| 2012 | ICCCI | Ten Years of Weakly Universal Cellular Automata in the Hyperbolic Plane. | Maurice Margenstern |
| 2012 | UC | Universality and the Halting Problem for Cellular Automata in Hyperbolic Spaces: The Side of the Halting Problem. | Maurice Margenstern |
| 2010 | UC | Majority Adder Implementation by Competing Patterns in Life-Like Rule | Genaro Jurez Martnez, Kenichi Morita, Andrew Adamatzky, Maurice Margenstern |
| 2007 | CiE | Producer/Consumer in Membrane Systems and Petri Nets. | Francesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan |
| 2005 | SYNASC | On P Systems with Bounded Parallelism. | Francesco Bernardini, Francisco Jos Romero-Campero, Marian Gheorghe, Mario J. Prez-Jimnez, Maurice Margenstern, Sergey Verlan, Natalio Krasnogor |
| 2004 | DNA | Splicing Systems for Universal Turing Machines. | Tero Harju, Maurice Margenstern |
| 2004 | DNA | Accepting Hybrid Networks of Evolutionary Processors. | Maurice Margenstern, Victor Mitrana, Mario J. Prez-Jimnez |
| 2003 | CATA | A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology. | Maurice Margenstern |
| 2003 | DNA | Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. | Maurice Margenstern, Yurii Rogozhin, Sergey Verlan |
| 2002 | DNA | Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. | Maurice Margenstern, Yurii Rogozhin, Sergey Verlan |
| 2001 | DNA | Computing with Membranes: Variants with an Enhanced Membrane Handling. | Maurice Margenstern, Carlos Martn-Vide, Gheorghe Paun |
| 2001 | DNA | A Universal Time-Varying Distributed H System of Degree 1. | Maurice Margenstern, Yurii Rogozhin |
| 2000 | DNA | About Time-Varying Distributed H Systems. | Maurice Margenstern, Yurii Rogozhin |
| 1998 | MCU | Frontier between decidability and undecidability: a survey. | Maurice Margenstern |
| 1997 | LFCS | Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. | Maurice Margenstern |
| 1995 | LATIN | Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. | Maurice Margenstern |
| 1993 | FCT | Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. | Maurice Margenstern |