Permutation Graphs and Transitive Graphs
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Time Bounded Random Access Machines with Parallel Processing
Journal of the ACM (JACM)
Journal of the ACM (JACM)
Computing connected components on parallel computers
Communications of the ACM
Algorithm 447: efficient algorithms for graph manipulation
Communications of the ACM
On the Power of Probabilistic Choice in Synchronous Parallel Computations
Proceedings of the 9th Colloquium on Automata, Languages and Programming
Parallel algorithms for the transitive closure and the connected component problems
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
A unified approach to models of synchronous parallel machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Some connections between nonuniform and uniform complexity classes
STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
Graph Theory With Applications
Graph Theory With Applications
Proceedings of the 30th IEEE symposium on Foundations of computer science
The complexity of acyclic conjunctive queries
Journal of the ACM (JACM)
Paths Problems in Symmetric Logarithmic Space
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
The Complexity of Planarity Testing
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
The complexity of planarity testing
Information and Computation
Undirected ST-connectivity in log-space
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Undirected connectivity in log-space
Journal of the ACM (JACM)
Absorbing Random Walks and the NAE2SAT Problem
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
A combinatorial algorithm for Pfaffians
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
| Hi-index | 0.00 |