{"id":"https://openalex.org/W7170158644","doi":"https://doi.org/10.4230/lipics.ccc.2026.29","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-01-01","ids":{"openalex":"https://openalex.org/W7170158644","doi":"https://doi.org/10.4230/lipics.ccc.2026.29"},"language":"en","primary_location":{"id":"doi:10.4230/lipics.ccc.2026.29","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.29","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"type":"conference-paper","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.4230/lipics.ccc.2026.29","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":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Chmel, Petr","raw_affiliation_strings":["Computer Science Institute of Charles University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-9131-1458","affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143487193","display_name":"Aditi Dudeja","orcid":"https://orcid.org/0009-0004-9988-9301"},"institutions":[{"id":"https://openalex.org/I4210116924","display_name":"Chinese University of Hong Kong, Shenzhen","ror":"https://ror.org/02d5ks197","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633","https://openalex.org/I180726961","https://openalex.org/I4210116924"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Dudeja, Aditi","raw_affiliation_strings":["The School of Data Science, The Chinese University of Hong Kong, Shenzhen, China"],"raw_orcid":"https://orcid.org/0009-0004-9988-9301","affiliations":[{"raw_affiliation_string":"The School of Data Science, The Chinese University of Hong Kong, Shenzhen, China","institution_ids":["https://openalex.org/I4210116924"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040922782","display_name":"Michal Kouck\u00fd","orcid":"https://orcid.org/0000-0003-0808-2269"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Kouck\u00fd, Michal","raw_affiliation_strings":["Computer Science Institute of Charles University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0003-0808-2269","affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015894874","display_name":"Ian Mertz","orcid":"https://orcid.org/0000-0002-4715-933X"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Mertz, Ian","raw_affiliation_strings":["Computer Science Institute of Charles University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0002-4715-933X","affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075537255","display_name":"Ninad Rajgopal","orcid":"https://orcid.org/0000-0001-6945-2345"},"institutions":[{"id":"https://openalex.org/I21250087","display_name":"Charles University","ror":"https://ror.org/024d6js02","country_code":"CZ","type":"education","lineage":["https://openalex.org/I21250087"]}],"countries":["CZ"],"is_corresponding":false,"raw_author_name":"Rajgopal, Ninad","raw_affiliation_strings":["Computer Science Institute of Charles University, Prague, Czech Republic"],"raw_orcid":"https://orcid.org/0000-0001-6945-2345","affiliations":[{"raw_affiliation_string":"Computer Science Institute of Charles University, Prague, Czech Republic","institution_ids":["https://openalex.org/I21250087"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"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":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.7056000232696533},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.5011000037193298},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.46860000491142273},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4643000066280365},{"id":"https://openalex.org/keywords/randomized-algorithm","display_name":"Randomized algorithm","score":0.42289999127388},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.4043999910354614},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.34779998660087585},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.33219999074935913}],"concepts":[{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.7056000232696533},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6434999704360962},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5338000059127808},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.5011000037193298},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.46860000491142273},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4643000066280365},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.42289999127388},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.4043999910354614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38510000705718994},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.34779998660087585},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.33709999918937683},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33219999074935913},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3303000032901764},{"id":"https://openalex.org/C2778572836","wikidata":"https://www.wikidata.org/wiki/Q380933","display_name":"Space (punctuation)","level":2,"score":0.3140000104904175},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3133000135421753},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.3018999993801117},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.2971000075340271},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.296099990606308},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.2863999903202057},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.27549999952316284},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.2687999904155731},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.26579999923706055},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.2531000077724457}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.4230/lipics.ccc.2026.29","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.29","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"ConferencePaper"}],"best_oa_location":{"id":"doi:10.4230/lipics.ccc.2026.29","is_oa":true,"landing_page_url":"https://doi.org/10.4230/lipics.ccc.2026.29","pdf_url":null,"source":{"id":"https://openalex.org/S7407052059","display_name":"Dagstuhl Research Online Publication Server","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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"ConferencePaper"},"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,136],"algorithms":[3,31,114],"for":[4,43,106,115,144],"fundamental":[5],"problems":[6,117],"in":[7,12,33,60],"algorithm":[8,42,78,95],"design":[9,38,111],"that":[10],"run":[11],"polynomial":[13,34,40,112],"time,":[14],"use":[15,20],"only":[16,87],"\ud835\udcaa(log(n))":[17,88],"workspace,":[18],"and":[19,68,81,125,147],"sublinear":[21],"space":[23,27,72],"matching":[24],"the":[25,56,61,70,75,101,116,126],"best-known":[26],"bounds":[28,59,104],"of":[29,74,118],"non-catalytic":[30,62,141],"running":[32,97],"time.":[35],"First,":[36],"we":[37,91,110],"a":[39,93],"time":[41,98,103,113],"directed":[44],"s-t":[45],"connectivity":[46],"using":[47,86,131],"n":[48,132],"/":[49,133],"2^{\u0398(\u221a{log":[50,134],"n})}":[51,135],"space,":[53],"which":[54],"matches":[55,100,140],"state-of-the-art":[57],"time-space":[58,142],"setting":[63],"[Barnes":[64],"et":[65,152],"al.,":[66,153],"1998],":[67],"improves":[69],"usage":[73],"best":[76],"known":[77,105],"[James":[79],"Cook":[80],"Edward":[82],"Pyne,":[83],"2026].":[84],"Furthermore,":[85],"random":[89],"bits":[90],"get":[92],"randomized":[94],"whose":[96],"nearly":[99],"fastest":[102],"space-unrestricted":[107],"algorithms.":[108],"Second,":[109],"computing":[119],"Edit":[120,145],"Distance,":[121,129],"Longest":[122],"Common":[123,149],"Subsequence,":[124],"Discrete":[127],"Fr\u00e9chet":[128],"again":[130,139],"space.":[137],"This":[138],"frontier":[143],"Distance":[146],"Least":[148],"Subsequence":[150],"[Kiyomi":[151],"2021].":[154]},"counts_by_year":[],"updated_date":"2026-07-24T06:07:23.975819","created_date":"2026-07-24T00:00:00"}