Optimizing a Computational Method for Length Lower Bounds for Reflecting Sequences
Author:
- 31 July 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 228-236
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- Time-space tradeoffs for undirected graph traversal2002
- Improved length lower bounds for reflecting sequences1996
- Lower Bounds on Universal Traversal Sequences Based on Chains of Length FiveInformation and Computation, 1995
- Lower Bounds on Universal Traversal Sequences for Cycles and Other Low Degree GraphsSIAM Journal on Computing, 1992
- Bounds on Universal SequencesSIAM Journal on Computing, 1989
- The electrical resistance of a graph captures its commute and cover times1989
- Lower bounds on the length of universal traversal sequences1989
- Space Lower Bounds for Maze Threadability on Restricted MachinesSIAM Journal on Computing, 1980
- Random walks, universal traversal sequences, and the complexity of maze problems1979