{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:09:22Z","timestamp":1725548962429},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540249986"},{"type":"electronic","value":"9783540318569"}],"license":[{"start":{"date-parts":[[2005,1,1]],"date-time":"2005-01-01T00:00:00Z","timestamp":1104537600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/978-3-540-31856-9_34","type":"book-chapter","created":{"date-parts":[[2010,3,2]],"date-time":"2010-03-02T13:06:19Z","timestamp":1267535179000},"page":"412-421","source":"Crossref","is-referenced-by-count":7,"title":["Increasing Kolmogorov Complexity"],"prefix":"10.1007","author":[{"given":"Harry","family":"Buhrman","sequence":"first","affiliation":[]},{"given":"Lance","family":"Fortnow","sequence":"additional","affiliation":[]},{"given":"Ilan","family":"Newman","sequence":"additional","affiliation":[]},{"given":"Nikolai","family":"Vereshchagin","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF00535682","volume":"34","author":"Ahlswede","year":"1976","unstructured":"Ahlswede, G\u00e1cs, K\u00f6rner: Bounds on conditional probabilities with applications in multi-user communication. Z. Wahrscheinlichkeitstheorie verw. Gebiete\u00a034, 157\u2013177 (1976)","journal-title":"Z. Wahrscheinlichkeitstheorie verw. Gebiete"},{"key":"34_CR2","unstructured":"Allender, Buhrman, Kouck\u00fd, van Melkbeek, Ronneberger: Power from Random Strings. In: 43rd IEEE Symposium on the Foundations of Computer Science, pp. 669\u2013678 (2002)"},{"key":"34_CR3","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1016\/S0021-9800(66)80059-5","volume":"1","author":"L.H. Harper","year":"1966","unstructured":"Harper, L.H.: Optimal numberings and isoperimetric problems on graphs. J. Combinatorial Theory\u00a01, 385\u2013393 (1966)","journal-title":"J. Combinatorial Theory"},{"key":"34_CR4","first-page":"131","volume":"10","author":"G.O.H. Katona","year":"1975","unstructured":"Katona, G.O.H.: The Hamming-sphere has minimum boundary. Studia Scientarium Mathematicarum Hungarica\u00a010, 131\u2013140 (1975)","journal-title":"Studia Scientarium Mathematicarum Hungarica"},{"key":"34_CR5","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An introduction to Kolmogorov complexity and its applications","author":"M. Li","year":"1997","unstructured":"Li, M., Vit\u00e1nyi, P.M.B.: An introduction to Kolmogorov complexity and its applications. Springer, New York (1997)"},{"key":"34_CR6","first-page":"325","volume":"9","author":"G.A. Margulis","year":"1975","unstructured":"Margulis, G.A.: Explicit constructions of concentrators. Probab. Info. Trans.\u00a09, 325\u2013332 (1975); Translated into English from Problemy peredachi informatsii 9(2), 71\u201380 (1973)","journal-title":"Probab. Info. Trans."},{"volume-title":"Handbook of Discrete Combinatorial Mathematics","year":"2000","key":"34_CR7","unstructured":"Rosen (ed.): Handbook of Discrete Combinatorial Mathematics. CRC Press, Boca Raton (2000)"}],"container-title":["Lecture Notes in Computer Science","STACS 2005"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-31856-9_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T13:30:34Z","timestamp":1558272634000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-31856-9_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540249986","9783540318569"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-31856-9_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}