{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:36:41Z","timestamp":1725457001148},"publisher-location":"Berlin\/Heidelberg","reference-count":17,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540528261"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0032071","type":"book-chapter","created":{"date-parts":[[2005,12,11]],"date-time":"2005-12-11T06:05:31Z","timestamp":1134281131000},"page":"744-751","source":"Crossref","is-referenced-by-count":20,"title":["The parallel simplicity of compaction and chaining"],"prefix":"10.1007","author":[{"given":"Prabhakar","family":"Ragde","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"crossref","unstructured":"P. Beame and J. Hastad, Optimal Bounds for Decision Problems on the CRCW PRAM, Proc. 19th Annual ACM Symposium on the Theory of Computing, 1987, pp. 83\u201393.","DOI":"10.1145\/28395.28405"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"O. Berkman and U. Vishkin, Recursive *-Tree Parallel Data-Structure (extended abstract), Proc. 30th Annual ACM Symposium on Foundations of Computer Science, 1989.","DOI":"10.1109\/SFCS.1989.63478"},{"key":"55_CR3","unstructured":"B. Chlebus, K. Diks, T. Hagerup, and T. Radzik, Efficient Simulations Between CRCW PRAMs, Proc. 13th Symposium on the Mathematical Foundations of Computer Science, 1988, pp. 230\u2013239."},{"key":"55_CR4","doi-asserted-by":"crossref","first-page":"222","DOI":"10.1016\/0022-0000(85)90015-7","volume":"30","author":"A. Chandra","year":"1986","unstructured":"A. Chandra, S. Fortune, and R. Lipton, Unbounded Fan-In Circuits and Associative Functions, Journal of Computer and Systems Sciences 30 (1986), pp. 222\u2013234.","journal-title":"Journal of Computer and Systems Sciences"},{"key":"55_CR5","doi-asserted-by":"crossref","unstructured":"R. Cole and U. Vishkin, Approximate and Exact Parallel Scheduling with Applications to List, Tree, and Graph Problems, Proc. 27th Annual ACM Symposium on Foundations of Computer Science, 1986, pp. 478.","DOI":"10.1109\/SFCS.1986.10"},{"key":"55_CR6","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1016\/0022-0000(79)90044-8","volume":"18","author":"L. Carter","year":"1979","unstructured":"L. Carter and M. Wegman, Universal Classes of Hash Functions, Journal of Computer and System Sciences 18 (1979), pp. 143\u2013154.","journal-title":"Journal of Computer and System Sciences"},{"key":"55_CR7","doi-asserted-by":"crossref","unstructured":"M. Fredman, J. Koml\u00f3s, and E. Szemer\u00e9di, Storing a Sparse Table with O(1) Worst-Case Access Time, Proc. 23rd Annual IEEE Symposium on Foundations of Computer Science, 1982, pp. 165\u2013169.","DOI":"10.1109\/SFCS.1982.39"},{"key":"55_CR8","doi-asserted-by":"crossref","unstructured":"F.E. Fich, A. Wigderson, and P. Ragde, Relations Between Concurrent-Write Models of Parallel Computation (preliminary version), Proc. 3rd Annual ACM Symposium on Principles of Distributed Computing, 1984, pp. 179\u2013189.","DOI":"10.1145\/800222.806745"},{"key":"55_CR9","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1007\/BF01762109","volume":"3","author":"F.E. Fich","year":"1988","unstructured":"F.E. Fich, A. Wigderson, and P. Ragde, Simulations Among Concurrent-Write Models of Parallel Computation, Algorithmica 3 (1988), pp. 43\u201351.","journal-title":"Algorithmica"},{"key":"55_CR10","unstructured":"V. Grolmusz, Large Parallel Machines Can Be Extremely Slow for Small Problems, manuscript, 1988."},{"key":"55_CR11","unstructured":"J. Gil and L. Rudolph, Counting and Packing in Parallel, Proc. 1986 International Conference on Parallel Processing, pp. 1000\u20131002."},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"T. Hagerup and M. Nowak, Parallel Retrieval of Scattered Information, Proc. 16th Annual International Conference on Automata, Languages and Programming, 1989, to appear.","DOI":"10.1007\/BFb0035775"},{"key":"55_CR13","doi-asserted-by":"crossref","unstructured":"I. Newman, P. Ragde, and A. Wigderson, Perfect Hashing, Graph Entropy, and Circuit Complexity, Proc. 5th IEEE Conference on Structure in Complexity Theory, 1990.","DOI":"10.1109\/SCT.1990.113958"},{"key":"55_CR14","unstructured":"P. Ragde, Lower Bounds for Parallel Computation, Ph.D Thesis, University of California at Berkeley, 1986."},{"key":"55_CR15","doi-asserted-by":"crossref","unstructured":"J. Reif, An Optimal Parallel Algorithm for Integer Sorting, Proc. 26th Annual ACM Symposium on Foundations of Computer Science, 1985, pp. 496\u2013504.","DOI":"10.1109\/SFCS.1985.9"},{"key":"55_CR16","unstructured":"L. Rudolph and W. Steiger, Subset Selection in Parallel, Proc. 1985 International Conference on Parallel Processing, pp. 11\u201314."},{"key":"55_CR17","unstructured":"I. Wegener, N. Wurm, and S.-Z. Yi, Symmetric Functions in AC\n0\nCan Be Computed In Constant Depth With Very Small Size, Universit\u00e4t Dortmund Forschungsbereicht Nr. 326, 1989."}],"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\/BFb0032071.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:05:38Z","timestamp":1607551538000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0032071"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540528261"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/bfb0032071","relation":{},"subject":[]}}