{"id":"https://openalex.org/W1999665052","doi":"https://doi.org/10.1137/s0097539793251888","title":"Linear Time and Memory-Efficient Computation","display_name":"Linear Time and Memory-Efficient Computation","publication_year":1996,"publication_date":"1996-02-01","ids":{"openalex":"https://openalex.org/W1999665052","doi":"https://doi.org/10.1137/s0097539793251888","mag":"1999665052"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539793251888","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793251888","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5007392192","display_name":"Kenneth W. Regan","orcid":"https://orcid.org/0000-0002-7382-7178"},"institutions":[{"id":"https://openalex.org/I63190737","display_name":"University at Buffalo, State University of New York","ror":"https://ror.org/01y64my43","country_code":"US","type":"education","lineage":["https://openalex.org/I63190737"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Kenneth W. Regan","raw_affiliation_strings":["Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14620-2000"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, State University of New York at Buffalo, 226 Bell Hall, Buffalo, NY 14620-2000","institution_ids":["https://openalex.org/I63190737"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5007392192"],"corresponding_institution_ids":["https://openalex.org/I63190737"],"apc_list":null,"apc_paid":null,"fwci":0.5154,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.63667446,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":96},"biblio":{"volume":"25","issue":"1","first_page":"133","last_page":"168"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9997000098228455,"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.9991999864578247,"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/T12162","display_name":"Cellular Automata and Applications","score":0.9991999864578247,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.7072576284408569},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6566314101219177},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6427327394485474},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6064558625221252},{"id":"https://openalex.org/keywords/model-of-computation","display_name":"Model of computation","score":0.593776524066925},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.49297571182250977},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.4667993187904358},{"id":"https://openalex.org/keywords/finite-state-machine","display_name":"Finite-state machine","score":0.45023995637893677},{"id":"https://openalex.org/keywords/hierarchy","display_name":"Hierarchy","score":0.44910192489624023},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.44585633277893066},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.431454598903656},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.41763490438461304},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.41202548146247864},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.3595343232154846},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.345802903175354},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13092279434204102}],"concepts":[{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.7072576284408569},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6566314101219177},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6427327394485474},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6064558625221252},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.593776524066925},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.49297571182250977},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.4667993187904358},{"id":"https://openalex.org/C167822520","wikidata":"https://www.wikidata.org/wiki/Q176452","display_name":"Finite-state machine","level":2,"score":0.45023995637893677},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.44910192489624023},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.44585633277893066},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.431454598903656},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.41763490438461304},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.41202548146247864},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3595343232154846},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.345802903175354},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13092279434204102},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","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}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/s0097539793251888","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539793251888","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.9666","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.9666","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cse.buffalo.edu/~regan/papers/pdf/ltmec.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.32.5232","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.5232","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ftp://ftp.cs.buffalo.edu/pub/tech-reports/./94-18.ps.Z","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":66,"referenced_works":["https://openalex.org/W134510267","https://openalex.org/W1514767237","https://openalex.org/W1546744413","https://openalex.org/W1576817182","https://openalex.org/W1577871826","https://openalex.org/W1584670745","https://openalex.org/W1967321130","https://openalex.org/W1972152334","https://openalex.org/W1978395023","https://openalex.org/W1979641885","https://openalex.org/W1979740015","https://openalex.org/W1979971526","https://openalex.org/W1982718233","https://openalex.org/W1983243118","https://openalex.org/W1986188250","https://openalex.org/W1989122074","https://openalex.org/W1996028864","https://openalex.org/W1996578733","https://openalex.org/W2004471951","https://openalex.org/W2005874499","https://openalex.org/W2009798194","https://openalex.org/W2010032869","https://openalex.org/W2011717090","https://openalex.org/W2016486322","https://openalex.org/W2018147301","https://openalex.org/W2027501230","https://openalex.org/W2027796826","https://openalex.org/W2030147970","https://openalex.org/W2031934066","https://openalex.org/W2036018689","https://openalex.org/W2038142281","https://openalex.org/W2038351263","https://openalex.org/W2040439439","https://openalex.org/W2042940615","https://openalex.org/W2045583484","https://openalex.org/W2045717693","https://openalex.org/W2047259054","https://openalex.org/W2051177275","https://openalex.org/W2057894153","https://openalex.org/W2059677035","https://openalex.org/W2062246109","https://openalex.org/W2065953381","https://openalex.org/W2067228794","https://openalex.org/W2069516228","https://openalex.org/W2074159544","https://openalex.org/W2079745007","https://openalex.org/W2081339104","https://openalex.org/W2082154422","https://openalex.org/W2083481894","https://openalex.org/W2085862166","https://openalex.org/W2085938002","https://openalex.org/W2088300760","https://openalex.org/W2089442854","https://openalex.org/W2093865976","https://openalex.org/W2103995270","https://openalex.org/W2112708371","https://openalex.org/W2125269219","https://openalex.org/W2125495920","https://openalex.org/W2142495779","https://openalex.org/W2147429368","https://openalex.org/W2153586911","https://openalex.org/W2569165898","https://openalex.org/W2911693923","https://openalex.org/W4241108585","https://openalex.org/W4243643814","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1978271909","https://openalex.org/W127357700","https://openalex.org/W2724597727","https://openalex.org/W1480528870","https://openalex.org/W2508541108","https://openalex.org/W4243191745","https://openalex.org/W2315419748","https://openalex.org/W1029445510","https://openalex.org/W1722394934","https://openalex.org/W3103990451"],"abstract_inverted_index":{"A":[0],"realistic":[1],"model":[2,9],"of":[3,19,46,75,81],"computation":[4,15],"called":[5],"the":[6,40,60,82],"block-move":[7],"(BM)":[8],"is":[10,54,62,119],"developed.":[11],"The":[12,117],"BM":[13,41,61,83,118,136],"regards":[14],"as":[16],"a":[17,30,43,72,87,94,101,129],"sequence":[18],"finite":[20,96],"transductions":[21],"in":[22,50,114],"memory,":[23],"and":[24,49,126,137],"operations":[25],"are":[26,104,142],"timed":[27],"according":[28],"to":[29,52,64,93,106,111,121,127],"memory":[31],"cost":[32],"parameter":[33],"$\\mu":[34,76],"$.":[35],"Unlike":[36],"previous":[37],"memory-cost":[38],"models,":[39],"provides":[42],"rich":[44],"theory":[45],"linear":[47,69],"time,":[48],"contrast":[51],"what":[53],"known":[55],"for":[56,68],"Turing":[57],"machines":[58],"(TMs),":[59],"proved":[63,120],"be":[65],"highly":[66],"robust":[67],"time.":[70,116],"Under":[71],"wide":[73],"range":[74],"$":[77],"parameters,":[78],"many":[79],"forms":[80],"model,":[84],"ranging":[85],"from":[86],"fixed-wordsize":[88],"random-access":[89],"machine":[90],"(RAM)":[91],"down":[92],"single":[95,102],"automaton":[97],"iterating":[98],"itself":[99],"on":[100],"tape,":[103],"shown":[105],"simulate":[107],"each":[108],"other":[109],"up":[110],"constant":[112],"factors":[113],"running":[115],"enjoy":[122],"efficient":[123],"universal":[124],"simulation,":[125],"have":[128],"tight":[130],"deterministic":[131],"time":[132,139],"hierarchy.":[133],"Relationships":[134],"among":[135],"TM":[138],"complexity":[140],"classes":[141],"studied.":[143]},"counts_by_year":[{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}