Victor Valls, Panagiotis Promponas, et al.
IEEE Communications Magazine
Paper
A time-space tradeoff for undirected graph traversal by walking automata
Abstract
We prove a time-space tradeoff for traversing undirected graphs, using a structured model that is a nonjumping variant of Cook and Rackoff's "jumping automata for graphs.". © 1999 Society for Industrial and Applied Mathematics.
Related
Conference paper
Low-Resource Speech Recognition of 500-Word Vocabularies
Sabine Deligne, Ellen Eide, et al.
INTERSPEECH - Eurospeech 2001
Erich P. Stuntebeck, John S. Davis II, et al.
HotMobile 2008
Conference paper
Performance test case generation for microprocessors
Pradip Bose
VTS 1998