{"id":"https://openalex.org/W2798577881","doi":"https://doi.org/10.4230/lipics.mfcs.2018.59","title":"A Subquadratic Algorithm for 3XOR","display_name":"A Subquadratic Algorithm for 3XOR","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2798577881","doi":"https://doi.org/10.4230/lipics.mfcs.2018.59","mag":"2798577881"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:1804.11086","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.11086","pdf_url":"https://arxiv.org/pdf/1804.11086","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1804.11086","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067257613","display_name":"Martin Dietzfelbinger","orcid":"https://orcid.org/0000-0001-5484-3474"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Dietzfelbinger, Martin","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5055179066","display_name":"Philipp Schlag","orcid":null},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Schlag, Philipp","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024860874","display_name":"Stefan Walzer","orcid":"https://orcid.org/0000-0002-6477-0106"},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Walzer, Stefan","raw_affiliation_strings":["Technische Universit\u00e4t Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067257613"],"corresponding_institution_ids":["https://openalex.org/I119449181"],"apc_list":null,"apc_paid":null,"fwci":0.24776592,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.51156414,"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":null,"last_page":null},"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.998199999332428,"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.998199999332428,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9975000023841858,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10237","display_name":"Cryptography and Data Security","score":0.9948999881744385,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/combinatorics","display_name":"Combinatorics","score":0.6483398079872131},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.611319899559021},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5407665967941284},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5084558725357056},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4903004467487335},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4821321964263916},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.4762720763683319},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4645032584667206},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.4629479646682739},{"id":"https://openalex.org/keywords/sorting","display_name":"Sorting","score":0.46027421951293945},{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.4453434348106384},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.41409480571746826},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23705878853797913},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.22635868191719055}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6483398079872131},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.611319899559021},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5407665967941284},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5084558725357056},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4903004467487335},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4821321964263916},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4762720763683319},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4645032584667206},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.4629479646682739},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.46027421951293945},{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.4453434348106384},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.41409480571746826},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23705878853797913},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.22635868191719055},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","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},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:arXiv.org:1804.11086","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.11086","pdf_url":"https://arxiv.org/pdf/1804.11086","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"doi:10.48550/arxiv.1804.11086","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1804.11086","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"},{"id":"doi:10.4230/lipics.mfcs.2018.59","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.mfcs.2018.59","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":""}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1804.11086","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1804.11086","pdf_url":"https://arxiv.org/pdf/1804.11086","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W1546441687","https://openalex.org/W2031683606","https://openalex.org/W2049774319"],"related_works":["https://openalex.org/W2155395173","https://openalex.org/W4377371889","https://openalex.org/W2089134982","https://openalex.org/W4299305030","https://openalex.org/W2040347389","https://openalex.org/W1862126075","https://openalex.org/W2113270940","https://openalex.org/W2521054645","https://openalex.org/W4389820491","https://openalex.org/W2018076478"],"abstract_inverted_index":{"Given":[0],"a":[1,26,43,76,82,110,122,138,146,156],"set":[2,137],"X":[3,23,86,140],"of":[4,8,124,203],"n":[5],"binary":[6,204],"words":[7],"equal":[9],"length":[10,48],"w,":[11],"the":[12,32,125,136,191,262],"3XOR":[13,160,230,252],"problem":[14,37,194,197],"asks":[15],"for":[16,85,117,128,144,159,189,242,272],"three":[17],"elements":[18],"a,":[19],"b,":[20],"c":[21],"in":[22,50,141,147,150,201,206],"such":[24],"that":[25,179,228,251],"oplus":[27,30,139],"b=c,":[28],"where":[29],"denotes":[31],"bitwise":[33],"XOR":[34],"operation.":[35],"The":[36,172,223],"can":[38,65,237,253],"be":[39,66,254],"easily":[40],"solved":[41],"on":[42],"word":[44,47],"RAM":[45],"with":[46,87,95,161,198,247],"w":[49],"time":[51,90,98,115,164,208,234],"O(n^2":[52,69,165],"log":[53,70,71,169],"n).":[54,72],"Using":[55],"Han's":[56],"fast":[57],"integer":[58,199],"sorting":[59],"algorithm":[60,94,116,158,173],"(STOC/J.":[61],"Algorithms,":[62],"2002/2004)":[63],"this":[64],"reduced":[67,255],"to":[68,92,134,176,256],"With":[73],"randomization":[74],"or":[75],"sophisticated":[77],"deterministic":[78],"dictionary":[79],"construction,":[80],"creating":[81],"hash":[83,219],"table":[84],"constant":[88],"lookup":[89],"leads":[91],"an":[93],"(expected)":[96],"running":[97,163,233],"O(n^2).":[99],"At":[100],"present,":[101],"seemingly":[102],"no":[103],"faster":[104],"algorithms":[105],"are":[106,221],"known.":[107],"We":[108,249],"present":[109],"surprisingly":[111],"simple":[112],"deterministic,":[113],"quadratic":[114],"3XOR.":[118],"Its":[119],"core":[120],"is":[121],"version":[123],"PATRICIA":[126],"tree":[127],"X,":[129],"which":[130,269],"makes":[131],"it":[132],"possible":[133],"traverse":[135],"ascending":[142],"order":[143],"arbitrary":[145],"{0,":[148],"1}^{w}":[149],"linear":[151,218],"time.":[152],"Furthermore,":[153],"we":[154],"describe":[155],"randomized":[157],"expected":[162,207,232],"*":[166],"min{log^3(w)/w,":[167],"(log":[168],"n)^2/log^2":[170],"n}).":[171],"transfers":[174],"techniques":[175],"our":[177],"setting":[178],"were":[180,270],"used":[181],"by":[182,212,274],"Baran,":[183],"Demaine,":[184],"and":[185,214,266,277],"Patrascu":[186],"(WADS/Algorithmica,":[187],"2005/2008)":[188],"solving":[190],"related":[192],"int3SUM":[193],"(the":[195],"same":[196],"addition":[200],"place":[202],"XOR)":[205],"o(n^2).":[209],"As":[210],"suggested":[211],"Jafargholi":[213],"Viola":[215],"(Algorithmica,":[216],"2016),":[217],"functions":[220],"employed.":[222],"latter":[224],"authors":[225],"also":[226],"showed":[227],"assuming":[229],"needs":[231],"n^(2-o(1))":[235],"one":[236],"prove":[238],"conditional":[239],"lower":[240],"bounds":[241],"triangle":[243],"enumeration":[244],"just":[245],"as":[246,259],"3SUM.":[248],"demonstrate":[250],"other":[257],"problems":[258],"well,":[260],"treating":[261],"examples":[263],"offline":[264,267],"SetDisjointness":[265],"SetIntersection,":[268],"studied":[271],"3SUM":[273],"Kopelowitz,":[275],"Pettie,":[276],"Porat":[278],"(SODA,":[279],"2016).":[280]},"counts_by_year":[{"year":2020,"cited_by_count":1}],"updated_date":"2026-02-09T09:26:11.010843","created_date":"2025-10-10T00:00:00"}