{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:40:08Z","timestamp":1725489608956},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540656913"},{"type":"electronic","value":"9783540491163"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-49116-3_6","type":"book-chapter","created":{"date-parts":[[2007,8,16]],"date-time":"2007-08-16T12:56:14Z","timestamp":1187268974000},"page":"68-77","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory Organization Schemes for Large Shared Data: A Randomized Solution for Distributed Memory Machines"],"prefix":"10.1007","author":[{"given":"Alexander E.","family":"Andreev","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrea E. F.","family":"Clementi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paolo","family":"Penna","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 D. P.","family":"Rolim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,4,12]]},"reference":[{"key":"6_CR1","unstructured":"A.E. Andreev, A.E.F. Clementi, J.D.P. Rolim(1996), On the parallel computation of Boolean functions on unrelated inputs. Proc. of the IV IEEE Israel Symposium on Theory of Computing and Systems (ISTCS\u201996), IEEE, pp. 155\u2013161."},{"issue":"3","key":"6_CR2","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1145\/5925.5928","volume":"33","author":"F. Chin","year":"1986","unstructured":"Chin F. (1986), Security Problems on Inference Control for SUM, MAX and MIN Queries. J. of ACM, 33(3), pp. 451\u2013464.","journal-title":"J. of ACM"},{"key":"6_CR3","unstructured":"Chor B., and Gilboa N. (1997), Computationally Private Information Retrieval. Proc. of ACM STOC, p. 304\u2013313."},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"Chor B., Goldreich O., Kushilevitz E., and Sudan M. (1995), Private Information Retrieval. Proc of IEEE FOCS, pp. 41\u201350.","DOI":"10.1109\/SFCS.1995.492461"},{"issue":"1","key":"6_CR5","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1145\/320064.320068","volume":"4","author":"D. Dobkin","year":"1979","unstructured":"Dobkin D., Jones A. K., Lipton R.J. (1979), Secure Databases: Protection Against User Influence, ACM Trans. on Database Systems, 4(1), pp. 97\u2013106.","journal-title":"ACM Trans. on Database Systems"},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"Gertner Y., Goldwasser S., and Malkin T. (1998), A Random Server Model for Private Information Retrieval. Technical Report MIT-LCS-TR-715. To appear on Proc. RANDOM\u2019 98","DOI":"10.1007\/3-540-49543-6_17"},{"key":"6_CR7","doi-asserted-by":"crossref","unstructured":"Gertner Y., Ishai Y., Kushilevitz E., and Malkin T. (1998), Protecting Data Privacy in Private Information Retrieval Schemes. Proc. of ACM STOC.","DOI":"10.1145\/276698.276723"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/BF01940878","volume":"16","author":"R. M. Karp","year":"1996","unstructured":"Karp R. M., Luby M., and Meyer auf der Heide F. (1996), Efficient PRAM Simulation on a Distributed Memory Machine. Algoritmica, 16, pp. 517\u2013542(Extended Abstract in A CM STOC 1992).","journal-title":"Algoritmica"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Karlin A. and Upfal E. (1986), Parallel hashing-an efficient implementation of shared memory. Proc. of ACM STOC, 160\u2013168.","DOI":"10.1145\/12130.12146"},{"key":"6_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0304-3975(90)90192-K","volume":"71","author":"C.P. Kruskal","year":"1990","unstructured":"Kruskal C.P., Rudolph L., and Snir M. (1990), A Complexity Theory of Efficient Parallel Algorithms. Theoret. Comput. Sci, 71, p. 95\u2013132.","journal-title":"Theoret. Comput. Sci"},{"key":"6_CR11","unstructured":"Kumar V., Grama A., Gupta A., and Karypis G. (1995), Introduction to Parallel Computing. Benjamin\/Cummings Publ. Company."},{"key":"6_CR12","doi-asserted-by":"crossref","unstructured":"T. Leighton(1992), Introduction to parallel algorithms and architectures: arrays, trees, hypercubes. Morgan Kaufmann Publishers, san Mateo,CA.","DOI":"10.1016\/B978-1-4832-0772-8.50005-4"},{"key":"6_CR13","doi-asserted-by":"crossref","unstructured":"Liu Z., Li X., and You J. (1992), On storage schemes for parallel array access. Proc. ACMICS, pp. 282\u2013291.","DOI":"10.1145\/143369.143421"},{"key":"6_CR14","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/BF00264615","volume":"21","author":"K. Mehlhorn","year":"1984","unstructured":"Mehlhorn K. and Vishkin U. (1984), Randomized and Deterministic Simulation of PRAM by Parallel Machines with Restricted Granularity of Parallel Memories. ACTA Informatica, 21, pp. 339\u2013374.","journal-title":"ACTA Informatica"},{"key":"6_CR15","unstructured":"Pietracaprina A., and F. P. Preparata (1993), A Practical Constructive Scheme for Deterministic Shared-Memory Access. Proc of ACM SPAA, p. 100\u2013109."},{"key":"6_CR16","unstructured":"Pluris Inc. (1998), Pluris Massively Parallel Routing. Technical Report available at \n                    http:\/\/www.pluris.com\/wp\/index.html\n                    \n                  ."},{"key":"6_CR17","unstructured":"Pluris Inc. (1998), Parallel Routing, Technical report available at \n                    http:\/\/www.pluris.com."},{"key":"6_CR18","unstructured":"Tannenbaum A. (1994), Computer Networks. Prenctice Hall, III Edition."},{"key":"6_CR19","unstructured":"Ullman J.D. (1982) Principles of Database Systems. II edition."},{"issue":"3","key":"6_CR20","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1145\/828.1892","volume":"31","author":"E. Upfal","year":"1984","unstructured":"Upfal E. (1984), Efficient Schemes for Parallel Communication. J. of the ACM, 31(3), pp. 507\u2013517.","journal-title":"J. of the ACM"},{"key":"6_CR21","doi-asserted-by":"publisher","first-page":"116","DOI":"10.1145\/7531.7926","volume":"34","author":"E. Upfal","year":"1987","unstructured":"Upfal E. and Wigderson A. (1987), How to share memory in a distributed system, J. of the ACM, 34, pp. 116\u2013127.","journal-title":"J. of the ACM"}],"container-title":["Lecture Notes in Computer Science","STACS 99"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-49116-3_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T00:55:45Z","timestamp":1558486545000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-49116-3_6"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540656913","9783540491163"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-49116-3_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"12 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}