The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Journal of the ACM (JACM)
Lower Bounds on Merging Networks
Journal of the ACM (JACM)
Relations Among Complexity Measures
Journal of the ACM (JACM)
On non-linear lower bounds in computational complexity
STOC '75 Proceedings of seventh annual ACM symposium on Theory of computing
An efficient algorithm for computing optimal disk merge patterns. (Extended Abstract)
STOC '74 Proceedings of the sixth annual ACM symposium on Theory of computing
STRING-MATCHING AND OTHER PRODUCTS
STRING-MATCHING AND OTHER PRODUCTS
The complexity of monotone functions.
The complexity of monotone functions.
Space-Time Trade-Offs for Banded Matrix Problems
Journal of the ACM (JACM)
Time-Space trade-offs for some algebraic problems
Journal of the ACM (JACM)
STOC '86 Proceedings of the eighteenth annual ACM symposium on Theory of computing
On-line algorithms for path selection in a nonblocking network
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
On probabilistic networks for selection, merging, and sorting
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Lower bounds for sorting networks
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
The asymptotic complexity of merging networks
Journal of the ACM (JACM)
Strictly non-blocking WDM cross-connects for heterogeneous networks
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
The realization of monotone Boolean functions (Preliminary Version)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Time-space tradeoffs for computing functions, using connectivity properties of their circuits
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Negation can be exponentially powerful
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Upper and lower bounds on time-space tradeoffs
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A time-space tradeoff for sorting on a general sequential model of computation
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Time-space tradeoffs for some algebraic problems
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Time-Space Tradeoffs on Back-to-Back FFT Algorithms
IEEE Transactions on Computers
The Lens Interconnection Strategy
IEEE Transactions on Computers
Reductions for monotone Boolean circuits
Theoretical Computer Science
Valiant load balancing, capacity provisioning and resilient backbone design
CAAN'07 Proceedings of the 4th conference on Combinatorial and algorithmic aspects of networking
Reductions for monotone boolean circuits
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
On Probabilistic Networks for Selection, Merging, and Sorting
Theory of Computing Systems
| Hi-index | 0.01 |
Graphs that in a certain precise sense are rich in sets of vertex-disjoint paths are studied. Bounds are obtained on the minimum number of edges in such graphs, and these are used to deduce nonlinear lower bounds on the computational complexity of shifting, merging, and matching problems.