Pages that link to "Item:Q3604402"

The following pages link to Undirected connectivity in log-space (Q3604402):

Displayed 50 items.

• Anonymous meeting in networks (Q262278) ‎ (← links)
• Solving linear equations parameterized by Hamming weight (Q309792) ‎ (← links)
• Solving the canonical representation and star system problems for proper circular-arc graphs in logspace (Q350727) ‎ (← links)
• Derandomizing the HSSW algorithm for 3-SAT (Q378221) ‎ (← links)
• Log-space algorithms for paths and matchings in \(k\)-trees (Q385514) ‎ (← links)
• Reprint of: Memory-constrained algorithms for simple polygons (Q390167) ‎ (← links)
• Pseudorandom generators for combinatorial checkerboards (Q395607) ‎ (← links)
• Pseudorandom generators, typically-correct derandomization, and circuit lower bounds (Q430845) ‎ (← links)
• Drawing maps with advice (Q433400) ‎ (← links)
• Deterministic network exploration by a single agent with Byzantine tokens (Q436569) ‎ (← links)
• Space complexity of perfect matching in bounded genus bipartite graphs (Q439936) ‎ (← links)
• The complexity of surjective homomorphism problems-a survey (Q444433) ‎ (← links)
• Weak derandomization of weak algorithms: explicit versions of Yao's lemma (Q451107) ‎ (← links)
• Gaming is a hard job, but someone has to do it! (Q489749) ‎ (← links)
• Interval graph representation with given interval and intersection lengths (Q491160) ‎ (← links)
• The complexity of counting quantifiers on equality languages (Q515549) ‎ (← links)
• Memory efficient algorithms for cactus graphs and block graphs (Q528335) ‎ (← links)
• The pervasive reach of resource-bounded Kolmogorov complexity in computational complexity theory (Q619899) ‎ (← links)
• The cycle switching graph of the Steiner triple systems of order 19 is connected (Q659722) ‎ (← links)
• How much memory is needed for leader election (Q661049) ‎ (← links)
• Space-efficient biconnected components and recognition of outerplanar graphs (Q666673) ‎ (← links)
• Green's theorem and isolation in planar graphs (Q714498) ‎ (← links)
• The isomorphism problem for \(k\)-trees is complete for logspace (Q714733) ‎ (← links)
• Restricted space algorithms for isomorphism on bounded treewidth graphs (Q714737) ‎ (← links)
• Searching for an evader in an unknown dark cave by an optimal number of asynchronous searchers (Q820530) ‎ (← links)
• An improved lower bound for competitive graph exploration (Q831137) ‎ (← links)
• How many ants does it take to find the food? (Q896147) ‎ (← links)
• On deterministic rendezvous at a node of agents with arbitrary velocities (Q1705703) ‎ (← links)
• A gentle introduction to applications of algorithmic metatheorems for space and circuit classes (Q1736808) ‎ (← links)
• On the power of unambiguity in log-space (Q1926109) ‎ (← links)
• How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) ‎ (← links)
• Low-level dichotomy for quantified constraint satisfaction problems (Q1944186) ‎ (← links)
• Consistent query answering for primary keys in Datalog (Q2035471) ‎ (← links)
• Approximation in (Poly-) logarithmic space (Q2037114) ‎ (← links)
• Equivalence classes and conditional hardness in massively parallel computations (Q2121067) ‎ (← links)
• Byzantine gathering in polynomial time (Q2146872) ‎ (← links)
• From the \(W\)-hierarchy to XNLP. Classes of fixed parameter intractability (Q2154075) ‎ (← links)
• Depth-first search in directed planar graphs, revisited (Q2170277) ‎ (← links)
• Expander construction in \(\mathrm{VNC}^1\) (Q2187260) ‎ (← links)
• Constant work-space algorithms for facility location problems (Q2192101) ‎ (← links)
• Exploration of carrier-based time-varying networks: the power of waiting (Q2202018) ‎ (← links)
• Frameworks for designing in-place graph algorithms (Q2237887) ‎ (← links)
• Estimating the number of connected components in sublinear time (Q2252647) ‎ (← links)
• Incremental delay enumeration: space and time (Q2274091) ‎ (← links)
• Space complexity of reachability testing in labelled graphs (Q2316928) ‎ (← links)
• Space efficient linear time algorithms for BFS, DFS and applications (Q2322695) ‎ (← links)
• 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)