{"id":"https://openalex.org/W2146634436","doi":"https://doi.org/10.1007/s00037-012-0057-1","title":"Tradeoff lower lounds for stack machines","display_name":"Tradeoff lower lounds for stack machines","publication_year":2013,"publication_date":"2013-01-07","ids":{"openalex":"https://openalex.org/W2146634436","doi":"https://doi.org/10.1007/s00037-012-0057-1","mag":"2146634436"},"language":"en","primary_location":{"id":"doi:10.1007/s00037-012-0057-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-012-0057-1","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","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/A5055960227","display_name":"Matei David","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Matei David","raw_affiliation_strings":["Center for Computational Intractability, Princeton University, Princeton, NJ, USA","Center for Computational Intractability, Princeton University, Princeton, USA"],"affiliations":[{"raw_affiliation_string":"Center for Computational Intractability, Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Center for Computational Intractability, Princeton University, Princeton, USA","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5089121499","display_name":"Periklis A. Papakonstantinou","orcid":"https://orcid.org/0009-0006-5734-5837"},"institutions":[{"id":"https://openalex.org/I99065089","display_name":"Tsinghua University","ror":"https://ror.org/03cve4549","country_code":"CN","type":"education","lineage":["https://openalex.org/I99065089"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Periklis A. Papakonstantinou","raw_affiliation_strings":["ITCS, IIIS Tsinghua University, Beijing, People\u2019s Republic of China","ITCS, IIIS Tsinghua University, Beijing, People's Republic of China#TAB#"],"affiliations":[{"raw_affiliation_string":"ITCS, IIIS Tsinghua University, Beijing, People\u2019s Republic of China","institution_ids":["https://openalex.org/I99065089"]},{"raw_affiliation_string":"ITCS, IIIS Tsinghua University, Beijing, People's Republic of China#TAB#","institution_ids":["https://openalex.org/I99065089"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5055960227"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":{"value":2290,"currency":"EUR","value_usd":2890},"apc_paid":null,"fwci":0.373,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.6777345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"23","issue":"1","first_page":"99","last_page":"146"},"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.9995999932289124,"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.9995999932289124,"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.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/T12002","display_name":"Computability, Logic, AI Algorithms","score":0.9972000122070312,"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/bounded-function","display_name":"Bounded function","score":0.6515122652053833},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.612672746181488},{"id":"https://openalex.org/keywords/nspace","display_name":"NSPACE","score":0.6030941009521484},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5810198783874512},{"id":"https://openalex.org/keywords/turing-machine","display_name":"Turing machine","score":0.5685610771179199},{"id":"https://openalex.org/keywords/time-hierarchy-theorem","display_name":"Time hierarchy theorem","score":0.5559840798377991},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5285077691078186},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5177140235900879},{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.5165256857872009},{"id":"https://openalex.org/keywords/dtime","display_name":"DTIME","score":0.4946398437023163},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4608210623264313},{"id":"https://openalex.org/keywords/linear-space","display_name":"Linear space","score":0.44531822204589844},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4285627007484436},{"id":"https://openalex.org/keywords/communication-complexity","display_name":"Communication complexity","score":0.42114537954330444},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41109517216682434},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3641946017742157},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.33034059405326843},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.3162214159965515},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2885432839393616},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10933557152748108},{"id":"https://openalex.org/keywords/universal-turing-machine","display_name":"Universal Turing machine","score":0.1050000786781311}],"concepts":[{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6515122652053833},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.612672746181488},{"id":"https://openalex.org/C201958364","wikidata":"https://www.wikidata.org/wiki/Q1756295","display_name":"NSPACE","level":5,"score":0.6030941009521484},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5810198783874512},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.5685610771179199},{"id":"https://openalex.org/C48415503","wikidata":"https://www.wikidata.org/wiki/Q5251122","display_name":"Time hierarchy theorem","level":5,"score":0.5559840798377991},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5285077691078186},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5177140235900879},{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.5165256857872009},{"id":"https://openalex.org/C15547884","wikidata":"https://www.wikidata.org/wiki/Q1155831","display_name":"DTIME","level":5,"score":0.4946398437023163},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4608210623264313},{"id":"https://openalex.org/C176370821","wikidata":"https://www.wikidata.org/wiki/Q1826459","display_name":"Linear space","level":2,"score":0.44531822204589844},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4285627007484436},{"id":"https://openalex.org/C179145077","wikidata":"https://www.wikidata.org/wiki/Q5154130","display_name":"Communication complexity","level":2,"score":0.42114537954330444},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41109517216682434},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3641946017742157},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.33034059405326843},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3162214159965515},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2885432839393616},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10933557152748108},{"id":"https://openalex.org/C131671149","wikidata":"https://www.wikidata.org/wiki/Q2703890","display_name":"Universal Turing machine","level":4,"score":0.1050000786781311},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/s00037-012-0057-1","is_oa":false,"landing_page_url":"https://doi.org/10.1007/s00037-012-0057-1","pdf_url":null,"source":{"id":"https://openalex.org/S193995496","display_name":"Computational Complexity","issn_l":"1016-3328","issn":["1016-3328","1420-8954"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320186","host_organization_name":"Birkh\u00e4user","host_organization_lineage":["https://openalex.org/P4310320186","https://openalex.org/P4310319900"],"host_organization_lineage_names":["Birkh\u00e4user","Springer Science+Business Media"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"computational complexity","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W987035227","https://openalex.org/W1487872891","https://openalex.org/W1527197079","https://openalex.org/W1557064786","https://openalex.org/W1583636811","https://openalex.org/W1593443957","https://openalex.org/W1965022641","https://openalex.org/W1965817034","https://openalex.org/W1994584977","https://openalex.org/W1995893260","https://openalex.org/W2027501230","https://openalex.org/W2041210515","https://openalex.org/W2051700974","https://openalex.org/W2052531873","https://openalex.org/W2071260871","https://openalex.org/W2075424516","https://openalex.org/W2079275582","https://openalex.org/W2080745194","https://openalex.org/W2095274905","https://openalex.org/W2116117986","https://openalex.org/W2151303208","https://openalex.org/W2170954902","https://openalex.org/W2340787257","https://openalex.org/W2911693923","https://openalex.org/W4210551624","https://openalex.org/W4285719527","https://openalex.org/W4298227433"],"related_works":["https://openalex.org/W2008300589","https://openalex.org/W2080505327","https://openalex.org/W2122747219","https://openalex.org/W1486286946","https://openalex.org/W1555195996","https://openalex.org/W2051933114","https://openalex.org/W21360042","https://openalex.org/W3192680852","https://openalex.org/W4388215614","https://openalex.org/W2013091420"],"abstract_inverted_index":null,"counts_by_year":[{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}