Pages that link to "Item:Q3890116"
From MaRDI portal
The following pages link to Space Lower Bounds for Maze Threadability on Restricted Machines (Q3890116):
Displayed 28 items.
- More efficient periodic traversal in anonymous undirected graphs (Q442265) (← links)
- How much memory is needed for leader election (Q661049) (← links)
- Undirected \(s\)--\(t\) connectivity in polynomial time and sublinear space (Q677988) (← links)
- Milking the Aanderaa argument (Q918198) (← links)
- Universal sequences for complete graphs (Q918989) (← links)
- Incremental branching programs (Q929291) (← links)
- Distributed chasing of network intruders (Q930899) (← links)
- Fast periodic graph exploration with constant memory (Q931724) (← links)
- Setting port numbers for fast graph exploration (Q935169) (← links)
- Pebble machines and tree walking machines (Q1170037) (← links)
- Lower bounds on the length of universal traversal sequences (Q1201151) (← links)
- Counting quantifiers, successor relations, and logarithmic space (Q1362332) (← links)
- Reachability and the power of local ordering (Q1367543) (← links)
- A space lower bound for \(st\)-connectivity on node-named JAGs (Q1566733) (← links)
- Voronoi-like nondeterministic partition of a lattice by collectives of finite automata (Q1596777) (← links)
- A type-based complexity analysis of object oriented programs (Q1640983) (← links)
- Finite graph automata for linear and boundary graph languages (Q1770387) (← links)
- How to meet when you forget: log-space rendezvous in arbitrary graphs (Q1938363) (← links)
- Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits (Q2403234) (← links)
- Length lower bounds for reflecting sequences and universal traversal sequences (Q2407040) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- Space Complexity of the Directed Reachability Problem over Surface-Embedded Graphs (Q2821694) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Reachability is harder for directed than for undirected finite graphs (Q3489984) (← links)
- Pure Pointer Programs with Iteration (Q3540172) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Ramified Corecurrence and Logspace (Q5739361) (← links)