A new polynomial-time algorithm for linear programming
Combinatorica
Self-adjusting binary search trees
Journal of the ACM (JACM)
Separating the polynomial-time hierarchy by oracles
Proc. 26th annual symposium on Foundations of computer science
Average case complete problems
SIAM Journal on Computing
Computational limitations of small-depth circuits
Computational limitations of small-depth circuits
Structural complexity 1
The method of forced enumeration for nondeterministic automata
Acta Informatica
A new approach to the maximum-flow problem
Journal of the ACM (JACM)
Nondeterministic space is closed under complementation
SIAM Journal on Computing
Pseudo-random generation from one-way functions
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
The maximum concurrent flow problem
Journal of the ACM (JACM)
Structural complexity 2
A bridging model for parallel computation
Communications of the ACM
Introduction to algorithms
Finding minimum-cost circulations by successive approximation
Mathematics of Operations Research
Fast approximation algorithms for multicommodity flow problems
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Journal of Computer and System Sciences
The complexity of finite functions
Handbook of theoretical computer science (vol. A)
Theory of computing: achievements, challenges, and opportunities
ACM SIGACT News
Polynomial-time approximation algorithms for the Ising model
SIAM Journal on Computing
Mapping the genome: some combinatorial problems arising in molecular biology
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Introduction to the theory of complexity
Introduction to the theory of complexity
Efficient and effective querying by image content
Journal of Intelligent Information Systems - Special issue: advances in visual information management systems
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
A General Approximation Technique for Constrained Forest Problems
SIAM Journal on Computing
Randomized algorithms
Communications of the ACM
Fast protein folding in the hydrophobic-hydrophilic model within three-eights of optimal
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Interactive proofs and the hardness of approximating cliques
Journal of the ACM (JACM)
Implementing data cubes efficiently
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
The primal-dual method for approximation algorithms and its application to network design problems
Approximation algorithms for NP-hard problems
On the complexity of string folding
Discrete Applied Mathematics - Special volume on computational molecular biology
Advances in knowledge discovery and data mining
Advances in knowledge discovery and data mining
Average-case computational complexity theory
Complexity theory retrospective II
On the hardness of approximating minimization problems
Journal of the ACM (JACM)
External-memory graph algorithms
Proceedings of the sixth annual ACM-SIAM symposium on Discrete algorithms
A commercial application of survivable network design: ITP/INPLANS CCS network topology analyzer
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Error-resilient DNA computation
Proceedings of the seventh annual ACM-SIAM symposium on Discrete algorithms
Computational Work and Time on Finite Machines
Journal of the ACM (JACM)
Applying Parallel Computation Algorithms in the Design of Serial Algorithms
Journal of the ACM (JACM)
A method for obtaining digital signatures and public-key cryptosystems
Communications of the ACM
Cryptography: Theory and Practice
Cryptography: Theory and Practice
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Can Parallel Algorithms Enhance Serial Implementation?
Proceedings of the 8th International Symposium on Parallel Processing
MFCS '94 Proceedings of the 19th International Symposium on Mathematical Foundations of Computer Science 1994
Optimization Algorithms For Large Networks
ESA '94 Proceedings of the Second Annual European Symposium on Algorithms
Reconstructing strings from substrings in rounds
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
Perspectives on database theory
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
I/O complexity: The red-blue pebble game
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
STOC '79 Proceedings of the eleventh 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
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Open Combinatorial Problems in computational Molecular Biology
ISTCS '95 Proceedings of the 3rd Israel Symposium on the Theory of Computing Systems (ISTCS'95)
Competitive routing of virtual circuits in ATM networks
IEEE Journal on Selected Areas in Communications
Strategic directions in computational geometry
ACM Computing Surveys (CSUR) - Special ACM 50th-anniversary issue: strategic directions in computing research
| Hi-index | 0.00 |