Pages that link to "Item:Q5716786"
From MaRDI portal
The following pages link to Automata, Languages and Programming (Q5716786):
Displaying 22 items.
- Drawing maps with advice (Q433400) (← links)
- Online computation with advice (Q541670) (← links)
- Trade-offs between the size of advice and broadcasting time in trees (Q547287) (← links)
- Local MST computation with short advice (Q613116) (← 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)
- Impact of memory size on graph exploration capability (Q947116) (← links)
- Labeling schemes for tree representation (Q1017912) (← links)
- Distributed graph searching with a sense of direction (Q2355324) (← links)
- Proof labeling schemes (Q2377139) (← links)
- Distributed computing with advice: information sensitivity of graph coloring (Q2377267) (← links)
- The ANTS problem (Q2401118) (← links)
- Graph decomposition for memoryless periodic exploration (Q2429354) (← links)
- Toward more localized local algorithms: removing assumptions concerning global knowledge (Q2441787) (← links)
- Graph exploration by a finite automaton (Q2575752) (← links)
- Graph Decomposition for Improving Memoryless Periodic Exploration (Q3182950) (← links)
- More Efficient Periodic Traversal in Anonymous Undirected Graphs (Q3408168) (← links)
- Black Hole Search in Directed Graphs (Q3408170) (← links)
- On the simulation of coloured labels by uncoloured ones on simple R-graphs (Q3989927) (← links)
- Memory Efficient Anonymous Graph Exploration (Q5302040) (← links)
- Mathematical Foundations of Computer Science 2004 (Q5311120) (← links)
