{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:51:43Z","timestamp":1725565903852},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540228493"},{"type":"electronic","value":"9783540278368"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-27836-8_12","type":"book-chapter","created":{"date-parts":[[2010,9,15]],"date-time":"2010-09-15T22:53:21Z","timestamp":1284591201000},"page":"110-121","source":"Crossref","is-referenced-by-count":8,"title":["Learning a Hidden Subgraph"],"prefix":"10.1007","author":[{"given":"Noga","family":"Alon","sequence":"first","affiliation":[]},{"given":"Vera","family":"Asodi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"Alon, N., Beigel, R., Kasif, S., Rudich, S., Sudakov, B.: Learning a Hidden Matching. In: Proceedings of the 43rd IEEE FOCS 2002, pp. 197\u2013206 (2002)","DOI":"10.1109\/SFCS.2002.1181943"},{"key":"12_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471722154","volume-title":"The Probabilistic Method","author":"N. Alon","year":"2000","unstructured":"Alon, N., Spencer, J.H.: The Probabilistic Method, 2nd edn. Wiley, New York (2000)","edition":"2"},{"key":"12_CR3","volume-title":"Random Graphs","author":"B. Bollob\u00e1s","year":"1985","unstructured":"Bollob\u00e1s, B.: Random Graphs. Academic Press, London (1985)"},{"issue":"3","key":"12_CR4","first-page":"158","volume":"18","author":"G. Dyachkov","year":"1982","unstructured":"Dyachkov, G., Rykov, V.V.: Bounds on the Length of Disjunctive Codes. Problemy Peredachi Informatsii\u00a018(3), 158\u2013166 (1982)","journal-title":"Problemy Peredachi Informatsii"},{"key":"12_CR5","doi-asserted-by":"crossref","unstructured":"Grebinski, V., Kucherov, G.: Optimal Query Bounds for Reconstructing a Hamiltonian Cycle in Complete Graphs. In: Proc. 5th Israeli Symposium on Theoretical Computer Science, pp. 166\u2013173 (1997)","DOI":"10.1109\/ISTCS.1997.595169"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1016\/S0166-218X(98)00070-5","volume":"88","author":"V. Grebinski","year":"1998","unstructured":"Grebinski, V., Kucherov, G.: Reconstructing a Hamiltonian Cycle by Querying the Graph: Application to DNA Physical Mapping. Discrete Applied Math.\u00a088, 147\u2013165 (1998)","journal-title":"Discrete Applied Math."},{"issue":"1","key":"12_CR7","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1007\/s004530010033","volume":"28","author":"V. Grebinski","year":"2000","unstructured":"Grebinski, V., Kucherov, G.: Optimal Reconstruction of Graphs under the Additive Model. Algorithmica\u00a028(1), 104\u2013124 (2000)","journal-title":"Algorithmica"},{"issue":"2","key":"12_CR8","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/0097-3165(94)90067-1","volume":"66","author":"M. Ruszink\u00f3","year":"1994","unstructured":"Ruszink\u00f3, M.: On the Upper Bound of the size of the r-cover-free families. Journal of Combinatorial Theory Series A\u00a066(2), 302\u2013310 (1994)","journal-title":"Journal of Combinatorial Theory Series A"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-27836-8_12.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:30:52Z","timestamp":1620012652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-27836-8_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540228493","9783540278368"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-27836-8_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}