| 2012 | ||
|---|---|---|
| c19 | Oliver Schneider, Thomas Worsch: A 3-State Asynchronous CA for the Simulation of Delay-Insensitive Circuits. ACRI 2012: 565-574 | |
| c18 | ||
| c17 | Simon Wacker, Thomas Worsch: Phase Space Invertible Asynchronous Cellular Automata. DCM 2012: 236-254 | |
| 2010 | ||
| j12 | Hidenosuke Nishio, Thomas Worsch: Changing the Neighborhood of Cellular Automata: Local Structure, Equivalence and Isomorphism. J. Cellular Automata 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 (Eds.): Automata 2010 - 16th Intl. Workshop on CA and DCS, Nancy, France, June 14-16, 2010. Discrete Mathematics and Theoretical Computer Science Proceedings, DMTCS 2010 | |
| i1 | Thomas Worsch, Hidenosuke Nishio: Real-Time Sorting of Binary Numbers on One-Dimensional CA. CoRR abs/1012.0674 (2010) | |
| 2009 | ||
| j11 | Thomas Worsch, Hidenosuke Nishio: Achieving Universality of CA by Changing the Neighborhood. J. Cellular Automata 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 | ||
| e2 | Andrew Adamatzky, Ramón Alonso-Sanz, Anna T. Lawniczak, Genaro Juárez Martínez, Kenichi Morita, Thomas Worsch (Eds.): 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 | |
| 2007 | ||
| c12 | ||
| 2006 | ||
| j10 | ||
| 2005 | ||
| c11 | Werner Augustin, Marc-Oliver Straub, Thomas Worsch: Benchmarking One-Sided Communication with SKaMPI 5. PVM/MPI 2005: 301-308 | |
| 2004 | ||
| c10 | ||
| c9 | Hubert Schmid, Thomas Worsch: The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA. IFIP TCS 2004: 111-124 | |
| 2003 | ||
| j9 | Thomas Worsch: Simulations Between Cellular Automata on Trees Extended by Horizontal Edges. Fundam. Inform. 58(2003): 241-260 (2003) | |
| c8 | ||
| 2002 | ||
| j8 | Michael Stratmann, Thomas Worsch: Leader election in d-dimensional CA in time diam log(diam). Future Generation Comp. Syst. 18(7): 939-950 (2002) | |
| j7 | Daniel Merkle, Thomas Worsch: Formal language recognition by stochastic cellular automata. Fundam. Inform. 52(1-3): 183-201 (2002) | |
| j6 | Peter Sanders, Roland Vollmar, Thomas Worsch: Cellular Automata: Energy Consumption and Physical Feasibility. Fundam. Inform. 52(1-3): 233-248 (2002) | |
| c7 | Thomas Worsch, Ralf Reussner, Werner Augustin: On Benchmarking Collective MPI Operations. PVM/MPI 2002: 271-279 | |
| 2001 | ||
| j5 | Andreas Beckers, Thomas Worsch: A perimeter-time CA for the queen bee problem. Parallel Computing 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 (Eds.): 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 | |
| 1999 | ||
| j4 | Thomas Worsch: Simulation of cellular automata. Future Generation Comp. Syst. 16(2-3): 157-170 (1999) | |
| j3 | Thomas Worsch: Parallel Turing Machines with One-Head Control Units and Cellular Automata. Theor. Comput. Sci. 217(1): 3-30 (1999) | |
| c5 | ||
| 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 | |
| j2 | Martin Kutrib, Roland Vollmar, Thomas Worsch: Introduction to the Special Issue on Cellular Automata. Parallel Computing 23(11): 1567-1576 (1997) | |
| j1 | Thomas Worsch: On Parallel Turing Machines with Multi-Head Control Units. Parallel Computing 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 | ||
| 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 | |
| 1991 | ||
| b1 | Thomas Worsch: Komplexitätstheoretische Untersuchungen an myopischen Polyautomaten. TU Braunschweig 1991, pp. I-V, 1-173 | |
Colors in the list of coauthors
Last update Wed May 22 19:41:18 2013 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page