{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:08:37Z","timestamp":1763467717298},"publisher-location":"Berlin\/Heidelberg","reference-count":8,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540123172"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0036940","type":"book-chapter","created":{"date-parts":[[2006,1,25]],"date-time":"2006-01-25T17:38:14Z","timestamp":1138210694000},"page":"597-609","source":"Crossref","is-referenced-by-count":35,"title":["Parallel dictionaries on 2\u20133 trees"],"prefix":"10.1007","author":[{"given":"W.","family":"Paul","sequence":"first","affiliation":[]},{"given":"U.","family":"Vishkin","sequence":"additional","affiliation":[]},{"given":"H.","family":"Wagener","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","volume-title":"The design and analysis of computer algorithms","author":"A. Aho","year":"1974","unstructured":"A. Aho, J. Hopcroft and J.D. Ullman, The design and analysis of computer algorithms, Addison-Wesley, Reading, Massachusetts, 1974."},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"M. Ajtai, J. Komlos and E. Szemerdi, \u201cAn O(n log n) sorting network\u201d, Proc. Fifteenth ACM Symp. on Theory of Computing, 1983, to appear.","DOI":"10.1145\/800061.808726"},{"key":"48_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF00263762","volume":"9","author":"R. Bayer","year":"1977","unstructured":"R. Bayer and M. Schkolnick, \u201cConcurrency of operations on B-Trees\u201d, Acta Informatica 9, 1\u201321 (1977).","journal-title":"Acta Informatica"},{"key":"48_CR4","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie, \u201cParallelism in random access machines\u201d, Proc. Tenth ACM Symp. on Theory of Computing, 114\u2013118 (1978).","DOI":"10.1145\/800133.804339"},{"key":"48_CR5","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/BF00289064","volume":"14","author":"E. C. Schlatter","year":"1980","unstructured":"Ellis C. Schlatter, \u201cConcurrent search and insertion in 2\u20133 trees\u201d, Acta Informatica 14, 63\u201386 (1980).","journal-title":"Acta Informatica"},{"key":"48_CR6","volume-title":"TR 210","author":"U. Vishkin","year":"1981","unstructured":"U. Vishkin, \u201cImplementation of simultaneous memory access in models that forbid it\u201d, TR 210, Dept. of Computer Science, Technion, Haifa, Israel (1981), and J. of Algorithms 4, 45\u201350, (1983)."},{"key":"48_CR7","volume-title":"RC 9541","author":"U. Vishkin","year":"1982","unstructured":"U. Vishkin, \u201cParallel-Design space Distributed-Implementation space (PDDI) general purpose computer\u201d, RC 9541, IBM T.J. Watson Research Center, Yorktown Heights, N.Y. 10598, 1982."},{"key":"48_CR8","unstructured":"H. Wagener, \u201cParallele Bearbeitung von 2-3-B\u00e4umen\u201d, Diplomarbeit, Faklt\u00e4t f\u00fcr Mathematik, Universit\u00e4t Bielefeld, 1982."}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0036940.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:21:45Z","timestamp":1607552505000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0036940"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540123172"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/bfb0036940","relation":{},"subject":[]}}