{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,12]],"date-time":"2022-04-12T18:57:41Z","timestamp":1649789861988},"reference-count":52,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,4,1]],"date-time":"1998-04-01T00:00:00Z","timestamp":891388800000},"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":5586,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1998,4]]},"DOI":"10.1016\/s0304-3975(97)00199-0","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"153-180","source":"Crossref","is-referenced-by-count":8,"title":["ERCW PRAMs and optical communication"],"prefix":"10.1016","volume":"196","author":[{"given":"Philip D.","family":"MacKenzie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vijaya","family":"Ramachandran","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(97)00199-0_BIB1","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1145\/235809.235812","article-title":"Efficient routing in optical networks","volume":"43","author":"Aggarwal","year":"1996","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB2","series-title":"Combinatorics of Finite Sets","author":"Anderson","year":"1987"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB3","article-title":"Optical communication for pointer based algorithms","author":"Anderson","year":"1988"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB4","series-title":"Graphs","author":"Berge","year":"1985"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB5","first-page":"1797","article-title":"Optics and supercomputing","volume":"77","author":"Berra","year":"1989"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB6","series-title":"European Symp. on Algorithms","first-page":"369","article-title":"Self-simulation for the passive optical star model","volume":"vol. 979","author":"Berthom\u00e9","year":"1995"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB7","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1090\/dimacs\/021\/03","article-title":"On broadcasting schemes in restricted optical passive star systems","volume":"vol. 21","author":"Berthom\u00e9","year":"1995","journal-title":"DIMACS Series in Discrete Mathematics and Computer Science"},{"issue":"1","key":"10.1016\/S0304-3975(97)00199-0_BIB8","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0890-5401(91)90031-V","article-title":"Improved deterministic parallel integer sorting","volume":"94","author":"Bhatt","year":"1991","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB9","series-title":"Proc. 21st Symp. on Theory of Comput.","first-page":"320","article-title":"Optimal separations between concurrent-write parallel machines","author":"Boppana","year":"1989"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB10","series-title":"Algorithms and Complexity","first-page":"757","article-title":"The complexity of finite functions","volume":"vol. A","author":"Boppana","year":"1990"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB11","series-title":"Proc. 23th Symp. on Found. of Comp. Sci.","first-page":"1","article-title":"A complexity theory for unbounded fan-in parallelism","author":"Chandra","year":"1982"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB12","series-title":"Separating the power of CRCW PRAMs","author":"Chaudhuri","year":"1993"},{"issue":"2","key":"10.1016\/S0304-3975(97)00199-0_BIB13","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0020-0190(88)90092-0","article-title":"A parallel bucket sort","volume":"27","author":"Chlebus","year":"1988","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"10.1016\/S0304-3975(97)00199-0_BIB14","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0020-0190(89)90120-8","article-title":"Parallel iterated bucket sort","volume":"31","author":"Chlebus","year":"1989","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB15","series-title":"Proc. 13th Symp. on Math. Found. of Comp. Sci.","first-page":"231","article-title":"Efficient simulations between CRCW PRAMs","volume":"vol. 324","author":"Chlebus","year":"1988"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB16","series-title":"Proc. 7th Internat. Conf. on Fundamentals of Comp. Theory","first-page":"95","article-title":"New simulations between CRCW PRAMs","volume":"vol. 380","author":"Chlebus","year":"1989"},{"issue":"1","key":"10.1016\/S0304-3975(97)00199-0_BIB17","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1137\/0215006","article-title":"Upper and lower time bounds for parallel random access machines without simultaneous writes","volume":"15","author":"Cook","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB18","series-title":"Proc. ACM Symp. on Para. Alg. Arch.","first-page":"110","article-title":"Simple, efficient shared memory simulations","author":"Dietzfelbinger","year":"1993"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB19","doi-asserted-by":"crossref","first-page":"161","DOI":"10.2307\/1969503","article-title":"A decomposition theorem for partially ordered sets","volume":"51","author":"Dilworth","year":"1950","journal-title":"Ann. Math."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB20","series-title":"Proc. 18th Symp. on Comp. Arch.","first-page":"96","article-title":"High performance interprocessor communication through optical wavelength division multiple access channels","author":"Dowd","year":"1991"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB21","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","article-title":"Intersection theorems for systems of sets","volume":"35","author":"Erd\u00f6s","year":"1960","journal-title":"J. London Math. Soc."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB22","doi-asserted-by":"crossref","first-page":"827","DOI":"10.1109\/12.83620","article-title":"Parallel algorithms for image processing on omc","volume":"40","author":"Eshaghian","year":"1991","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB23","series-title":"Proc. of 10th Symp. Theoret. Aspects of Comput. Sci.","article-title":"Limits on the power of parallel random access machines with weak forms of write conflict resolution","author":"Fich","year":"1993"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB24","series-title":"Proc. 3rd Scand. Workshop on Alg. Theory","first-page":"30","article-title":"Retrieval of scattered information by EREW, CREW, and CRCW PRAMs","volume":"vol. 621","author":"Fich","year":"1992"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB25","series-title":"Proc. 17th Symp. on Theory of Computing","first-page":"48","article-title":"One, two, three \u2026 infinity: Lower bounds for parallel computation","author":"Fich","year":"1985"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB26","doi-asserted-by":"crossref","first-page":"606","DOI":"10.1137\/0217037","article-title":"Relations between concurrent-write models of parallel computation","volume":"17","author":"Fich","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB27","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1137\/0215047","article-title":"Construct O(n log n) size montone formulae for the kth threshold function of n boolean variables","volume":"15","author":"Friedman","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB28","series-title":"Proc. Scandinavian Workshop on Algo. Theory","article-title":"Direct bulk-synchronous parallel algorithms","author":"Gerbessiotis","year":"1992"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB29","series-title":"Proc. ACM Symp. on Para. Alg. and Arch.","first-page":"41","article-title":"Efficient optical communication in parallel computers","author":"Ger\u00e9b-Graus","year":"1992"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB30","series-title":"Proc. ACM-SIAM Symp. on Discrete Algorithms","first-page":"638","article-title":"The Queue-Read Queue-Write PRAM model: Accounting for contention in parallel algorithms","author":"Gibbons","year":"1994"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB31","series-title":"Proc. ACM Symp. on Para. Alg. Arch.","first-page":"300","article-title":"A doubly logarithmic communication algorithm for the completely connected optical communication parallel computer","author":"Goldberg","year":"1993"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB32","series-title":"Proc. ACM Symp. on Parallel Algorithms and Architectures","first-page":"147","article-title":"A lower bound for routing on a completely connected optical communication parallel computer","author":"Goldberg","year":"1994"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB33","first-page":"850","article-title":"Optical interconnections for vlsi systems","volume":"72","author":"Goodman","year":"1984"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB34","series-title":"Proc. 28th Symp. on Found. of Comp. Sci.","first-page":"89","article-title":"Incomparability in parallel computation","author":"Grolmusz","year":"1987"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB35","doi-asserted-by":"crossref","first-page":"1782","DOI":"10.1109\/JLT.1987.1075467","article-title":"Protocols for very high-speed optical fiber local area networks using a passive star topology","author":"Habbab","year":"1987","journal-title":"J. Lightwave Tech. LT-5"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB36","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/0890-5401(87)90062-9","article-title":"Towards optimal parallel bucket sorting","volume":"75","author":"Hagerup","year":"1987","journal-title":"Inform. and Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB37","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"299","article-title":"Constant-time parallel integer sorting","author":"Hagerup","year":"1991"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB38","series-title":"Proc. 2nd ACM Symp. on Para. Alg. and Arch.","first-page":"117","article-title":"Every robust CRCW PRAM can efficiently simulate a Priority PRAM","author":"Hagerup","year":"1990"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB39","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1117\/12.7976958","article-title":"Design sketches for optical crossbar switches intended for large-scale parallel processing applications","volume":"28","author":"Hartmann","year":"1989","journal-title":"Opt. Eng."},{"issue":"1","key":"10.1016\/S0304-3975(97)00199-0_BIB40","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1145\/2422.322412","article-title":"Bounding fan-out in logical networks","volume":"31","author":"Hoover","year":"1984","journal-title":"J. ACM."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB41","series-title":"Algorithms and Complexity","first-page":"869","article-title":"Parallel algorithms for shared-memory machines","volume":"vol. A","author":"Karp","year":"1990"},{"issue":"1","key":"10.1016\/S0304-3975(97)00199-0_BIB42_1","first-page":"83","article-title":"A method for determining lower bounds for the complexity of \u03a0-schemes","volume":"10","author":"Khrapchenko","year":"1971","journal-title":"Mat. Zametki"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB42_2","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1007\/BF01747074","volume":"10","author":"Khrapchenko","year":"1971","journal-title":"Math. Notes"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB43_1","first-page":"803","article-title":"Complexity of contact circuits realizing a function of logical algebra","volume":"151","author":"Krichevskii","year":"1963","journal-title":"Dokl. Akad. Nauk SSSR"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB43_2","first-page":"770","volume":"8","author":"Krichevskii","year":"1964","journal-title":"Sov. Phys. Dokl."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB44","series-title":"Proc. 26th ACM Symp. on Theory of Computing","first-page":"153","article-title":"On contention resolution protocols and associated probabilistic phenomena","author":"MacKenzie","year":"1994"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB45","series-title":"2nd ACM-SIAM Symp. on Disc. Alg.","first-page":"414","article-title":"Ultra-fast expected time parallel algorithms","author":"MacKenzie","year":"1991"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB46","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1145\/321879.321882","article-title":"Bounds to complexities of networks for sorting and for switching","volume":"22","author":"Muller","year":"1975","journal-title":"J. ACM"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB47","doi-asserted-by":"crossref","first-page":"594","DOI":"10.1137\/0218041","article-title":"Optimal and sublogarithmic time randomized parallel sorting algorithms","volume":"18","author":"Rajasekaran","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB48","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/MC.1987.1663591","article-title":"Optical crossbar networks","volume":"20","author":"Sawchuk","year":"1987","journal-title":"IEEE Comput."},{"key":"10.1016\/S0304-3975(97)00199-0_BIB49","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0196-6774(84)90016-6","article-title":"Short monotone formulae for the majority function","volume":"5","author":"Valiant","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(97)00199-0_BIB50","series-title":"Algorithms and Complexity","first-page":"945","article-title":"General purpose parallel architectures","volume":"vol. A","author":"Valiant","year":"1990"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001990?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397597001990?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T21:58:33Z","timestamp":1556315913000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397597001990"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,4]]},"references-count":52,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,4]]}},"alternative-id":["S0304397597001990"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(97)00199-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1998,4]]}}}