{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:35:10Z","timestamp":1757540110171},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,12,1]],"date-time":"1984-12-01T00:00:00Z","timestamp":470707200000},"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":10455,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1984,12]]},"DOI":"10.1016\/0022-0000(84)90003-5","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"330-337","source":"Crossref","is-referenced-by-count":54,"title":["Finding Euler tours in parallel"],"prefix":"10.1016","volume":"29","author":[{"given":"Mikhail","family":"Atallah","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Uzi","family":"Vishkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(84)90003-5_BIB1","series-title":"Proc. Seventeenth Annual Conf. on Information Sciences and Systems","first-page":"685","article-title":"Finding Euler tours in parallel","author":"Atallah","year":"1983"},{"key":"10.1016\/0022-0000(84)90003-5_BIB2","series-title":"Proc. Sixteenth ACM Symp. on Theory of Computing","first-page":"249","article-title":"Finding Euler circuits in logarithmic parallel time","author":"Awerbuch","year":"1984"},{"key":"10.1016\/0022-0000(84)90003-5_BIB3","series-title":"Proc. Fifteenth ACM Symp. on Theory of Computing","first-page":"1","article-title":"An O(n log n) sorting network","author":"Ajtai","year":"1983"},{"key":"10.1016\/0022-0000(84)90003-5_BIB4","article-title":"Simultaneous Memory Access","author":"Eckstein","year":"1979"},{"key":"10.1016\/0022-0000(84)90003-5_BIB5","series-title":"Graph Algorithms","author":"Even","year":"1979"},{"key":"10.1016\/0022-0000(84)90003-5_BIB6","series-title":"Proc. Fifteenth ACM Symposium on Theory of Computing","first-page":"10","article-title":"A logarithmic time sort for linear size networks","author":"Reif","year":"1983"},{"key":"10.1016\/0022-0000(84)90003-5_BIB7","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0196-6774(82)90008-6","article-title":"An O(log n) parallel connectivity algorithm","volume":"3","author":"Shiloach","year":"1982","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(84)90003-5_BIB8","article-title":"An Efficient Parallel Biconnectivity Algorithm","author":"Tarjan","year":"1983"},{"key":"10.1016\/0022-0000(84)90003-5_BIB9","doi-asserted-by":"crossref","first-page":"1171","DOI":"10.1109\/TC.1983.1676178","article-title":"The VLSI complexity of sorting","volume":"32","author":"Thompson","year":"1983","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0022-0000(84)90003-5_BIB10","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0196-6774(83)90033-0","article-title":"Implementation of simultaneous memory address access in models that forbit it","volume":"4","author":"Vishkin","year":"1983","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(84)90003-5_BIB11","article-title":"Synchronous Parallel Computation\u2014A Survey","author":"Vishkin","year":"1983"},{"key":"10.1016\/0022-0000(84)90003-5_BIB12","article-title":"The Complexity of Parallel Computation","author":"Wyllie","year":"1979"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900035?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000084900035?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:51:59Z","timestamp":1550325119000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000084900035"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,12]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,12]]}},"alternative-id":["0022000084900035"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(84)90003-5","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1984,12]]}}}