{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:07:58Z","timestamp":1750306078246,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,25]],"date-time":"2017-07-25T00:00:00Z","timestamp":1500940800000},"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":[[2017,7,25]]},"DOI":"10.1145\/3087801.3087821","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"111-120","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["On the Multiparty Communication Complexity of Testing Triangle-Freeness"],"prefix":"10.1145","author":[{"given":"Orr","family":"Fischer","sequence":"first","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shay","family":"Gershtein","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rotem","family":"Oshman","sequence":"additional","affiliation":[{"name":"Tel Aviv University, Tel Aviv, Israel"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,25]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10056"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930070001"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109589"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780644"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897646"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-011-0132-x"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2013.77"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897582"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_4"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2767386.2767414"},{"key":"e_1_3_2_1_11_1","unstructured":"Thomas M. Cover and Joy A. Thomas. 2006. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing).  Thomas M. Cover and Joy A. Thomas. 2006. Elements of Information Theory (Wiley Series in Telecommunications and Signal Processing)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_14"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2611462.2611493"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.44"},{"key":"e_1_3_2_1_15_1","first-page":"97","article-title":"The Art of Uninformed Decisions","volume":"75","author":"Fischer Eldar","year":"2001","journal-title":"Bulletin of the EATCS"},{"key":"e_1_3_2_1_16_1","unstructured":"Orr Fischer Shay Gershtein and Rotem Oshman. 2017. On The Multiparty Communication Complexity of Testing Triangle-Freeness (Full Version). CoRR abs\/1705.08438 (2017). http:\/\/arxiv.org\/abs\/1705.08438  Orr Fischer Shay Gershtein and Rotem Oshman. 2017. On The Multiparty Communication Complexity of Testing Triangle-Freeness (Full Version). CoRR abs\/1705.08438 (2017). http:\/\/arxiv.org\/abs\/1705.08438"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.4007\/annals.2011.174.1.17"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53426-7_25"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Oded Goldreich. 1998. Combinatorial Property Testing -- a Survey. Randomization Methods in Algorithm Design (1998) 45--60.  Oded Goldreich. 1998. Combinatorial Property Testing -- a Survey. Randomization Methods in Algorithm Design (1998) 45--60.","DOI":"10.1090\/dimacs\/043\/04"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285060"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258627"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10078"},{"key":"e_1_3_2_1_23_1","unstructured":"L. Gugelmann. 2006.bibinfotitleTesting Trinagle-Freeness in General Graphs: Lower Bounds. Bachelor thesis Dept. of Mathematics ETH Zurich. (2006).  L. Gugelmann. 2006.bibinfotitleTesting Trinagle-Freeness in General Graphs: Lower Bounds. Bachelor thesis Dept. of Mathematics ETH Zurich. (2006)."},{"volume-title":"43rd International Colloquium on Automata, Languages, and Programming (ICALP). 18:1--18:16","year":"2016","author":"Huang Zengfeng","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974782.116"},{"key":"e_1_3_2_1_26_1","unstructured":"Iordanis Kerenidis and Ran Raz. 2006. The One-way Communication Complexity of the Boolean Hidden Matching Problem. Electronic Colloquium on Computational Complexity (ECCC) 13 (2006).  Iordanis Kerenidis and Ran Raz. 2006. The One-way Communication Complexity of the Boolean Hidden Matching Problem. Electronic Colloquium on Computational Complexity (ECCC) 13 (2006)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"Fran\u00e7ois Le Gall. 2016. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. 57--70.  Fran\u00e7ois Le Gall. 2016. Further Algebraic Algorithms in the Congested Clique Model and Applications to Graph-Theoretic Problems. 57--70.","DOI":"10.1007\/978-3-662-53426-7_5"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Yi Li Xiaoming Sun Chengu Wang and David P. Woodruff. 2014. On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model. 499--513.  Yi Li Xiaoming Sun Chengu Wang and David P. Woodruff. 2014. On the Communication Complexity of Linear Algebraic Problems in the Message Passing Model. 499--513.","DOI":"10.1007\/978-3-662-45174-8_34"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(91)90157-D"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.42"},{"key":"e_1_3_2_1_31_1","unstructured":"T. Rast. 2006. Testing Trinagle-Freeness in General Graphs: Upper Bounds. Bachelor thesis Dept. of Mathematics ETH Zurich. ( 2006).  T. Rast. 2006. Testing Trinagle-Freeness in General Graphs: Upper Bounds. Bachelor thesis Dept. of Mathematics ETH Zurich. ( 2006)."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1561\/0400000029"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973082.2"}],"event":{"name":"PODC '17: ACM Symposium on Principles of Distributed Computing","sponsor":["SIGOPS ACM Special Interest Group on Operating Systems","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Washington DC USA","acronym":"PODC '17"},"container-title":["Proceedings of the ACM Symposium on Principles of Distributed Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087821","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087801.3087821","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:07Z","timestamp":1750217407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087801.3087821"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,25]]},"references-count":33,"alternative-id":["10.1145\/3087801.3087821","10.1145\/3087801"],"URL":"https:\/\/doi.org\/10.1145\/3087801.3087821","relation":{},"subject":[],"published":{"date-parts":[[2017,7,25]]},"assertion":[{"value":"2017-07-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}