dblp.uni-trier.dewww.uni-trier.de

Maurice Margenstern

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2009
87EEMaurice Margenstern: A new universal cellular automaton on the ternary heptagrid CoRR abs/0903.2108: (2009)
86EEMaurice Margenstern: Surprising Areas in the Quest for Small Universal Devices. Electr. Notes Theor. Comput. Sci. 225: 201-220 (2009)
85EEK. G. Subramanian, Rosihan M. Ali, Atulya K. Nagar, Maurice Margenstern: Array P Systems and t.Communication. Fundam. Inform. 91(1): 145-159 (2009)
2008
84EEMaurice Margenstern, Benoît Martin, Hiroshi Umeo, Shogo Yamano, Kazuhiro Nishioka: A Proposal for a Japanese Keyboard on Cellular Phones. ACRI 2008: 299-306
83 Maurice Margenstern: The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. CSP 2008: 201-214
82EEArtiom Alhazov, Maurice Margenstern, Sergey Verlan: Fast Synchronization in P Systems. Workshop on Membrane Computing 2008: 118-128
81EEMaurice Margenstern: The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable CoRR abs/0806.1602: (2008)
80EEMaurice Margenstern, Yu Song: A Universal Cellular Automaton on the Ternary Heptagrid. Electr. Notes Theor. Comput. Sci. 223: 167-185 (2008)
79EEMaurice Margenstern: The Finite Tiling Problem is Undecidable in the Hyperbolic Plane. Int. J. Found. Comput. Sci. 19(4): 971-982 (2008)
78EEFrancesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan: How to Synchronize the Activity of All Components of a P System? Int. J. Found. Comput. Sci. 19(5): 1183-1198 (2008)
77EEMaurice Margenstern: On a Characterization of Cellular Automata in Tilings of the Hyperbolic Plane. Int. J. Found. Comput. Sci. 19(5): 1235-1257 (2008)
76EEMaurice Margenstern: Research Notices: The injectivity of the global function of a cellular automaton in the hyperbolic plane is undecidable. SIGACT News 39(3): 40 (2008)
75EESergey Verlan, Francesco Bernardini, Marian Gheorghe, Maurice Margenstern: Generalized communicating P systems. Theor. Comput. Sci. 404(1-2): 170-184 (2008)
74EEGiuditta Franco, Maurice Margenstern: A DNA computing inspired computational model. Theor. Comput. Sci. 404(1-2): 88-96 (2008)
73EEMaurice Margenstern: The domino problem of the hyperbolic plane is undecidable. Theor. Comput. Sci. 407(1-3): 29-84 (2008)
2007
72 Jérôme Olivier Durand-Lose, Maurice Margenstern: Machines, Computations, and Universality, 5th International Conference, MCU 2007, Orléans, France, September 10-13, 2007, Proceedings Springer 2007
71EEFrancesco Bernardini, Marian Gheorghe, Maurice Margenstern, Sergey Verlan: Producer/Consumer in Membrane Systems and Petri Nets. CiE 2007: 43-52
70EEMaurice Margenstern: About the domino problem in the hyperbolic plane, a new solution: complement CoRR abs/0705.0086: (2007)
69EEMaurice Margenstern: The Domino Problem of the Hyperbolic Plane Is Undecidable CoRR abs/0706.4161: (2007)
68EEMaurice Margenstern: Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane CoRR abs/0710.0232: (2007)
67EEMaurice Margenstern: Is the injectivity of the global function of a cellular automaton in the hyperbolic plane undecidable? CoRR abs/0712.2577: (2007)
66EEMaurice Margenstern: About the domino problem in the hyperbolic plane, a new solution CoRR abs/cs/0701096: (2007)
65EEMaurice Margenstern: On a characterization of cellular automata in tilings of the hyperbolic plane CoRR abs/cs/0702155: (2007)
64EEMaurice Margenstern: The finite tiling problem is undecidable in the hyperbolic plane CoRR abs/cs/0703147: (2007)
63EEMaurice Margenstern: The periodic domino problem is undecidable in the hyperbolic plane CoRR abs/cs/0703153: (2007)
62EEGiuditta Franco, Maurice Margenstern: Computing by Floating Strings. Electr. Notes Theor. Comput. Sci. 171(2): 95-104 (2007)
61EEHidenosuke Nishio, Maurice Margenstern, Friedrich von Haeseler: On Algebraic Structure of Neighborhoods of Cellular AutomataHorse Power Problem. Fundam. Inform. 78(3): 397-416 (2007)
60EEMaurice Margenstern: Constructing a uniform plane-filling path in the ternary heptagrid of the hyperbolic plane. The Computer Science Journal of Moldova 15(3): 247-277 (2007)
59EEErzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil, Sergey Verlan: On small universal antiport P systems. Theor. Comput. Sci. 372(2-3): 152-164 (2007)
2006
58 Maurice Margenstern: An Algorithm for Buiding Inrinsically Universal Automata in Hyperbolic Spaces. FCS 2006: 3-9
57EEErzsébet Csuhaj-Varjú, Maurice Margenstern, György Vaszil: P Colonies with a Bounded Number of Cells and Programs. Workshop on Membrane Computing 2006: 352-366
56EESergey Verlan, Francesco Bernardini, Marian Gheorghe, Maurice Margenstern: Computational Completeness of Tissue P Systems with Conditional Uniport. Workshop on Membrane Computing 2006: 521-535
55EEMaurice Margenstern: About the domino problem in the hyperbolic plane from an algorithmic point of view CoRR abs/cs/0603093: (2006)
54EEMaurice Margenstern: On the communication between cells of a cellular automaton on the penta- and heptagrids of the hyperbolic plane CoRR abs/cs/0606012: (2006)
53EEMaurice Margenstern, Guentcho Skordev: Substitutions for tilings $\{p,q\}$ CoRR abs/cs/0611039: (2006)
52EEMaurice Margenstern: Machines, Computations and Universality. Fundam. Inform. 74(4): (2006)
51EEMaurice Margenstern: About an Algorithmic Approach to Tilings {p, q} of the Hyperbolic Plane. J. UCS 12(5): 512-550 (2006)
2005
50 Maurice Margenstern: Machines, Computations, and Universality, 4th International Conference, MCU 2004, Saint Petersburg, Russia, September 21-24, 2004, Revised Selected Papers Springer 2005
49EEFrancesco Bernardini, Francisco José Romero-Campero, Marian Gheorghe, Mario J. Pérez-Jiménez, Maurice Margenstern, Sergey Verlan, Natalio Krasnogor: On P Systems with Bounded Parallelism. SYNASC 2005: 399-406
48EEMaurice Margenstern, Sergey Verlan, Yurii Rogozhin: Time-Varying Distributed H Systems: An Overview. Fundam. Inform. 64(1-4): 291-306 (2005)
47EESergey Verlan, Maurice Margenstern: About Splicing P Systems with One Membrane. Fundam. Inform. 65(3): 279-290 (2005)
46EEMaurice Margenstern, Gheorghe Paun, Yurii Rogozhin, Sergey Verlan: Context-free insertion-deletion systems. Theor. Comput. Sci. 330(2): 339-348 (2005)
2004
45EEKamel Chelghoum, Maurice Margenstern, Benoît Martin, Isabelle Pecci: Cellular Automata in the Hyperbolic Plane: Proposal for a New Environment. ACRI 2004: 678-687
44EETero Harju, Maurice Margenstern: Splicing Systems for Universal Turing Machines. DNA 2004: 149-158
43EEMaurice Margenstern, Victor Mitrana, Mario J. Pérez-Jiménez: Accepting Hybrid Networks of Evolutionary Processors. DNA 2004: 235-246
42EEKamel Chelghoum, Maurice Margenstern, Benoît Martin, Isabelle Pecci: Palette hyperbolique: un outil pour interagir avec des ensembles de donneacute;es. IHM 2004: 195-198
41EELoïc Colson, Natasa Jonoska, Maurice Margenstern: lambda-P Systems and Typed lambda-Calculus. Workshop on Membrane Computing 2004: 1-18
40EEArtiom Alhazov, Maurice Margenstern, Vladimir Rogozhin, Yurii Rogozhin, Sergey Verlan: Communicative P Systems with Minimal Cooperation. Workshop on Membrane Computing 2004: 161-177
39EENatasa Jonoska, Maurice Margenstern: Tree Operations in P Systems and lamda-Calculus. Fundam. Inform. 59(1): 67-90 (2004)
38EESerge Grigorieff, Maurice Margenstern: Register Cellular Automata in the Hyperbolic Plane. Fundam. Inform. 61(1): 19-27 (2004)
37EEMaurice Margenstern: The Tiling of the Hyperbolic 4D Space by the 120-cell is Combinatoric. J. UCS 10(9): 1212-1238 (2004)
2003
36 Maurice Margenstern: A Combinatorial Approach to Hyperbolic Geometry as a New Perspective for Computer Science and Technology. Computers and Their Applications 2003: 468-471
35EEMaurice Margenstern: Cellular Automata and Combinatoric Tilings in Hyperbolic Spaces. A Survey. DMTCS 2003: 48-72
34EEMaurice Margenstern, Yurii Rogozhin, Sergey Verlan: Time-Varying Distributed H Systems with Parallel Computations: The Problem Is Solved. DNA 2003: 48-53
33EEFranziska Freund, Rudolf Freund, Marion Oswald, Maurice Margenstern, Yurii Rogozhin, Sergey Verlan: P Systems with Cutting/Recombination Rules Assigned to Membranes. Workshop on Membrane Computing 2003: 191-202
32EEMaurice Margenstern: Can Hyperbolic Geometry Be of Help for P Systems?. Workshop on Membrane Computing 2003: 240-249
31EEMaurice Margenstern: On the Infinigons of the Hyperbolic Plane, A combinatorial approach. Fundam. Inform. 56(3): 255-272 (2003)
30EEMartin Kutrib, Maurice Margenstern, Hiroshi Umeo: Foreword. Fundam. Inform. 58(2003): (2003)
29EEMaurice Margenstern, Guentcho Skordev: Tools for devising cellular automata in the hyperbolic 3D space. Fundam. Inform. 58(2003): 369-398 (2003)
28EEMaurice Margenstern, Lioudmila Pavlotskaïa: On the Optimal Number of Instructions for Universal Turing Machines Connected With a Finite Automaton. IJAC 13(2): 133-202 (2003)
27EEMaurice Margenstern, Guentcho Skordev: Fibonacci Type Coding for the Regular Rectangular Tilings of the Hyperbolic Plane. J. UCS 9(5): 398-422 (2003)
26EEFrancine Herrmann, Maurice Margenstern: A universal cellular automaton in the hyperbolic plane. Theor. Comput. Sci. 296(2): 327-364 (2003)
2002
25EEMaurice Margenstern, Yurii Rogozhin, Sergey Verlan: Time-Varying Distributed H Systems of Degree 2 Can Carry Out Parallel Computations. DNA 2002: 326-336
24 Maurice Margenstern, Yurii Rogozhin: Self-describing Turing machines. Fundam. Inform. 50(3-4): 285-303 (2002)
23EEMaurice Margenstern: Tiling the Hyperbolic Plane with a Single Pentagonal Tile. J. UCS 8(2): 297-316 (2002)
2001
22 Maurice Margenstern, Yurii Rogozhin: Machines, Computations, and Universality, Third International Conference, MCU 2001, Chisinau, Moldavia, May 23-27, 2001, Proceedings Springer 2001
21EEMaurice Margenstern, Carlos Martín-Vide, Gheorghe Paun: Computing with Membranes: Variants with an Enhanced Membrane Handling. DNA 2001: 340-349
20EEMaurice Margenstern, Yurii Rogozhin: A Universal Time-Varying Distributed H System of Degree 1. DNA 2001: 371-380
19 Maurice Margenstern, Yurii Rogozhin: Time-Varying Distributed H Systems of Degree 1 Generate All Recursively Enumerable Languages. Words, Semigroups, and Transductions 2001: 329-339
18EEMaurice Margenstern: On quasi-unilateral universal Turing machines. Theor. Comput. Sci. 257(1-2): 153-166 (2001)
17EEMaurice Margenstern, Kenichi Morita: NP problems are tractable in the space of cellular automata in the hyperbolic plane. Theor. Comput. Sci. 259(1-2): 99-128 (2001)
2000
16EEMaurice Margenstern, Yurii Rogozhin: About Time-Varying Distributed H Systems. DNA Computing 2000: 53-62
15EEMaurice Margenstern: New Tools for Cellular Automata in the Hyperbolic Plane. J. UCS 6(12): 1226-1252 (2000)
14EEMaurice Margenstern: Frontier between decidability and undecidability: a survey. Theor. Comput. Sci. 231(2): 217-251 (2000)
1999
13 Kenichi Morita, Maurice Margenstern, Katsunobu Imai: Universality of Reversible Hexagonal Cellular Automata. ITA 33(6): 535-550 (1999)
12EEMaurice Margenstern, Kenichi Morita: A Polynomial Solution for 3-SAT in the Space of Cellular Automata in the Hyperbolic Plane. J. UCS 5(9): 563-573 (1999)
11EEHava T. Siegelmann, Maurice Margenstern: Nine switch-affine neurons suffice for Turing universality. Neural Networks 12(4-5): 593-600 (1999)
1998
10 Maurice Margenstern: International Colloquium Universal Machines and Computations, MCU'98, Metz, France, March 23-27, 1998, Proceedings, Volume I IUT Metz 1998
9 Maurice Margenstern: International Colloquium Universal Machines and Computations, MCU'98, Metz, France, March 23-27, 1998, Proceedingsi, Volume II IUT Metz 1998
8 Maurice Margenstern: Frontier between decidability and undecidability: a survey. MCU (1) 1998: 141-177
1997
7 Maurice Margenstern: Decidability and Undecidability of the Halting Problem on Turing Machines, a Survey. LFCS 1997: 226-236
6 Maurice Margenstern: The Laterality Problem for Non-Erasing Turing Machines on {0, 1} is Completely Solved. ITA 31(2): 159-204 (1997)
5EEEric Goles Ch., Maurice Margenstern: Universality of the Chip-Firing Game. Theor. Comput. Sci. 172(1-2): 121-134 (1997)
1996
4 Maurice Margenstern: Foreword: Universal Machines and Computations. Theor. Comput. Sci. 168(2): 213-214 (1996)
1995
3 Maurice Margenstern: Non-Erasing Turing Machines: A New Frontier Between a Decidable Halting Problem and Universality. LATIN 1995: 386-397
1994
2 Maurice Margenstern: Nonerasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. Theor. Comput. Sci. 129(2): 419-424 (1994)
1993
1 Maurice Margenstern: Non Erasing Turing Machines: A Frontier Between a Decidable Halting Problem and Universality. FCT 1993: 375-385

Coauthor Index

1Artiom Alhazov [40] [82]
2Rosihan M. Ali [85]
3Francesco Bernardini [49] [56] [71] [75] [78]
4Eric Goles Ch. [5]
5Kamel Chelghoum [42] [45]
6Loïc Colson [41]
7Erzsébet Csuhaj-Varjú [57] [59]
8Jérôme Olivier Durand-Lose (Jérôme Durand-Lose) [72]
9Giuditta Franco [62] [74]
10Franziska Freund [33]
11Rudolf Freund [33]
12Marian Gheorghe [49] [56] [71] [75] [78]
13Serge Grigorieff [38]
14Friedrich von Haeseler [61]
15Tero Harju [44]
16Francine Herrmann [26]
17Katsunobu Imai [13]
18Natasa Jonoska (Natasha Jonoska) [39] [41]
19Natalio Krasnogor [49]
20Martin Kutrib [30]
21Benoît Martin [42] [45] [84]
22Carlos Martín-Vide [21]
23Victor Mitrana [43]
24Kenichi Morita [12] [13] [17]
25Atulya K. Nagar [85]
26Hidenosuke Nishio [61]
27Kazuhiro Nishioka [84]
28Marion Oswald [33]
29Gheorghe Paun [21] [46]
30Lioudmila Pavlotskaïa [28]
31Isabelle Pecci [42] [45]
32Mario J. Pérez-Jiménez [43] [49]
33Vladimir Rogozhin [40]
34Yurii Rogozhin [16] [19] [20] [22] [24] [25] [33] [34] [40] [46] [48]
35Francisco José Romero-Campero [49]
36Hava T. Siegelmann [11]
37Guentcho Skordev [27] [29] [53]
38Yu Song [80]
39K. G. Subramanian [85]
40Hiroshi Umeo [30] [84]
41György Vaszil [57] [59]
42Sergey Verlan [25] [33] [34] [40] [46] [47] [48] [49] [56] [59] [71] [75] [78] [82]
43Shogo Yamano [84]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)