The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Linear time bounds for median computations
STOC '72 Proceedings of the fourth annual ACM symposium on Theory of computing
The complexity of problems on probabilistic, nondeterministic, and alternating decision trees
Journal of the ACM (JACM)
Applications of Ramsey's theorem to decision tree complexity
Journal of the ACM (JACM)
Fast algorithms for N-dimensional restrictions of hard problems
Journal of the ACM (JACM)
Stable set and multiset operations in optimal time and space
Proceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Bounds on the Complexity of the Longest Common Subsequence Problem
Journal of the ACM (JACM)
Lower Bounds for Selection in X + Y and Other Multisets
Journal of the ACM (JACM)
A Counting Approach to Lower Bounds for Selection Problems
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Using Constraints for Efficient Query Processing in Nondeterministic Databases
IEEE Transactions on Knowledge and Data Engineering
A linear time algorithm for the weighted lexicographic rectilinear 1-center problem in the plane
Information Processing Letters
Probabilistic, nondeterministic, and alternating decision trees (Preliminary Version)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Lower bounds for algebraic computation trees
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Recent developments in the theory of data structures
Computer Languages
| Hi-index | 0.00 |