乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T04:58:20Z","timestamp":1648875500452},"reference-count":19,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,5,1]],"date-time":"1991-05-01T00:00:00Z","timestamp":673056000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8113,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Computation"],"published-print":{"date-parts":[[1991,5]]},"DOI":"10.1016\/0890-5401(91)90021-s","type":"journal-article","created":{"date-parts":[[2004,12,2]],"date-time":"2004-12-02T00:24:20Z","timestamp":1101947060000},"page":"81-96","source":"Crossref","is-referenced-by-count":2,"title":["Deterministic P-RAM simulation with constant redundancy"],"prefix":"10.1016","volume":"92","author":[{"given":"Scot W.","family":"Hornick","sequence":"first","affiliation":[]},{"given":"Franco P.","family":"Preparata","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0890-5401(91)90021-S_BIB1","doi-asserted-by":"crossref","first-page":"808","DOI":"10.1137\/0216053","article-title":"Deterministic simulation of idealized parallel computers on more realistic ones","volume":"16","author":"Alt","year":"1987","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0890-5401(91)90021-S_BIB2","series-title":"Proceedings of the 10th Annual ACM Symposium on the Theory of Computing","first-page":"114","article-title":"Parallelism in random access machines","author":"Fortune","year":"1978"},{"key":"10.1016\/0890-5401(91)90021-S_BIB3","series-title":"Proceedings of the 7th Annual ACM Symposium on Operating System Principles","first-page":"150","article-title":"Weighted voting for replicated data","author":"Gifford","year":"1979"},{"key":"10.1016\/0890-5401(91)90021-S_BIB4","series-title":"Proceedings of the 26th Annual Allerton Conference on Communication, Control and Computing","first-page":"1084","article-title":"Deterministic simulations of PRAMs on bounded degree networks","author":"Herley","year":"1988"},{"key":"10.1016\/0890-5401(91)90021-S_BIB5","author":"Hirschberg","year":"1977"},{"key":"10.1016\/0890-5401(91)90021-S_BIB6","series-title":"Proceedings of the 18th Annual ACM Symposium on the Theory of Computing","first-page":"160","article-title":"Parallel hashing\u2014An efficient implementation of shared memory","author":"Karlin","year":"1980"},{"key":"10.1016\/0890-5401(91)90021-S_BIB7","author":"Karp","year":"1988"},{"key":"10.1016\/0890-5401(91)90021-S_BIB8","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1007\/BF01744433","article-title":"New lower bound techniques for VLSI","volume":"17","author":"Leighton","year":"1984","journal-title":"Math. Systems Theory"},{"key":"10.1016\/0890-5401(91)90021-S_BIB9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1016\/0020-0190(88)90160-3","article-title":"A probabilistic simulation of PRAMs on a bounded-degree network","volume":"28","author":"Luccio","year":"1988","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0890-5401(91)90021-S_BIB10","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1007\/BF01840402","article-title":"A new scheme for the deterministic simulation of PRAMs in VLSI","volume":"5","author":"Luccio","year":"1990","journal-title":"Algorithmica"},{"key":"10.1016\/0890-5401(91)90021-S_BIB11_1","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1007\/BF00264615","article-title":"W, Randomized and deterministic simulations of PRAMs by parallel machines with restricted granularity of parallel memories","volume":"21","author":"Mehlhorn","year":"1984","journal-title":"Acta Informat."},{"key":"10.1016\/0890-5401(91)90021-S_BIB11_2","doi-asserted-by":"crossref","unstructured":"Nath, D., Maheshwari, S. N., and Bhatt, P. C. P., Efficient VLSI networks for parallel processing based on orthogonal trees, IEEE Trans. Comput.C-32, 569.","DOI":"10.1109\/TC.1983.1676279"},{"key":"10.1016\/0890-5401(91)90021-S_BIB12","series-title":"Proceedings of the 1977 International Conference on Parallel Procesisng","first-page":"202","article-title":"Parallelism in sorting","author":"Preparata","year":"1977"},{"key":"10.1016\/0890-5401(91)90021-S_BIB13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1145\/62044.62050","article-title":"Efficient dispersal of information for security, load balancing, and fault tolerance","volume":"36","author":"Rabin","year":"1989","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/0890-5401(91)90021-S_BIB14","series-title":"Proceedings of the 28th Annual Symposium on the Foundations of Computer Science","first-page":"185","article-title":"How to emulate shared memory","author":"Ranade","year":"1987"},{"key":"10.1016\/0890-5401(91)90021-S_BIB15","article-title":"How to share memory in a distributed system using a small extra space","author":"Schuster","year":"1987"},{"key":"10.1016\/0890-5401(91)90021-S_BIB16","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1145\/320071.320076","article-title":"A majority consensus approach to concurrency control for multiple copy databases","author":"Thomas","year":"1979","journal-title":"ACM Trans. Database Systems"},{"key":"10.1016\/0890-5401(91)90021-S_BIB17","series-title":"Proceedings of the 16th Annual ACM Symposium on the Theory of Computing","first-page":"258","article-title":"A probabilistic relation between desirable and feasible models of parallel computation","author":"Upfal","year":"1984"},{"key":"10.1016\/0890-5401(91)90021-S_BIB18","doi-asserted-by":"crossref","first-page":"116","DOI":"10.1145\/7531.7926","article-title":"How to share memory in a distributed system","volume":"34","author":"Upfal","year":"1987","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190021S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:089054019190021S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,1]],"date-time":"2019-02-01T18:25:22Z","timestamp":1549045522000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/089054019190021S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,5]]},"references-count":19,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,5]]}},"alternative-id":["089054019190021S"],"URL":"https:\/\/doi.org\/10.1016\/0890-5401(91)90021-s","relation":{},"ISSN":["0890-5401"],"issn-type":[{"value":"0890-5401","type":"print"}],"subject":[],"published":{"date-parts":[[1991,5]]}}}