{"id":"https://openalex.org/W7213486136","doi":null,"title":"Computing under Constraints: Efficient Fault-Tolerant and Memory-Bound Algorithms","display_name":"Computing under Constraints: Efficient Fault-Tolerant and Memory-Bound Algorithms","alternate_titles":[],"publication_year":2026,"publication_date":"2026-08-31","ids":{"openalex":"https://openalex.org/W7213486136"},"language":"en","primary_location":{"id":"pmh:oai:escholarship.org:ark:/13030/qt49m7s1s8","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/49m7s1s8","pdf_url":"https://escholarship.org/content/qt49m7s1s8/qt49m7s1s8.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"etd"},"parent_works":[],"lineage":["https://openalex.org/W7213486136"],"child_works_count":0,"type":"dissertation","is_traditional":true,"indexed_in":[],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://escholarship.org/content/qt49m7s1s8/qt49m7s1s8.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073208702","display_name":"Vinesh Sridhar","orcid":"https://orcid.org/0009-0009-3549-9589","observed_orcids":["https://orcid.org/0009-0009-3549-9589"]},"institutions":[{"id":"https://openalex.org/I204250578","display_name":"University of California, Irvine","ror":"https://ror.org/04gyf1771","country_code":"US","type":"education","lineage":["https://openalex.org/I204250578"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Sridhar, Vinesh","raw_affiliation_strings":["Doctor of Philosophy in Computer Science 2026 University of California , Irvine Irvine , CA","University of California , Irvine Irvine , CA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Doctor of Philosophy in Computer Science 2026 University of California , Irvine Irvine , CA","institution_ids":["https://openalex.org/I204250578"]},{"raw_affiliation_string":"University of California , Irvine Irvine , CA","institution_ids":["https://openalex.org/I204250578"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5073208702"],"corresponding_institution_ids":["https://openalex.org/I204250578"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":true,"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_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6615999937057495,"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.6615999937057495,"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.08640000224113464,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.06210000067949295,"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/fault-tolerant-algorithms","display_name":"fault-tolerant algorithms","score":0.8140000104904175},{"id":"https://openalex.org/keywords/in-place-algorithms","display_name":"in-place algorithms","score":0.8159999847412109},{"id":"https://openalex.org/keywords/sorting-algorithms","display_name":"sorting algorithms","score":0.5950000286102295},{"id":"https://openalex.org/keywords/random-walks","display_name":"random walks","score":0.8560000061988831}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7055000066757202},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.5900999903678894},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5343000292778015},{"id":"https://openalex.org/C120373497","wikidata":"https://www.wikidata.org/wiki/Q1087987","display_name":"Parallel algorithm","level":2,"score":0.4950000047683716},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4733000099658966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45500001311302185},{"id":"https://openalex.org/C538114610","wikidata":"https://www.wikidata.org/wiki/Q24282658","display_name":"Analysis of parallel algorithms","level":3,"score":0.4343999922275543},{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.40459999442100525},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.39800000190734863},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.3725000023841858},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.34700000286102295},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.3253999948501587},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2971000075340271},{"id":"https://openalex.org/C198352243","wikidata":"https://www.wikidata.org/wiki/Q37105","display_name":"Line (geometry)","level":2,"score":0.27570000290870667},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.2694000005722046},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.26829999685287476},{"id":"https://openalex.org/C29123130","wikidata":"https://www.wikidata.org/wiki/Q874709","display_name":"Computational geometry","level":2,"score":0.2671999931335449},{"id":"https://openalex.org/C104065381","wikidata":"https://www.wikidata.org/wiki/Q1002535","display_name":"Geometric modeling","level":2,"score":0.26499998569488525},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2533000111579895}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:escholarship.org:ark:/13030/qt49m7s1s8","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/49m7s1s8","pdf_url":"https://escholarship.org/content/qt49m7s1s8/qt49m7s1s8.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"etd"}],"best_oa_location":{"id":"pmh:oai:escholarship.org:ark:/13030/qt49m7s1s8","doi":null,"is_oa":true,"landing_page_url":"https://escholarship.org/uc/item/49m7s1s8","pdf_url":"https://escholarship.org/content/qt49m7s1s8/qt49m7s1s8.pdf","source":{"id":"https://openalex.org/S4306400115","display_name":"eScholarship (California Digital Library)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I2801248553","host_organization_name":"California Digital Library","host_organization_lineage":["https://openalex.org/I2801248553"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"etd"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7213486136.pdf","grobid_xml":"https://content.openalex.org/works/W7213486136.grobid-xml"},"referenced_works_count":127,"referenced_works":["https://openalex.org/W199261334","https://openalex.org/W200390202","https://openalex.org/W348286531","https://openalex.org/W1002779697","https://openalex.org/W1508354858","https://openalex.org/W1513076288","https://openalex.org/W1539498068","https://openalex.org/W1567218086","https://openalex.org/W1571766602","https://openalex.org/W1587590810","https://openalex.org/W1589972038","https://openalex.org/W1601531080","https://openalex.org/W1627753597","https://openalex.org/W1874694348","https://openalex.org/W1963700323","https://openalex.org/W1966069213","https://openalex.org/W1971550377","https://openalex.org/W1976915153","https://openalex.org/W1978583881","https://openalex.org/W1979201594","https://openalex.org/W1980744864","https://openalex.org/W1981032891","https://openalex.org/W1982051925","https://openalex.org/W1986520777","https://openalex.org/W1991429808","https://openalex.org/W1998115980","https://openalex.org/W2000358470","https://openalex.org/W2002322113","https://openalex.org/W2002370028","https://openalex.org/W2004389974","https://openalex.org/W2008581147","https://openalex.org/W2011024091","https://openalex.org/W2011297770","https://openalex.org/W2012255008","https://openalex.org/W2015792336","https://openalex.org/W2016350196","https://openalex.org/W2016945104","https://openalex.org/W2021615496","https://openalex.org/W2023146810","https://openalex.org/W2025299767","https://openalex.org/W2032985147","https://openalex.org/W2038435918","https://openalex.org/W2039432414","https://openalex.org/W2040295160","https://openalex.org/W2040730660","https://openalex.org/W2041094480","https://openalex.org/W2041097097","https://openalex.org/W2041775009","https://openalex.org/W2042607215","https://openalex.org/W2044712489","https://openalex.org/W2047662881","https://openalex.org/W2049074379","https://openalex.org/W2056821447","https://openalex.org/W2057644858","https://openalex.org/W2057671314","https://openalex.org/W2058432138","https://openalex.org/W2060690113","https://openalex.org/W2067994867","https://openalex.org/W2069817080","https://openalex.org/W2071743136","https://openalex.org/W2074456838","https://openalex.org/W2076458424","https://openalex.org/W2077333890","https://openalex.org/W2077676588","https://openalex.org/W2084300309","https://openalex.org/W2089064856","https://openalex.org/W2090650041","https://openalex.org/W2104923354","https://openalex.org/W2114400222","https://openalex.org/W2120490947","https://openalex.org/W2122538863","https://openalex.org/W2126446668","https://openalex.org/W2126876121","https://openalex.org/W2127235804","https://openalex.org/W2130566259","https://openalex.org/W2130596127","https://openalex.org/W2131306093","https://openalex.org/W2132445073","https://openalex.org/W2142278387","https://openalex.org/W2147996100","https://openalex.org/W2151690061","https://openalex.org/W2168586324","https://openalex.org/W2395495808","https://openalex.org/W2482131081","https://openalex.org/W2567671846","https://openalex.org/W2603442307","https://openalex.org/W2610278296","https://openalex.org/W2783319652","https://openalex.org/W2783939054","https://openalex.org/W2801073231","https://openalex.org/W2889523050","https://openalex.org/W2891219599","https://openalex.org/W2898932275","https://openalex.org/W2899160927","https://openalex.org/W2912254316","https://openalex.org/W2914915498","https://openalex.org/W2928783453","https://openalex.org/W2951137085","https://openalex.org/W2951465128","https://openalex.org/W2964000130","https://openalex.org/W2993963457","https://openalex.org/W3029270599","https://openalex.org/W3041534482","https://openalex.org/W3041758129","https://openalex.org/W3048914833","https://openalex.org/W3088152573","https://openalex.org/W3090302669","https://openalex.org/W3120046605","https://openalex.org/W3121104049","https://openalex.org/W3137429815","https://openalex.org/W3147681132","https://openalex.org/W4210521711","https://openalex.org/W4238964467","https://openalex.org/W4242723385","https://openalex.org/W4288323273","https://openalex.org/W4315779783","https://openalex.org/W4378895317","https://openalex.org/W4388823227","https://openalex.org/W4399566576","https://openalex.org/W4403814287","https://openalex.org/W4405191201","https://openalex.org/W4412217039","https://openalex.org/W6929427678","https://openalex.org/W7024046646","https://openalex.org/W7109946868","https://openalex.org/W7134271324","https://openalex.org/W7164938625"],"related_works":["https://openalex.org/W6967278969","https://openalex.org/W7164938625","https://openalex.org/W3145069317","https://openalex.org/W1509962102","https://openalex.org/W573093302","https://openalex.org/W2020007061","https://openalex.org/W1836678964","https://openalex.org/W1965214876","https://openalex.org/W7096887181","https://openalex.org/W2063123129"],"abstract_inverted_index":{"Theoretical":[0],"analysis":[1],"of":[2,8,123,142,145,160],"algorithms":[3,103,172,187],"relies":[4],"on":[5],"idealized":[6],"models":[7,26,122],"computers.":[9],"This":[10,32,67],"inevitably":[11],"creates":[12],"a":[13,54,157],"gap":[14],"between":[15],"what":[16],"is":[17,129,138],"efficient":[18,170,192],"in":[19,22,37,71,112,125,140,188],"theory":[20],"and":[21,73,101,115,148,168,193],"practice,":[23],"motivating":[24],"fine-grained":[25],"which":[27,126],"better":[28],"emulate":[29],"real-world":[30],"constraints.":[31],"thesis":[33],"makes":[34],"new":[35,110,158],"developments":[36],"two":[38],"such":[39,51,89],"models.":[40],"First,":[41],"we":[42,119],"consider":[43,120],"the":[44,59,78,133,143,146],"noisy":[45],"primitives":[46],"model.":[47],"Here,":[48],"each":[49],"comparison,":[50],"as":[52,90],"''is":[53,91],"<":[55,65],"b?'',":[56],"independently":[57],"returns":[58],"wrong":[60],"answer":[61],"with":[62,84],"probability":[63],"p":[64,93],"1/2.":[66],"model":[68,79,159,190],"has":[69],"applications":[70],"quantum":[72],"distributed":[74],"computing.":[75],"We":[76,97,131,154,179],"extend":[77],"to":[80,183],"various":[81],"geometric":[82,86,107],"problems":[83,108],"Boolean":[85],"primitive":[87],"comparisons":[88],"point":[92],"above":[94],"line":[95],"L?''.":[96],"give":[98,132,169],"optimal":[99,139],"sequential":[100],"parallel":[102,116,171],"that":[104,137,173,185],"solve":[105],"these":[106],"using":[109],"techniques":[111,182],"random":[113],"walks":[114],"divide-and-conquer.":[117],"Second,":[118],"in-place":[121,194],"computation,":[124],"memory":[127],"usage":[128],"restricted.":[130],"first":[134],"sorting":[135],"algorithm":[136],"terms":[141],"run-entropy":[144],"input":[147],"only":[149],"uses":[150],"O(1)":[151],"additional":[152],"memory.":[153,178],"also":[155],"define":[156],"memory-efficient":[161],"parallelism":[162],"called":[163],"Strict":[164],"Synchronous":[165],"Parallel":[166],"In-Place":[167],"require":[174],"no":[175],"auxiliary":[176],"shared":[177],"introduce":[180],"novel":[181],"ensure":[184],"our":[186],"this":[189],"remain":[191],"at":[195],"all":[196],"processor":[197],"counts.":[198]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W7213486136","counts_by_year":[],"updated_date":"2026-11-16T12:05:36.265796","created_date":"2026-09-17T00:00:00"}
