{"id":"https://openalex.org/W2134098997","doi":"https://doi.org/10.1145/2077336.2077337","title":"Pebbles and Branching Programs for Tree Evaluation","display_name":"Pebbles and Branching Programs for Tree Evaluation","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2134098997","doi":"https://doi.org/10.1145/2077336.2077337","mag":"2134098997"},"language":"en","primary_location":{"id":"doi:10.1145/2077336.2077337","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2077336.2077337","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","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/A5034555443","display_name":"Stephen Cook","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Stephen Cook","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039352699","display_name":"Pierre McKenzie","orcid":"https://orcid.org/0000-0002-2483-8305"},"institutions":[{"id":"https://openalex.org/I70931966","display_name":"Universit\u00e9 de Montr\u00e9al","ror":"https://ror.org/0161xgx34","country_code":"CA","type":"education","lineage":["https://openalex.org/I70931966"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Pierre McKenzie","raw_affiliation_strings":["Universit\u00e9 de Montr\u00e9al","UNIVERSITE DE MONTREAL"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e9 de Montr\u00e9al","institution_ids":["https://openalex.org/I70931966"]},{"raw_affiliation_string":"UNIVERSITE DE MONTREAL","institution_ids":["https://openalex.org/I70931966"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5007526297","display_name":"Dustin Wehr","orcid":null},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Dustin Wehr","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042816355","display_name":"Mark Braverman","orcid":"https://orcid.org/0000-0003-1276-6081"},"institutions":[{"id":"https://openalex.org/I185261750","display_name":"University of Toronto","ror":"https://ror.org/03dbr7087","country_code":"CA","type":"education","lineage":["https://openalex.org/I185261750"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mark Braverman","raw_affiliation_strings":["University of Toronto"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Toronto","institution_ids":["https://openalex.org/I185261750"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5085864294","display_name":"Rahul Santhanam","orcid":"https://orcid.org/0000-0002-8716-6091"},"institutions":[{"id":"https://openalex.org/I98677209","display_name":"University of Edinburgh","ror":"https://ror.org/01nrxwf90","country_code":"GB","type":"education","lineage":["https://openalex.org/I98677209"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Rahul Santhanam","raw_affiliation_strings":["University of Edinburgh"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Edinburgh","institution_ids":["https://openalex.org/I98677209"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5034555443"],"corresponding_institution_ids":["https://openalex.org/I185261750"],"apc_list":null,"apc_paid":null,"fwci":3.4712,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":{"value":0.92956872,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"3","issue":"2","first_page":"1","last_page":"43"},"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.9998000264167786,"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.9998000264167786,"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/T10374","display_name":"Advanced Graph Theory Research","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/T12288","display_name":"Optimization and Search Problems","score":0.9890000224113464,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.8805742859840393},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7019946575164795},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6287589073181152},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6220609545707703},{"id":"https://openalex.org/keywords/branching","display_name":"Branching (polymer chemistry)","score":0.5862781405448914},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.5373420119285583},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.5247939825057983},{"id":"https://openalex.org/keywords/binary-decision-diagram","display_name":"Binary decision diagram","score":0.49172666668891907},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.45648902654647827},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2033519446849823}],"concepts":[{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.8805742859840393},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7019946575164795},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6287589073181152},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6220609545707703},{"id":"https://openalex.org/C206175624","wikidata":"https://www.wikidata.org/wiki/Q595731","display_name":"Branching (polymer chemistry)","level":2,"score":0.5862781405448914},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.5373420119285583},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.5247939825057983},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.49172666668891907},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45648902654647827},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2033519446849823},{"id":"https://openalex.org/C192562407","wikidata":"https://www.wikidata.org/wiki/Q228736","display_name":"Materials science","level":0,"score":0.0},{"id":"https://openalex.org/C159985019","wikidata":"https://www.wikidata.org/wiki/Q181790","display_name":"Composite material","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2077336.2077337","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2077336.2077337","pdf_url":null,"source":{"id":"https://openalex.org/S205019203","display_name":"ACM Transactions on Computation Theory","issn_l":"1942-3454","issn":["1942-3454","1942-3462"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Computation Theory","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.751.7249","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.751.7249","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1005.2642.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W42251193","https://openalex.org/W143396352","https://openalex.org/W1507688495","https://openalex.org/W1517585663","https://openalex.org/W1524205832","https://openalex.org/W1536619467","https://openalex.org/W1556429797","https://openalex.org/W1626365820","https://openalex.org/W1975124543","https://openalex.org/W1976463987","https://openalex.org/W1979328074","https://openalex.org/W1992185863","https://openalex.org/W2001736707","https://openalex.org/W2003104918","https://openalex.org/W2006252547","https://openalex.org/W2014963708","https://openalex.org/W2036615169","https://openalex.org/W2054197381","https://openalex.org/W2061739322","https://openalex.org/W2095012419","https://openalex.org/W2104757941","https://openalex.org/W2107000858","https://openalex.org/W2141585995","https://openalex.org/W2401138554","https://openalex.org/W2911480877","https://openalex.org/W3012388883","https://openalex.org/W4205241946","https://openalex.org/W4252948584","https://openalex.org/W4285719527","https://openalex.org/W6630883433"],"related_works":["https://openalex.org/W257150968","https://openalex.org/W3140601928","https://openalex.org/W1977451125","https://openalex.org/W2057257783","https://openalex.org/W2168881618","https://openalex.org/W86917440","https://openalex.org/W2057159994","https://openalex.org/W1554633336","https://openalex.org/W2408104189","https://openalex.org/W2109998394"],"abstract_inverted_index":{"We":[0,110,160,201,244],"introduce":[1,161,202],"the":[2,25,38,96,105,108,113,120,180,223,228,261],"tree":[3,46,122,174],"evaluation":[4,175],"problem":[5,39,225,263],",":[6,50],"show":[7,111,178,208],"that":[8,112,146,179,209,235,247],"it":[9],"is":[10,40,104,150,190,238,251],"in":[11,15,24,84],"LogDCFL":[12],"(and":[13],"hence":[14],"P":[16],"),":[17],"and":[18,68,143,156,177,207,233],"study":[19],"its":[20,90,99],"branching":[21,131,171,258],"program":[22,132],"complexity":[23],"hope":[26],"of":[27,47,75,98,107,123,184],"eventually":[28],"proving":[29],"a":[30,41,82,127,162],"superlogarithmic":[31],"space":[32],"lower":[33],"bound.":[34],"The":[35,102],"input":[36],"to":[37,89,95,119],"rooted,":[42],"balanced":[43],"d":[44,57,91,100],"-ary":[45,58,92],"height":[48,124],"h":[49,125,137,153,157,188,194,241,265],"whose":[51,69],"internal":[52],"nodes":[53],"are":[54,71],"labeled":[55,72],"with":[56,73,133,215],"functions":[59],"on":[60,168],"[":[61,76,85],"k":[62,66,77,86,129,136,169,187,218,256],"]":[63,87],"=":[64,154,158,242,266],"{1,...,":[65],"},":[67],"leaves":[70],"elements":[74],"].":[78],"Each":[79],"node":[80],"obtains":[81],"value":[83,106,231],"equal":[88],"function":[93],"applied":[94,118],"values":[97],"children.":[101],"output":[103],"root.":[109],"standard":[114],"black":[115],"pebbling":[116,204],"algorithm":[117],"binary":[121],"yields":[126,211],"deterministic":[128,198],"-way":[130,170,257],"O":[134],"(":[135,186,217],")":[138,189,220],"states":[139,221],"solving":[140,173,222,260],"this":[141,147,210,236,248],"problem,":[142],"we":[144],"prove":[145,234,246],"upper":[148],"bound":[149,183,237,250],"tight":[151,191,239,252],"for":[152,192,197,205,240,253,264],"2":[155,196],"3.":[159],"simple":[163],"semantic":[164],"restriction":[165],"called":[166],"thrifty":[167,199,213],"programs":[172,214,259],"problems":[176],"same":[181,249],"state":[182],"\u0398":[185,216],"all":[193],"\u2265":[195],"programs.":[200],"fractional":[203],"trees":[206],"nondeterministic":[212,255],"h/2+1":[219],"Boolean":[224,262],"\u201cdetermine":[226],"whether":[227],"root":[229],"has":[230],"1\u201d,":[232],"2,3,4.":[243],"also":[245],"unrestricted":[254],"2,3.":[267]},"counts_by_year":[{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":5},{"year":2012,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}