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)
The String-to-String Correction Problem
Journal of the ACM (JACM)
The Complexity of Computing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
STRING-MATCHING AND OTHER PRODUCTS
STRING-MATCHING AND OTHER PRODUCTS
Time-Space trade-offs for some algebraic problems
Journal of the ACM (JACM)
Bounds on Algorithm-Based Fault Tolerance in Multiple Processor Systems
IEEE Transactions on Computers - The MIT Press scientific computation series
On the Construction of Communication Networks Satisfying Bounded Fan-In of Service Ports
IEEE Transactions on Computers
Fault-tolerant circuit-switching networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Shifting Graphs and Their Applications
Journal of the ACM (JACM)
A Survey of Analysis Techniques for Discrete Algorithms
ACM Computing Surveys (CSUR)
Classification Categories and Historical Development of Circuit Switching Topologies
ACM Computing Surveys (CSUR)
A layout strategy for VLSI which is provably good (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Space bounds for a game on graphs
STOC '76 Proceedings of the eighth 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
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Unbounded fan-in circuits and associative functions
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Smaller superconcentrators of density 28
Information Processing Letters
Rearrangeable and nonblocking [w, f] -distributors
IEEE/ACM Transactions on Networking (TON)
Smaller superconcentrators of density 28
Information Processing Letters
Universality considerations in VLSI circuits
IEEE Transactions on Computers
Block-oriented programmable design with switching network interconnect
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Tradeoffs in depth-two superconcentrators
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
CRYPTO'05 Proceedings of the 25th annual international conference on Advances in Cryptology
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
| Hi-index | 0.01 |
The purpose of this paper is to explore the possibility that purely graph-theoretic reasons may account for the superlinear complexity of wide classes of computational problems. The results are therefore of two kinds: reductions to graph theoretic conjectures on the one hand, and graph theoretic results on the other. We show that the graph of any algorithm for any one of a number of arithmetic problems (e.g. polynomial multiplication, discrete Fourier transforms, matrix multiplication) must have properties closely related to concentration networks.