{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,12]],"date-time":"2026-02-12T12:49:00Z","timestamp":1770900540807,"version":"3.50.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2017,7,27]],"date-time":"2017-07-27T00:00:00Z","timestamp":1501113600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000038","name":"NSERC","doi-asserted-by":"crossref","id":[{"id":"10.13039\/501100000038","id-type":"DOI","asserted-by":"crossref"}]},{"name":"DFG","award":["3501\/1 and 3501\/2"],"award-info":[{"award-number":["3501\/1 and 3501\/2"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Comput. Surv."],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"<jats:p>\n            Many proofs in discrete mathematics and theoretical computer science are based on the probabilistic method. To prove the existence of a good object, we pick a random object and show that it is bad with low probability. This method is effective, but the underlying probabilistic machinery can be daunting. \u201cEncoding arguments\u201d provide an alternative presentation in which probabilistic reasoning is encapsulated in a \u201cuniform encoding lemma.\u201d This lemma provides an upper bound on the probability of an event using the fact that a uniformly random choice from a set of size\n            <jats:italic>n<\/jats:italic>\n            cannot be encoded with fewer than log\n            <jats:sub>2<\/jats:sub>\n            <jats:italic>n<\/jats:italic>\n            bits on average. With the lemma, the argument reduces to devising an encoding where bad objects have short codewords.\n          <\/jats:p>\n          <jats:p>In this expository article, we describe the basic method and provide a simple tutorial on how to use it. After that, we survey many applications to classic problems from discrete mathematics and computer science. We also give a generalization for the case of non-uniform distributions, as well as a rigorous justification for the use of non-integer codeword lengths in encoding arguments. These latter two results allow encoding arguments to be applied more widely and to produce tighter results.<\/jats:p>","DOI":"10.1145\/3084288","type":"journal-article","created":{"date-parts":[[2017,7,28]],"date-time":"2017-07-28T12:19:47Z","timestamp":1501244387000},"page":"1-36","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Encoding Arguments"],"prefix":"10.1145","volume":"50","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0471-4118","authenticated-orcid":false,"given":"Pat","family":"Morin","sequence":"first","affiliation":[{"name":"Carleton University, Ottawa Canada"}]},{"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[{"name":"Freie Universit\u00e4t Berlin"}]},{"given":"Tommy","family":"Reddad","sequence":"additional","affiliation":[{"name":"McGill University, Montreal, Canada"}]}],"member":"320","published-online":{"date-parts":[[2017,7,27]]},"reference":[{"key":"e_1_2_1_2_1","unstructured":"N. Alon and J. H. Spencer. 2016. The Probabilistic Method (4th ed.). Wiley-Interscience.  N. Alon and J. H. Spencer. 2016. The Probabilistic Method (4th ed.). Wiley-Interscience."},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/0219035"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1137\/S009753970444435X"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00184-X"},{"key":"e_1_2_1_9_1","first-page":"376","article-title":"A theorem on trees","volume":"23","author":"Cayley A.","year":"1889","unstructured":"A. Cayley . 1889 . A theorem on trees . Quart. J. Math. 23 (1889), 376 -- 378 . A. Cayley. 1889. A theorem on trees. Quart. J. Math. 23 (1889), 376--378.","journal-title":"Quart. J. Math."},{"key":"e_1_2_1_10_1","volume-title":"A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 4 (12","author":"Chernoff H.","year":"1952","unstructured":"H. Chernoff . 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 4 (12 1952 ), 493--507. H. Chernoff. 1952. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat. 23, 4 (12 1952), 493--507."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02915448"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403372"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511581274"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1975.1055349"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1947-08785-1"},{"key":"e_1_2_1_16_1","volume-title":"Colloquia Mathematica Societatis J\u00e1nos Bolyai","volume":"10","author":"Erd\u0151s P.","unstructured":"P. Erd\u0151s and L. Lov\u00e1sz . 1973. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, A. Hajnal, R. Rado, and V. T. S\u00f3s (Eds.) . Colloquia Mathematica Societatis J\u00e1nos Bolyai , Vol. 10 . North-Holland, 609--627. P. Erd\u0151s and L. Lov\u00e1sz. 1973. Problems and results on 3-chromatic hypergraphs and some related questions. In Infinite and Finite Sets, A. Hajnal, R. Rado, and V. T. S\u00f3s (Eds.). Colloquia Mathematica Societatis J\u00e1nos Bolyai, Vol. 10. North-Holland, 609--627."},{"key":"e_1_2_1_18_1","volume-title":"Retrieved","author":"Fortnow L.","year":"2009","unstructured":"L. Fortnow . 2009 . A Kolmogorov Complexity Proof of the Lov\u00e1sz Local Lemma . Retrieved November 28, 2015 from http:\/\/blog.computationalcomplexity.org\/2009\/06\/kolmogorov-complexity-proof-of-lov.html. L. Fortnow. 2009. A Kolmogorov Complexity Proof of the Lov\u00e1sz Local Lemma. Retrieved November 28, 2015 from http:\/\/blog.computationalcomplexity.org\/2009\/06\/kolmogorov-complexity-proof-of-lov.html."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-03981-6"},{"key":"e_1_2_1_20_1","unstructured":"T. Haimberger. 2013. Theoretische und Experimentelle Untersuchung von Kuckucks-Hashing. (2013). Bachelor\u2019s thesis. Freie Universit\u00e4t Berlin.  T. Haimberger. 2013. Theoretische und Experimentelle Untersuchung von Kuckucks-Hashing. (2013). Bachelor\u2019s thesis. Freie Universit\u00e4t Berlin."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/366622.366644"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2007.01.007"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107359949.008"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2012.06.005"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511813603"},{"key":"e_1_2_1_27_1","volume-title":"Open Data Structures: An Introduction","author":"Morin P.","unstructured":"P. Morin . 2013. Open Data Structures: An Introduction . Athabasca University Press , Edmonton . P. Morin. 2013. Open Data Structures: An Introduction. Athabasca University Press, Edmonton."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1536414.1536462"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/1667053.1667060"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814075"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jalgor.2003.12.002"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the 7th International Teletraffic Conference","volume":"4","author":"Pinsker M. S.","year":"1973","unstructured":"M. S. Pinsker . 1973 . On the complexity of a concentrator . In Proceedings of the 7th International Teletraffic Conference , Vol. 4 . 1--4. M. S. Pinsker. 1973. On the complexity of a concentrator. In Proceedings of the 7th International Teletraffic Conference, Vol. 4. 1--4."},{"key":"e_1_2_1_33_1","volume-title":"Retrieved","author":"P\u0103tra\u015fcu M.","year":"2010","unstructured":"M. P\u0103tra\u015fcu . 2010 . Cuckoo Hashing . Retrieved April 15, 2015 from http:\/\/infoweekly.blogspot.ca\/2010\/02\/cuckoo-hashing.html. M. P\u0103tra\u015fcu. 2010. Cuckoo Hashing. Retrieved April 15, 2015 from http:\/\/infoweekly.blogspot.ca\/2010\/02\/cuckoo-hashing.html."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/765568.765571"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.2307\/2308012"},{"key":"e_1_2_1_36_1","unstructured":"R. Sedgewick and P. Flajolet. 1996. An Introduction to the Analysis of Algorithms. Addison-Wesley Longman Publishing Co. Inc. Boston MA.  R. Sedgewick and P. Flajolet. 1996. An Introduction to the Analysis of Algorithms. Addison-Wesley Longman Publishing Co. Inc. Boston MA."},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"e_1_2_1_38_1","volume-title":"Entropy, Search, Complexity","author":"Vit\u00e1nyi P.","unstructured":"P. Vit\u00e1nyi . 2007. Analysis of sorting algorithms by kolmogorov complexity (a survey) . In Entropy, Search, Complexity . Bolyai Society Mathematical Studies, Vol . 16. Springer-Verlag New York , NY, 209--232. P. Vit\u00e1nyi. 2007. Analysis of sorting algorithms by kolmogorov complexity (a survey). In Entropy, Search, Complexity. Bolyai Society Mathematical Studies, Vol. 16. Springer-Verlag New York, NY, 209--232."},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/792538.792546"}],"container-title":["ACM Computing Surveys"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3084288","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3084288","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:36Z","timestamp":1750217436000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3084288"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,27]]},"references-count":36,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3084288"],"URL":"https:\/\/doi.org\/10.1145\/3084288","relation":{},"ISSN":["0360-0300","1557-7341"],"issn-type":[{"value":"0360-0300","type":"print"},{"value":"1557-7341","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,7,27]]},"assertion":[{"value":"2016-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}