{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T12:06:45Z","timestamp":1763467605458,"version":"3.30.2"},"reference-count":33,"publisher":"IEEE Computer. Soc","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1109\/sfcs.2003.1238192","type":"proceedings-article","created":{"date-parts":[[2004,3,2]],"date-time":"2004-03-02T02:26:50Z","timestamp":1078194410000},"page":"179-188","source":"Crossref","is-referenced-by-count":17,"title":["Always Good Turing: asymptotically optimal probability estimation"],"prefix":"10.1109","author":[{"given":"A.","family":"Orlitsky","sequence":"first","affiliation":[]},{"given":"N.P.","family":"Santhanam","sequence":"additional","affiliation":[]},{"given":"J.","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/18.87000"},{"key":"ref32","first-page":"91","author":"wilf","year":"1990","journal-title":"Generatingfunctionology"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1556"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/312624.312698"},{"key":"ref10","doi-asserted-by":"crossref","DOI":"10.1163\/9789004653566_015","article-title":"What is wrong with adding one?","author":"gale","year":"1994","journal-title":"Corpus Based Research into Language"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/BF00136984"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.2307\/2333344"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1080\/00949650008812016"},{"key":"ref14","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1112\/plms\/s2-17.1.75","article-title":"Asymptotic formulae in combinatory analysis","volume":"17","author":"hardy","year":"1918","journal-title":"Proceedings of London Mathematics Society"},{"key":"ref15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1515\/crll.1956.196.67","article-title":"A generalization of Stirling's formula","volume":"196","author":"hayman","year":"1956","journal-title":"Journal fur die reine und angewandte Mathematik"},{"journal-title":"Alan Turing The Enigma","year":"2000","author":"hodges","key":"ref16"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2002.1023592"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1981.1056331"},{"journal-title":"Philosophical Essay on Probabilities","year":"1995","author":"laplace","key":"ref19"},{"key":"ref28","first-page":"559","article-title":"Coding of discrete sources with unknown statistics","author":"shtarkov","year":"1977","journal-title":"Topics in Information Theory (Coll Math Soc J Boyai no 16)"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/BF01889984"},{"key":"ref27","article-title":"The most likely alphabet","author":"orlitsky","year":"0","journal-title":"preparation"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.3115\/981863.981904"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1111\/j.1467-9965.1991.tb00002.x"},{"key":"ref29","first-page":"3","article-title":"Universal sequential coding of single messages","volume":"23","author":"shtarkov","year":"1987","journal-title":"Problems of Information Transmission"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(94)90153-8"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1973.1055092"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/18.556596"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/307400.307407"},{"key":"ref9","article-title":"Good Turing smoothing without tears","author":"gale","year":"1994","journal-title":"Technical Report"},{"key":"ref1","article-title":"Multialphabet coding with separate alphabet description","author":"\u00e5berg","year":"1997","journal-title":"Proceedings of Compression and Complexity of Sequences"},{"key":"ref20","article-title":"The weighted majority algorithm","author":"littlestone","year":"1992","journal-title":"IEEE Symposium on Foundations of Computer Science"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/18.720534"},{"key":"ref21","article-title":"On the convergence rate of Good Turing estimators","author":"mcallester","year":"2000","journal-title":"Proceedings of the Thirteenth Annual Conference on Computational Learning Theory"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1080\/01966324.1991.10737313"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1985.1164728"},{"key":"ref26","article-title":"Universal compression of memory less sources over unknown alphabets","author":"orlitsky","year":"0","journal-title":"IEEE Transactions on Information Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/DCC.2003.1194031"}],"event":{"name":"44th Annual IEEE Symposium on Foundations of Computer Science - FOCS 2003","acronym":"SFCS-03","location":"Cambridge, MA, USA"},"container-title":["44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings."],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/8767\/27770\/01238192.pdf?arnumber=1238192","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,15]],"date-time":"2024-12-15T13:23:03Z","timestamp":1734268983000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1238192\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"references-count":33,"URL":"https:\/\/doi.org\/10.1109\/sfcs.2003.1238192","relation":{},"subject":[]}}