{"id":"https://openalex.org/W2095476685","doi":"https://doi.org/10.1016/s1571-0661(03)00003-3","title":"The Garland Measure and Computational Complexity of Stack Programs","display_name":"The Garland Measure and Computational Complexity of Stack Programs","publication_year":2003,"publication_date":"2003-11-01","ids":{"openalex":"https://openalex.org/W2095476685","doi":"https://doi.org/10.1016/s1571-0661(03)00003-3","mag":"2095476685"},"language":"en","primary_location":{"id":"doi:10.1016/s1571-0661(03)00003-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(03)00003-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1016/s1571-0661(03)00003-3","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063909629","display_name":"Lars Kristiansen","orcid":"https://orcid.org/0000-0002-6749-4004"},"institutions":[{"id":"https://openalex.org/I184531372","display_name":"OsloMet \u2013 Oslo Metropolitan University","ror":"https://ror.org/04q12yn84","country_code":"NO","type":"education","lineage":["https://openalex.org/I184531372"]}],"countries":["NO"],"is_corresponding":true,"raw_author_name":"L. Kristiansen","raw_affiliation_strings":["Faculty of Engineering, Oslo University College, Oslo, Norway","(Faculty of Engineering, Oslo University College, Oslo, Norway)"],"affiliations":[{"raw_affiliation_string":"Faculty of Engineering, Oslo University College, Oslo, Norway","institution_ids":["https://openalex.org/I184531372"]},{"raw_affiliation_string":"(Faculty of Engineering, Oslo University College, Oslo, Norway)","institution_ids":["https://openalex.org/I184531372"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113599640","display_name":"Karl-Heinz Niggl","orcid":null},"institutions":[{"id":"https://openalex.org/I119449181","display_name":"Technische Universit\u00e4t Ilmenau","ror":"https://ror.org/01weqhp73","country_code":"DE","type":"education","lineage":["https://openalex.org/I119449181"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"K.-H. Niggl","raw_affiliation_strings":["Institut f\u00fcr Theoretische und Technische Informatik, Technische Universit\u00e4t Ilmenau, Helmholtzplatz\u00a01, 98684 Ilmenau, Germany"],"affiliations":[{"raw_affiliation_string":"Institut f\u00fcr Theoretische und Technische Informatik, Technische Universit\u00e4t Ilmenau, Helmholtzplatz\u00a01, 98684 Ilmenau, Germany","institution_ids":["https://openalex.org/I119449181"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063909629","https://openalex.org/A5113599640"],"corresponding_institution_ids":["https://openalex.org/I119449181","https://openalex.org/I184531372"],"apc_list":null,"apc_paid":null,"fwci":1.3706,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84797937,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"90","issue":null,"first_page":"15","last_page":"35"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9998999834060669,"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/T11567","display_name":"semigroups and automata theory","score":0.9993000030517578,"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/T11010","display_name":"Logic, Reasoning, and Knowledge","score":0.9988999962806702,"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/call-stack","display_name":"Call stack","score":0.7819572687149048},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.6668250560760498},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6098609566688538},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5870234966278076},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5699812173843384},{"id":"https://openalex.org/keywords/computable-function","display_name":"Computable function","score":0.5525686740875244},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.539340078830719},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5081791877746582},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4675307273864746},{"id":"https://openalex.org/keywords/kolmogorov-complexity","display_name":"Kolmogorov complexity","score":0.4505128264427185},{"id":"https://openalex.org/keywords/syntax","display_name":"Syntax","score":0.4119194447994232},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37211787700653076},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.35305020213127136},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34526804089546204},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.24832728505134583},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1962328851222992},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.17705896496772766},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.09152448177337646}],"concepts":[{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.7819572687149048},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.6668250560760498},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6098609566688538},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5870234966278076},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5699812173843384},{"id":"https://openalex.org/C54271186","wikidata":"https://www.wikidata.org/wiki/Q1148456","display_name":"Computable function","level":2,"score":0.5525686740875244},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.539340078830719},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5081791877746582},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4675307273864746},{"id":"https://openalex.org/C2779341405","wikidata":"https://www.wikidata.org/wiki/Q1456811","display_name":"Kolmogorov complexity","level":2,"score":0.4505128264427185},{"id":"https://openalex.org/C60048249","wikidata":"https://www.wikidata.org/wiki/Q37437","display_name":"Syntax","level":2,"score":0.4119194447994232},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37211787700653076},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.35305020213127136},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34526804089546204},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.24832728505134583},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1962328851222992},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.17705896496772766},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.09152448177337646}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s1571-0661(03)00003-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(03)00003-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.1016/s1571-0661(03)00003-3","is_oa":true,"landing_page_url":"https://doi.org/10.1016/s1571-0661(03)00003-3","pdf_url":null,"source":{"id":"https://openalex.org/S50368787","display_name":"Electronic Notes in Theoretical Computer Science","issn_l":"1571-0661","issn":["1571-0661"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":"cc-by-nc-nd","license_id":"https://openalex.org/licenses/cc-by-nc-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Electronic Notes in Theoretical Computer Science","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W615345195","https://openalex.org/W1970954854","https://openalex.org/W1981528174","https://openalex.org/W2043102901","https://openalex.org/W2055303025","https://openalex.org/W2069792094","https://openalex.org/W2072088733","https://openalex.org/W2083350000","https://openalex.org/W6619233846","https://openalex.org/W6668633151"],"related_works":["https://openalex.org/W2955446419","https://openalex.org/W1986583804","https://openalex.org/W1808977091","https://openalex.org/W1750180674","https://openalex.org/W1871326006","https://openalex.org/W4298880292","https://openalex.org/W2298795566","https://openalex.org/W182037539","https://openalex.org/W2030492659","https://openalex.org/W1516047453"],"abstract_inverted_index":{"A":[0],"key":[1],"problem":[2,29],"in":[3,25,64,78,97,126,162,190],"implicit":[4],"computational":[5,223],"complexity":[6,114],"is":[7,34,90,95,133,182,188],"to":[8,52,69,84,211],"analyse":[9],"the":[10,43,88,98,107,113,176,185,191],"impact":[11],"on":[12,197],"program":[13],"run":[14],"times":[15],"of":[16,39,45,56,106,115,124,139,158,170],"nesting":[17,55],"restricted":[18],"control":[19,57,112,125,222],"structures,":[20],"such":[21,46,86],"as":[22,51],"for-do":[23],"statements":[24],"imperative":[26],"languages.":[27],"This":[28,117],"has":[30],"two":[31],"aspects.":[32],"One":[33],"whether":[35,91],"there":[36,81],"are":[37,82],"methods":[38],"extracting":[40],"information":[41],"from":[42,67],"syntax":[44],"programs":[47,138,169,199],"that":[48,80,100,109,135,184,193,214],"give":[49],"insight":[50],"why":[53],"some":[54],"structures":[58],"may":[59],"cause":[60,110,220],"a":[61,92,103,120,149,156],"blow":[62],"up":[63],"complexity,":[65],"e.g.":[66],"polynomial":[68],"(iterated)":[70],"exponential":[71],"time,":[72],"while":[73],"others":[74],"do":[75],"not.":[76],"Bearing":[77],"mind":[79],"limitations":[83],"any":[85,207],"method,":[87],"other":[89,195],"given":[93],"method":[94],"\u201coptimal\u201d":[96,189],"sense":[99,192],"it":[101,181],"provides":[102],"full":[104],"understanding":[105],"mechanisms":[108],"and":[111,221],"computations.":[116],"paper":[118],"presents":[119],"graph":[121],"theoretical":[122],"analysis":[123],"stack":[127,137,168,198,217],"programs,":[128],"called":[129],"\u201cgarland":[130],"measure\u201d.":[131],"It":[132],"shown":[134,183],"(1)":[136,201],"garland":[140,171,186],"measure":[141,172,187,196],"n":[142],"compute":[143,174],"exactly":[144],"those":[145,216],"functions":[146],"computed":[147],"by":[148],"Turing":[150],"machine":[151],"whose":[152],"running":[153],"time":[154],"(as":[155],"function":[157],"input":[159],"size)":[160],"lies":[161],"Grzegorczyk":[163],"class":[164],"En+2.":[165],"In":[166],"particular,":[167],"0":[173],"precisely":[175],"polynomial-time":[177],"computable":[178],"functions.":[179],"Furthermore,":[180],"no":[194],"satisfying":[200],"can":[202],"admit":[203],"more":[204],"algorithms":[205],"at":[206],"level":[208],"when":[209],"restricting":[210],"\u201ccore":[212],"programs\u201d":[213],"comprise":[215],"manipulations":[218],"which":[219],"complexity.":[224]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}