Pages that link to "Item:Q3604402"
From MaRDI portal
The following pages link to Undirected connectivity in log-space (Q3604402):
Displaying 50 items.
- On the isomorphism problem for decision trees and decision lists (Q2348033) (← links)
- Byzantine gathering in networks (Q2359766) (← links)
- Memory-constrained algorithms for simple polygons (Q2391542) (← links)
- The ANTS problem (Q2401118) (← links)
- Searching without communicating: tradeoffs between performance and selection complexity (Q2401119) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- The multi-agent rotor-router on the ring: a deterministic alternative to parallel random walks (Q2407630) (← links)
- Robustness of the rotor-router mechanism (Q2408092) (← links)
- The parameterized space complexity of embedding along a path (Q2408562) (← links)
- On approximating the eigenvalues of stochastic matrices in probabilistic logspace (Q2410679) (← links)
- Network robustness depth and topology management of networked dynamic systems (Q2416520) (← links)
- Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652) (← links)
- Rendezvous in networks in spite of delay faults (Q2629214) (← links)
- Limitations of the Impagliazzo-Nisan-Wigderson pseudorandom generator against permutation branching programs (Q2695266) (← links)
- Sublinear-space approximation algorithms for Max \(r\)-SAT (Q2695279) (← links)
- Deterministic rendezvous, treasure hunts, and strongly universal exploration sequences (Q2799477) (← links)
- Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855) (← links)
- Uniform-Circuit and Logarithmic-Space Approximations of Refined Combinatorial Optimization Problems (Q2867130) (← links)
- Reversibility in space-bounded computation (Q2930716) (← links)
- Depth-First Search Using $$O(n)$$ Bits (Q2942660) (← links)
- On Probabilistic Space-Bounded Machines with Multiple Access to Random Tape (Q2946415) (← links)
- PSPACE-Completeness of Bloxorz and of Games with 2-Buttons (Q2947039) (← links)
- Different Speeds Suffice for Rendezvous of Two Agents on Arbitrary Graphs (Q2971126) (← links)
- A logspace solution to the word and conjugacy problem of generalized Baumslag-Solitar groups (Q2975255) (← links)
- Finite Groups and Complexity Theory: From Leningrad to Saint Petersburg via Las Vegas (Q3007625) (← links)
- Planarity Testing Revisited (Q3010433) (← links)
- STCON in Directed Unique-Path Graphs (Q3165964) (← links)
- Expanding Generating Sets for Solvable Permutation Groups (Q3176493) (← links)
- On the Problem of Approximating the Eigenvalues of Undirected Graphs in Probabilistic Logspace (Q3448804) (← links)
- Undirected ST-connectivity in log-space (Q3581436) (← links)
- An $O(\logn \log\logn)$ Space Algorithm for Undirected st-Connectivity (Q3624373) (← links)
- Ontologies and Databases: The DL-Lite Approach (Q3639004) (← links)
- Formulas versus Circuits for Small Distance Connectivity (Q4554075) (← links)
- Pseudorandomness via the Discrete Fourier Transform (Q4562280) (← links)
- A fast randomized LOGSPACE algorithm for graph connectivity (Q4632451) (← links)
- (Q4638077) (← links)
- Expander Construction in VNC1 (Q4638081) (← links)
- The complexity of properties of transformation semigroups (Q4960463) (← links)
- (Q4993594) (← links)
- Constant-Round Interactive Proofs for Delegating Computation (Q4997311) (← links)
- Probabilistic logarithmic-space algorithms for Laplacian solvers (Q5002644) (← links)
- (Q5002836) (← links)
- Identifiability of Graphs with Small Color Classes by the Weisfeiler--Leman Algorithm (Q5009334) (← links)
- A Framework for In-place Graph Algorithms (Q5009570) (← links)
- Randomized and Symmetric Catalytic Computation (Q5042242) (← links)
- Approximation in (Poly-) Logarithmic Space (Q5089177) (← links)
- Efficient Isolation of Perfect Matching in O(log n) Genus Bipartite Graphs (Q5089210) (← links)
- (Q5090424) (← links)
- Compressed Decision Problems in Hyperbolic Groups. (Q5090484) (← links)
- (Q5091138) (← links)
