{"id":"https://openalex.org/W2144372283","doi":"https://doi.org/10.1145/2612669.2612670","title":"On computing maximal independent sets of hypergraphs in parallel","display_name":"On computing maximal independent sets of hypergraphs in parallel","publication_year":2014,"publication_date":"2014-06-21","ids":{"openalex":"https://openalex.org/W2144372283","doi":"https://doi.org/10.1145/2612669.2612670","mag":"2144372283"},"language":"en","primary_location":{"id":"doi:10.1145/2612669.2612670","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","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/A5016433369","display_name":"Ioana O. Bercea","orcid":"https://orcid.org/0000-0001-8430-2441"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Ioana O. Bercea","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5029531416","display_name":"Navin Goyal","orcid":"https://orcid.org/0000-0002-8521-0108"},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]},{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN","US"],"is_corresponding":false,"raw_author_name":"Navin Goyal","raw_affiliation_strings":["Microsoft Research India, Bangalore, India","Microsoft Research india, Bangalore, India#TAB#"],"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]},{"raw_affiliation_string":"Microsoft Research india, Bangalore, India#TAB#","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101783327","display_name":"David G. Harris","orcid":"https://orcid.org/0000-0002-3021-3555"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"David G. Harris","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005118312","display_name":"Aravind Srinivasan","orcid":"https://orcid.org/0000-0002-0062-3684"},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Aravind Srinivasan","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD, USA","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016433369"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":0.3561,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.65068659,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"42","last_page":"50"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9998999834060669,"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":0.9998999834060669,"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.9998000264167786,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/hypergraph","display_name":"Hypergraph","score":0.9069058895111084},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7074190974235535},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6713963150978088},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.6573103070259094},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6436985731124878},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6267436742782593},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.49608859419822693},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.4639347195625305},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.46104687452316284},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.4528034031391144},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.31492292881011963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.24628561735153198}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9069058895111084},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7074190974235535},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6713963150978088},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.6573103070259094},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6436985731124878},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6267436742782593},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.49608859419822693},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.4639347195625305},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.46104687452316284},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4528034031391144},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.31492292881011963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.24628561735153198},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2612669.2612670","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2612669.2612670","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1743911534","display_name":null,"funder_award_id":"CNS-1010789","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"}],"funders":[{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1584086289","https://openalex.org/W1873349594","https://openalex.org/W1976287818","https://openalex.org/W2005390858","https://openalex.org/W2010583864","https://openalex.org/W2068871408","https://openalex.org/W2077204415","https://openalex.org/W2079278135","https://openalex.org/W2095163132","https://openalex.org/W2132750992","https://openalex.org/W6723629830"],"related_works":["https://openalex.org/W2005615533","https://openalex.org/W2743938404","https://openalex.org/W2099271296","https://openalex.org/W2055625272","https://openalex.org/W1838063489","https://openalex.org/W2036758175","https://openalex.org/W1577155814","https://openalex.org/W1545170796","https://openalex.org/W2038796709","https://openalex.org/W1972433940"],"abstract_inverted_index":{"Whether":[0],"or":[1],"not":[2],"the":[3,19,23,29,37,52,58,61,75,132,135,139],"problem":[4,53],"of":[5,18,25,32,60,134],"finding":[6],"maximal":[7],"independent":[8],"sets":[9],"(MIS)in":[10],"hypergraphs":[11,68,106,144],"is":[12,16,42,49,54,124],"in":[13,22,34,55,81,98],"R":[14],"NC":[15],"one":[17],"fundamental":[20],"problems":[21],"theory":[24],"parallel":[26],"computing.":[27],"Unlike":[28],"well-understood":[30],"case":[31],"MIS":[33],"graphs,":[35],"for":[36,141],"hypergraph":[38,62,136],"problem,":[39],"our":[40],"knowledge":[41],"quite":[43],"limited":[44],"despite":[45],"considerable":[46],"work.":[47],"It":[48],"known":[50,78],"that":[51,96,130],"RNC":[56],"when":[57],"edges":[59],"have":[63],"constant":[64,142],"size.":[65],"For":[66],"general":[67,105],"with":[69,84,101],"n":[70,114],"vertices":[71],"and":[72,115,137],"m":[73],"edges,":[74],"fastest":[76],"previously":[77],"algorithm":[79,95,123,140],"works":[80,97],"time":[82,99],"O(\u221a\u203en)":[83],"poly(m,n)":[85,102],"processors.":[86],"In":[87],"this":[88],"paper":[89],"we":[90],"give":[91],"an":[92],"EREW":[93],"PRAM":[94],"no(1)":[100],"processors":[103],"on":[104,126],"satisfying":[107],"m<nlog(2)n\u20448(log(3)n)2,":[108],"where":[109],"log(2)n":[110],"=":[111,117],"log":[112,113,118,119,120],"log(3)n":[116],"n.":[121],"Our":[122],"based":[125],"a":[127,146],"sampling":[128],"idea":[129],"reduces":[131],"dimension":[133,143],"employs":[138],"as":[145],"subroutine.":[147]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}