The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
The art of computer programming, volume 2 (3rd ed.): seminumerical algorithms
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
On the Optimality of Some Set Algorithms
Journal of the ACM (JACM)
A Note on Dijkstra's Shortest Path Algorithm
Journal of the ACM (JACM)
Approximate Algorithms for the 0/1 Knapsack Problem
Journal of the ACM (JACM)
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Journal of the ACM (JACM)
The Complexity of Near-Optimal Graph Coloring
Journal of the ACM (JACM)
Expected time bounds for selection
Communications of the ACM
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
Communications of the ACM
Complexity of Sequential and Parallel Numerical Algorithms
Complexity of Sequential and Parallel Numerical Algorithms
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The analysis of double hashing(Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A generalization and proof of the Aanderaa-Rosenberg conjecture
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
The complexity of parallel evaluation of linear recurrence
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
Approximation algorithms for combinatorial problems
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
The complexity of theorem-proving procedures
STOC '71 Proceedings of the third annual ACM symposium on Theory of computing
A generalized bound on LPT sequencing
SIGMETRICS '76 Proceedings of the 1976 ACM SIGMETRICS conference on Computer performance modeling measurement and evaluation
Scheduling partially ordered tasks with probabilistic execution times
SOSP '75 Proceedings of the fifth ACM symposium on Operating systems principles
Big Omicron and big Omega and big Theta
ACM SIGACT News
Formal languages and their relation to automata
Formal languages and their relation to automata
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
ACM Computing Surveys (CSUR)
The tracker: a threat to statistical database security
ACM Transactions on Database Systems (TODS)
Perspectives in Software Engineering
ACM Computing Surveys (CSUR)
The Organization of Microprogram Stores
ACM Computing Surveys (CSUR)
ACM Computing Surveys (CSUR)
Multidimensional divide-and-conquer
Communications of the ACM
Minimum node disjoint path covering for circular-arc graphs
Information Processing Letters
| Hi-index | 0.02 |