{"id":"https://openalex.org/W1500786554","doi":"https://doi.org/10.1007/978-3-642-28332-1_12","title":"Fast and Cache-Oblivious Dynamic Programming with Local Dependencies","display_name":"Fast and Cache-Oblivious Dynamic Programming with Local Dependencies","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1500786554","doi":"https://doi.org/10.1007/978-3-642-28332-1_12","mag":"1500786554"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-28332-1_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-28332-1_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5083100766","display_name":"Philip Bille","orcid":"https://orcid.org/0000-0002-1120-5154"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Philip Bille","raw_affiliation_strings":["DTU Informatics, Technical University of Denmark, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DTU Informatics, Technical University of Denmark, Copenhagen, Denmark","institution_ids":["https://openalex.org/I96673099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052881435","display_name":"Morten St\u00f6ckel","orcid":"https://orcid.org/0000-0002-6875-7005"},"institutions":[{"id":"https://openalex.org/I96673099","display_name":"Technical University of Denmark","ror":"https://ror.org/04qtj9h94","country_code":"DK","type":"education","lineage":["https://openalex.org/I96673099"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Morten St\u00f6ckel","raw_affiliation_strings":["DTU Informatics, Technical University of Denmark, Copenhagen, Denmark"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"DTU Informatics, Technical University of Denmark, Copenhagen, Denmark","institution_ids":["https://openalex.org/I96673099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.3173,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.58388222,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"131","last_page":"142"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T11269","display_name":"Algorithms and Data Compression","score":1.0,"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/T12326","display_name":"Network Packet Processing and Optimization","score":0.9889000058174133,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10015","display_name":"Genomics and Phylogenetic Studies","score":0.9866999983787537,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.848212718963623},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.6036016941070557},{"id":"https://openalex.org/keywords/bottleneck","display_name":"Bottleneck","score":0.6023597121238708},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.5774273872375488},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.576035737991333},{"id":"https://openalex.org/keywords/string-searching-algorithm","display_name":"String searching algorithm","score":0.508639931678772},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4814740717411041},{"id":"https://openalex.org/keywords/longest-increasing-subsequence","display_name":"Longest increasing subsequence","score":0.4601825177669525},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4513779878616333},{"id":"https://openalex.org/keywords/string","display_name":"String (physics)","score":0.44668352603912354},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4345393478870392},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.42833849787712097},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.424783855676651},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.42098382115364075},{"id":"https://openalex.org/keywords/subsequence","display_name":"Subsequence","score":0.4168499708175659},{"id":"https://openalex.org/keywords/edit-distance","display_name":"Edit distance","score":0.41442620754241943},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.37106987833976746},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10240375995635986},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.08988931775093079}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.848212718963623},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6036016941070557},{"id":"https://openalex.org/C2780513914","wikidata":"https://www.wikidata.org/wiki/Q18210350","display_name":"Bottleneck","level":2,"score":0.6023597121238708},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.5774273872375488},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.576035737991333},{"id":"https://openalex.org/C7757238","wikidata":"https://www.wikidata.org/wiki/Q374040","display_name":"String searching algorithm","level":3,"score":0.508639931678772},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4814740717411041},{"id":"https://openalex.org/C170006305","wikidata":"https://www.wikidata.org/wiki/Q4183855","display_name":"Longest increasing subsequence","level":4,"score":0.4601825177669525},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4513779878616333},{"id":"https://openalex.org/C157486923","wikidata":"https://www.wikidata.org/wiki/Q1376436","display_name":"String (physics)","level":2,"score":0.44668352603912354},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4345393478870392},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.42833849787712097},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.424783855676651},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.42098382115364075},{"id":"https://openalex.org/C137877099","wikidata":"https://www.wikidata.org/wiki/Q1332977","display_name":"Subsequence","level":3,"score":0.4168499708175659},{"id":"https://openalex.org/C44359876","wikidata":"https://www.wikidata.org/wiki/Q5338467","display_name":"Edit distance","level":2,"score":0.41442620754241943},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.37106987833976746},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10240375995635986},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.08988931775093079},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C37914503","wikidata":"https://www.wikidata.org/wiki/Q156495","display_name":"Mathematical physics","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},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/978-3-642-28332-1_12","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-28332-1_12","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pure.atira.dk:publications/08a0822b-d2f9-4c5e-a648-27cd1be9be30","is_oa":false,"landing_page_url":"https://orbit.dtu.dk/en/publications/08a0822b-d2f9-4c5e-a648-27cd1be9be30","pdf_url":null,"source":{"id":"https://openalex.org/S4306400705","display_name":"Technical University of Denmark, DTU Orbit (Technical University of Denmark, DTU)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I96673099","host_organization_name":"Technical University of Denmark","host_organization_lineage":["https://openalex.org/I96673099"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Bille , P & St\u00f6ckel , M 2012 , Fast and Cache-Oblivious Dynamic Programming with Local Dependencies . in Language and Automata Theory and Applications : 6th International Conference, LATA 2012 A Coru\u00f1a, Spain, March 5-9, 2012 Proceedings . Springer , Lecture Notes in Computer Science , vol. 7183 , pp. 131\u2013142 , The 6th International Conference on Language and Automata Theory and Applications, LATA , Coru\u00f1a , Spain , 05/03/2012 . https://doi.org/10.1007/978-3-642-28332-1_12","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W938539187","https://openalex.org/W1644420677","https://openalex.org/W1821184416","https://openalex.org/W1970026646","https://openalex.org/W1990061958","https://openalex.org/W2001496424","https://openalex.org/W2008803097","https://openalex.org/W2012010763","https://openalex.org/W2014145971","https://openalex.org/W2027506564","https://openalex.org/W2038142281","https://openalex.org/W2052899946","https://openalex.org/W2084002994","https://openalex.org/W2091929432","https://openalex.org/W2095875205","https://openalex.org/W2100751585","https://openalex.org/W2108215151","https://openalex.org/W2137939491","https://openalex.org/W2139596748","https://openalex.org/W2144031643","https://openalex.org/W2152971387","https://openalex.org/W2165654401","https://openalex.org/W2490672683","https://openalex.org/W4253069684","https://openalex.org/W6603968179"],"related_works":["https://openalex.org/W1746697883","https://openalex.org/W3022573534","https://openalex.org/W1540010783","https://openalex.org/W4389489786","https://openalex.org/W4289596129","https://openalex.org/W1974063126","https://openalex.org/W2969919693","https://openalex.org/W4225868058","https://openalex.org/W4323338832","https://openalex.org/W170643605"],"abstract_inverted_index":null,"counts_by_year":[{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}