{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T00:36:16Z","timestamp":1649205376958},"reference-count":11,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T00:00:00Z","timestamp":1444780800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2016,10]]},"DOI":"10.1007\/s00224-015-9661-1","type":"journal-article","created":{"date-parts":[[2015,10,14]],"date-time":"2015-10-14T02:58:08Z","timestamp":1444791488000},"page":"517-531","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Distinguishing Two Probability Ensembles with One Sample from each Ensemble"],"prefix":"10.1007","volume":"59","author":[{"given":"Lu\u00eds","family":"Antunes","sequence":"first","affiliation":[]},{"given":"Harry","family":"Buhrman","sequence":"additional","affiliation":[]},{"given":"Armando","family":"Matos","sequence":"additional","affiliation":[]},{"given":"Andr\u00e9","family":"Souto","sequence":"additional","affiliation":[]},{"given":"Andreia","family":"Teixeira","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,10,14]]},"reference":[{"issue":"3","key":"9661_CR1","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1007\/BF01955678","volume":"16","author":"A Ambainis","year":"1996","unstructured":"Ambainis, A.: Communication complexity in a 3-computer model. Algorithmica 16(3), 298\u2013301 (1996)","journal-title":"Algorithmica"},{"key":"9661_CR2","unstructured":"Babai, L., Kimmel, P.: Randomized simultaneous messages. In: Proceedings 12Th IEEE Symposium on Computational Complexity, pp. 239\u2013246. IEEE (1996)"},{"key":"9661_CR3","unstructured":"Feller, W.: An Introduction to Probability Theory and Its Applications, vol. 1. Wiley (1968). http:\/\/www.amazon.ca\/exec\/obidos\/redirect?tag=citeulike04-20&path=ASIN\/0471257087"},{"key":"9661_CR4","first-page":"215","volume":"191","author":"O Goldreich","year":"1998","unstructured":"Goldreich, O., Meyer, B.: Computational indistinguishability: Algorithms vs. circuits. Theor. Comput. Sci. 191, 215\u2013218 (1998). doi: 10.1016\/S0304-3975(97)00162-X http:\/\/portal.acm.org\/citation.cfm?id=278633.278647","journal-title":"Theor. Comput. Sci."},{"key":"9661_CR5","doi-asserted-by":"publisher","unstructured":"Goldreich, O., Sudan, M.: Computational indistinguishability: a sample hierarchy. J. Comput. System Sci. 59(2), 253\u2013269 (1999). doi: 10.1006\/jcss.1999.1652","DOI":"10.1006\/jcss.1999.1652"},{"key":"9661_CR6","doi-asserted-by":"crossref","unstructured":"Kushilevitz, E., Nisan, N.: Communication Complexity. Cambridge University Press (1997)","DOI":"10.1016\/S0065-2458(08)60342-3"},{"key":"9661_CR7","unstructured":"Macwilliams, F., Sloane N.: The Theory of Error-Correcting Codes (1978)"},{"key":"9661_CR8","doi-asserted-by":"publisher","unstructured":"Maurer, U., Tessaro, S.: A hardcore lemma for computational indistinguishability: Security amplification for arbitrarily weak prgs with optimal stretch. In: Micciancio, D. (ed.) Theory of Cryptography, Lecture Notes in Computer Science, vol. 5978, pp. 237\u2013254. Springer, Berlin Heidelberg (2010). doi: 10.1007\/978-3-642-11799-2-15","DOI":"10.1007\/978-3-642-11799-2-15"},{"key":"9661_CR9","doi-asserted-by":"crossref","unstructured":"Newman, I., Szegedy, M.: Public vs. private coin flips in one round communication games (extended abstract). In: Proceedings 28Th ACM Symposium on the Theory of Computing, pp 561\u2013570. ACM Press (1996)","DOI":"10.1145\/237814.238004"},{"key":"9661_CR10","doi-asserted-by":"crossref","unstructured":"Sipser, M.: Introduction to the Theory of Computation, 1st edn. International Thomson Publishing (1996)","DOI":"10.1145\/230514.571645"},{"key":"9661_CR11","doi-asserted-by":"publisher","unstructured":"Yao, A.: Some complexity questions related to distributive computing(preliminary report). In: Proceedings of the 11th annual ACM symposium on Theory of computing, STOC \u201979, pp. 209\u2013213. ACM, New York (1979). doi: 10.1145\/800135.804414","DOI":"10.1145\/800135.804414"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9661-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00224-015-9661-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-015-9661-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,31]],"date-time":"2019-08-31T10:47:16Z","timestamp":1567248436000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00224-015-9661-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,10,14]]},"references-count":11,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,10]]}},"alternative-id":["9661"],"URL":"https:\/\/doi.org\/10.1007\/s00224-015-9661-1","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"value":"1432-4350","type":"print"},{"value":"1433-0490","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,10,14]]}}}