| 2008 |
|---|
| 23 | EE | Thomas Worsch,
Hidenosuke Nishio:
Changing Neighborhoods of CA: Reduced Local Structures and Embeddings for Universality.
ACRI 2008: 252-259 |
| 2007 |
|---|
| 22 | EE | Thomas Worsch,
Hidenosuke Nishio:
Variations on Neighborhoods in CA.
EUROCAST 2007: 581-588 |
| 2005 |
|---|
| 21 | EE | Werner Augustin,
Marc-Oliver Straub,
Thomas Worsch:
Benchmarking One-Sided Communication with SKaMPI 5.
PVM/MPI 2005: 301-308 |
| 2004 |
|---|
| 20 | EE | Richard Walter,
Thomas Worsch:
Efficient Simulation of CA with Few Activities.
ACRI 2004: 101-110 |
| 19 | | Hubert Schmid,
Thomas Worsch:
The Firing Squad Synchronization Problem with Many Generals For One-Dimensional CA.
IFIP TCS 2004: 111-124 |
| 2003 |
|---|
| 18 | EE | Werner Augustin,
Thomas Worsch:
Usefulness and Usage of SKaMPI-Bench.
PVM/MPI 2003: 63-70 |
| 17 | EE | Thomas Worsch:
Simulations Between Cellular Automata on Trees Extended by Horizontal Edges.
Fundam. Inform. 58(2003): 241-260 (2003) |
| 2002 |
|---|
| 16 | EE | Thomas Worsch,
Ralf Reussner,
Werner Augustin:
On Benchmarking Collective MPI Operations.
PVM/MPI 2002: 271-279 |
| 15 | EE | Daniel Merkle,
Thomas Worsch:
Formal language recognition by stochastic cellular automata.
Fundam. Inform. 52(1-3): 183-201 (2002) |
| 14 | EE | Peter Sanders,
Roland Vollmar,
Thomas Worsch:
Cellular Automata: Energy Consumption and Physical Feasibility.
Fundam. Inform. 52(1-3): 233-248 (2002) |
| 13 | EE | Michael Stratmann,
Thomas Worsch:
Leader election in d-dimensional CA in time diam log(diam).
Future Generation Comp. Syst. 18(7): 939-950 (2002) |
| 2001 |
|---|
| 12 | | Andreas Beckers,
Thomas Worsch:
A perimeter-time CA for the queen bee problem.
Parallel Computing 27(5): 555-569 (2001) |
| 2000 |
|---|
| 11 | | 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 |
| 10 | | Thomas Worsch:
Linear Time Language Recognition on Cellular Automata with Restricted Communication.
LATIN 2000: 417-426 |
| 1999 |
|---|
| 9 | EE | Thomas Worsch:
Cellular Automata with Dynamically Reconfigurable Buses.
SOFSEM 1999: 488-496 |
| 8 | EE | Thomas Worsch:
Simulation of cellular automata.
Future Generation Comp. Syst. 16(2-3): 157-170 (1999) |
| 7 | EE | Thomas Worsch:
Parallel Turing Machines with One-Head Control Units and Cellular Automata.
Theor. Comput. Sci. 217(1): 3-30 (1999) |
| 1997 |
|---|
| 6 | | Peter Sanders,
Roland Vollmar,
Thomas Worsch:
Feasible Models of Computation: Three-Dimensionality and Energy Consumption.
Euro-Par 1997: 384-388 |
| 5 | | Martin Kutrib,
Roland Vollmar,
Thomas Worsch:
Introduction to the Special Issue on Cellular Automata.
Parallel Computing 23(11): 1567-1576 (1997) |
| 4 | | Thomas Worsch:
On Parallel Turing Machines with Multi-Head Control Units.
Parallel Computing 23(11): 1683-1697 (1997) |
| 1996 |
|---|
| 3 | | Thomas Worsch:
Programming Environments for Cellular Automata.
ACRI 1996: 3-12 |
| 2 | | Alf-Christian Achilles,
Martin Kutrib,
Thomas Worsch:
On Relations between Arrays of Processing Elements of Different Dimensionality.
Parcella 1996: 13-20 |
| 1994 |
|---|
| 1 | | Martin Kutrib,
Thomas Worsch:
Investigation of Different Input Modes for Cellular Automata.
Parcella 1994: 141-150 |
