Parallel dictionaries on 2–3 trees
- 25 January 2006
- book chapter
- Published by Springer Nature
- p. 597-609
- https://doi.org/10.1007/bfb0036940
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- An 0(n log n) sorting networkPublished by Association for Computing Machinery (ACM) ,1983
- Concurrent search and insertion in 2?3 treesActa Informatica, 1980
- Parallelism in random access machinesPublished by Association for Computing Machinery (ACM) ,1978
- Concurrency of operations on B-treesActa Informatica, 1977