| | |
- CSB - MetaPress - Google - Bing - Yahoo
 | 2011 | |
|---|---|---|
| 14 |      | Miklós Bartha, Miklós Krész: Molecular Switching by Turing Automata. NCMA 2011: 51-71 |
| 2009 | ||
| 13 |  | Miklós Bartha, Miklós Krész: A Depth-first Algorithm to Reduce Graphs in Linear Time. SYNASC 2009: 273-281 |
| 2008 | ||
| 12 | | Miklós Krész: Automata associated with open conjugated systems. AFL 2008: 232-244 |
| 11 | | Miklós Bartha, Miklós Krész: Splitters and Barriers in Open Graphs Having a Perfect Internal Matching. Acta Cybern. 18(4): 697-718 (2008) |
| 10 | | Miklós Krész: Soliton automata with constant external edges. Inf. Comput. 206(9-10): 1126-1141 (2008) |
| 2007 | ||
| 9 | | Miklós Krész: Nondeterministic soliton automata with a single external vertex. LATA 2007: 319-330 |
| 8 | | Miklós Krész: Graph Decomposition and Descriptional Complexity of Soliton Automata. Journal of Automata, Languages and Combinatorics 12(1-2): 237-263 (2007) |
| 2006 | ||
| 7 | | Miklós Bartha, Miklós Krész: Flexible Matchings. WG 2006: 313-324 |
| 6 | | Miklós Bartha, Miklós Krész: Deterministic Soliton Graphs. Informatica (Slovenia) 30(3): 281-288 (2006) |
| 2005 | ||
| 5 | | Miklós Krész: Simulation of Soliton Circuits. CIAA 2005: 347-348 |
| 4 | | Miklós Krész: On the descriptional complexity of soliton automata. DCFS 2005: 245-252 |
| 2004 | ||
| 3 | | Miklós Bartha, Miklós Krész: Tutte type theorems for graphs having a perfect internal matching. Inf. Process. Lett. 91(6): 277-284 (2004) |
| 2003 | ||
| 2 | | Miklós Bartha, Miklós Krész: Structuring the elementary components of graphs having a perfect internal matching. Theor. Comput. Sci. 1-3(299): 179-210 (2003) |
| 2000 | ||
| 1 | | Miklós Bartha, Miklós Krész: Elementary decomposition of soliton automata. Acta Cybern. 14(4): 631-652 (2000) |
| 1 | Miklós Bartha | [1] [2] [3] [6] [7] [11] [13] [14] |
Data released under the ODC-BY 1.0 license — See also our legal information page