{"id":"https://openalex.org/W1567908230","doi":"https://doi.org/10.1007/3-540-47849-3_37","title":"Cellular Automata with Dynamically Reconfigurable Buses","display_name":"Cellular Automata with Dynamically Reconfigurable Buses","publication_year":1999,"publication_date":"1999-01-01","ids":{"openalex":"https://openalex.org/W1567908230","doi":"https://doi.org/10.1007/3-540-47849-3_37","mag":"1567908230"},"language":"en","primary_location":{"id":"doi:10.1007/3-540-47849-3_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47849-3_37","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/A5015010410","display_name":"Thomas Worsch","orcid":null},"institutions":[{"id":"https://openalex.org/I143379178","display_name":"FZI Research Center for Information Technology","ror":"https://ror.org/04kdh6x72","country_code":"DE","type":"nonprofit","lineage":["https://openalex.org/I143379178"]},{"id":"https://openalex.org/I4210119349","display_name":"Karlsruhe University of Education","ror":"https://ror.org/01t1kq612","country_code":"DE","type":"education","lineage":["https://openalex.org/I4210119349"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Thomas Worsch","raw_affiliation_strings":["Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Germany","Universit\u00e4t Karlsruhe,"],"affiliations":[{"raw_affiliation_string":"Fakult\u00e4t f\u00fcr Informatik, Universit\u00e4t Karlsruhe, Germany","institution_ids":["https://openalex.org/I143379178"]},{"raw_affiliation_string":"Universit\u00e4t Karlsruhe,","institution_ids":["https://openalex.org/I4210119349"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5015010410"],"corresponding_institution_ids":["https://openalex.org/I143379178","https://openalex.org/I4210119349"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.18043912,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"488","last_page":"496"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12162","display_name":"Cellular Automata and Applications","score":1.0,"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/T12162","display_name":"Cellular Automata and Applications","score":1.0,"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/T11567","display_name":"semigroups and automata theory","score":0.9986000061035156,"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.9973000288009644,"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/computer-science","display_name":"Computer science","score":0.8211411833763123},{"id":"https://openalex.org/keywords/cellular-automaton","display_name":"Cellular automaton","score":0.7475635409355164},{"id":"https://openalex.org/keywords/overhead","display_name":"Overhead (engineering)","score":0.6486024260520935},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.6149031519889832},{"id":"https://openalex.org/keywords/automaton","display_name":"Automaton","score":0.614203929901123},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.6082087159156799},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5711385607719421},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5309977531433105},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.5043131113052368},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4613272249698639},{"id":"https://openalex.org/keywords/mobile-automaton","display_name":"Mobile automaton","score":0.4582897424697876},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4444510340690613},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44038981199264526},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35518670082092285},{"id":"https://openalex.org/keywords/automata-theory","display_name":"Automata theory","score":0.2129000723361969},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15836554765701294},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.15007466077804565},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.14121466875076294},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.10096195340156555}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8211411833763123},{"id":"https://openalex.org/C35527583","wikidata":"https://www.wikidata.org/wiki/Q189156","display_name":"Cellular automaton","level":2,"score":0.7475635409355164},{"id":"https://openalex.org/C2779960059","wikidata":"https://www.wikidata.org/wiki/Q7113681","display_name":"Overhead (engineering)","level":2,"score":0.6486024260520935},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.6149031519889832},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.614203929901123},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.6082087159156799},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5711385607719421},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5309977531433105},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.5043131113052368},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4613272249698639},{"id":"https://openalex.org/C50348692","wikidata":"https://www.wikidata.org/wiki/Q6887056","display_name":"Mobile automaton","level":4,"score":0.4582897424697876},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4444510340690613},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44038981199264526},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35518670082092285},{"id":"https://openalex.org/C116248031","wikidata":"https://www.wikidata.org/wiki/Q214526","display_name":"Automata theory","level":3,"score":0.2129000723361969},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15836554765701294},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.15007466077804565},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.14121466875076294},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.10096195340156555},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/3-540-47849-3_37","is_oa":false,"landing_page_url":"https://doi.org/10.1007/3-540-47849-3_37","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"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.7200000286102295}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W44103648","https://openalex.org/W1724322485","https://openalex.org/W1985597771","https://openalex.org/W2020818044","https://openalex.org/W2042095013","https://openalex.org/W2051842903","https://openalex.org/W2052565631","https://openalex.org/W2072448904","https://openalex.org/W2143141523","https://openalex.org/W2160047101","https://openalex.org/W3141355543"],"related_works":["https://openalex.org/W45821419","https://openalex.org/W2159634855","https://openalex.org/W2131328519","https://openalex.org/W1994519856","https://openalex.org/W2992015824","https://openalex.org/W2520633580","https://openalex.org/W2002600082","https://openalex.org/W1947204099","https://openalex.org/W1555991356","https://openalex.org/W4211227983"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}