Combinatorica
Deterministic simulation in LOGSPACE
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Better expanders and superconcentrators
Journal of Algorithms
Expanders obtained from affine transformations
Combinatorica - Theory of Computing
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
On the second eigenvalue of random regular graphs
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Pseudorandom generators for space-bounded computations
STOC '90 Proceedings of the twenty-second annual ACM symposium on Theory of computing
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Universal traversal sequences for expander graphs
Information Processing Letters
Existence and explicit constructions of q+1 regular Ramanujan graphs for every prime power q
Journal of Combinatorial Theory Series B
Pseudorandomness for network algorithms
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
The complexity of reconfiguring network models
Information and Computation
Journal of Computer and System Sciences
On recycling the randomness of states in space bounded computation
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Journal of the ACM (JACM)
An O(log(n)4/3) space algorithm for (s, t) connectivity in undirected graphs
Journal of the ACM (JACM)
Graph Nonisomorphism Has Subexponential Size Proofs Unless the Polynomial-Time Hierarchy Collapses
SIAM Journal on Computing
The Complexity of Graph Connectivity
MFCS '92 Proceedings of the 17th International Symposium on Mathematical Foundations of Computer Science
Derandomization That Is Rarely Wrong from Short Advice That Is Typically Good
RANDOM '02 Proceedings of the 6th International Workshop on Randomization and Approximation Techniques
Randomization and Derandomization in Space-Bounded Computation
CCC '96 Proceedings of the 11th Annual IEEE Conference on Computational Complexity
Sampling adsorbing staircase walks using a new Markov chain decomposition method
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Entropy waves, the zig-zag graph product, and new constant-degree expanders and extractors
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Universal Traversal Sequences with Backtracking
CCC '01 Proceedings of the 16th Annual Conference on Computational Complexity
Factoring graphs to bound mixing rates
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
On traversal sequences, exploration sequences and completeness of kolmogorov random strings
On traversal sequences, exploration sequences and completeness of kolmogorov random strings
Bipartite Subgraphs and the Smallest Eigenvalue
Combinatorics, Probability and Computing
A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
Journal of the ACM (JACM)
An O(log n log log n) space algorithm for undirected st-connectivity
Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Pseudorandom walks on regular digraphs and the RL vs. L problem
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
The PCP theorem by gap amplification
Journal of the ACM (JACM)
S-T Connectivity on Digraphs with a Known Stationary Distribution
CCC '07 Proceedings of the Twenty-Second Annual IEEE Conference on Computational Complexity
Computational Complexity: A Conceptual Perspective
Computational Complexity: A Conceptual Perspective
Random walks, universal traversal sequences, and the complexity of maze problems
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
On the second eigenvalue of random regular graphs
SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science
Undirected connectivity in O(log/sup 1.5/n) space
SFCS '92 Proceedings of the 33rd Annual Symposium on Foundations of Computer Science
Derandomized squaring of graphs
APPROX'05/RANDOM'05 Proceedings of the 8th international workshop on Approximation, Randomization and Combinatorial Optimization Problems, and Proceedings of the 9th international conference on Randamization and Computation: algorithms and techniques
Tractable Optimization Problems through Hypergraph-Based Structural Restrictions
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
Pseudorandom Generators and Typically-Correct Derandomization
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Small-Bias Spaces for Group Products
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Robustness of the Rotor-router Mechanism
OPODIS '09 Proceedings of the 13th International Conference on Principles of Distributed Systems
Logspace Reduction of Directed Reachability for Bounded Genus Graphs to the Planar Case
ACM Transactions on Computation Theory (TOCT)
The DL-lite family and relations
Journal of Artificial Intelligence Research
Proceedings of the twenty-ninth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
Delays induce an exponential memory gap for rendezvous in trees
Proceedings of the twenty-second annual ACM symposium on Parallelism in algorithms and architectures
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
How to meet when you forget: log-space rendezvous in arbitrary graphs
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
The computational complexity of RACETRACK
FUN'10 Proceedings of the 5th international conference on Fun with algorithms
The cover time of deterministic random walks
COCOON'10 Proceedings of the 16th annual international conference on Computing and combinatorics
How much memory is needed for leader election
DISC'10 Proceedings of the 24th international conference on Distributed computing
The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory
Journal of Computer and System Sciences
Tree exploration with logarithmic memory
ACM Transactions on Algorithms (TALG)
Constructing a map of an anonymous graph: applications of universal sequences
OPODIS'10 Proceedings of the 14th international conference on Principles of distributed systems
S-T connectivity on digraphs with a known stationary distribution
ACM Transactions on Algorithms (TALG)
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
Finite groups and complexity theory: from leningrad to saint petersburg via las vegas
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Planarity of knots, register automata and logspace computability
LATA'11 Proceedings of the 5th international conference on Language and automata theory and applications
Low-level dichotomy for quantified constraint satisfaction problems
Information Processing Letters
Nodes connected by path languages
DLT'11 Proceedings of the 15th international conference on Developments in language theory
Derandomizing HSSW algorithm for 3-SAT
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Interval Graphs: Canonical Representations in Logspace
SIAM Journal on Computing
Proceedings of the twenty-third annual ACM-SIAM symposium on Discrete Algorithms
Journal of Parallel and Distributed Computing
Space complexity of perfect matching in bounded genus bipartite graphs
Journal of Computer and System Sciences
Constant-Work-Space algorithm for a shortest path in a simple polygon
WALCOM'10 Proceedings of the 4th international conference on Algorithms and Computation
Deterministic network exploration by a single agent with Byzantine tokens
Information Processing Letters
Green's theorem and isolation in planar graphs
Information and Computation
Tight bounds for monotone switching networks via fourier analysis
STOC '12 Proceedings of the forty-fourth annual ACM symposium on Theory of computing
The complexity of surjective homomorphism problems-a survey
Discrete Applied Mathematics
Decidability classes for mobile agents computing
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Survey: A glimpse at Christos H. Papadimitriou
Computer Science Review
The isomorphism problem for k-trees is complete for logspace
Information and Computation
Restricted space algorithms for isomorphism on bounded treewidth graphs
Information and Computation
Collaborative search on the plane without communication
PODC '12 Proceedings of the 2012 ACM symposium on Principles of distributed computing
Deterministic network exploration by anonymous silent agents with local traffic reports
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
DLT'12 Proceedings of the 16th international conference on Developments in Language Theory
On the complexity of rolling block and alice mazes
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Grid graphs with diagonal edges and the complexity of xmas mazes
FUN'12 Proceedings of the 6th international conference on Fun with Algorithms
Near-Optimal expanding generator sets for solvable permutation groups
MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Scalable geo-thematic query answering
ISWC'12 Proceedings of the 11th international conference on The Semantic Web - Volume Part I
Memory lower bounds for randomized collaborative search and implications for biology
DISC'12 Proceedings of the 26th international conference on Distributed Computing
Data complexity of query answering in description logics
Artificial Intelligence
Delays Induce an Exponential Memory Gap for Rendezvous in Trees
ACM Transactions on Algorithms (TALG)
Pure pointer programs and tree isomorphism
FOSSACS'13 Proceedings of the 16th international conference on Foundations of Software Science and Computation Structures
How to meet asynchronously at polynomial cost
Proceedings of the 2013 ACM symposium on Principles of distributed computing
Decomposing combinatorial auctions and set packing problems
Journal of the ACM (JACM)
An algebraic characterization of testable boolean CSPs
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Log-Space Algorithms for Paths and Matchings in k-Trees
Theory of Computing Systems
Reprint of: Memory-constrained algorithms for simple polygons
Computational Geometry: Theory and Applications
Pseudorandom generators for combinatorial checkerboards
Computational Complexity
| Hi-index | 0.01 |
We present a deterministic, log-space algorithm that solves st-connectivity in undirected graphs. The previous bound on the space complexity of undirected st-connectivity was log4/3(⋅) obtained by Armoni, Ta-Shma, Wigderson and Zhou (JACM 2000). As undirected st-connectivity is complete for the class of problems solvable by symmetric, nondeterministic, log-space computations (the class SL), this algorithm implies that SL = L (where L is the class of problems solvable by deterministic log-space computations). Independent of our work (and using different techniques), Trifonov (STOC 2005) has presented an O(log n log log n)-space, deterministic algorithm for undirected st-connectivity. Our algorithm also implies a way to construct in log-space a fixed sequence of directions that guides a deterministic walk through all of the vertices of any connected graph. Specifically, we give log-space constructible universal-traversal sequences for graphs with restricted labeling and log-space constructible universal-exploration sequences for general graphs.