Peter Bro Miltersen

发表

Equilibrium Computation Dagstuhl Seminar

Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel, 2007 .

Guest Editors' Foreword

Peter Bro Miltersen, Jens Lagergren, 1999, Nord. J. Comput..

Secret Sharing and Secure Computing from Monotone Formulae

Peter Bro Miltersen, Ivan Damgård, Jonas Kölker, 2012, IACR Cryptol. ePrint Arch..

Lower Bounds for Static Dictionaries on RAMs with Bit Operations But No Multiplication

Peter Bro Miltersen, 1996, ICALP.

Hilbert's Thirteenth Problem and Circuit Complexity

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Oded Lachish, 2009, ISAAC.

Truthful Approximations to Range Voting pdf

Peter Bro Miltersen, Aris Filos-Ratsikas, Aris Filos-Ratsikas, 2013, WINE.

New bounds for the language compression problem

Peter Bro Miltersen, Harry Buhrman, Sophie Laplante, 2000, Proceedings 15th Annual IEEE Conference on Computational Complexity.

Privacy-Enhancing Auctions Using Rational Cryptography

Peter Bro Miltersen, Nikos Triandopoulos, Jesper Buus Nielsen, 2009, CRYPTO.

Static dictionaries on AC/sup 0/ RAMs: query time /spl theta/(/spl radic/log n/log log n) is necessary and sufficient

Peter Bro Miltersen, Mikkel Thorup, Arne Andersson, 1996, Proceedings of 37th Conference on Foundations of Computer Science.

Lower Bounds for Dynamic Algebraic Problems

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, Johan P. Hansen, 1998, Inf. Comput..

Equilibrium Computation, 18.11. - 23.11.2007

Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel, 2008, Equilibrium Computation.

07471 Abstracts Collection - Equilibrium Computation

Peter Bro Miltersen, Éva Tardos, Bernhard von Stengel, 2007, Equilibrium Computation.

Complexity Models for Incremental Computation

Peter Bro Miltersen, Jeffrey Scott Vitter, Roberto Tamassia, 1994, Theor. Comput. Sci..

The Complexity of Solving Reachability Games Using Value and Strategy Iteration

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Rasmus Ibsen-Jensen, 2011, CSR.

On the Complexity of Numerical Analysis

Peter Bro Miltersen, Eric Allender, Peter Bürgisser, 2009, SIAM J. Comput..

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Michal Koucký, 2009, 2009 24th Annual IEEE Symposium on Logic In Computer Science.

The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2010, SAGT.

Exact algorithms for solving stochastic games: extended abstract

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Michal Koucký, 2011, STOC.

Some Meet-in-the-Middle Circuit Lower Bounds

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, 2004, MFCS.

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

Peter Bro Miltersen, Frank D. Valencia, Catuscia Palamidessi, 2009, SOFSEM.

Existence and computation of equilibria of first-price auctions with integral valuations and bids

Peter Bro Miltersen, Guillaume Escamocher, R. RocioSantillan, 2009, AAMAS.

Approximability and Parameterized Complexity of Minmax Values

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2008, WINE.

On Data Structures and Asymmetric Communication Complexity

Peter Bro Miltersen, 1994 .

Exact Algorithms for Solving Stochastic Games pdf

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Michal Koucký, 2012, ArXiv.

Deterministic Graphical Games Revisited

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2008, CiE.

Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard

Peter Bro Miltersen, Jesper Torp Kristensen, 2006, COCOON.

Monomial Strategies for Concurrent Reachability Games and Other Stochastic Games

Peter Bro Miltersen, Søren Kristoffer Stiil Frederiksen, 2013, RP.

Proceedings of the Annual IEEE Conference on Computational Complexity: Preface

Peter Bro Miltersen, Ronitt Rubinfeld, Luca Trevisan, 2005 .

Simple Recursive Games pdf

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2007, ArXiv.

Computing sequential equilibria for two-player games

Peter Bro Miltersen, Troels Bjerre Lund, T. Lund, 2006, SODA '06.

Error correcting codes, perfect hashing circuits, and deterministic dynamic dictionaries

Peter Bro Miltersen, 1998, SODA '98.

08381 Abstracts Collection - Computational Complexity of Discrete Problems

Peter Bro Miltersen, Dieter van Melkebeek, Rüdiger Reischuk, 2008, Computational Complexity of Discrete Problems.

On Pseudorandom Generators in NC

Peter Bro Miltersen, Mary Cryan, Mary Cryan, 2001, MFCS.

Searching Constant Width Mazes Captures the AC0 Hierarchy

Peter Bro Miltersen, Sven Skyum, Chi-Jen Lu, 1997, STACS.

Computation of Stackelberg Equilibria of Finite Sequential Games

Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, 2015, WINE.

Tables should be sorted (on random access machines)

Peter Bro Miltersen, Faith E. Fich, 1995 .

Privacy-enhancing auctions using rational cryptography

Peter Bro Miltersen, Nikos Triandopoulos, Jesper Buus Nielsen, 2009, BQGT.

Relative to a random oracle, NP is not small

Peter Bro Miltersen, Steven M. Kautz, 1994, Proceedings of IEEE 9th Annual Conference on Structure in Complexity Theory.

Trembling hand perfection is NP-hard pdf

Peter Bro Miltersen, 2008, ArXiv.

Special Issue: “Conference on Computational Complexity 2007” Guest Editor’s Foreword

Peter Bro Miltersen, 2008, computational complexity.

10171 Abstracts Collection - Equilibrium Computation

Peter Bro Miltersen, Edith Elkind, Bernhard von Stengel, 2010, Equilibrium Computation.

The Complexity of Finding Replicas Using Equality Tests

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1993, MFCS.

On monotone planar circuits

Peter Bro Miltersen, Sven Skyum, Chi-Jen Lu, 1999, Proceedings. Fourteenth Annual IEEE Conference on Computational Complexity (Formerly: Structure in Complexity Theory Conference) (Cat.No.99CB36317).

Walrasian Pricing in Multi-Unit Auctions

Simina Brânzei, Peter Bro Miltersen, Aris Filos-Ratsikas, 2016, MFCS.

Dynamic word problems

Peter Bro Miltersen, Sven Skyum, Gudmund Skovbjerg Frandsen, 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

A near-optimal strategy for a heads-up no-limit Texas Hold'em poker tournament

Peter Bro Miltersen, Troels Bjerre Lund, 2007, AAMAS '07.

Deterministic Graphical Games Revisited

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2008, J. Log. Comput..

The asymptotic complexity of merging networks

Peter Bro Miltersen, Mike Paterson, Jun Tarui, 1996, JACM.

On the Cell Probe Complexity of Polynomial Evaluation

Peter Bro Miltersen, 1995, Theor. Comput. Sci..

Are bitvectors optimal?

Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh, 2000, STOC '00.

The Complexity of Malign Measures

Peter Bro Miltersen, 1993, SIAM J. Comput..

Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy

Peter Bro Miltersen, Søren Kristoffer Stiil Frederiksen, 2013, ISAAC.

Relative to a Random Oracle, NP Is Not Small

Peter Bro Miltersen, Steven M. Kautz, 1996, J. Comput. Syst. Sci..

On converting CNF to DNF

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, 2005, Theor. Comput. Sci..

Send mixed signals: earn more, work less pdf

Peter Bro Miltersen, Or Sheffet, Or Sheffet, 2012, EC '12.

Semi-algebraic geometry in computational game theory - a consumer's perspective (Invited Talk)

Peter Bro Miltersen, 2014, STACS.

Special Section on the Forty-Fifth Annual ACM Symposium on the Theory of Computing (STOC 2013)

Peter Bro Miltersen, Yuval Ishai, James Aspnes, 2016, SIAM J. Comput..

Efficient Multiparty Protocols via Log-Depth Threshold Formulae

Peter Bro Miltersen, Ran Raz, Ron Rothblum, 2013, Electron. Colloquium Comput. Complex..

On showing lower bounds for external-memory computational geometry problems

Peter Bro Miltersen, Lars Arge, 1998, External Memory Algorithms.

On converting CNF to DNF

Peter Bro Miltersen, Jaikumar Radhakrishnan, Ingo Wegener, 2003, Theor. Comput. Sci..

Derandomizing Arthur-Merlin Games using Hitting Sets

Peter Bro Miltersen, N. V. Vinodchandran, Vinodchandran N. Variyam, 1999 .

Is linear hashing good?

Peter Bro Miltersen, Noga Alon, Gábor Tardos, 1997, STOC '97.

The complexity of malign ensembles

Peter Bro Miltersen, 1991, [1991] Proceedings of the Sixth Annual Structure in Complexity Theory Conference.

Envy-Free Pricing in Multi-unit Markets pdf

Simina Brânzei, Peter Bro Miltersen, Aris Filos-Ratsikas, 2016, ArXiv.

On Range of Skill

Peter Bro Miltersen, Troels Bjerre Lund, Thomas Dueholm Hansen, 2008, AAAI.

Trans-Dichotomous Algorithms Without Multiplication - Some Upper and Lower Bounds

Peter Bro Miltersen, J. Ian Munro, Andrej Brodnik, 1997, WADS.

Derandomizing Complexity Classes

Peter Bro Miltersen, 2001 .

Dynamic Algorithms for the Dyck Languages

Peter Bro Miltersen, Thore Husfeldt, Gudmund Skovbjerg Frandsen, 1995 .

Equilibria of Chinese Auctions pdf

Simina Brânzei, Peter Bro Miltersen, Kate Larson, 2012, ArXiv.

Characterization and Computation of Equilibria for Indivisible Goods

Simina Brânzei, Peter Bro Miltersen, Hadi Hosseini, 2015, SAGT.

A Dictatorship Theorem for Cake Cutting

Simina Brânzei, Peter Bro Miltersen, Simina Brânzei, 2015, IJCAI.

Privacy-Enhancing First-Price Auctions Using Rational Cryptography

Peter Bro Miltersen, Nikos Triandopoulos, Jesper Buus Nielsen, 2008, IACR Cryptol. ePrint Arch..

The Complexity of Solving Stochastic Games on Graphs

Peter Bro Miltersen, Daniel Andersson, Daniel Andersson, 2009, ISAAC.

Lower Bounds for Dynamic Algebraic Problems

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, Johan P. Hansen, 2001, Inf. Comput..

Are Bitvectors Optimal?

Peter Bro Miltersen, Jaikumar Radhakrishnan, Srinivasan Venkatesh, 2002, SIAM J. Comput..

Fast algorithms for finding proper strategies in game trees

Peter Bro Miltersen, Troels Bjerre Lund, T. Lund, 2008, SODA '08.

The Complexity of Solving Reachability Games Using Value and Strategy Iteration

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Rasmus Ibsen-Jensen, 2013, Theory of Computing Systems.

Lower bounds on the size of selection and rank indexes

Peter Bro Miltersen, 2005, SODA '05.

The Bit Probe Complexity Measure Revisited

Peter Bro Miltersen, 1993, STACS.

Fusion Trees can be Implemented with AC0 Instructions Only

Peter Bro Miltersen, Mikkel Thorup, Arne Andersson, 1999, Theor. Comput. Sci..

The Computational Complexity of One-Dimensional Sandpiles

Peter Bro Miltersen, 2006, Theory of Computing Systems.

SOFSEM 2009: Theory and Practice of Computer Science 35th Conference on Current Trends in Theory and Practice of Computer Science, Spindleruv Mln, Czech ... Computer Science and General Issues)

Peter Bro Miltersen, Frank D. Valencia, Mogens Nielsen, 2009 .

The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form pdf

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Lund, 2014, SAGT.

The Computational Complexity of One-Dimensional Sandpiles

Peter Bro Miltersen, 2005, CiE.

Equilibrium Computation, Dagstuhl Seminar Proceedings

Peter Bro Miltersen, Éva Tardos, Marcin Jurdzinski, 2008 .

Tables Should Be Sorted (On Random Access Machines)

Peter Bro Miltersen, Faith Ellen, 1995, WADS.

Reviewing bounds on the circuit size of the hardest functions

Peter Bro Miltersen, Gudmund Skovbjerg Frandsen, 2005, Inf. Process. Lett..

Circuit Depth Relative to a Random Oracle

Peter Bro Miltersen, 1992, Inf. Process. Lett..

Circuits on Cylinders

Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay, 2003, FCT.

Fusion Trees can be Implemented with AC0 Instructions only

Peter Bro Miltersen, Mikkel Thorup, Arne Andersson, 1996 .

Equilibrium analysis in cake cutting

Simina Brânzei, Peter Bro Miltersen, Simina Brânzei, 2013, AAMAS.

Super-Polynomial Versus Half-Exponential Circuit Size in the Exponential Hierarchy

Peter Bro Miltersen, Osamu Watanabe, N. V. Vinodchandran, 1999, COCOON.

Two Notes on the Computational Complexity of One-Dimensional Sandpiles

Peter Bro Miltersen, 1999 .

On data structures and asymmetric communication complexity

Peter Bro Miltersen, Noam Nisan, Avi Wigderson, 1994, STOC '95.