팔로우
Peter Bro Miltersen
Peter Bro Miltersen
Former Professor of Computer Science at Aarhus University
cs.au.dk의 이메일 확인됨
제목
인용
인용
연도
On data structures and asymmetric communication complexity
PB Miltersen, N Nisan, S Safra, A Wigderson
Journal of Computer and System Sciences 57, 37-49, 1998
4021998
On the complexity of numerical analysis
E Allender, P Bürgisser, J Kjeldgaard-Pedersen, PB Miltersen
SIAM Journal on Computing 38 (5), 1987-2006, 2009
2332009
Strategy iteration is strongly polynomial for 2-player turn-based stochastic games with a constant discount factor
TD Hansen, PB Miltersen, U Zwick
Innovations in Computer Science 2011, 253-263, 2011
1792011
Derandomizing Arthur-Merlin games using hitting sets
PB Miltersen, NV Vinodchandran
40th Annual Symposium on Foundations of Computer Science (Cat. No. 99CB37039 …, 1999
163*1999
Are bitvectors optimal?
H Buhrman, PB Miltersen, J Radhakrishnan, S Venkatesh
Proceedings of the thirty-second annual ACM symposium on Theory of computing …, 2000
1562000
Complexity models for incremental computation
PB Miltersen, S Subramanian, JS Vitter, R Tamassia
Theoretical Computer Science 130 (1), 203-236, 1994
1391994
Deterministic dictionaries
T Hagerup, PB Miltersen, R Pagh
Journal of Algorithms 41 (1), 69-85, 2001
1362001
The cell probe complexity of succinct data structures
A Gál, PB Miltersen
Theoretical Computer Science 379 (3), 405-417, 2007
123*2007
Lower bounds for union-split-find related problems on random access machines
PB Miltersen
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing …, 1994
1191994
Cell probe complexity-a survey
PB Miltersen
Proceedings of the 19th conference on the foundations of software technology …, 1999
1051999
Send mixed signals: earn more, work less
P Bro Miltersen, O Sheffet
Proceedings of the 13th ACM conference on electronic commerce, 234-247, 2012
1032012
On pseudorandom generators in NC0
M Cryan, P Miltersen
Mathematical Foundations of Computer Science 2001, 272-284, 2001
1022001
The complexity of solving stochastic games on graphs
D Andersson, PB Miltersen
International Symposium on Algorithms and Computation, 112-121, 2009
972009
Fusion trees can be implemented with AC0 instructions only
A Andersson, PB Miltersen, M Thorup
Theoretical Computer Science 215 (1), 337-344, 1999
781999
On converting CNF to DNF
PB Miltersen, J Radhakrishnan, I Wegener
Theoretical computer science 347 (1-2), 325-335, 2005
712005
Linear hash functions
N Alon, M Dietzfelbinger, PB Miltersen, E Petrank, G Tardos
Journal of the ACM (JACM) 46 (5), 667-683, 1999
701999
Exact algorithms for solving stochastic games
KA Hansen, M Koucky, N Lauritzen, PB Miltersen, EP Tsigaridas
Proceedings of the forty-third annual ACM symposium on Theory of computing …, 2011
692011
Dynamic word problems
G Skovbjerg Frandsen, PB Miltersen, S Skyum
Journal of the ACM (JACM) 44 (2), 257-271, 1997
68*1997
Super-polynomial versus half-exponential circuit size in the exponential hierarchy
PB Miltersen, NV Vinodchandran, O Watanabe
International Computing and Combinatorics Conference, 210-220, 1999
651999
Static dictionaries on AC0 RAMs: query time Theta(√ log n/log log n) is necessary and sufficient
A Andersson, PB Miltersen, S Riis, M Thorup
Foundations of Computer Science, 1996. Proceedings., 37th Annual Symposium …, 1996
65*1996
현재 시스템이 작동되지 않습니다. 나중에 다시 시도해 주세요.
학술자료 1–20