{"id":"https://openalex.org/W6928938508","doi":"https://doi.org/10.3929/ethz-b-000593470","title":"Exploring the Edge of the Online World: Hashing, Zero Memory, Reservation","display_name":"Exploring the Edge of the Online World: Hashing, Zero Memory, Reservation","publication_year":2022,"publication_date":"2022-01-01","ids":{"openalex":"https://openalex.org/W6928938508","doi":"https://doi.org/10.3929/ethz-b-000593470"},"language":"en","primary_location":{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/593470","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/593470","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},"type":"other","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/20.500.11850/593470","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Wehner, David","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Wehner, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/hash-function","display_name":"Hash function","score":0.7638999819755554},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.5322999954223633},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5098999738693237},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4253000020980835},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3995000123977661},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.3774000108242035},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.3720000088214874},{"id":"https://openalex.org/keywords/hash-table","display_name":"Hash table","score":0.36640000343322754}],"concepts":[{"id":"https://openalex.org/C99138194","wikidata":"https://www.wikidata.org/wiki/Q183427","display_name":"Hash function","level":2,"score":0.7638999819755554},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.6402999758720398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5986999869346619},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.5322999954223633},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5098999738693237},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4253000020980835},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.3774000108242035},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.3720000088214874},{"id":"https://openalex.org/C67388219","wikidata":"https://www.wikidata.org/wiki/Q207440","display_name":"Hash table","level":3,"score":0.36640000343322754},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3578000068664551},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3458000123500824},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3456000089645386},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.33489999175071716},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.33379998803138733},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3303000032901764},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.32670000195503235},{"id":"https://openalex.org/C2777632111","wikidata":"https://www.wikidata.org/wiki/Q1937518","display_name":"Reservation","level":2,"score":0.3188000023365021},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.29600000381469727},{"id":"https://openalex.org/C23123220","wikidata":"https://www.wikidata.org/wiki/Q816826","display_name":"Information retrieval","level":1,"score":0.29249998927116394},{"id":"https://openalex.org/C2778165684","wikidata":"https://www.wikidata.org/wiki/Q6576792","display_name":"Online community","level":2,"score":0.2768000066280365},{"id":"https://openalex.org/C2779955035","wikidata":"https://www.wikidata.org/wiki/Q4686785","display_name":"Advice (programming)","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.26409998536109924},{"id":"https://openalex.org/C45235069","wikidata":"https://www.wikidata.org/wiki/Q278425","display_name":"Table (database)","level":2,"score":0.2596000134944916},{"id":"https://openalex.org/C74270461","wikidata":"https://www.wikidata.org/wiki/Q1625299","display_name":"Locality-sensitive hashing","level":4,"score":0.25760000944137573},{"id":"https://openalex.org/C40687702","wikidata":"https://www.wikidata.org/wiki/Q11515519","display_name":"Vertex cover","level":3,"score":0.25360000133514404},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2522999942302704}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/593470","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/593470","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},{"id":"doi:10.3929/ethz-b-000593470","is_oa":true,"landing_page_url":"https://doi.org/10.3929/ethz-b-000593470","pdf_url":null,"source":{"id":"https://openalex.org/S7407051236","display_name":"ETH Z\u00fcrich Research Collection","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":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Other"}],"best_oa_location":{"id":"pmh:oai:www.research-collection.ethz.ch:20.500.11850/593470","is_oa":true,"landing_page_url":"http://hdl.handle.net/20.500.11850/593470","pdf_url":null,"source":{"id":"https://openalex.org/S4306402302","display_name":"Repository for Publications and Research Data (ETH Zurich)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I35440088","host_organization_name":"ETH Zurich","host_organization_lineage":["https://openalex.org/I35440088"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"info:eu-repo/semantics/doctoralThesis"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0,171,396,570],"thesis":[1],"studies":[2],"three":[3],"topics":[4],"in":[5,120,151,306,343],"online":[6,18,34,43,55,68,76,184,228,465,574,599],"computing.":[7],"In":[8,27,45,78,239],"the":[9,28,33,46,64,67,97,179,205,224,258,269,273,294,300,303,319,387,390,431,463,485,494,501,508,516,519,546,554,565,567,573,576,583,587,597],"first":[10],"topic,":[11,30,48],"we":[12,31,49,62,71,80,88,200,231,437,461,608,619],"regard":[13,72],"a":[14,37,51,82,125,144,174,195,213,219,233,250,253,288,315,393,418,528,562],"problem":[15,38,467,584],"as":[16,74,90],"being":[17,41],"that":[19,53,115,154,215,332,439,451,626],"is":[20,99,117,130,143,156,212,247,263,389,442,498,561,585,596],"usually":[21],"only":[22,256,352,397,453],"considered":[23],"to":[24,40,100,103,176,193,203,222,264,272,326,355,403,489,499,526,628,633],"be":[25,356,425],"offline.":[26],"second":[29],"tighten":[32],"restriction":[35],"of":[36,66,139,166,183,208,227,252,268,302,321,380,392,473,504,531,550,564],"close":[39,621],"an":[42,75,92,242,307,400,415,447],"problem.":[44,77,238,601],"third":[47],"consider":[50],"model":[52,571],"connects":[54],"and":[56,96,255,276,297,324,339,349,358,368,383,407,456,575,604,612,623],"offline":[57,577,588],"problems.":[58,229],"Thus,":[59],"figuratively":[60],"speaking,":[61],"explore":[63,327,404],"edge":[65,285],"world.":[69],"First,":[70],"hashing":[73],"hashing,":[79],"have":[81,433],"large":[83,603],"universe":[84],"U,":[85],"from":[86],"which":[87,284],"receive":[89],"input":[91,471,517],"unknown":[93],"subset":[94],"S":[95,102,116,136,167],"goal":[98,262,497],"map":[101],"our":[104,240],"hash":[105,126,145,197],"table":[106],"T,":[107],"whose":[108],"m":[109],"elements":[110,165],"are":[111,168,191,201,337,347,354,366,376],"called":[112],"cells":[113],"such":[114,153],"well":[118],"dispersed":[119],"T.":[121],"We":[122,317,330,413],"study":[123,232],"c-ideality:":[124],"function":[127,146,198],"family":[128],"H":[129,152],"c-ideal":[131,196],"if,":[132],"for":[133,341,417,482,591,630],"every":[134,266],"set":[135],"\u2286":[137],"U":[138,148],"size":[140,381,503,510,549],"n,":[141],"there":[142,155],"h:":[147],"\u2192":[149],"T":[150],"no":[157],"cell":[158],"where":[159,386,421,556],"more":[160],"than":[161],"c":[162],"\u00b7":[163],"n/m":[164],"mapped":[169],"to.":[170],"notion":[172],"creates":[173],"link":[175],"competitive":[177],"analysis,":[178],"classical":[180],"performance":[181],"analysis":[182],"algorithms.":[185],"By":[186],"studying":[187],"how":[188],"many":[189,540],"functions":[190],"necessary":[192,323,338,348,367],"constitute":[194],"family,":[199],"able":[202],"measure":[204,223],"advice":[206],"complexity":[207,211,226],"hashing.":[209],"Advice":[210],"tool":[214],"was":[216],"invented":[217],"over":[218],"decade":[220],"ago":[221],"information":[225],"Second,":[230],"very":[234,443],"restrictive":[235],"graph":[236,254,411,419,423],"exploration":[237,342],"model,":[241],"agent":[243,279,291,311],"without":[244],"persistent":[245],"memory":[246],"placed":[248],"on":[249,378],"vertex":[251,267,296],"sees":[257],"adjacent":[259],"vertices.":[260],"The":[261,278,290,310,496,535],"visit":[265],"graph,":[270],"return":[271],"start":[274],"vertex,":[275],"terminate.":[277],"does":[280],"not":[281,313,408],"know":[282],"through":[283],"it":[286,595],"entered":[287],"vertex.":[289,316],"may":[292,312,511,521,537],"color":[293],"current":[295],"can":[298,424],"see":[299],"colors":[301,322,336,346,365,375,455],"neighboring":[304],"vertices":[305,441],"arbitrary":[308],"order.":[309],"recolor":[314],"investigate":[318],"number":[320],"sufficient":[325,340,350,377],"all":[328,405,458],"graphs.":[329,459],"prove":[331,438,620],"n":[333,362,372,382],"\u2212":[334,360,363,370,373],"1":[335,629],"general,":[344],"3":[345],"if":[351,399],"trees":[353],"explored,":[357],"min{2k":[359,369],"3,":[361],"1}":[364,374],"1,":[371,594],"graphs":[379,406,432],"circumference":[384,388],"k,":[385],"length":[391],"longest":[394],"cycle.":[395],"holds":[398],"algorithm":[401,448,486,520,536],"has":[402,488],"merely":[409],"certain":[410],"classes.":[412],"give":[414],"example":[416],"class":[420],"each":[422,483],"explored":[426],"with":[427,449,468],"4":[428],"colors,":[429],"although":[430],"maximal":[434,547],"circumference.":[435],"Moreover,":[436],"recoloring":[440,450],"powerful":[444],"by":[445],"designing":[446],"uses":[452],"7":[454],"explores":[457],"Third,":[460],"analyze":[462],"simple":[464],"knapsack":[466,589,600],"reservation.":[469],"Here,":[470],"items":[472,525,552],"sizes":[474],"s1,":[475],"s2,":[476],".":[477,478,479],"arrive":[480],"and,":[481],"item,":[484],"either":[487],"pack,":[490],"discard,":[491],"or":[492],"reserve":[493,538],"item.":[495],"maximize":[500],"total":[502,533,548],"packed":[505],"items,":[506,541],"but":[507,542],"packing":[509,530],"never":[512],"exceed":[513],"1.":[514],"When":[515],"ends,":[518],"still":[522],"use":[523],"reserved":[524,551],"achieve":[527],"better":[529],"higher":[532],"size.":[534],"arbitrarily":[539],"pays":[543],"\u03b1":[544,557,580,592,631],"times":[545],"at":[553],"end,":[555],"\u2208":[558],"[0,":[559],"1]":[560],"parameter":[563],"problem,":[566],"reservation":[568,606,617],"factor.":[569],"bridges":[572],"world:":[578],"For":[579,602,615],"=":[581,593],"0,":[582],"essentially":[586],"problem;":[590],"normal":[598],"medium-sized":[605],"factors,":[607,618],"provide":[609],"tight":[610],"upper":[611,622],"lower":[613,624],"bounds.":[614],"small":[616],"bounds":[625],"tend":[627],"tending":[632],"zero.":[634]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2025-10-10T00:00:00"}