The deterministic complexity of parallel multisearch

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1097, Issue , 1996, Pages 404-415

  Bäumker, Arinin ^a   Dittrich, Wolfgang ^a   Pietracaprina, Andrea ^b  

^a UNIVERSITY OF PADERBORN   (Germany)

^b UNIVERSITY OF PADOVA   (Italy)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

COMMUNICATION COMPLEXITY; DISTRIBUTED MEMORY MACHINES; LOWER BOUNDS; OPTIMAL SPEED; QUERY POINTS; REDUNDANT REPRESENTATION;

REDUNDANCY;

EID: 84947923622     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61422-2_149     Document Type: Conference Paper

References (8)

1. M.J. Atallah, F. Dehne, R. Miller, A. Rau-Chaplin, and J.J. Tsay. Multisearch techniques for implementing data structures on a mesh-connected computer. In Proc. of the 3rd ACM Symp. on Parallel Algorithms and Architectures, pages 204-214, 1991.
2. M.J. Atallah and A. Fabri. On the multisearch problem for hypercubes. In Proc. of Parallel Architectures and Languages Europe (PARLE 94), 1994.
3. A. Bäumker, W. Dittrich, and F. Meyer auf der Heide. Truly efficient parallel algorithms: 1-optimal multisearch for and extension of the BSP model. Technical Report tr-rsfb-96-008, Department of Mathematics and Computer Science, University of Paderborn, 1996. See also Proc. of the 3rd ESA, 1995, pages 17-30.
4. F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse-grained multicomputers. In Proc. of the ACM Conference on Computational Geometry, 1993.
5. A. Pietracaprina and G. Pucci. The complexity of deterministic PRAM simulation on Distributed Memory Machines. Technical Report GEPPCOM-II-23, DEI Universita di Padova, Padova, Italy, 1995. See also Proc. of the 2nd ESA, 1994, pages 391-400.
6. A.G. Ranade. Maintaining dynamic ordered sets on processors networks. In Proc. of 4rd ACM Symp. on Parallel Algorithms and Architectures, pages 127-137, 1992.
7. J.H. Reif and S. Sen. Randomized algorithms for binary search ant load balancing on fixed connection networks with geometric applications. SIAM Journal on Computing, 23(3):633-651, June 1994.
8. L.G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103-111, August 1990.