A new polynomial-time algorithm for linear programming
Combinatorica
Proceedings of the 12th Colloquium on Automata, Languages and Programming
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Las Vegas is better than determinism in VLSI and distributed computing (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Some complexity questions related to distributive computing(Preliminary Report)
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
On notions of information transfer in VLSI circuits
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Lower bounds for non-commutative computation
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Nondeterministic communication with a limited number of advice bits
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Public vs. private coin flips in one round communication games (extended abstract)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
Querying temporal constraint networks in PTIME
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
STDBM '99 Proceedings of the International Workshop on Spatio-Temporal Database Management
Algorithms and theory of computation handbook
Algorithms and theory of computation handbook
Fast track article: Designing hierarchical sensor networks with mobile data collectors
Pervasive and Mobile Computing
Proceedings of the 3rd Innovations in Theoretical Computer Science Conference
Linear vs. semidefinite extended formulations: exponential separation and strong lower bounds
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Computing a nonnegative matrix factorization -- provably
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Compact systems for T-join and perfect matching polyhedra of graphs with bounded genus
Operations Research Letters
Using separation algorithms to generate mixed integer model reformulations
Operations Research Letters
An information complexity approach to extended formulations
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
| Hi-index | 0.00 |