Chi-Leung Wong, Zehra Sura, et al.
I-SPAN 2002
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
Heinz Koeppl, Marc Hafner, et al.
BMC Bioinformatics
Conference paper
A privacy-protecting coupon system
Liqun Chen, Matthias Enzmann, et al.
FC 2005
Paper
The Qx-coder
M.J. Slattery, Joan L. Mitchell
IBM J. Res. Dev