Storing a Sparse Table with 0(1) Worst Case Access Time
Journal of the ACM (JACM)
Two applications of inductive counting for complementation problems
SIAM Journal on Computing
Parallel hashing: an efficient implementation of shared memory
Journal of the ACM (JACM)
Lower bounds on the length of universal traversal sequences
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
High-probability parallel transitive closure algorithms
SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Deterministic algorithms for undirected s-t connectivity using polynomial time and sublinear space.
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Time-space trade-offs for undirected st-connectivity on a JAG
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Distributed holonic multi-agent system for resource discovery in grids
Multiagent and Grid Systems
Many random walks are faster than one
Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Mobile Agent-Based Approach for Resource Discovery in Peer-to-Peer Networks
Agents and Peer-to-Peer Computing
Multiple Random Walks and Interacting Particle Systems
ICALP '09 Proceedings of the 36th Internatilonal Collogquium on Automata, Languages and Programming: Part II
How Well Do Random Walks Parallelize?
APPROX '09 / RANDOM '09 Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
Radio cover time in hyper-graphs
Proceedings of the 6th International Workshop on Foundations of Mobile Computing
Multiple Random Walks in Random Regular Graphs
SIAM Journal on Discrete Mathematics
Static and expanding grid coverage with ant robots: Complexity results
Theoretical Computer Science
Random walks, interacting particles, dynamic networks: randomness can be helpful
SIROCCO'11 Proceedings of the 18th international conference on Structural information and communication complexity
Radio cover time in hyper-graphs
Ad Hoc Networks
| Hi-index | 0.00 |
Aleliunas et al. [1] posed the following question: “The reachability problem for undirected graphs can be solved in logspace and O(mn) time [m is the number of edges and n is the number of vertices] by a probabilistic algorithm that simulates a random walk, or in linear time and space by a conventional deterministic graph traversal algorithm. Is there a spectrum of time-space trade-offs between these extremes?” We answer this question in the affirmative for linear-sized graphs by presenting an algorithm which is faster than the random walk by a factor essentially proportional to the size of its workspace. For denser graphs, the algorithm is faster than the random walk but the speed-up factor is smaller.