{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,30]],"date-time":"2022-03-30T22:36:21Z","timestamp":1648679781494},"reference-count":6,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1995,8,1]],"date-time":"1995-08-01T00:00:00Z","timestamp":807235200000},"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":6560,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[1995,8]]},"DOI":"10.1016\/0166-218x(94)00015-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:53:20Z","timestamp":1027612400000},"page":"187-194","source":"Crossref","is-referenced-by-count":3,"title":["Bounds on the size of merging networks"],"prefix":"10.1016","volume":"61","author":[{"given":"Martin","family":"Aigner","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Otfried","family":"Schwarzkopf","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(94)00015-6_BIB1","first-page":"307","article-title":"Sorting networks and their applications","volume":"Vol. 32","author":"Batcher","year":"1968"},{"key":"10.1016\/0166-218X(94)00015-6_BIB2","series-title":"Proceedings 1987 International Conference on Parallel Processing","article-title":"On the size of test sets for sorting and related problems","author":"Chung","year":"1987"},{"key":"10.1016\/0166-218X(94)00015-6_BIB3","series-title":"Complexity of Computer Computations","first-page":"105","article-title":"Permuting information in idealized two-level storage","author":"Floyd","year":"1972"},{"key":"10.1016\/0166-218X(94)00015-6_BIB4","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0166-218X(94)00015-6_BIB5","doi-asserted-by":"crossref","unstructured":"P.B. Miltersen, M. Paterson and J. Tarui, The asymptotic complexity of merging networks, in: FOCS'92, to appear.","DOI":"10.1109\/SFCS.1992.267768"},{"key":"10.1016\/0166-218X(94)00015-6_BIB6","doi-asserted-by":"crossref","first-page":"566","DOI":"10.1145\/321958.321976","article-title":"Lower bounds on merging networks","volume":"23","author":"Yao","year":"1976","journal-title":"J. ACM"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94000156?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X94000156?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,26]],"date-time":"2019-04-26T17:56:57Z","timestamp":1556301417000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X94000156"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,8]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1995,8]]}},"alternative-id":["0166218X94000156"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(94)00015-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1995,8]]}}}