Kieran T. Herley, Andrea Pietracaprina, Geppino Pucci  Home/Search
Context
Related
| dei.unipd.it/~capri/PAPERS...tcs00.ps.Z 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: dei.unipd.it/~capri/papers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The backtrack search problem involves visiting all the nodes of an arbitrary binary tree given a pointer to its root, subject to the constraint that the children of a node are revealed only after their parent is visited. We present a fast, deterministic backtrack search algorithm for a p-processor COMMON CRCW-PRAM, which visits any n-node tree of height h in time O (n=p + h)(log log log p) 2 . This upper bound compares favourably with a natural n=p + h) lower bound for this problem. Our... (Update)
Similar documents (at the sentence level):
11.8%: Fast Deterministic Backtrack Search - Herley, Pietracaprina, Pucci (1996) (Correct)
Active bibliography (related documents): More All
1.4: Deterministic Parallel Backtrack Search - Herley, Pietracaprina, Pucci (2001) (Correct)
0.3: Simulating Binary Trees on Hypercubes - Monien, Sudborough (1988) (Correct)
0.2: Distributed Computing On Anonymous Hypercubes With Faulty.. - Kranakis, Santoro (1992) (Correct)
Similar documents based on text: More All
0.7: Implementing Shared Memory on Multi-Dimensional Meshes .. - Herley.. (1995) (Correct)
0.7: Implementing Shared Memory on Mesh-Connected Computers .. - Herley.. (2000) (Correct)
0.7: Fast Deterministic Parallel Branch-and-Bound - Herley, Pietracaprina, Pucci (1999) (Correct)
BibTeX entry: (Update)
@article{ herley02deterministic,
author = "Kieran T. Herley and Andrea Pietracaprina and Geppino Pucci",
title = "Deterministic parallel backtrack search",
journal = "Theoretical Computer Science",
volume = "270",
number = "1--2",
pages = "309--324",
year = "2002",
url = "citeseer.ist.psu.edu/article/herley00deterministic.html" }
Citations (may not include all citations):314 An Introduction to Parallel Algorithms (context) - aJ - 1992
47 Part I: The basic technique with applications to optimal par.. (context) - Cole, Vishkin et al. - 1988
42 Randomized parallel algorithms for backtrack search and bran.. (context) - Karp, Zhang - 1993
37 An atomic model for message-passing - Liu, Aeillo et al. - 1993
32 Branch-and-bound and backtrack search on mesh-connected arra.. - Kaklamanis, Persiano - 1994
29 Communication complexity for parallel divideand -conquer - Wu, Kung - 1991
20 Optimal deterministic approximate parallel prex sums and the.. - Goldberg, Zwick - 1994
14 A simpler analysis of the Karp-Zhang parallel branch-andboun.. (context) - Ranade - 1990
14 Near-perfect token distribution (context) - Broder, Frieze et al. - 1992
12 Tight bounds for on-line tree embeddings - Bhatt, Greenberg et al. - 1991
4 hypercube embeddings and fault-tolerance (context) - Aiello, Leighton - 1991
3 Dynamic tree embeddings in butter ies and hypercubes (context) - Leighton, Newman et al. - 1992
2 Optimal speed-up for backtrack search on a butter y network (context) - Ranade - 1994
Documents on the same site (http://www.dei.unipd.it/~capri/papers.html): More
Constructive, Deterministic Implementation of Shared.. - Pietracaprina, Pucci.. (Correct)
Fast Deterministic Parallel Branch-and-Bound - Herley, Pietracaprina, Pucci (1999) (Correct)
The Complexity of Deterministic PRAM Simulation on.. - Pietracaprina, Pucci (1997) (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