The space complexity of the accessibility problem for undirected graphs of log n bounded genus
Proceedings of the 12th symposium on Mathematical foundations of computer science 1986
Universal traversal sequences for paths and cycles
Journal of Algorithms
Universal traversal sequences of length nO(log n) for cliques
Information Processing Letters
Polynomial universal traversing sequences for cycles are constructible
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
SIAM Journal on Computing
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Multiparty protocols and logspace-hard pseudorandom sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Trading space for time in undirected s-t connectivity
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Lower bounds on the length of universal traversal sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Universal sequences for complete graphs
Discrete Applied Mathematics - Computational combinatiorics
High-probability parallel transitive closure algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
The Art of Computer Programming Volumes 1-3 Boxed Set
The Art of Computer Programming Volumes 1-3 Boxed Set
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Fast connected components algorithms for the EREW PRAM
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
Hi-index | 0.00 |