Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment

M. Korzeniowski, C. Scheideler, in:, ISPAN, 2005, pp. 182–187.

Download
OA 110.39 KB
URN
Conference Paper
Author
;
Publishing Year
Proceedings Title
ISPAN
Page
182--187
LibreCat-ID

Cite this

Korzeniowski M, Scheideler C. Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In: ISPAN.; 2005:182-187.
Korzeniowski, M., & Scheideler, C. (2005). Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment. In ISPAN (pp. 182–187).
@inbook{Korzeniowski_Scheideler_2005, title={Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment}, booktitle={ISPAN}, author={Korzeniowski, Miroslaw and Scheideler, Christian}, year={2005}, pages={182–187}}
Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” In ISPAN, 182–87, 2005.
M. Korzeniowski and C. Scheideler, “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment,” in ISPAN, 2005, pp. 182–187.
Korzeniowski, Miroslaw, and Christian Scheideler. “Transparent Data Structures, or How to Make Search Trees Robust in a Distributed Environment.” ISPAN. N.p., 2005. 182–187. Print.
Main File(s)
File Name
Access Level
OA Open Access
Last Uploaded
2018-04-13T08:45:41Z


Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar