| 2001 | On a P-optimal Proof System for the Set of All Satisfiable Boolean Formulas (SAT). | Zenon Sadowski |
| 2001 | On the Computational Power of a Continuous-Space Optical Model of Computation. | Thomas J. Naughton, Damien Woods |
| 2001 | P Systems with Membrane Creation: Universality and Efficiency. | Madhu Mutyam, Kamala Krithivasan |
| 2001 | A Simple Universal Logic Element and Cellular Automata for Reversible Computing. | Kenichi Morita |
| 2001 | Computing with Membranes (P Systems): Universality Results. | Carlos Martn-Vide, Gheorghe Paun |
| 2001 | Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. | Martin Kutrib |
| 2001 | Combinatorial and Computational Problems on Finite Sets of Words. | Juhani Karhumki |
| 2001 | Speeding-Up Cellular Automata by Alternations. | Chuzo Iwamoto, Katsuyuki Tateishi, Kenichi Morita, Katsunobu Imai |
| 2001 | Power, Puzzles and Properties of Entanglement. | Jozef Gruska, Hiroshi Imai |
| 2001 | A Direct Construction of a Universal Extended H System. | Pierluigi Frisco |
| 2001 | On the Number of Non-terminal Symbols in Graph-Controlled, Programmed and Matrix Grammars. | Rudolf Freund, Gheorghe Paun |
| 2001 | Nonterminal Complexity of Programmed Grammars. | Henning Fernau |
| 2001 | JC-Nets. | Gabriel Ciobanu, Mihai Rotaru |
| 2001 | On the Transition Graphs of Turing Machines. | Didier Caucal |
| 2001 | On a Conjecture of Kurka. A Turing Machine with No Periodic Configurations. | Vincent D. Blondel, Julien Cassaigne, Codrin M. Nichitiu |
| 2001 | Computation in Gene Networks. | Asa Ben-Hur, Hava T. Siegelmann |
| 2001 | Three Small Universal Turing Machines. | Claudio Baiocchi |
| 1998 | A deisgn of cellular algorithms for 1-bit inter-call communications and related cellular algorithms. | Hiroshi Umeo |
| 1998 | Foldede and Immersed Cellular Automata. | Jacqueline Signorini, Patrick Greussay |
| 1998 | A Theory of Complexity for Continuous Time Dynamics. | Hava T. Siegelmann, Asa Ben-Hur, Shmuel Fishman |
| 1998 | Complete Formal Systems for Equivalence Problems. | Graud Snizergues |
| 1998 | Intractability of Decision Problems for Finite-Memory Automata. | Hiroshi Sakamoto, Daisuke Ikeda |
| 1998 | On the notion of algorithmic decidability. | Liudmila Pavlotskaya |
| 1998 | DNA Computing Based on Splicing: Universality Results. | Gheorghe Paun |
| 1998 | On the Border of Universality and Non-Universality in Restricted High-Level Petri Nets. | Ulrich Nitsche |