Voronoi diagrams and arrangements
Discrete & Computational Geometry
One, two, three . . . infinity: lower bounds for parallel computation
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
Algorithms in combinatorial geometry
Algorithms in combinatorial geometry
Expanding graphs contain all small trees
Combinatorica
Journal of the ACM (JACM)
Wide-sense nonblocking networks
SIAM Journal on Discrete Mathematics
Explicit construction of linear sized tolerant networks
Discrete Mathematics - First Japan Conference on Graph Theory and Applications
Sorting in c log n parallel steps
Combinatorica
Combinatorial complexity bounds for arrangements of curves and spheres
Discrete & Computational Geometry - Special issue on the complexity of arrangements
Applications of random sampling in computational geometry, II
Discrete & Computational Geometry - Selected papers from the fourth ACM symposium on computational geometry, Univ. of Illinois, Urbana-Champaign, June 6 8, 1988
Ramsey theory (2nd ed.)
Discrete & Computational Geometry - Selected papers from the fifth annual ACM symposium on computational geometry, Saarbrücken, Germany, June 5-11, 1989
SIAM Journal on Computing
Simulating (logcn)-wise independence in NC
Journal of the ACM (JACM)
The history and status of the P versus NP question
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
An upper bound on the number of planar K-sets
Discrete & Computational Geometry
Reporting points in halfspaces
Computational Geometry: Theory and Applications
Computing and Verifying Depth Orders
SIAM Journal on Computing
The probabilistic method yields deterministic parallel algorithms
Proceedings of the 30th IEEE symposium on Foundations of computer science
ACM Computing Surveys (CSUR)
Average case analysis of a heuristic for the assignment problem
Mathematics of Operations Research
Randomized algorithms
Handbook of combinatorics (vol. 1)
Sudden emergence of a giant k-core in a random graph
Journal of Combinatorial Theory Series B
Journal of Combinatorial Theory Series A
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Fast probabilistic algorithms for hamiltonian circuits and matchings
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Crossing Numbers and Hard Erdös Problems in Discrete Geometry
Combinatorics, Probability and Computing
An algorithmic approach to the lovász local lemma. I
Random Structures & Algorithms
Repeated communication and Ramsey graphs
IEEE Transactions on Information Theory
| Hi-index | 0.00 |