{"id":"https://openalex.org/W7131426012","doi":"https://doi.org/10.48550/arxiv.2602.21089","title":"Frontier Space-Time Algorithms Using Only Full Memory","display_name":"Frontier Space-Time Algorithms Using Only Full Memory","publication_year":2026,"publication_date":"2026-02-24","ids":{"openalex":"https://openalex.org/W7131426012","doi":"https://doi.org/10.48550/arxiv.2602.21089"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.21089","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5085073462","display_name":"Petr Chmel","orcid":"https://orcid.org/0000-0002-9131-1458"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Chmel, Petr","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5000225226","display_name":"Aditi Dudeja","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Dudeja, Aditi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5125627560","display_name":"Michal Kouck\u00fd","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kouck\u00fd, Michal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126790612","display_name":"Ian Mertz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mertz, Ian","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5075537255","display_name":"Ninad Rajgopal","orcid":"https://orcid.org/0000-0001-6945-2345"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Rajgopal, Ninad","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5085073462"],"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":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.3758000135421753,"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.3758000135421753,"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/T10237","display_name":"Cryptography and Data Security","score":0.08340000361204147,"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/T11269","display_name":"Algorithms and Data Compression","score":0.07119999825954437,"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/time-complexity","display_name":"Time complexity","score":0.707099974155426},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.48840001225471497},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4706000089645386},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.46939998865127563},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42250001430511475},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.40639999508857727},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.34599998593330383},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3328999876976013}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.707099974155426},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6499999761581421},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5401999950408936},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4706000089645386},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.46939998865127563},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42250001430511475},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.40639999508857727},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3833000063896179},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.34599998593330383},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3431999981403351},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3328999876976013},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.31189998984336853},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.30660000443458557},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3046000003814697},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.30079999566078186},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.2824999988079071},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.2816999852657318},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.2782000005245209},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.2694999873638153},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.2671000063419342},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.2632000148296356}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.21089","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.21089","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.21089","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.21089","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"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":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0],"develop":[1],"catalytic":[2,22,52,71,134],"algorithms":[3,31,112],"for":[4,43,104,113,142],"fundamental":[5],"problems":[6,115],"in":[7,12,33,60],"algorithm":[8,42,78,93],"design":[9,38,109],"that":[10],"run":[11],"polynomial":[13,34,40,110],"time,":[14],"use":[15,20],"only":[16,85],"$\\mathcal{O}(\\log(n))$":[17,86],"workspace,":[18],"and":[19,68,80,123,145],"sublinear":[21],"space":[23,27,72],"matching":[24],"the":[25,56,61,70,75,99,114,124],"best-known":[26],"bounds":[28,59,102],"of":[29,74,116],"non-catalytic":[30,62,139],"running":[32,95],"time.":[35],"First,":[36],"we":[37,89,108],"a":[39,91],"time":[41,96,101,111],"directed":[44],"$s$-$t$":[45],"connectivity":[46],"using":[47,84,129],"$n":[48,130],"\\big/":[49,131],"2^{\u0398(\\sqrt{\\log":[50,132],"n})}$":[51,133],"space,":[53],"which":[54],"matches":[55,98,138],"state-of-the-art":[57],"time-space":[58,140],"setting":[63],"[Barnes":[64],"et":[65,150],"al.,":[66,151],"1998],":[67],"improves":[69],"usage":[73],"best":[76],"known":[77,103],"[Cook":[79],"Pyne,":[81],"2026].":[82],"Furthermore,":[83],"random":[87],"bits":[88],"get":[90],"randomized":[92],"whose":[94],"nearly":[97],"fastest":[100],"space-unrestricted":[105],"algorithms.":[106],"Second,":[107],"computing":[117],"Edit":[118,143],"Distance,":[119,127],"Longest":[120],"Common":[121,147],"Subsequence,":[122],"Discrete":[125],"Fr\u00e9chet":[126],"again":[128,137],"space.":[135],"This":[136],"frontier":[141],"Distance":[144],"Least":[146],"Subsequence":[148],"[Kiyomi":[149],"2021].":[152]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-26T00:00:00"}