![]() | ![]() |
Ask others: ACM DL/Guide -
- CSB - MetaPress - Google - Bing - Yahoo
| 116 | Rudolf Freund, Marian Kogler, Marion Oswald: A General Framework for Regulated Rewriting Based on the Applicability of Rules. Computation, Cooperation, and Life 2011: 35-53 | |
| 102 | Artiom Alhazov, Marion Oswald, Rudolf Freund, Sergey Verlan: Partial Halting and Minimal Parallelism Based on Arbitrary Rule Partitions. Fundam. Inform. 91(1): 17-34 (2009) | |
| 101 | Cristian S. Calude, José Félix Costa, Rudolf Freund, Marion Oswald, Grzegorz Rozenberg: Unconventional Computing, 7th International Conference, UC 2008, Vienna, Austria, August 25-28, 2008. Proceedings Springer 2008 | |
| 99 | Rudolf Freund, Marion Oswald: Regular omega-Languages Defined by Finite Extended Spiking Neural P Systems. Fundam. Inform. 83(1-2): 65-73 (2008) | |
| 98 | Rudolf Freund, Marion Oswald: Cd Grammar Systems with Regular Start Conditions. Int. J. Found. Comput. Sci. 19(4): 767-779 (2008) | |
| 97 | Rudolf Freund, Mihai Ionescu, Marion Oswald: Extended Spiking Neural P Systems with Decaying Spikes and/or Total Spiking. Int. J. Found. Comput. Sci. 19(5): 1223-1234 (2008) | |
| 96 | Rudolf Freund, Marion Oswald: CD Grammar Systems with Regular Start Conditions. DCFS 2007: 69-80 | |
| 95 | Artiom Alhazov, Rudolf Freund, Marion Oswald, Sergey Verlan: Partial Halting in P Systems Using Membrane Rules with Permitting Contexts. MCU 2007: 110-121 | |
| 92 | Rudolf Freund, Marion Oswald: Tissue P Systems and (Mem)Brane Systems with Mate and Drip Operations Working on Strings. Electr. Notes Theor. Comput. Sci. 171(2): 105-115 (2007) | |
| 90 | Rudolf Freund, Marion Oswald: Modelling Grammar Systems by Tissue P Systems Working in the Sequential Mode. Fundam. Inform. 76(3): 305-323 (2007) | |
| 88 | Rudolf Freund, Marion Oswald: Partial Halting in P Systems. Int. J. Found. Comput. Sci. 18(6): 1215-1225 (2007) | |
| 87 | Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-Controlled, Programmed, and Matrix Grammars. Journal of Automata, Languages and Combinatorics 12(1-2): 117-138 (2007) | |
| 86 | Matteo Cavaliere, Rudolf Freund, Marion Oswald, Dragos Sburlan: Multiset random context grammars, checkers, and transducers. Theor. Comput. Sci. 372(2-3): 136-151 (2007) | |
| 83 | Rudolf Freund, Marion Oswald: A Small Universal Antiport P System with Forbidden Context. DCFS 2006: 259-266 | |
| 82 | Artiom Alhazov, Rudolf Freund, Marion Oswald, Marija Slavkovik: Extended Spiking Neural P Systems. Workshop on Membrane Computing 2006: 123-134 | |
| 78 | Artiom Alhazov, Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron: (Tissue) P Systems with Unit Rules and Energy Assigned to Membranes. Fundam. Inform. 74(4): 391-408 (2006) | |
| 76 | Rudolf Freund, Marion Oswald: P colonies and prescribed teams. Int. J. Comput. Math. 83(7): 569-592 (2006) | |
| 75 | Artiom Alhazov, Rudolf Freund, Marion Oswald: Cell/symbol complexity of tissue P systems with symport/antiport rules. Int. J. Found. Comput. Sci. 17(1): 3-25 (2006) | |
| 73 | Henning Fernau, Rudolf Freund, Marion Oswald, Klaus Reinhardt: Refining the Nonterminal Complexity of Graph-controlled Grammars. DCFS 2005: 110-121 | |
| 72 | Artiom Alhazov, Rudolf Freund, Marion Oswald: Tissue P Systems with Antiport Rules and Small Numbers of Symbols and Cells. Developments in Language Theory 2005: 100-111 | |
| 70 | Rudolf Freund, Marion Oswald: P Colonies Working in the Maximally Parallel and in the Sequential Mode. SYNASC 2005: 419-426 | |
| 68 | Artiom Alhazov, Rudolf Freund, Marion Oswald: Symbol/Membrane Complexity of P Systems with Symport/Antiport Rules. Workshop on Membrane Computing 2005: 96-113 | |
| 65 | Rudolf Freund, Marion Oswald, Andrei Paun: Optimal results for the computational completeness of gemmating (tissue) P systems. Int. J. Found. Comput. Sci. 16(5): 929-942 (2005) | |
| 62 | Rudolf Freund, Lila Kari, Marion Oswald, Petr Sosík: Computationally universal P systems without priorities: two catalysts are sufficient. Theor. Comput. Sci. 330(2): 251-266 (2005) | |
| 61 | Franziska Freund, Rudolf Freund, Marion Oswald: Splicing Test Tube Systems and Their Relation to Splicing Membrane Systems. Aspects of Molecular Computing 2004: 139-151 | |
| 60 | Aneta Binder, Rudolf Freund, Georg Lojka, Marion Oswald: Implementation of Catalytic P Systems. CIAA 2004: 45-56 | |
| 59 | Rudolf Freund, Marion Oswald, Andrei Paun: Gemmating P Systems are Computationally Complete with Four Membranes. DCFS 2004: 191-203 | |
| 57 | Rudolf Freund, Alberto Leporati, Marion Oswald, Claudio Zandron: Sequential P Systems with Unit Rules and Energy Assigned to Membranes. MCU 2004: 200-210 | |
| 54 | Rudolf Freund, Marion Oswald, Andrei Paun: P Systems Generating Trees. Workshop on Membrane Computing 2004: 309-319 | |
| 52 | Rudolf Freund, Marion Oswald: P Systems with Conditional Communication Rules Assigned to Membranes. Journal of Automata, Languages and Combinatorics 9(4): 387-397 (2004) | |
| 51 | Rudolf Freund, Marion Oswald: P Systems with Local Graph Productions. New Generation Comput. 22(4): 365-375 (2004) | |
| 49 | Rudolf Freund, Marion Oswald, Petr Sosík: Reducing the Number of Catalysts Needed in Computationally Universal P Systems without Priorities. DCFS 2003: 102-113 | |
| 46 | Franziska 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 | |
| 45 | Rudolf Freund, Marion Oswald, Ludwig Staiger: omega-P Automata with Communication Rules. Workshop on Membrane Computing 2003: 203-217 | |
| 41 | Rudolf Freund, Marion Oswald: P Systems with Activated/Prohibited Membrane Channels. WMC-CdeA 2002: 261-269 | |
| 38 | Rudolf Freund, Marion Oswald: A Short Note on Analysing P Systems with Antiport Rules. Bulletin of the EATCS 78: 231-236 (2002) | |
| 37 | Rudolf Freund, Marion Oswald: GP Systems with Forbidding Context. Fundam. Inform. 49(1-3): 81-102 (2002) |
Selection of 37 from 119 records - Rudolf Freund has 64 coauthors
Last update 2012-09-10 CET by the DBLP Team —
Content released under the ODC-BY 1.0 license — See also our legal information page