The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Essentially Every Unimodular Matrix Defines and Expander
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Recursive construction for 3-regular expanders
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Reductions for monotone Boolean circuits
Theoretical Computer Science
A note on time-space tradeoffs for computing continuous functions
Information Processing Letters
Tradeoffs in depth-two superconcentrators
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Finite Fields and Their Applications
Constructions of given-depth and optimal multirate rearrangeably nonblocking distributors
Journal of Combinatorial Optimization
| Hi-index | 0.00 |
The extent to which a set of related graph-theoretic properties can be used to accont for the superlinear complexity of computational problems is explored. While a previously widely held positive conjecture is refuted, it is also shown that certain limited lower bounds can be proved by means of such properties.