Regular interactive algorithms and their implementations on processor arrays
Regular interactive algorithms and their implementations on processor arrays
Theory of linear and integer programming
Theory of linear and integer programming
Testing for cycles in infinite graphs with periodic structure
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Integer and combinatorial optimization
Integer and combinatorial optimization
Detecting cycles in dynamic graphs in polynomial time
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Strongly polynomial-time and NC algorithms for detecting cycles in dynamic graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Recognizing strong connectivity in (dynamic) periodic graphs and its relation to integer programming
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
The Organization of Computations for Uniform Recurrence Equations
Journal of the ACM (JACM)
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
| Hi-index | 0.00 |