Michal Koucky  Home/Search
Context
Related
| rutgers.edu/~mkoucky/papers/suts.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: rutgers.edu/~mkoucky/prof (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we introduce a new notion of traversal sequences that we call exploration sequences. Exploration sequences share many properties with the traversal sequences defined in [AKL+], but they also exhibit some new properties. In particular, they have an ability to backtrack, and their random properties are robust under choice of the probability distribution on labels. Further, we present extremely simple constructions of polynomial length universal exploration sequences for some... (Update)
Active bibliography (related documents): More All
0.3: Lower Bounds on Universal Traversal Sequences Based on Chains.. - Buss, Tompa (1995) (Correct)
0.3: Lower Bounds On Universal Traversal Sequences For Cycles And.. - Martin Tom Pa (Correct)
0.2: Lower Bounds for t-Reflecting Sequences: A Computational Approach - Flannery Dai (Correct)
Similar documents based on text: More All
0.6: Symmetric Logspace is Closed Under Complement - Nisan, Ta-Shma (1994) (Correct)
0.6: Universal Traversal Sequences - Feigenbaum, Reingold (1993) (Correct)
0.5: Time-Space Tradeoffs in the Counting Hierarchy - Allender, Kouck, Ronneburger (2001) (Correct)
BibTeX entry: (Update)
@inproceedings{ koucky01universal,
author = "Koucky",
title = "Universal Traversal Sequences with Backtracking",
booktitle = "{SCT}: Annual Conference on Structure in Complexity Theory",
year = "2001",
url = "citeseer.ist.psu.edu/koucky01universal.html" }
Citations (may not include all citations):65 universal traversal sequences (context) - Aleliunas, Karp et al. - 1979
11 Universal sequences for complete graphs (context) - Alon, Azar et al. - 1990
7 Ta-Shma (context) - Armoni
5 A simple graph traversing problem (context) - Aleliunas - 1978
http://www.stat.Berkeley.EDU/
Documents on the same site (http://paul.rutgers.edu/~mkoucky/prof.html):
Time-Space Tradeoffs in the Counting Hierarchy - Allender, Kouck, Ronneburger (2001) (Correct)
Power from Random Strings - Allender, Buhrman, Koucky, van.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC