{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,28]],"date-time":"2026-03-28T06:31:49Z","timestamp":1774679509654,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540001706","type":"print"},{"value":"9783540361695","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36169-3_30","type":"book-chapter","created":{"date-parts":[[2007,8,12]],"date-time":"2007-08-12T00:27:32Z","timestamp":1186878452000},"page":"380-394","source":"Crossref","is-referenced-by-count":9,"title":["How to Achieve Minimax Expected Kullback-Leibler Distance from an Unknown Finite Distribution"],"prefix":"10.1007","author":[{"given":"Dietrich","family":"Braess","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00fcrgen","family":"Forster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tomas","family":"Sauer","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hans U.","family":"Simon","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2002,11,8]]},"reference":[{"key":"30_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1109\/TIT.1972.1054738","volume":"18","author":"T. M. Cover","year":"1971","unstructured":"T. M. Cover. Admissibility properties of Gilbert\u2019s encoding for unknown source probabilities. IEEE Transactions on Information Theory, 18:216\u2013217, 1971.","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR2","unstructured":"J\u00fcrgen Forster and Manfred Warmuth. Relative expected instantaneous loss bounds. Journal of Computer and System Sciences. To appear."},{"key":"30_CR3","unstructured":"J\u00fcrgen Forster and Manfred Warmuth. Relative expected instantaneous loss bounds. In Proceedings of the 13th Annual Conference on Computational Learning Theory, pages 90\u201399. Morgan Kaufmann, 2000."},{"key":"30_CR4","unstructured":"Ronald L. Graham, Donald E. Knuth, and Oren Patashnik. Concrete Mathematics. Addison Wesley, 1989."},{"issue":"10","key":"30_CR5","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"D. A. Huffman","year":"1952","unstructured":"D. A. Huffman. A method for the construction of minimum redundancy codes. Proc.IRE, 40(10):1098\u20131101, 1952.","journal-title":"Proc.IRE"},{"key":"30_CR6","doi-asserted-by":"crossref","unstructured":"Rafail E. Krichevskiy. Universal Compression and Retrieval. Kluwer Academic Publishers, 1994.","DOI":"10.1007\/978-94-017-3628-2"},{"issue":"1","key":"30_CR7","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1109\/18.651051","volume":"44","author":"R. E. Krichevskiy","year":"1998","unstructured":"Rafail E. Krichevskiy. Laplace\u2019s law of succession and universal encoding. IEEE Transactions on Information Theory, 44(1):296\u2013303, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"30_CR8","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1002\/j.1538-7305.1948.tb01338.x","volume":"27","author":"C. E. Shannon","year":"1948","unstructured":"Claude E. Shannon. A mathematical theory of communication. The Bell System Technical Journal, 27:379\u2013423,623-656, 1948.","journal-title":"The Bell System Technical Journal"},{"issue":"2","key":"30_CR9","doi-asserted-by":"publisher","first-page":"646","DOI":"10.1109\/18.556120","volume":"43","author":"Q. Xie","year":"1997","unstructured":"Qun Xie and Andrew R. Barron. Minimax redundancy for the class of memoryless sources. IEEE Transactions on Information Theory, 43(2):646\u2013657, 1997.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"2","key":"30_CR10","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1109\/18.825803","volume":"46","author":"Q. Xie","year":"2000","unstructured":"Qun Xie and Andrew R. Barron. Asymptotic minimax regret for data compression, gambling, and prediction. IEEE Transactions on Information Theory, 46(2):431\u2013445, 2000.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36169-3_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T13:46:12Z","timestamp":1550756772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36169-3_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001706","9783540361695"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-36169-3_30","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2002]]}}}