( en | de | ru )

 

Disambiguation of "Miltersen, Peter Bro"

Author of the publication

copydeleteadd this publication to your clipboard
On Monotone Planar Circuits.

, , , and . CCC, page 24-. IEEE Computer Society, (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Peter Bro Miltersen

Josef Bro

Justyna Bro ska

Anne Brockhoff

Struktur-Funktionsbeziehungen menschlicher Bitterrezeptoren. Uni Potsdam, (2009)

Sandra Verena Ursula Broll

Selbstreplizierende nicht-virale Episomen (Minicircles): Expressionseigenschaften und Etablierung im Zellkern. TU Braunschweig, (2009)
 

Other publications of authors with the same name

Truthful approximations to range voting., and . CoRR, (2013)Are bitvectors optimal?, , , and . STOC, page 449-458. ACM, (2000)Lower bounds for union-split-find related problems on random access machines.. STOC, page 625-634. ACM, (1994)Computing Proper Equilibria of Zero-Sum Games., and . Computers and Games, volume 4630 of Lecture Notes in Computer Science, page 200-211. Springer, (2006)Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract)., , , , , , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 185-202. Springer, (2013)Computation of Stackelberg Equilibria of Finite Sequential Games., , , , and . WINE, volume 9470 of Lecture Notes in Computer Science, page 201-215. Springer, (2015)Exact Algorithms for Solving Stochastic Games, , , , and . CoRR, (2012)07471 Abstracts Collection - Equilibrium Computation., , , , and . Equilibrium Computation, volume 07471 of Dagstuhl Seminar Proceedings, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany, (2007)Winning Concurrent Reachability Games Requires Doubly-Exponential Patience., , and . LICS, page 332-341. IEEE Computer Society, (2009)The Cell Probe Complexity of Succinct Data Structures., and . ICALP, volume 2719 of Lecture Notes in Computer Science, page 332-344. Springer, (2003)