Fully dynamic search trees for an extension of the BSP model

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Fully dynamic search trees for an extension of the BSP model

Full text

Pdf (1.20 MB)

Source

ACM Symposium on Parallel Algorithms and Architectures archive
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures table of contents

Padua, Italy

Pages: 233 - 242

Year of Publication: 1996

ISBN:0-89791-809-6

Authors

Armin Baumker	Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, D-33095 Paderborn, Germany
Wolfgang Dittrich	Department of Mathematics and Computer Science and Heinz Nixdorf Institute, University of Paderborn, D-33095 Paderborn, Germany

Sponsors

SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGARCH: ACM Special Interest Group on Computer Architecture

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 1, Downloads (12 Months): 12, Citation Count: 6

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/237502.237562 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Armin Bäumker , Wolfgang Dittrich , Friedhelm Meyer auf der Heide, Truly efficient parallel algorithms: 1-optimal multisearch for an extension of the BSP model, Selected papers from the third European symposium on Algorithms, p.175-203, August 1998, Courfu, Greece
	2	A. Baumker, W. Dittrich, and F. Meyer auf der Heide. Truly Efficient Parallel Algorithms: 1-Optimal Multisearch for an Extension of the BSP model. Technical Report University of Paderborn, 1996.
	3	Armin Bäumker , Wolfgang Dittrich, Parallel Algorithms for Image Processing: Practical Algorithms with Experiments, Proceedings of the 10th International Parallel Processing Symposium, p.429-433, April 15-19, 1996
	4	R.H. Bisseling and W.F. McColl, Scientific computing on bulk synchronous parallel architectures, Proc. 13th IFIP World Computer Congress, Volume 1, 1994.
	5	K. Mehlhorn, Data Structures and Algorithms 1-3. Springer-Verlag.
	6	Abhiram Ranade, Maintaining dynamic ordered sets on processor networks, Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures, p.127-137, June 29-July 01, 1992, San Diego, California, United States [doi>10.1145/140901.140915]
	7	Wolfgang J. Paul , Uzi Vishkin , Hubert Wagener, Parallel Dictionaries in 2-3 Trees, Proceedings of the 10th Colloquium on Automata, Languages and Programming, p.597-609, July 18-22, 1983
	8	John H. Reif , Sandeep Sen, Randomized Algorithms for Binary Search and Load Balancing on Fixed Connection Networks with Geometric Applications, SIAM Journal on Computing, v.23 n.3, p.633-651, June 1994 [doi>10.1137/S0097539790184298]
	9	Alexandros V. Gerbessiotis , Leslie G. Valiant, Direct bulk-synchronous parallel algorithms, Journal of Parallel and Distributed Computing, v.22 n.2, p.251-267, Aug. 1994 [doi>10.1006/jpdc.1994.1085]
	10	Leslie G. Valiant, A bridging model for parallel computation, Communications of the ACM, v.33 n.8, p.103-111, Aug. 1990 [doi>10.1145/79173.79181]

CITED BY 6

	Micah Adler , Phillip B. Gibbons , Vijaya Ramachandran , Yossi Matias, Modeling parallel bandwidth: local vs. global restrictions, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.94-105, June 23-25, 1997, Newport, Rhode Island, United States
	Micah Adler , Wolfgang Dittrich , Ben Juurlink , Mirosław Kutyłowski , Ingo Rieping, Communication-optimal parallel minimum spanning tree algorithms (extended abstract), Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.27-36, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Guy E. Blelloch , Margaret Reid-Miller, Fast set operations using treaps, Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.16-26, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Wolfgang Dittrich , David Hutchinson , Anil Maheshwari, Blocking in parallel multisearch problems (extended abstract), Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures, p.98-107, June 28-July 02, 1998, Puerto Vallarta, Mexico
	Phillip B. Gibbons , Yossi Matias , Vijaya Ramachandran, Can shared-memory model serve as a bridging model for parallel computation?, Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures, p.72-83, June 23-25, 1997, Newport, Rhode Island, United States
	Mark W. Goudreau , Kevin Lang , Satish B. Rao , Torsten Suel , Thanasis Tsantilas, Portable and Efficient Parallel Computing Using the BSP Model, IEEE Transactions on Computers, v.48 n.7, p.670-689, July 1999