{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T19:39:32Z","timestamp":1776713972807,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,5,21]],"date-time":"2006-05-21T00:00:00Z","timestamp":1148169600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,5,21]]},"DOI":"10.1145\/1132516.1132556","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"261-270","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":82,"title":["Graph limits and parameter testing"],"prefix":"10.1145","author":[{"given":"Christian","family":"Borgs","sequence":"first","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jennifer","family":"Chayes","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"L\u00e1szl\u00f3","family":"Lov\u00e1sz","sequence":"additional","affiliation":[{"name":"Microsoft Research, Redmond, WA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vera T.","family":"S\u00f3s","sequence":"additional","affiliation":[{"name":"R\u00e9nyi Institute, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bal\u00e1zs","family":"Szegedy","sequence":"additional","affiliation":[{"name":"Institute for Advanced Study, Princeton, NJ"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Katalin","family":"Vesztergombi","sequence":"additional","affiliation":[{"name":"E\u00f6tv\u00f6s Lor\u00e1nd University, Budapest, Hungary"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2006,5,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00008-4"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480199358655"},{"key":"e_1_3_2_1_4_1","unstructured":"N. Alon A. Naor: Approximating the Cut-Norm via Grothendieck's Inequality (preprint).  N. Alon A. Naor: Approximating the Cut-Norm via Grothendieck's Inequality (preprint)."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060590.1060611"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.2005.5"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225140"},{"key":"e_1_3_2_1_8_1","unstructured":"C. Borgs J. Chayes L. Lov\u00e1sz V.T. S\u00f3s K. Vesztergombi: Counting graph homomorphisms (preprint).  C. Borgs J. Chayes L. Lov\u00e1sz V.T. S\u00f3s K. Vesztergombi: Counting graph homomorphisms (preprint)."},{"key":"e_1_3_2_1_9_1","unstructured":"C. Borgs J. Chayes L. Lov\u00e1sz V.T. S\u00f3s K. Vesztergombi: Convergent sequences of dense graphs Parts I and II (manuscripts).  C. Borgs J. Chayes L. Lov\u00e1sz V.T. S\u00f3s K. Vesztergombi: Convergent sequences of dense graphs Parts I and II (manuscripts)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02125347"},{"key":"e_1_3_2_1_11_1","first-page":"97","volume":"75","author":"E.","year":"2001","unstructured":"E. Fischer: The art of uninformed decisions: A primer to property testing , The Computational Complexity Column of the Bulletin of the European Association for Theoretical Computer Science 75 ( 2001 ), 97 -- 126 . E. Fischer: The art of uninformed decisions: A primer to property testing, The Computational Complexity Column of the Bulletin of the European Association for Theoretical Computer Science 75 (2001), 97--126.","journal-title":"The Computational Complexity Column of the Bulletin of the European Association for Theoretical Computer Science"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930050052"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10078"},{"key":"e_1_3_2_1_17_1","unstructured":"L. Lov\u00e1sz and B. Szegedy: Szemer\u00e9di's lemma for the analist http:\/\/research.microsoft.com\/users\/lovasz\/ analyst.pdf  L. Lov\u00e1sz and B. Szegedy: Szemer\u00e9di's lemma for the analist http:\/\/research.microsoft.com\/users\/lovasz\/ analyst.pdf"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793255151"}],"event":{"name":"STOC06: Symposium on Theory of Computing","location":"Seattle WA USA","acronym":"STOC06","sponsor":["ACM Association for Computing Machinery","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"]},"container-title":["Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132556","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1132516.1132556","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T16:18:50Z","timestamp":1750263530000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1132516.1132556"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,5,21]]},"references-count":16,"alternative-id":["10.1145\/1132516.1132556","10.1145\/1132516"],"URL":"https:\/\/doi.org\/10.1145\/1132516.1132556","relation":{},"subject":[],"published":{"date-parts":[[2006,5,21]]},"assertion":[{"value":"2006-05-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}