What is he best known for?
The fields of study he is best known for:
- Algorithm
- Discrete mathematics
- Combinatorics
Peter Bro Miltersen mainly focuses on Discrete mathematics, Combinatorics, Data structure, Upper and lower bounds and Time complexity.
The Complexity class and Strongly polynomial research he does as part of his general Discrete mathematics study is frequently linked to other disciplines of science, such as Discounting, Turns, rounds and time-keeping systems in games and Power iteration, therefore creating a link between diverse domains of science.
His Combinatorics study frequently links to adjacent areas such as Set.
His Data structure research incorporates elements of Structure, Algorithm, Communication complexity and Word.
The various areas that Peter Bro Miltersen examines in his Upper and lower bounds study include Contrast, Mathematical economics, Logarithm, Common value auction and Mathematical optimization.
His Time complexity study combines topics in areas such as Scheme, Model of computation, Computation and Linear programming.
His most cited work include:
- On Data Structures and Asymmetric Communication Complexity (197 citations)
- On the Complexity of Numerical Analysis (135 citations)
- On Pseudorandom Generators in NC (128 citations)
What are the main themes of his work throughout his whole career to date?
His primary scientific interests are in Combinatorics, Discrete mathematics, Upper and lower bounds, Time complexity and Algorithm.
His biological study spans a wide range of topics, including Computational complexity theory, Function and Exponential function.
His Discrete mathematics research includes themes of Reachability and Constant.
The study incorporates disciplines such as Circuit complexity, Set, Data structure and Field in addition to Upper and lower bounds.
He interconnects Structure, Dynamic problem and Theoretical computer science in the investigation of issues within Data structure.
His study on Time complexity also encompasses disciplines like
- Combinatorial game theory, which have a strong connection to Stochastic game,
- Mathematical economics that connect with fields like Microeconomics.
He most often published in these fields:
- Combinatorics (42.51%)
- Discrete mathematics (38.92%)
- Upper and lower bounds (26.35%)
What were the highlights of his more recent work (between 2011-2017)?
- Mathematical economics (13.17%)
- Mathematical optimization (10.18%)
- Time complexity (14.97%)
In recent papers he was focusing on the following fields of study:
Peter Bro Miltersen focuses on Mathematical economics, Mathematical optimization, Time complexity, Algorithm and Constant.
The concepts of his Mathematical optimization study are interwoven with issues in Stackelberg competition and Computation.
His work deals with themes such as Class, Sequential decision and Face, which intersect with Algorithm.
Peter Bro Miltersen has researched Constant in several fields, including Strongly polynomial, Fraction and Theoretical computer science.
His Combinatorics research is multidisciplinary, incorporating perspectives in Expression and Protocol.
In his works, he performs multidisciplinary study on Discrete mathematics and Turns, rounds and time-keeping systems in games.
Between 2011 and 2017, his most popular works were:
- Strategy Iteration Is Strongly Polynomial for 2-Player Turn-Based Stochastic Games with a Constant Discount Factor (98 citations)
- Send mixed signals: earn more, work less (58 citations)
- A dictatorship theorem for cake cutting (27 citations)
In his most recent research, the most cited papers focused on:
- Algorithm
- Algebra
- Discrete mathematics
His primary areas of investigation include Mathematical optimization, Markov decision process, Algorithm, Upper and lower bounds and Constant.
Peter Bro Miltersen combines subjects such as Scheme and Common value auction with his study of Mathematical optimization.
His work focuses on many connections between Scheme and other disciplines, such as Contrast, that overlap with his field of interest in Time complexity.
The various areas that Peter Bro Miltersen examines in his Algorithm study include Bondareva–Shapley theorem and Corollary.
In his study, Finite set, Special case and Discrete mathematics is strongly linked to Mathematical economics, which falls under the umbrella field of Upper and lower bounds.
His Constant study combines topics in areas such as Strongly polynomial and Sequential game, Combinatorial game theory.
This overview was generated by a machine learning system which analysed the scientist’s
body of work. If you have any feedback, you can
contact us
here.
