World's Best Scientists 2026 revealed!
Peter Bro Miltersen

Peter Bro Miltersen

D-Index & Metrics

Computer Science

D-Index
35
Citations
4131
World Ranking
11827
National Ranking
56

Overview

Peter Bro Miltersen is affiliated with Aarhus University in Denmark. Their research spans multiple fields within social sciences, economics, and decision sciences, focusing particularly on auction theory, economic models, and behavioral economics.

The primary fields of study associated with their work include Decision Sciences, Economics, Econometrics and Finance, and Social Sciences. Their subfields of study highlight a concentration in Management Science and Operations Research, Economics and Econometrics, as well as Safety Research.

The main topics covered in their publications are:

  • Auction Theory and Applications
  • Economic theories and models
  • Experimental Behavioral Economics Studies

Peter Bro Miltersen has published in the journal Artificial Intelligence. Within this venue, their recent paper is:

  • "Walrasian pricing in multi-unit auctions," published in 2023 in Artificial Intelligence

Their frequent co-authors are:

  • Simina Brânzei
  • Aris Filos-Ratsikas
  • Yulong Zeng

Best Publications

  • On Data Structures and Asymmetric Communication Complexity

    Peter Bro Miltersen;Noam Nisan;Shmuel Safra;Avi Wigderson

  • Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor

    Thomas Dueholm Hansen;Peter Bro Miltersen;Uri Zwick

  • On the Complexity of Numerical Analysis

    Eric Allender;Peter Bürgisser;Johan Kjeldgaard-Pedersen;Peter Bro Miltersen

  • Derandomizing Arthur-Merlin games using hitting sets

    Peter Bro Miltersen;N. V. Vinodchandran

  • Are Bitvectors Optimal

    H. Buhrman;P. B. Miltersen;J. Radhakrishnan;S. Venkatesh

  • On Pseudorandom Generators in NC

    Mary Cryan;Peter Bro Miltersen

  • Complexity models for incremental computation

    Peter Bro Miltersen;Sairam Subramanian;Jeffrey Scott Vitter;Roberto Tamassia

  • Deterministic Dictionaries

    Torben Hagerup;Peter Bro Miltersen;Rasmus Pagh

  • Lower bounds for union-split-find related problems on random access machines

    Peter Bro Miltersen

  • The cell probe complexity of succinct data structures

    Anna Gál;Peter Bro Miltersen

  • On data structures and asymmetric communication complexity

    Peter Bro Miltersen;Noam Nisan;Shmuel Safra;Avi Wigderson

  • The Complexity of Solving Stochastic Games on Graphs

    Daniel Andersson;Peter Bro Miltersen

  • Send mixed signals: earn more, work less

    Peter Bro Miltersen;Or Sheffet

  • Fusion trees can be implemented with AC 0 instructions only

    Arne Andersson;Peter Bro Miltersen;Mikkel Thorup

  • On the complexity of numerical analysis

    E. Allender;J. Kjeldgaard-Pedersen;P. Burgisser;P. Miltersen

  • Linear hash functions

    Noga Alon;Martin Dietzfelbinger;Peter Bro Miltersen;Erez Petrank

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

    A. Andersson;P.B. Miltersen;S. Riis;M. Thorup

  • On converting CNF to DNF

    Peter Bro Miltersen;Jaikumar Radhakrishnan;Ingo Wegener

  • Lower bounds on the size of selection and rank indexes

    Peter Bro Miltersen

  • Super-polynomial versus half-exponential circuit size in the exponential hierarchy

    Peter Bro Miltersen;N. V. Vinodchandran;Osamu Watanabe

  • On Data Structures and Asymmetric Communication Complexity

    Peter Bro Miltersen

Frequent Co-Authors

Yuval Ishai
Yuval Ishai Technion – Israel Institute of Technology
Ivan Damgård
Ivan Damgård Aarhus University
Ran Raz
Ran Raz Princeton University
Antonín Kučera
Antonín Kučera Masaryk University
Eric Allender
Eric Allender Rutgers, The State University of New Jersey
Éva Tardos
Éva Tardos Cornell University
Mikkel Thorup
Mikkel Thorup University of Copenhagen
Catuscia Palamidessi
Catuscia Palamidessi French Institute for Research in Computer Science and Automation - INRIA
Erez Petrank
Erez Petrank Technion – Israel Institute of Technology
Uri Zwick
Uri Zwick Tel Aviv University

If you think any of the details on this page are incorrect, let us know.

Report an issue

We appreciate your kind effort to assist us to improve this page, it would be helpful providing us with as much detail as possible in the text box below:

Related Online Degrees & Career Pathways

Exploring computer science in the USA opens doors to multiple study and career options. Many students seek affordable online degree programs to minimize expenses while gaining a quality education. Online learning enables flexibility, making it easier to balance study and work.

Worried about grades? You can still find a college with low gpa admission requirements, ensuring more students have the chance to pursue tech careers.

For those looking to fast-track their education, consider a 1 year computer science degree online. These programs are intensive and can quickly prepare you for the workforce.

Beyond software development, tech graduates can enter diverse fields, such as environmental technology. Some roles align with high-paying jobs with environmental science degree, demonstrating the range of lucrative career paths available with technical expertise.

Best Scientists Citing Peter Bro Miltersen

Trending Scientists