{"id":"https://openalex.org/W2157316017","doi":"https://doi.org/10.1145/335305.335324","title":"Compression using efficient multicasting","display_name":"Compression using efficient multicasting","alternate_titles":[],"publication_year":2000,"publication_date":"2000-05-01","ids":{"openalex":"https://openalex.org/W2157316017","doi":"https://doi.org/10.1145/335305.335324","mag":"2157316017"},"language":"en","primary_location":{"id":"doi:10.1145/335305.335324","doi":"https://doi.org/10.1145/335305.335324","is_oa":true,"landing_page_url":"https://doi.org/10.1145/335305.335324","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/335305.335324","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2157316017"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://dl.acm.org/doi/pdf/10.1145/335305.335324","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5014172485","display_name":"Micah Adler","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]},{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["CA","US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Micah Adler","raw_affiliation_strings":["University of Toronto and Department of Computer Science, University of Massachusetts, Amherst, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto and Department of Computer Science, University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I185261750","https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113572159","display_name":"Tom Leighton","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Tom Leighton","raw_affiliation_strings":["Dept. of Mathematics and LCS, MIT and Akamai Technologies, 210 Broadway Street, Cambridge, MA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Mathematics and LCS, MIT and Akamai Technologies, 210 Broadway Street, Cambridge, MA","institution_ids":["https://openalex.org/I10734018","https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":1,"citation_normalized_percentile":{"value":0.0,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"153","last_page":"162"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.975600004196167,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.00419999985024333,"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"}},{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.003599999938160181,"subfield":{"id":"https://openalex.org/subfields/2614","display_name":"Theoretical Computer Science"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/data-compression","display_name":"data compression","score":0.656000018119812},{"id":"https://openalex.org/keywords/multicast","display_name":"multicast","score":0.8489999771118164},{"id":"https://openalex.org/keywords/message-passing","display_name":"message passing","score":0.4490000009536743},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.6579999923706055},{"id":"https://openalex.org/keywords/distributed-algorithms","display_name":"distributed algorithms","score":0.8339999914169312},{"id":"https://openalex.org/keywords/fast-fourier-transform","display_name":"fast Fourier transform","score":0.7319999933242798},{"id":"https://openalex.org/keywords/parallel-sorting","display_name":"parallel sorting","score":0.8169999718666077},{"id":"https://openalex.org/keywords/shared-memory-multiprocessors","display_name":"shared-memory multiprocessors","score":0.871999979019165},{"id":"https://openalex.org/keywords/bandwidth-constraints","display_name":"bandwidth constraints","score":0.7110000252723694},{"id":"https://openalex.org/keywords/ramsey-theory","display_name":"Ramsey theory","score":0.8790000081062317},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"communication complexity","score":0.3440000116825104}],"concepts":[{"id":"https://openalex.org/C2778805511","wikidata":"https://www.wikidata.org/wiki/Q1713","display_name":"Citation","level":2,"score":0.7959727048873901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5616534352302551},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.5470954775810242},{"id":"https://openalex.org/C161191863","wikidata":"https://www.wikidata.org/wiki/Q199655","display_name":"Library science","level":1,"score":0.5131431221961975},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.11570259928703308}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/335305.335324","doi":"https://doi.org/10.1145/335305.335324","is_oa":true,"landing_page_url":"https://doi.org/10.1145/335305.335324","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/335305.335324","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/335305.335324","doi":"https://doi.org/10.1145/335305.335324","is_oa":true,"landing_page_url":"https://doi.org/10.1145/335305.335324","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/335305.335324","source":{"id":"https://openalex.org/S7407087723","display_name":"ACM Symposium on Theory of Computing (STOC)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-second annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2157316017.pdf","grobid_xml":"https://content.openalex.org/works/W2157316017.grobid-xml"},"referenced_works_count":30,"referenced_works":["https://openalex.org/W1022649828","https://openalex.org/W1655990431","https://openalex.org/W1964404326","https://openalex.org/W1965877201","https://openalex.org/W1970893109","https://openalex.org/W1981952277","https://openalex.org/W2002509291","https://openalex.org/W2023600080","https://openalex.org/W2025319946","https://openalex.org/W2027637765","https://openalex.org/W2029991649","https://openalex.org/W2030685985","https://openalex.org/W2033838647","https://openalex.org/W2034334221","https://openalex.org/W2037680316","https://openalex.org/W2044935944","https://openalex.org/W2045271686","https://openalex.org/W2045371181","https://openalex.org/W2064757275","https://openalex.org/W2067189483","https://openalex.org/W2079401865","https://openalex.org/W2092158648","https://openalex.org/W2102061396","https://openalex.org/W2108900323","https://openalex.org/W2126552237","https://openalex.org/W2143623993","https://openalex.org/W2156224093","https://openalex.org/W2798428635","https://openalex.org/W4254807835","https://openalex.org/W6750917982"],"related_works":["https://openalex.org/W189711204","https://openalex.org/W83061947","https://openalex.org/W38888122","https://openalex.org/W134102279","https://openalex.org/W7097739597","https://openalex.org/W2127346225","https://openalex.org/W2734687249","https://openalex.org/W2066756771","https://openalex.org/W58806729","https://openalex.org/W7097272185"],"abstract_inverted_index":{"Many":[0],"multiprocessor":[1],"systems":[2],"have":[3],"the":[4,38,69,119],"ability":[5,13],"to":[6,35,108],"broadcast":[7],"and/or":[8],"multicast":[9,107],"information":[10,41],"efficiently.However,":[11],"this":[12,23,114],"is":[14],"often":[15],"overlooked":[16],"when":[17],"designing":[18],"algorithms":[19,52,67],"for":[20,53],"these":[21],"systems.In":[22],"paper,":[24],"we":[25],"introduce":[26],"a":[27,80,102],"new":[28],"compression":[29,77],"technique":[30,78],"that":[31],"uses":[32,79],"efficient":[33,75],"multicasting":[34],"significantly":[36,50],"reduce":[37],"amount":[39],"of":[40,71,74,84,90,113],"communicated":[42],"during":[43],"parallel":[44,62],"and":[45,57],"distributed":[46],"computation,":[47],"resulting":[48],"in":[49],"faster":[51],"Fast":[54],"Fourier":[55],"Transforms":[56],"sorting":[58],"on":[59,97],"shared":[60],"memory":[61],"models":[63],"with":[64],"limited":[65],"bandwidth.These":[66],"demonstrate":[68],"importance":[70],"taking":[72],"advantage":[73],"multicasting.The":[76],"new,":[81],"natural":[82],"variant":[83],"Ramsey":[85],"theory,":[86],"which":[87],"may":[88],"be":[89,106],"independent":[91],"interest.":[92],"gle":[93],"point-to-point":[94],"message":[95],"must":[96],"average":[98],"traverse":[99],"p/2edges,":[100],"but":[101],"data":[103],"item":[104],"can":[105],"any":[109],"subset":[110],"*A":[111],"portion":[112],"research":[115],"was":[116],"performed":[117],"while":[118],"first":[120],"author":[121]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2157316017","counts_by_year":[],"updated_date":"2026-11-14T11:04:58.165337","created_date":"2016-06-24T00:00:00"}
