{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,22]],"date-time":"2025-03-22T04:19:14Z","timestamp":1742617154177,"version":"3.40.2"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540565031"},{"type":"electronic","value":"9783540475743"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1993]]},"DOI":"10.1007\/3-540-56503-5_65","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T11:16:53Z","timestamp":1330255013000},"page":"662-671","source":"Crossref","is-referenced-by-count":16,"title":["The bit probe complexity measure revisited"],"prefix":"10.1007","author":[{"given":"Peter Bro","family":"Miltersen","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,27]]},"reference":[{"key":"65_CR1","doi-asserted-by":"crossref","unstructured":"L. Adleman, Two theorems on random polynomial time, 19th Symp. Found. of Comp. Sci. (1978), 75\u201383.","DOI":"10.1109\/SFCS.1978.37"},{"key":"65_CR2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/BF02126797","volume":"8","author":"M. Ajtai","year":"1988","unstructured":"M. Ajtai, A lower bound for finding predecessors in Yao's cell probe model, Combinatorica 8 (1988) 235\u2013247.","journal-title":"Combinatorica"},{"key":"65_CR3","doi-asserted-by":"crossref","unstructured":"L. Babai, P. Frankl, J. Simon, Complexity classes in communication complexity theory, Proc. 27th IEEE FOCS (1986) 337\u2013347.","DOI":"10.1109\/SFCS.1986.15"},{"key":"65_CR4","doi-asserted-by":"crossref","first-page":"493","DOI":"10.1214\/aoms\/1177729330","volume":"23","author":"H. Chernoff","year":"1952","unstructured":"H. Chernoff, A measure of asymptotic efficiency for tests based on the sum of observations, Ann. Math. Statist. 23 (1952), 493\u2013509.","journal-title":"Ann. Math. Statist."},{"key":"65_CR5","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1145\/321892.321899","volume":"22","author":"P. Elias","year":"1975","unstructured":"P. Elias, R.A. Flower, The complexity of some simple retrieval problems, J. Ass. Comp. Mach. 22 (1975), 367\u2013379.","journal-title":"J. Ass. Comp. Mach."},{"key":"65_CR6","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1016\/0020-0190(90)90214-I","volume":"33","author":"T. Hagerup","year":"1990","unstructured":"T. Hagerup, C. R\u00fcb, A guided tour of Chernoff bounds, Inform. Proces. Lett. 33 (1990), 305\u2013308.","journal-title":"Inform. Proces. Lett."},{"key":"65_CR7","volume-title":"Paths, Flows, and VLSI Layout","author":"L. Lov\u00e1sz","year":"1990","unstructured":"L. Lov\u00e1sz, Communication complexity: A survey, in \u201cPaths, Flows, and VLSI Layout\u201d, edited by B.H. Korte, Springer Verlag, Berlin New York (1990)."},{"key":"65_CR8","doi-asserted-by":"crossref","unstructured":"K. Mehlhorn, E.M. Schmidt, Las Vegas is better than determinism in VLSI and distributed computing, Proc. 14th ACM STOC (1982) 330\u2013337.","DOI":"10.1145\/800070.802208"},{"key":"65_CR9","doi-asserted-by":"crossref","unstructured":"A.R. Meyer, L. Stockmeyer, The equivalence problem for regular expressions with squaring requires exponential space, IEEE 13th Annual Symposium on Switching and Automata Theory (1972), 125\u2013129.","DOI":"10.1109\/SWAT.1972.29"},{"key":"65_CR10","unstructured":"P.B. Miltersen, On-line reevaluation of functions, Aarhus University Tech. Report DAIMI PB-380."},{"key":"65_CR11","unstructured":"S. Sairam, J.S. Vitter, R. Tamassia, A complexity theoretic approach to incremental computation, these proceedings."},{"key":"65_CR12","doi-asserted-by":"crossref","unstructured":"A. C.-C. Yao, Some complexity questions related to distributive computing, Proc. 11th ACM STOC (1979) 209\u2013213.","DOI":"10.1145\/800135.804414"},{"key":"65_CR13","doi-asserted-by":"crossref","first-page":"615","DOI":"10.1145\/322261.322274","volume":"28","author":"A. C.-C-C. Yao","year":"1981","unstructured":"A. C.-C. Yao, Should tables be sorted?, JACM 28 (1981), 615\u2013628.","journal-title":"JACM"}],"container-title":["Lecture Notes in Computer Science","STACS 93"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-56503-5_65.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,21]],"date-time":"2025-03-21T21:49:38Z","timestamp":1742593778000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-56503-5_65"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993]]},"ISBN":["9783540565031","9783540475743"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-56503-5_65","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1993]]}}}