2009 | ||
---|---|---|
78 | EE | Mogens Nielsen, Antonín Kucera, Peter Bro Miltersen, Catuscia Palamidessi, Petr Tuma, Frank D. Valencia: SOFSEM 2009: Theory and Practice of Computer Science, 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings Springer 2009 |
77 | EE | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. SIAM J. Comput. 38(5): 1987-2006 (2009) |
2008 | ||
76 | P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: Equilibrium Computation, 18.11. - 23.11.2007 Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2008 | |
75 | Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: On Range of Skill. AAAI 2008: 277-282 | |
74 | EE | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Deterministic Graphical Games Revisited. CiE 2008: 1-10 |
73 | EE | Peter Bro Miltersen, Troels Bjerre Sørensen: Fast algorithms for finding proper strategies in game trees. SODA 2008: 874-883 |
72 | EE | Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Approximability and Parameterized Complexity of Minmax Values. WINE 2008: 684-695 |
71 | EE | Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Approximability and parameterized complexity of minmax values CoRR abs/0806.4344: (2008) |
70 | EE | Vladimir Gurvich, Peter Bro Miltersen: On the computational complexity of solving stochastic mean-payoff games CoRR abs/0812.0486: (2008) |
69 | EE | Peter Bro Miltersen: Trembling hand perfection is NP-hard CoRR abs/0812.0492: (2008) |
68 | EE | Peter Bro Miltersen: Special Issue: "Conference on Computational Complexity 2007" Guest Editor's Foreword. Computational Complexity 17(2): 147-148 (2008) |
2007 | ||
67 | EE | Peter Bro Miltersen, Troels Bjerre Sørensen: A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament. AAMAS 2007: 191 |
66 | EE | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Finding Equilibria in Games of No Chance. COCOON 2007: 274-284 |
65 | EE | P. Jean-Jacques Herings, Marcin Jurdzinski, Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel: 07471 Abstracts Collection - Equilibrium Computation. Equilibrium Computation 2007 |
64 | EE | Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen: Simple Recursive Games CoRR abs/0711.1055: (2007) |
63 | EE | Anna Gál, Peter Bro Miltersen: The cell probe complexity of succinct data structures. Theor. Comput. Sci. 379(3): 405-417 (2007) |
62 | EE | Peter Bro Miltersen: The Computational Complexity of One-Dimensional Sandpiles. Theory Comput. Syst. 41(1): 119-125 (2007) |
2006 | ||
61 | EE | Jesper Torp Kristensen, Peter Bro Miltersen: Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard. COCOON 2006: 489-496 |
60 | EE | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. Complexity of Boolean Functions 2006 |
59 | EE | Anna Gál, Peter Bro Miltersen: The Cell Probe Complexity of Succinct Data Structures. Complexity of Boolean Functions 2006 |
58 | EE | Peter Bro Miltersen, Troels Bjerre Sørensen: Computing Proper Equilibria of Zero-Sum Games. Computers and Games 2006: 200-211 |
57 | EE | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis. IEEE Conference on Computational Complexity 2006: 331-339 |
56 | EE | Peter Bro Miltersen, Troels Bjerre Sørensen: Computing sequential equilibria for two-player games. SODA 2006: 107-116 |
55 | EE | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on cylinders. Computational Complexity 15(1): 62-81 (2006) |
54 | EE | Jesper Torp Kristensen, Peter Bro Miltersen: Finding small OBDDs for incompletely specified truth tables is hard Electronic Colloquium on Computational Complexity (ECCC)(004): (2006) |
2005 | ||
53 | EE | Peter Bro Miltersen: The Computational Complexity of One-Dimensional Sandpiles. CiE 2005: 342-348 |
52 | EE | Peter Bro Miltersen: Lower bounds on the size of selection and rank indexes. SODA 2005: 11-12 |
51 | EE | Peter Bro Miltersen, N. V. Vinodchandran: Derandomizing Arthur-Merlin Games using Hitting Sets. Computational Complexity 14(3): 256-279 (2005) |
50 | EE | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen: Reviewing Bounds on the Circuit Size of the Hardest Functions Electronic Colloquium on Computational Complexity (ECCC)(032): (2005) |
49 | EE | Eric Allender, Peter Bürgisser, Johan Kjeldgaard-Pedersen, Peter Bro Miltersen: On the Complexity of Numerical Analysis Electronic Colloquium on Computational Complexity (ECCC)(037): (2005) |
48 | EE | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen: Reviewing bounds on the circuit size of the hardest functions. Inf. Process. Lett. 95(2): 354-357 (2005) |
47 | EE | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener: On converting CNF to DNF. Theor. Comput. Sci. 347(1-2): 325-335 (2005) |
2004 | ||
46 | EE | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen: Some Meet-in-the-Middle Circuit Lower Bounds. MFCS 2004: 334-345 |
2003 | ||
45 | EE | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders. FCT 2003: 171-182 |
44 | EE | Anna Gál, Peter Bro Miltersen: The Cell Probe Complexity of Succinct Data Structures. ICALP 2003: 332-344 |
43 | EE | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener: On Converting CNF to DNF. MFCS 2003: 612-621 |
42 | EE | Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener: On Converting CNF to DNF Electronic Colloquium on Computational Complexity (ECCC) 10(017): (2003) |
2002 | ||
41 | EE | Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay: Circuits on Cylinders Electronic Colloquium on Computational Complexity (ECCC)(066): (2002) |
40 | EE | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh: Are Bitvectors Optimal? SIAM J. Comput. 31(6): 1723-1744 (2002) |
2001 | ||
39 | EE | Mary Cryan, Peter Bro Miltersen: On Pseudorandom Generators in NC. MFCS 2001: 272-284 |
38 | EE | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen: Lower Bounds for Dynamic Algebraic Problems. Inf. Comput. 171(2): 333-349 (2001) |
37 | Torben Hagerup, Peter Bro Miltersen, Rasmus Pagh: Deterministic Dictionaries. J. Algorithms 41(1): 69-85 (2001) | |
2000 | ||
36 | Peter Bro Miltersen: On the Shannon Function for Partially Defined Boolean Functions. ICALP Satellite Workshops 2000: 253-258 | |
35 | EE | Harry Buhrman, Sophie Laplante, Peter Bro Miltersen: New Bounds for the Language Compression Problem. IEEE Conference on Computational Complexity 2000: 126-130 |
34 | EE | Harry Buhrman, Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh: Are bitvectors optimal? STOC 2000: 449-458 |
1999 | ||
33 | EE | Peter Bro Miltersen, N. V. Vinodchandran, Osamu Watanabe: Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy. COCOON 1999: 210-220 |
32 | EE | Peter Bro Miltersen, N. V. Vinodchandran: Derandomizing Arthur-Merlin Games Using Hitting Sets. FOCS 1999: 71-80 |
31 | EE | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum: On Monotone Planar Circuits. IEEE Conference on Computational Complexity 1999: 24- |
30 | EE | Gudmund Skovbjerg Frandsen, Johan P. Hansen, Peter Bro Miltersen: Lower Bounds for Dynamic Algebraic Problems. STACS 1999: 362-372 |
29 | Sven Skyum, Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Peter G. Binderup: The Complexity of Identifying Large Equivalence Classes. Fundam. Inform. 38(1-2): 25-37 (1999) | |
28 | EE | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Linear Hash Functions. J. ACM 46(5): 667-683 (1999) |
27 | Jens Lagergren, Peter Bro Miltersen: Guest Editors' Foreword. Nord. J. Comput. 6(2): 135-136 (1999) | |
26 | EE | Arne Andersson, Peter Bro Miltersen, Mikkel Thorup: Fusion Trees can be Implemented with AC0 Instructions Only. Theor. Comput. Sci. 215(1-2): 337-344 (1999) |
1998 | ||
25 | Peter Bro Miltersen: Error Correcting Codes, Perfect Hashing Circuits, and Deterministic Dynamic Dictionaries. SODA 1998: 556-563 | |
24 | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum: Searching Constant Width Mazes Captures the AC0 Hierarchy. STACS 1998: 73-83 | |
23 | Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson: On Data Structures and Asymmetric Communication Complexity. J. Comput. Syst. Sci. 57(1): 37-49 (1998) | |
1997 | ||
22 | EE | Noga Alon, Martin Dietzfelbinger, Peter Bro Miltersen, Erez Petrank, Gábor Tardos: Is Linear Hashing Good? STOC 1997: 465-474 |
21 | Andrej Brodnik, Peter Bro Miltersen, J. Ian Munro: Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds. WADS 1997: 426-439 | |
20 | EE | David A. Mix Barrington, Chi-Jen Lu, Peter Bro Miltersen, Sven Skyum: Searching constant width mazes captures the AC0 hierarchy Electronic Colloquium on Computational Complexity (ECCC) 4(44): (1997) |
19 | EE | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic word problems. J. ACM 44(2): 257-271 (1997) |
1996 | ||
18 | Arne Andersson, Peter Bro Miltersen, Søren Riis, Mikkel Thorup: Static Dictionaries on AC0 RAMs: Query Time Theta(sqrt(log n/log log n)) is Necessary and Sufficient. FOCS 1996: 441-450 | |
17 | Peter Bro Miltersen: Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication. ICALP 1996: 442-453 | |
16 | EE | Peter Bro Miltersen, Mike Paterson, Jun Tarui: The Asymptotic Complexity of Merging Networks. J. ACM 43(1): 147-165 (1996) |
15 | Steven M. Kautz, Peter Bro Miltersen: Relative to a Random Oracle, NP Is Not Small. J. Comput. Syst. Sci. 53(2): 235-250 (1996) | |
1995 | ||
14 | EE | Peter Bro Miltersen, Noam Nisan, Shmuel Safra, Avi Wigderson: On data structures and asymmetric communication complexity. STOC 1995: 103-111 |
13 | Faith E. Fich, Peter Bro Miltersen: Tables Should Be Sorted (On Random Access Machines). WADS 1995: 482-493 | |
12 | Gudmund Skovbjerg Frandsen, Thore Husfeldt, Peter Bro Miltersen, Theis Rauhe, Søren Skyum: Dynamic Algorithms for the Dyck Languages. WADS 1995: 98-108 | |
11 | EE | Peter Bro Miltersen: On the Cell Probe Complexity of Polynomial Evaluation. Theor. Comput. Sci. 143(1): 167-174 (1995) |
1994 | ||
10 | EE | Peter Bro Miltersen: Lower bounds for union-split-find related problems on random access machines. STOC 1994: 625-634 |
9 | Steven M. Kautz, Peter Bro Miltersen: Relative to a Random Oracle, NP is Not Small. Structure in Complexity Theory Conference 1994: 162-174 | |
8 | Peter Bro Miltersen, Sairam Subramanian, Jeffrey Scott Vitter, Roberto Tamassia: Complexity Models for Incremental Computation. Theor. Comput. Sci. 130(1): 203-236 (1994) | |
1993 | ||
7 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: Dynamic Word Problems FOCS 1993: 470-479 | |
6 | Gudmund Skovbjerg Frandsen, Peter Bro Miltersen, Sven Skyum: The Complexity of Finding Replicas Using Equality Tests. MFCS 1993: 463-472 | |
5 | Peter Bro Miltersen: The Bit Probe Complexity Measure Revisited. STACS 1993: 662-671 | |
4 | Peter Bro Miltersen: The Complexity of Malign Measures. SIAM J. Comput. 22(1): 147-156 (1993) | |
1992 | ||
3 | Peter Bro Miltersen, Mike Paterson, Jun Tarui: The Asymptotic Complexity of Merging Networks FOCS 1992: 236-246 | |
2 | Peter Bro Miltersen: Circuit Depth Relative to a Random Oracle. Inf. Process. Lett. 42(6): 295-298 (1992) | |
1991 | ||
1 | Peter Bro Miltersen: The Complexity of Malign Ensembles. Structure in Complexity Theory Conference 1991: 164-171 |