The following pages link to Peter Bro Miltersen (Q673646):
Displaying 50 items.
- On the cell probe complexity of polynomial evaluation (Q673647) (← links)
- Derandomizing Arthur-Merlin games using hitting sets (Q813315) (← links)
- Computing a quasi-perfect equilibrium of a two-player game (Q847801) (← links)
- Reviewing bounds on the circuit size of the hardest functions (Q1041784) (← links)
- Circuit depth relative to a random oracle (Q1198081) (← links)
- On data structures and asymmetric communication complexity (Q1273860) (← links)
- Fusion trees can be implemented with \(AC^0\) instructions only (Q1287094) (← links)
- Complexity models for incremental computation (Q1331947) (← links)
- Relative to a random oracle, NP is not small (Q1816731) (← links)
- Lower bounds for dynamic algebraic problems (Q1854488) (← links)
- The complexity of solving reachability games using value and strategy iteration (Q2254503) (← links)
- The cell probe complexity of succinct data structures (Q2373728) (← links)
- Circuits on cylinders (Q2506165) (← links)
- On converting CNF to DNF (Q2576880) (← links)
- The computational complexity of one-dimensional sandpiles (Q2642904) (← links)
- Deterministic Dictionaries (Q2765957) (← links)
- Lower bounds for union-split-find related problems on random access machines (Q2817656) (← links)
- A Faster Algorithm for Solving One-Clock Priced Timed Games (Q2842131) (← links)
- Efficient Multiparty Protocols via Log-Depth Threshold Formulae (Q2849395) (← links)
- Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy (Q2872110) (← links)
- Solving Simple Stochastic Games with Few Coin Toss Positions (Q2912881) (← links)
- (Q2921648) (← links)
- Truthful Approximations to Range Voting (Q2936984) (← links)
- The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form (Q2938661) (← links)
- Linear hash functions (Q3158554) (← links)
- The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements (Q3162519) (← links)
- Privacy-Enhancing Auctions Using Rational Cryptography (Q3183584) (← links)
- Characterization and Computation of Equilibria for Indivisible Goods (Q3449598) (← links)
- Computation of Stackelberg Equilibria of Finite Sequential Games (Q3460789) (← links)
- (Q3579499) (← links)
- Computing sequential equilibria for two-player games (Q3581574) (← links)
- Finding Small OBDDs for Incompletely Specified Truth Tables Is Hard (Q3591326) (← links)
- Finding Equilibria in Games of No Chance (Q3608853) (← links)
- On the Complexity of Numerical Analysis (Q3642872) (← links)
- The Complexity of Solving Stochastic Games on Graphs (Q3652196) (← links)
- Hilbert’s Thirteenth Problem and Circuit Complexity (Q3652201) (← links)
- The Complexity of Malign Measures (Q4037690) (← links)
- (Q4230345) (← links)
- (Q4234056) (← links)
- (Q4250224) (← links)
- (Q4265621) (← links)
- (Q4281568) (← links)
- The asymptotic complexity of merging networks (Q4371518) (← links)
- Dynamic word problems (Q4377276) (← links)
- (Q4449186) (← links)
- (Q4527014) (← links)
- (Q4779150) (← links)
- (Q4788614) (← links)
- (Q4818856) (← links)
- (Q4938667) (← links)
