{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:02:57Z","timestamp":1725663777542},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540571551"},{"type":"electronic","value":"9783540479185"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-57155-8_271","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T07:06:27Z","timestamp":1330239987000},"page":"464-470","source":"Crossref","is-referenced-by-count":0,"title":["A time-randomness tradeoff for selection in parallel"],"prefix":"10.1007","author":[{"given":"Danny","family":"Krizanc","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,9]]},"reference":[{"key":"43_CR1","doi-asserted-by":"crossref","unstructured":"H. J. Karloff and P. Raghavan, Randomized Algorithms and Pseudorandom Numbers, Proc. of 20th ACM Symp. on Theory of Computing, 1988, pp. 310\u2013321.","DOI":"10.1145\/62212.62242"},{"key":"43_CR2","doi-asserted-by":"crossref","unstructured":"D. Krizanc, D. Peleg and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, Proc. of 20th ACM Symp. on Theory of Computing, 1988, pp. 93\u2013102.","DOI":"10.1145\/62212.62221"},{"key":"43_CR3","unstructured":"N. Meggido, Parallel Algorithms for Finding the Maximum and the Median Almost Surely in Constant-time, Carnegie-Mellon University, Oct. 1982."},{"key":"43_CR4","doi-asserted-by":"crossref","unstructured":"K. Mulmuley, Randomized Geometric Algorithms and Pseudo-Random Generators, Proc. of 33rd Symp. on Foundations of Computer Science, 1992, pp. 90\u2013100.","DOI":"10.1109\/SFCS.1992.267815"},{"key":"43_CR5","first-page":"396","volume":"20","author":"D. Peleg","year":"1989","unstructured":"D. Peleg and E. Upfal, A Time-Randomness Tradeoff for Oblivious Routing, SIAM J. of Computing 20, (1989), pp. 396\u2013409.","journal-title":"SIAM J. of Computing"},{"key":"43_CR6","doi-asserted-by":"crossref","first-page":"1032","DOI":"10.1137\/0216066","volume":"16","author":"N. Pippenger","year":"1987","unstructured":"N. Pippenger, Sorting and Selecting in Rounds, SIAM J. of Computing 16, (1987), pp. 1032\u20131038.","journal-title":"SIAM J. of Computing"},{"key":"43_CR7","first-page":"21","volume-title":"Algorithms and Complexity, Recent Results and New Directions","author":"M. O. Rabin","year":"1976","unstructured":"M. O. Rabin, Probabilistic Algorithms, in Algorithms and Complexity, Recent Results and New Directions, (J. F. Traub, Ed.), Academic Press, New York, (1976), pp. 21\u201340."},{"key":"43_CR8","unstructured":"A. G. Ranade, Constrained Randomization for Parallel Communication, Yale Univeristy Technical Report TR-511, 1987."},{"key":"43_CR9","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1137\/0214030","volume":"14","author":"R. Reischuk","year":"1985","unstructured":"R. Reischuk, Probabilistic Parallel Algorithms for Sorting and Selection, SIAM J. of Computing 14, (1985), pp. 396\u2013409.","journal-title":"SIAM J. of Computing"},{"key":"43_CR10","unstructured":"J. Schmidt, A. Seigel and A. Srinivasan, Chernoff-Hoeffding Bounds for Applications with Limited Independence, Proc. of 4th Symp. on Discrete Algorithms, 1993, pp. 331\u2013340."},{"key":"43_CR11","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1137\/0204030","volume":"4","author":"L. G. Valiant","year":"1975","unstructured":"L. G. Valiant, Parallelism in Comparison Problems, SIAM J. of Computing 4, (1975), pp. 348\u2013355.","journal-title":"SIAM J. of Computing"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-57155-8_271.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:58:42Z","timestamp":1619557122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-57155-8_271"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540571551","9783540479185"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-57155-8_271","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}