default search action
Thomas Worsch
Person information
- affiliation: Karlsruhe Institute of Technology, Institute for Theoretical Informatics, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j20]Augusto Modanese, Thomas Worsch:
Embedding Arbitrary Boolean Circuits into Fungal Automata. Algorithmica 86(7): 2069-2091 (2024) - 2022
- [c27]Augusto Modanese
, Thomas Worsch:
Embedding Arbitrary Boolean Circuits into Fungal Automata. LATIN 2022: 393-408 - [i4]Augusto Modanese, Thomas Worsch:
Embedding arbitrary Boolean circuits into fungal automata. CoRR abs/2208.08779 (2022) - 2021
- [j19]Thomas Worsch:
A faster algorithm for the Birthday Song Singers Synchronization Problem (FSSP) in one-dimensional CA with multiple speeds. Acta Informatica 58(4): 451-462 (2021) - 2020
- [j18]Martin Kutrib
Self-Verifying Cellular Automata. J. Cell. Autom. 15(3): 223-242 (2020) - [j17]Jarkko Kari, Ville Salo
Sequentializing cellular automata. Nat. Comput. 19(4): 759-772 (2020) - [i3]Thomas Worsch:
A faster algorithm for the FSSP in one-dimensional CA with multiple speeds. CoRR abs/2003.13558 (2020)
2010 – 2019
- 2019
- [c26]Martin Kutrib
Iterative Arrays with Self-verifying Communication Cell. Automata 2019: 77-90 - 2018
- [c25]Martin Kutrib
Self-verifying Cellular Automata. ACRI 2018: 340-351 - [c24]Jarkko Kari
Sequentializing Cellular Automata. Automata 2018: 72-87 - [i2]Jarkko Kari, Ville Salo, Thomas Worsch:
Sequentializing cellular automata. CoRR abs/1802.06668 (2018) - 2016
- [c23]Augusto Modanese
Shrinking and Expanding Cellular Automata. Automata 2016: 159-169 - 2015
- [j16]Alberto Dennunzio, Enrico Formenti
Foreword: asynchronous behavior of cellular automata and discrete models. Nat. Comput. 14(4): 505-506 (2015) - 2014
- [c22]Martin Kutrib
Degrees of Reversibility for DFA and DPDA. RC 2014: 40-53 - 2013
- [j15]Simon Wacker, Thomas Worsch:
On Completeness and Decidability of Phase Space Invertible Asynchronous Cellular Automata. Fundam. Informaticae 126(2-3): 157-181 (2013) - [j14]Thomas Worsch:
Towards intrinsically universal asynchronous CA. Nat. Comput. 12(4): 539-550 (2013) - [c21]Thomas Worsch:
Simulations between Asynchronous Cellular Automata for the Standardization of Their Set of States and Their Neighborhood. CANDAR 2013: 487-494 - [c20]Martin Kutrib
Time-Symmetric Machines. RC 2013: 168-181 - 2012
- [c19]Oliver Schneider, Thomas Worsch:
A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits. ACRI 2012: 565-574 - [c18]Thomas Worsch:
(Intrinsically?) Universal Asynchronous CA. ACRI 2012: 689-698 - [c17]Simon Wacker, Thomas Worsch:
Phase Space Invertible Asynchronous Cellular Automata. AUTOMATA & JAC 2012: 236-254 - 2010
- [j13]Hidenosuke Nishio, Thomas Worsch:
Changing the Neighborhood of Cellular Automata: Local Structure, Equivalence and Isomorphism. J. Cell. Autom. 5(3): 227-240 (2010) - [c16]Thomas Worsch, Hidenosuke Nishio:
Real-time Sorting of Binary Numbers on One-dimensional CA. JAC 2010: 214-225 - [e3]Nazim Fatès, Jarkko Kari, Thomas Worsch:
Automata 2010 - 16th Intl. Workshop on CA and DCS, Nancy, France, June 14-16, 2010. DMTCS Proceedings AL, DMTCS 2010 [contents] - [i1]Thomas Worsch, Hidenosuke Nishio:
Real-Time Sorting of Binary Numbers on One-Dimensional CA. CoRR abs/1012.0674 (2010)
2000 – 2009
- 2009
- [j12]Thomas Worsch, Hidenosuke Nishio:
Achieving Universality of CA by Changing the Neighborhood. J. Cell. Autom. 4(3): 237-246 (2009) - [r1]Thomas Worsch:
Cellular Automata as Models of Parallel Computation. Encyclopedia of Complexity and Systems Science 2009: 741-755 - 2008
- [c15]Thomas Worsch, Hidenosuke Nishio:
Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality. ACRI 2008: 252-259 - [c14]Hidenosuke Nishio, Thomas Worsch:
Changing the neighborhood of CA: local structure, equivalence and reversibility. Automata 2008: 270-277 - [c13]Thomas Worsch:
Cellular automata with dynamically reconfigurable buses. Automata 2008: 306-312 - [p2]Joachim Mathes, Argirios Perogiannakis, Thomas Worsch:
Doing IO with MPI and Benchmarking It with SKaMPI-5. High Performance Computing in Science and Engineering 2008: 599-613 - [e2]Andrew Adamatzky, Ramón Alonso-Sanz, Anna T. Lawniczak, Genaro Juárez Martínez, Kenichi Morita, Thomas Worsch:
Automata 2008: Theory and Applications of Cellular Automata, Bristol, UK, June 12-14, 2008. Luniver Press, Frome, UK 2008, ISBN 978-1-905986-16-3 [contents] - 2007
- [c12]Thomas Worsch, Hidenosuke Nishio:
Variations on Neighborhoods in CA. EUROCAST 2007: 581-588 - 2006
- [j11]Thomas Worsch:
Editorial. J. Cell. Autom. 1(4) (2006) - [p1]Werner Augustin, Marc-Oliver Straub, Thomas Worsch:
Benchmarking MPI One-sided Communication with SKaMPI-5. High Performance Computing in Science and Engineering 2006: 329-340 - 2005
- [c11]Werner Augustin, Marc-Oliver Straub, Thomas Worsch:
Benchmarking One-Sided Communication with SKaMPI 5. PVM/MPI 2005: 301-308 - 2004
- [c10]Richard Walter, Thomas Worsch:
Efficient Simulation of CA with Few Activities. ACRI 2004: 101-110 - [c9]Hubert Schmid, Thomas Worsch:
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. IFIP TCS 2004: 111-124 - 2003
- [j10]Thomas Worsch:
Simulations Between Cellular Automata on Trees Extended by Horizontal Edges. Fundam. Informaticae 58(2003): 241-260 (2003) - [c8]Werner Augustin, Thomas Worsch:
Usefulness and Usage of SKaMPI-Bench. PVM/MPI 2003: 63-70 - 2002
- [j9]Michael Stratmann, Thomas Worsch:
Leader election in d-dimensional CA in time diam log(diam). Future Gener. Comput. Syst. 18(7): 939-950 (2002) - [j8]Daniel Merkle, Thomas Worsch:
Formal language recognition by stochastic cellular automata. Fundam. Informaticae 52(1-3): 183-201 (2002) - [j7]Peter Sanders, Roland Vollmar, Thomas Worsch:
Cellular Automata: Energy Consumption and Physical Feasibility. Fundam. Informaticae 52(1-3): 233-248 (2002) - [c7]Thomas Worsch, Ralf H. Reussner
On Benchmarking Collective MPI Operations. PVM/MPI 2002: 271-279 - 2001
- [j6]Andreas Beckers, Thomas Worsch:
A perimeter-time CA for the queen bee problem. Parallel Comput. 27(5): 555-569 (2001) - 2000
- [c6]Thomas Worsch:
Linear Time Language Recognition on Cellular Automata with Restricted Communication. LATIN 2000: 417-426 - [e1]Stefania Bandini, Thomas Worsch:
Theoretical and Practical Issues on Cellular Automata, Proceedings of the Fourth International Conference on Cellular Automata for Research and Industry, Karlsruhe, 4-6 October 2000. Springer 2000, ISBN 1-85233-388-X [contents]
1990 – 1999
- 1999
- [j5]Thomas Worsch:
Simulation of cellular automata. Future Gener. Comput. Syst. 16(2-3): 157-170 (1999) - [j4]Thomas Worsch:
Parallel Turing Machines with One-Head Control Units and Cellular Automata. Theor. Comput. Sci. 217(1): 3-30 (1999) - [c5]Thomas Worsch:
Cellular Automata with Dynamically Reconfigurable Buses. SOFSEM 1999: 488-496 - 1997
- [b3]Peter Sanders, Thomas Worsch:
Parallele Programmierung mit MPI - ein Praktikum, Programmtexte im Internet. Logos Verlag 1997, ISBN 978-3-931216-76-4, pp. 1-150 - [j3]Martin Kutrib
Introduction to the Special Issue on Cellular Automata. Parallel Comput. 23(11): 1567-1576 (1997) - [j2]Thomas Worsch:
On Parallel Turing Machines with Multi-Head Control Units. Parallel Comput. 23(11): 1683-1697 (1997) - [c4]Peter Sanders, Roland Vollmar, Thomas Worsch:
Feasible Models of Computation: Three-Dimensionality and Energy Consumption. Euro-Par 1997: 384-388 - 1996
- [c3]Thomas Worsch:
Programming Environments for Cellular Automata. ACRI 1996: 3-12 - [c2]Alf-Christian Achilles, Martin Kutrib, Thomas Worsch:
On Relations between Arrays of Processing Elements of Different Dimensionality. Parcella 1996: 13-20 - 1995
- [b2]Roland Vollmar, Thomas Worsch:
Modelle der Parallelverarbeitung - eine Einführung. Leitfaeden der Informatik, Teubner 1995, ISBN 978-3-519-02138-4, pp. I-VIII, 1-215 - 1994
- [c1]Martin Kutrib, Thomas Worsch:
Investigation of Different Input Modes for Cellular Automata. Parcella 1994: 141-150 - 1992
- [j1]Hiroshi Umeo, Thomas Worsch, Roland Vollmar:
On the power of global-bus in mesh-connected architectures. Future Gener. Comput. Syst. 7(2-3): 161-168 (1992) - 1990
- [b1]Thomas Worsch:
Komplexitätstheoretische Untersuchungen an myopischen Polyautomaten. Braunschweig University of Technology, Germany, 1990, pp. I-V, 1-173
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-25 19:30 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: