{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T06:03:05Z","timestamp":1775282585837,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2016,7,25]],"date-time":"2016-07-25T00:00:00Z","timestamp":1469404800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100004359","name":"Vetenskapsr\u00e5det","doi-asserted-by":"publisher","award":["VR 2012-4730"],"award-info":[{"award-number":["VR 2012-4730"]}],"id":[{"id":"10.13039\/501100004359","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000781","name":"European Research Council","doi-asserted-by":"publisher","award":["338077"],"award-info":[{"award-number":["338077"]}],"id":[{"id":"10.13039\/501100000781","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2016,7,25]]},"DOI":"10.1145\/2933057.2933101","type":"proceedings-article","created":{"date-parts":[[2016,7,26]],"date-time":"2016-07-26T20:07:42Z","timestamp":1469563662000},"page":"391-400","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["How Proofs are Prepared at Camelot"],"prefix":"10.1145","author":[{"given":"Andreas","family":"Bj\u00f6rklund","sequence":"first","affiliation":[{"name":"Lund University, Lund, Sweden"}]},{"given":"Petteri","family":"Kaski","sequence":"additional","affiliation":[{"name":"Aalto University, Helsinki, Finland"}]}],"member":"320","published-online":{"date-parts":[[2016,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2004.160.781"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0022-0000(88)90028-1"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/070683933"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2011.08.002"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"B\u00fcrgisser P.","year":"1997","unstructured":"P. B\u00fcrgisser , M. Clausen , M. A. Shokrollahi , Algebraic Complexity Theory , Springer , 1997 . P. B\u00fcrgisser, M. Clausen, M. A. Shokrollahi, Algebraic Complexity Theory, Springer, 1997."},{"key":"e_1_3_2_1_6_1","unstructured":"S. Caminiti I. Finocchi E. G. Fusco F. Silvestri Resilient dynamic programming Algorithmica to appear.  S. Caminiti I. Finocchi E. G. Fusco F. Silvestri Resilient dynamic programming Algorithmica to appear."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2840728.2840746"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1137\/110834949"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-17327-1","volume-title":"Fault-Tolerant Search Algorithms","author":"Cicalese F.","year":"2013","unstructured":"F. Cicalese , Fault-Tolerant Search Algorithms , Springer , Heidelberg , 2013 . F. Cicalese, Fault-Tolerant Search Algorithms, Springer, Heidelberg, 2013."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2004.05.009"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.07.026"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499228"},{"key":"e_1_3_2_1_13_1","volume-title":"IFIP Congress (1977)","author":"Freivalds R.","unstructured":"R. Freivalds ,Probabilistic machines can use less running time , IFIP Congress (1977) 839--842. R. Freivalds,Probabilistic machines can use less running time, IFIP Congress (1977) 839--842."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139856065","volume-title":"Modern Computer Algebra","author":"von zur Gathen J.","year":"2013","unstructured":"J. von zur Gathen , J. Gerhard , Modern Computer Algebra , 3 rd ed., Cambridge University Press , 2013 . J. von zur Gathen, J. Gerhard, Modern Computer Algebra, 3rd ed., Cambridge University Press, 2013.","edition":"3"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/978-1-4757-3789-9_5","volume-title":"Communications, Information, and Network Security","author":"Gao S.","year":"2003","unstructured":"S. Gao , A new algorithm for decoding Reed--Solomon codes , in: V. K. Bhargava, H. V. Poor, V. Tarokh, S. Yoon, eds., Communications, Information, and Network Security , Springer , 2003 , pp. 55 -- 68 . S. Gao, A new algorithm for decoding Reed--Solomon codes, in: V. K. Bhargava, H. V. Poor, V. Tarokh, S. Yoon, eds., Communications, Information, and Network Security, Springer, 2003, pp. 55--68."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1993806.1993829"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699436"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/0024-3795(77)90069-6"},{"key":"e_1_3_2_1_19_1","volume-title":"Tensors: Geometry and Applications","author":"Landsberg J. M.","year":"2012","unstructured":"J. M. Landsberg , Tensors: Geometry and Applications , American Mathematical Society , 2012 . J. M. Landsberg, Tensors: Geometry and Applications,American Mathematical Society, 2012."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2608628.2608664"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2010.09.009"},{"key":"e_1_3_2_1_22_1","first-page":"415","volume":"26","author":"Ne\u0161et\u0159il J.","year":"1985","unstructured":"J. Ne\u0161et\u0159il , S. Poljak , On the complexity of the subgraph problem , Comment. Math. Univ. Carolin. 26 ( 1985 ) 415 -- 419 . J. Ne\u0161et\u0159il, S. Poljak, On the complexity of the subgraph problem, Comment. Math. Univ. Carolin. 26 (1985) 415--419.","journal-title":"Comment. Math. Univ. Carolin."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1137\/0108018"},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807666"},{"key":"e_1_3_2_1_25_1","volume-title":"Short non-interactive proofs of batch evaluation,Proc. 31st IEEE Colloquium on Computational Complexity(CCC'16","author":"Williams R.","year":"2016","unstructured":"R. Williams , Strong ETH breaks with Merlin and Arthur : Short non-interactive proofs of batch evaluation,Proc. 31st IEEE Colloquium on Computational Complexity(CCC'16 , Tokyo, May 29-- June 1, 2016 ), to appear. R. Williams,Strong ETH breaks with Merlin and Arthur: Short non-interactive proofs of batch evaluation,Proc. 31st IEEE Colloquium on Computational Complexity(CCC'16, Tokyo, May 29--June 1, 2016), to appear."},{"key":"e_1_3_2_1_26_1","volume-title":"The Design and Analysis of Factorial Experiments","author":"Yates F.","year":"1937","unstructured":"F. Yates , The Design and Analysis of Factorial Experiments , Imperial Bureau of Soil Science , Harpenden , 1937 . F. Yates, The Design and Analysis of Factorial Experiments, Imperial Bureau of Soil Science, Harpenden, 1937."}],"event":{"name":"PODC '16: ACM Symposium on Principles of Distributed Computing","location":"Chicago Illinois USA","acronym":"PODC '16","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933101","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2933057.2933101","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:51Z","timestamp":1750222491000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2933057.2933101"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2016,7,25]]},"references-count":26,"alternative-id":["10.1145\/2933057.2933101","10.1145\/2933057"],"URL":"https:\/\/doi.org\/10.1145\/2933057.2933101","relation":{},"subject":[],"published":{"date-parts":[[2016,7,25]]},"assertion":[{"value":"2016-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}