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
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Universal traversal sequences for expander graphs
Information Processing Letters
Multiparty protocols, pseudorandom generators for logspace, and time-space trade-offs
Journal of Computer and System Sciences
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
Symmetric Logspace is Closed Under Complement
Symmetric Logspace is Closed Under Complement
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
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
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
The PCP theorem by gap amplification
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Can every randomized algorithm be derandomized?
Proceedings of the thirty-eighth 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
SIGACT news complexity theory column 51
ACM SIGACT News
Progress in computational complexity theory
Journal of Computer Science and Technology
Data streams: algorithms and applications
Foundations and Trends® in Theoretical Computer Science
The Complexity of Pure Literal Elimination
Journal of Automated Reasoning
Using expander graphs to find vertex connectivity
Journal of the ACM (JACM)
A rendezvous of logic, complexity, and algebra
ACM SIGACT News
The PCP theorem by gap amplification
Journal of the ACM (JACM)
The diameter of randomly perturbed digraphs and some applications
Random Structures & Algorithms
Tree exploration with logarithmic memory
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Deterministic rendezvous, treasure hunts and strongly universal exploration sequences
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
On the Expansion of the Giant Component in Percolated (n, d,λ) Graphs
Combinatorics, Probability and Computing
Distributed chasing of network intruders
Theoretical Computer Science
Cyclic Extensions of Order Varieties
Electronic Notes in Theoretical Computer Science (ENTCS)
A combinatorial construction of almost-ramanujan graphs using the zig-zag product
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Fast periodic graph exploration with constant memory
Journal of Computer and System Sciences
Note: Setting port numbers for fast graph exploration
Theoretical Computer Science
Randomness-Efficient Sampling within NC1
Computational Complexity
Reachability Problems: An Update
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Computational Complexity of Constraint Satisfaction
CiE '07 Proceedings of the 3rd conference on Computability in Europe: Computation and Logic in the Real World
Absorbing Random Walks and the NAE2SAT Problem
FAW '08 Proceedings of the 2nd annual international workshop on Frontiers in Algorithmics
Directed st-Connectivity Is Not Expressible in Symmetric Datalog
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II
Pure Pointer Programs with Iteration
CSL '08 Proceedings of the 22nd international workshop on Computer Science Logic
On Linear Secret Sharing for Connectivity in Directed Graphs
SCN '08 Proceedings of the 6th international conference on Security and Cryptography for Networks
A Formalised Lower Bound on Undirected Graph Reachability
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Directed Planar Reachability Is in Unambiguous Log-Space
ACM Transactions on Computation Theory (TOCT)
Memory Efficient Anonymous Graph Exploration
Graph-Theoretic Concepts in Computer Science
Boolean Constraint Satisfaction Problems: When Does Post's Lattice Help?
Complexity of Constraints
Uniform Constraint Satisfaction Problems and Database Theory
Complexity of Constraints
The Simple Reachability Problem in Switch Graphs
SOFSEM '09 Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science
The complexity of satisfiability problems: Refining Schaefer's theorem
Journal of Computer and System Sciences
Universal algebra and hardness results for constraint satisfaction problems
Theoretical Computer Science
Affine systems of equations and counting infinitary logic
Theoretical Computer Science
Constant-Working-Space Algorithms for Image Processing
Emerging Trends in Visual Computing
On Construction of Almost-Ramanujan Graphs
COCOA '09 Proceedings of the 3rd International Conference on Combinatorial Optimization and Applications
Derandomizing Random Walks in Undirected Graphs Using Locally Fair Exploration Strategies
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
The complexity of constraint satisfaction games and QCSP
Information and Computation
Planarity, Determinants, Permanents, and (Unique) Matchings
ACM Transactions on Computation Theory (TOCT)
Fast periodic graph exploration with constant memory
SIROCCO'07 Proceedings of the 14th international conference on Structural information and communication complexity
Faster treasure hunt and better strongly universal exploration sequences
ISAAC'07 Proceedings of the 18th international conference on Algorithms and computation
Logspace algorithms for computing shortest and longest paths in series-parallel graphs
FSTTCS'07 Proceedings of the 27th international conference on Foundations of software technology and theoretical computer science
Reachability In K3,3-free graphs and K5-free graphs is in unambiguous log-space
FCT'09 Proceedings of the 17th international conference on Fundamentals of computation theory
Pure pointer programs with iteration
ACM Transactions on Computational Logic (TOCL)
Cracks in the defenses: scouting out approaches on circuit lower bounds
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
A logspace algorithm for partial 2-tree canonization
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
Longest paths in planar DAGs in unambiguous logspace
CATS '09 Proceedings of the Fifteenth Australasian Symposium on Computing: The Australasian Theory - Volume 94
Interval graphs: canonical representation in logspace
ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Database theory: query languages
Algorithms and theory of computation handbook
Other complexity classes and measures
Algorithms and theory of computation handbook
Balanced queries: divide and conquer
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Distance constraint satisfaction problems
MFCS'10 Proceedings of the 35th international conference on Mathematical foundations of computer science
Database constraints and homomorphism dualities
CP'10 Proceedings of the 16th international conference on Principles and practice of constraint programming
Correctness of linear logic proof structures is NL-complete
Theoretical Computer Science
Finding reductions automatically
Fields of logic and computation
Quantum walks on directed graphs
Quantum Information & Computation
On the CSP dichotomy conjecture
CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
Bravely, moderately: a common theme in four recent works
Studies in complexity and cryptography
Basic facts about expander graphs
Studies in complexity and cryptography
Canonizing hypergraphs under abelian group action
COCOON'11 Proceedings of the 17th annual international conference on Computing and combinatorics
Characterizing schema mappings via data examples
ACM Transactions on Database Systems (TODS)
Combinatorial algorithms for distributed graph coloring
DISC'11 Proceedings of the 25th international conference on Distributed computing
Quantified Equality Constraints
SIAM Journal on Computing
A Combinatorial Construction of Almost-Ramanujan Graphs Using the Zig-Zag Product
SIAM Journal on Computing
One-input-face MPCVP is hard for l, but in LogDCFL
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
On hypergraph and graph isomorphism with bounded color classes
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Linear advice for randomized logarithmic space
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Evaluating monotone circuits on cylinders, planes and tori
STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
Setting port numbers for fast graph exploration
SIROCCO'06 Proceedings of the 13th international conference on Structural Information and Communication Complexity
On graph isomorphism for restricted graph classes
CiE'06 Proceedings of the Second conference on Computability in Europe: logical Approaches to Computational Barriers
Memoryless routing in convex subdivisions: Random walks are optimal
Computational Geometry: Theory and Applications
Simulating undirected st-connectivity algorithms on uniform JAGs and NNJAGs
ISAAC'05 Proceedings of the 16th international conference on Algorithms and Computation
Derandomized constructions of k-wise (almost) independent permutations
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
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
Proving lower bounds via pseudo-random generators
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The directed planar reachability problem
FSTTCS '05 Proceedings of the 25th international conference on Foundations of Software Technology and Theoretical Computer Science
The complexity of satisfiability problems: refining Schaefer's theorem
MFCS'05 Proceedings of the 30th international conference on Mathematical Foundations of Computer Science
Finding short right-hand-on-the-wall walks in graphs
SIROCCO'05 Proceedings of the 12th international conference on Structural Information and Communication Complexity
Balancing bounded treewidth circuits
CSR'10 Proceedings of the 5th international conference on Computer Science: theory and Applications
The reduced automata technique for graph exploration space lower bounds
Theoretical Computer Science
Intuitive algorithms and t-vertex cover
ISAAC'06 Proceedings of the 17th international conference on Algorithms and Computation
An improved strategy for exploring a grid polygon
SIROCCO'09 Proceedings of the 16th international conference on Structural Information and Communication Complexity
On the power of waiting when exploring public transportation systems
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
More efficient periodic traversal in anonymous undirected graphs
Theoretical Computer Science
Planarity, determinants, permanents, and (unique) matchings
CSR'07 Proceedings of the Second international conference on Computer Science: theory and applications
Correctness of multiplicative (and exponential) proof structures is NL-complete
CSL'07/EACSL'07 Proceedings of the 21st international conference, and Proceedings of the 16th annuall conference on Computer Science Logic
Span programs and quantum algorithms for st-connectivity and claw detection
ESA'12 Proceedings of the 20th Annual European conference on Algorithms
Perspective: Simple agents learn to find their way: An introduction on mapping polygons
Discrete Applied Mathematics
Balancing Bounded Treewidth Circuits
Theory of Computing Systems
| 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 [9]. As undirected st-connectivity is complete for the class of problems solvable by symmetric, non-deterministic, 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 [45] 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 labelling and log-space constructible universal-exploration sequences for general graphs.