{"id":"https://openalex.org/W2618062049","doi":"https://doi.org/10.1145/3087801.3087821","title":"On the Multiparty Communication Complexity of Testing Triangle-Freeness","display_name":"On the Multiparty Communication Complexity of Testing Triangle-Freeness","publication_year":2017,"publication_date":"2017-07-20","ids":{"openalex":"https://openalex.org/W2618062049","doi":"https://doi.org/10.1145/3087801.3087821","mag":"2618062049"},"language":"en","primary_location":{"id":"doi:10.1145/3087801.3087821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5023036907","display_name":"Orr Fischer","orcid":"https://orcid.org/0009-0007-4197-015X"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Orr Fischer","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5080880741","display_name":"Shay Gershtein","orcid":"https://orcid.org/0009-0008-6339-8358"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Gershtein","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5083335403","display_name":"Rotem Oshman","orcid":"https://orcid.org/0009-0007-5065-5557"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Rotem Oshman","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5023036907"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.3627,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.82512406,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"75","issue":null,"first_page":"111","last_page":"120"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9994999766349792,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6971946954727173},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5359557271003723},{"id":"https://openalex.org/keywords/property","display_name":"Property (philosophy)","score":0.520188570022583},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5020625591278076},{"id":"https://openalex.org/keywords/ask-price","display_name":"Ask price","score":0.47344040870666504},{"id":"https://openalex.org/keywords/property-testing","display_name":"Property testing","score":0.47130903601646423},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.41472938656806946},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.18697014451026917}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6971946954727173},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5359557271003723},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.520188570022583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5020625591278076},{"id":"https://openalex.org/C90329073","wikidata":"https://www.wikidata.org/wiki/Q914232","display_name":"Ask price","level":2,"score":0.47344040870666504},{"id":"https://openalex.org/C123842658","wikidata":"https://www.wikidata.org/wiki/Q2918980","display_name":"Property testing","level":2,"score":0.47130903601646423},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.41472938656806946},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.18697014451026917},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C136264566","wikidata":"https://www.wikidata.org/wiki/Q159810","display_name":"Economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3087801.3087821","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3087801.3087821","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM Symposium on Principles of Distributed Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W135467536","https://openalex.org/W199049232","https://openalex.org/W1498019842","https://openalex.org/W1606712848","https://openalex.org/W1611546574","https://openalex.org/W1845051857","https://openalex.org/W1970630090","https://openalex.org/W1988559754","https://openalex.org/W2003425214","https://openalex.org/W2012797687","https://openalex.org/W2025809519","https://openalex.org/W2056168287","https://openalex.org/W2085382249","https://openalex.org/W2088263428","https://openalex.org/W2090798615","https://openalex.org/W2107008873","https://openalex.org/W2107805020","https://openalex.org/W2139374679","https://openalex.org/W2153185098","https://openalex.org/W2155938367","https://openalex.org/W2161620758","https://openalex.org/W2164542539","https://openalex.org/W2253610808","https://openalex.org/W2279901945","https://openalex.org/W2366922697","https://openalex.org/W2511108295","https://openalex.org/W2568847787","https://openalex.org/W2739466586","https://openalex.org/W2900140513","https://openalex.org/W2950813619","https://openalex.org/W2951485559","https://openalex.org/W2952343177","https://openalex.org/W2963422939","https://openalex.org/W3008660429","https://openalex.org/W3103185047","https://openalex.org/W4237171398","https://openalex.org/W4241342151","https://openalex.org/W4251034921","https://openalex.org/W6608163828"],"related_works":["https://openalex.org/W267063485","https://openalex.org/W2073966617","https://openalex.org/W2551865055","https://openalex.org/W2963363569","https://openalex.org/W2108852611","https://openalex.org/W1972927969","https://openalex.org/W2338630033","https://openalex.org/W1566995037","https://openalex.org/W2404881703","https://openalex.org/W2358066991"],"abstract_inverted_index":{"In":[0,56],"this":[1,57],"paper":[2],"we":[3,26,59],"initiate":[4],"the":[5,22,40,46,49,68,76,82,85,93],"study":[6],"of":[7,75],"property":[8],"testing":[9,16],"in":[10,18],"multi-party":[11],"communication":[12],"complexity,":[13],"focusing":[14],"on":[15],"triangle-freeness":[17],"graphs.":[19],"We":[20],"consider":[21],"coordinator":[23,35,41,86],"model,":[24,58],"where":[25],"have":[27],"k":[28],"players":[29,50,83],"receiving":[30,73],"private":[31],"inputs,":[32],"and":[33,84],"a":[34],"who":[36],"receives":[37],"no":[38],"input;":[39],"can":[42],"communicate":[43,52],"with":[44,53,70],"all":[45],"players,":[47,69],"but":[48],"cannot":[51],"each":[54,71],"other.":[55],"ask:":[60],"if":[61,92],"an":[62],"input":[63],"graph":[64,94],"is":[65,95],"divided":[66],"between":[67],"player":[72],"some":[74],"edges,":[77],"how":[78],"many":[79],"bits":[80],"do":[81],"need":[87],"to":[88,90],"exchange":[89],"determine":[91],"triangle-free,":[96],"or":[97],"far":[98],"from":[99],"triangle-free?":[100]},"counts_by_year":[{"year":2020,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}