{"id":"https://openalex.org/W2485865435","doi":"https://doi.org/10.1145/2938436","title":"On Computing Maximal Independent Sets of Hypergraphs in Parallel","display_name":"On Computing Maximal Independent Sets of Hypergraphs in Parallel","publication_year":2016,"publication_date":"2016-06-28","ids":{"openalex":"https://openalex.org/W2485865435","doi":"https://doi.org/10.1145/2938436","mag":"2485865435"},"language":"en","primary_location":{"id":"doi:10.1145/2938436","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2938436","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-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":false,"raw_author_name":"Ioana O. Bercea","raw_affiliation_strings":["University of Maryland, College Park, MD, USA"],"raw_orcid":null,"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/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"],"is_corresponding":false,"raw_author_name":"Navin Goyal","raw_affiliation_strings":["Microsoft Research India, Bangalore"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research India, Bangalore","institution_ids":["https://openalex.org/I4210124949"]}]},{"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"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Maryland, College Park, MD","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"],"raw_orcid":null,"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":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.7024,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.75055032,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"3","issue":"1","first_page":"1","last_page":"13"},"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.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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9995999932289124,"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.8895179629325867},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6236791014671326},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.5991081595420837},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5986183285713196},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5792595744132996},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5620450377464294},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5607838034629822},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.5496734380722046},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.545732855796814},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.49771812558174133},{"id":"https://openalex.org/keywords/parallel-algorithm","display_name":"Parallel algorithm","score":0.45260515809059143},{"id":"https://openalex.org/keywords/deterministic-algorithm","display_name":"Deterministic algorithm","score":0.44343918561935425},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4267008900642395},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2660735845565796},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.25575804710388184}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8895179629325867},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6236791014671326},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.5991081595420837},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5986183285713196},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5792595744132996},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5620450377464294},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5607838034629822},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5496734380722046},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.545732855796814},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.49771812558174133},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.45260515809059143},{"id":"https://openalex.org/C13533509","wikidata":"https://www.wikidata.org/wiki/Q1064349","display_name":"Deterministic algorithm","level":2,"score":0.44343918561935425},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4267008900642395},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2660735845565796},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.25575804710388184},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"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/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2938436","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2938436","pdf_url":null,"source":{"id":"https://openalex.org/S2483380313","display_name":"ACM Transactions on Parallel Computing","issn_l":"2329-4949","issn":["2329-4949","2329-4957"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Parallel Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":9,"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/W2077204415","https://openalex.org/W2079278135","https://openalex.org/W2095163132","https://openalex.org/W2952469246"],"related_works":["https://openalex.org/W2174440985","https://openalex.org/W2112526268","https://openalex.org/W1964089073","https://openalex.org/W2011643166","https://openalex.org/W4243213822","https://openalex.org/W2279830512","https://openalex.org/W2119226317","https://openalex.org/W2036758175","https://openalex.org/W1972433940","https://openalex.org/W16541537"],"abstract_inverted_index":{"Whether":[0],"or":[1],"not":[2],"the":[3,19,23,29,38,46,52,55,58,66,81,87,90,104,192,218,221,225],"problem":[4,82],"of":[5,18,25,40,54,61,89,194,205,220],"finding":[6],"maximal":[7],"independent":[8],"sets":[9],"(MIS)":[10],"in":[11,14,22,36,51,63,84,110,133,174,198],"hypergraphs":[12,97,149,230],"is":[13,16,31,43,49,71,78,83,196],"(R)NC":[15],"one":[17],"fundamental":[20],"problems":[21],"theory":[24],"parallel":[26],"computing.":[27],"Essentially,":[28],"challenge":[30],"to":[32],"design":[33],"(randomized)":[34],"algorithms":[35,209],"which":[37],"number":[39,193],"processors":[41,146,195],"used":[42],"polynomial":[44,197],"and":[45,101,223],"(expected)":[47],"runtime":[48],"polylogarithmic":[50],"size":[53],"input.":[56],"Unlike":[57],"well-understood":[59],"case":[60],"MIS":[62],"graphs,":[64],"for":[65,187,201,227],"hypergraph":[67,91,222],"problem,":[68],"our":[69],"knowledge":[70],"quite":[72],"limited":[73],"despite":[74],"considerable":[75],"work.":[76],"It":[77],"known":[79,107],"that":[80,131,172,216],"RNC":[85],"when":[86],"edges":[88],"have":[92],"constant":[93,228],"size.":[94],"For":[95],"general":[96,148],"with":[98,116,138,181],"n":[99,114,135,141,144,153,158,162,176,184,200],"vertices":[100],"m":[102,151,182],"edges,":[103,186],"fastest":[105],"previously":[106],"algorithm":[108,130,171,226],"works":[109,132],"time":[111,134,175],"O":[112,139],"(\u221a":[113],")":[115,119,145],"poly(":[117],"m,n":[118],"processors.":[120],"In":[121],"this":[122],"article,":[123],"we":[124],"give":[125,166],"an":[126,167],"EREW":[127,168],"PRAM":[128,169],"randomized":[129],"o":[136,154],"(1)":[137,155],"(":[140],"+":[142],"mlog":[143],"on":[147,178,212],"satisfying":[150],"\u2264":[152,183],"log":[156,157,160,161],"/log":[159],".":[163],"We":[164],"also":[165],"deterministic":[170],"runs":[173],"\u03f5":[177],"a":[179,202,213,232],"graph":[180],"1/\u03b4":[185],"any":[188],"constants":[189],"\u03b4,":[190,206],"\u03f5;":[191],"m,":[199],"fixed":[203],"choice":[204],"\u03f5.":[207],"Our":[208],"are":[210],"based":[211],"sampling":[214],"idea":[215],"reduces":[217],"dimension":[219,229],"employs":[224],"as":[231],"subroutine.":[233]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":2}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}