The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Martin Kutrib: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Martin Kutrib, Jan-Thomas Löwe
    Fault Tolerant Parallel Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    ACRI, 2000, pp:72-80 [Conf]
  2. Andreas Klein, Martin Kutrib
    Self-Assembling Finite Automata. [Citation Graph (0, 0)][DBLP]
    COCOON, 2002, pp:310-319 [Conf]
  3. Thomas Buchholz, Andreas Klein, Martin Kutrib
    On tally languages and generalized interacting automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:316-325 [Conf]
  4. Henning Bordihn, Markus Holzer, Martin Kutrib
    Input Reversals and Iterated Pushdown Automata: A New Characterization of Khabbaz Geometric Hierarchy of Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:102-113 [Conf]
  5. Henning Bordihn, Markus Holzer, Martin Kutrib
    Revolving-Input Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:168-179 [Conf]
  6. Markus Holzer, Martin Kutrib
    Unary Language Operations and Their Nondeterministic State Complexity. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:162-172 [Conf]
  7. Markus Holzer, Martin Kutrib
    Flip-Pushdown Automata: Nondeterminism Is Better than Determinism. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:361-372 [Conf]
  8. Martin Kutrib, Andreas Malcher
    Context-Dependent Nondeterminism for Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:133-144 [Conf]
  9. Martin Kutrib, Andreas Malcher, Detlef Wotschke
    The Boolean Closure of Linear Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:284-295 [Conf]
  10. Martin Kutrib, Jörg Richstein
    Real-Time One-Way Pushdown Cellular Automata Languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:420-429 [Conf]
  11. Thomas Buchholz, Andreas Klein, Martin Kutrib
    Iterative Arrays with a Wee Bit Alternation. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:173-184 [Conf]
  12. Martin Kutrib
    Dimension- and Time-Hierarchies for Small Time Bounds. [Citation Graph (0, 0)][DBLP]
    FCT, 2003, pp:321-332 [Conf]
  13. Markus Holzer, Martin Kutrib
    Flip-Pushdown Automata: k+1 Pushdown Reversals Are Better than k. [Citation Graph (0, 0)][DBLP]
    ICALP, 2003, pp:490-501 [Conf]
  14. Thomas Buchholz, Andreas Klein, Martin Kutrib
    Real-Time Language Recognition by Alternating Cellular Automata. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2000, pp:213-225 [Conf]
  15. Markus Holzer, Martin Kutrib
    Register Complexity of LOOP-, WHILE-, and GOTO-Programs. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:233-244 [Conf]
  16. Martin Kutrib
    Efficient Universal Pushdown Cellular Automata and Their Application to Complexity. [Citation Graph (0, 0)][DBLP]
    MCU, 2001, pp:252-263 [Conf]
  17. Thomas Buchholz, Andreas Klein, Martin Kutrib
    Iterative Arrays with Small Time Bounds. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:243-252 [Conf]
  18. Thomas Buchholz, Andreas Klein, Martin Kutrib
    One Guess One-Way Cellular Arrays. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:807-815 [Conf]
  19. Andreas Klein, Martin Kutrib
    A Time Hierarchy for Bounded One-Way Cellular Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:439-450 [Conf]
  20. Martin Kutrib, Andreas Malcher
    Fast Iterative Arrays with Restricted Inter-cell Communication: Constructions and Decidability. [Citation Graph (0, 0)][DBLP]
    MFCS, 2006, pp:634-645 [Conf]
  21. Martin Kutrib, Jan-Thomas Löwe
    Massively Parallel Pattern Recognition with Link Failures. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2000, pp:392-401 [Conf]
  22. Martin Kutrib, Jan-Thomas Löwe
    String Transformation for n -Dimensional Image Compression. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2002, pp:208-217 [Conf]
  23. Markus Holzer, Martin Kutrib
    Improving Raster Image Run-Length Encoding Using Data Order. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:161-176 [Conf]
  24. Markus Holzer, Martin Kutrib
    State Complexity of Basic Operations on Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:148-157 [Conf]
  25. Henning Bordihn, Markus Holzer, Martin Kutrib
    Some Non-semi-decidability Problems for Linear and Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    CIAA, 2004, pp:68-79 [Conf]
  26. Henning Bordihn, Markus Holzer, Martin Kutrib
    Hybrid Extended Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:34-45 [Conf]
  27. Thomas Buchholz, Martin Kutrib
    On Time Computability of Functions in One-Way Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:4, pp:329-352 [Journal]
  28. Andreas Klein, Martin Kutrib
    Deterministic Turing Machines in the Range between Real-Time and Linear-Time [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:75, pp:- [Journal]
  29. Martin Kutrib, Roland Vollmar
    Minimal Time Synchronization in Restricted Defective Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1991, v:27, n:3, pp:179-196 [Journal]
  30. Martin Kutrib, Jan-Thomas Löwe
    Massively parallel fault tolerant computations on syntactical patterns. [Citation Graph (0, 0)][DBLP]
    Future Generation Comp. Syst., 2002, v:18, n:7, pp:905-919 [Journal]
  31. Thomas Buchholz, Andreas Klein, Martin Kutrib
    On Interacting Automata with Limited Nondeterminism. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2002, v:52, n:1-3, pp:15-38 [Journal]
  32. Martin Kutrib, Jan-Thomas Löwe
    Space- and Time-Bounded Nondeterminism for Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:2003, pp:273-293 [Journal]
  33. Martin Kutrib, Maurice Margenstern, Hiroshi Umeo
    Foreword. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2003, v:58, n:2003, pp:- [Journal]
  34. Markus Holzer, Martin Kutrib
    Variable Complexity of Simple Programs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2006, v:74, n:4, pp:511-528 [Journal]
  35. Henning Bordihn, Markus Holzer, Martin Kutrib
    Unsolvability levels of operation problems for subclasses of context-free languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:3, pp:423-440 [Journal]
  36. Markus Holzer, Martin Kutrib
    Nondeterministic Descriptional Complexity Of Regular Languages. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:6, pp:1087-1102 [Journal]
  37. Martin Kutrib
    The phenomenon of non-recursive trade-offs. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:5, pp:957-973 [Journal]
  38. Martin Kutrib
    Refining Nondeterminism Below Linear Time. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:533-547 [Journal]
  39. Thomas Buchholz, Martin Kutrib
    Some Relations Between Massively Parallel Arrays. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1997, v:23, n:11, pp:1643-1662 [Journal]
  40. Martin Kutrib, Roland Vollmar, Thomas Worsch
    Introduction to the Special Issue on Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Parallel Computing, 1997, v:23, n:11, pp:1567-1576 [Journal]
  41. Markus Holzer, Martin Kutrib
    On the descriptional complexity of finite automata with modified acceptance conditions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:267-285 [Journal]
  42. Andreas Klein, Martin Kutrib
    Deterministic Turing machines in the range between real-time and linear-time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:289, n:1, pp:253-275 [Journal]
  43. Andreas Klein, Martin Kutrib
    Fast one-way cellular automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:, pp:233-250 [Journal]
  44. Martin Kutrib
    On the descriptional power of heads, counters, and pebbles. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:330, n:2, pp:311-324 [Journal]
  45. Martin Kutrib
    Pushdown Cellular Automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:215, n:1-2, pp:239-261 [Journal]
  46. Martin Kutrib, Andreas Malcher
    Context-dependent nondeterminism for pushdown automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:376, n:1-2, pp:101-111 [Journal]
  47. Henning Bordihn, Markus Holzer, Martin Kutrib
    Hairpin Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:108-119 [Conf]
  48. Martin Kutrib, Andreas Malcher
    Real-Time Reversible Iterative Arrays. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:376-387 [Conf]
  49. Hermann Gruber, Markus Holzer, Martin Kutrib
    More on the Size of Higman-Haines Sets: Effective Constructions. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:193-204 [Conf]
  50. Martin Kutrib, Andreas Malcher, Larissa Werlein
    Regulated Nondeterminism in Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:85-96 [Conf]
  51. Martin Kutrib, Andreas Malcher
    Finite turns and the regular closure of linear context-free languages. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:16, pp:2152-2164 [Journal]
  52. Andreas Klein, Martin Kutrib
    Cellular Devices and Unary Languages. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:78, n:3, pp:343-368 [Journal]

  53. On the Computational Capacity of Parallel Communicating Finite Automata. [Citation Graph (, )][DBLP]


  54. On the power of one-way bounded cellular time computers. [Citation Graph (, )][DBLP]


  55. The Complexity of Regular(-Like) Expressions. [Citation Graph (, )][DBLP]


  56. Undecidability and Hierarchy Results for Parallel Communicating Finite Automata. [Citation Graph (, )][DBLP]


  57. Fast Cellular Automata with Restricted Inter-Cell Communication: Computational Capacity. [Citation Graph (, )][DBLP]


  58. On Relations between Arrays of Processing Elements of Different Dimensionality. [Citation Graph (, )][DBLP]


  59. Investigation of Different Input Modes for Cellular Automata. [Citation Graph (, )][DBLP]


  60. On Stateless Deterministic Restarting Automata. [Citation Graph (, )][DBLP]


  61. Cellular Automata with Sparse Communication. [Citation Graph (, )][DBLP]


  62. Nondeterministic Finite Automata-Recent Results on the Descriptional and Computational Complexity. [Citation Graph (, )][DBLP]


  63. Deterministic Input-Reversal and Input-Revolving Finite Automata. [Citation Graph (, )][DBLP]


  64. Descriptional and Computational Complexity of Finite Automata. [Citation Graph (, )][DBLP]


  65. Undecidability of Operation Problems for T0L Languages and Subclasses. [Citation Graph (, )][DBLP]


  66. Reversible Pushdown Automata. [Citation Graph (, )][DBLP]


  67. Descriptional Complexity of (Un)ambiguous Finite State Machines and Pushdown Automata. [Citation Graph (, )][DBLP]


  68. The Boolean closure of linear context-free languages. [Citation Graph (, )][DBLP]


  69. Multi-Head Finite Automata: Characterizations, Concepts and Open Problems [Citation Graph (, )][DBLP]


  70. On Measuring Non-Recursive Trade-Offs [Citation Graph (, )][DBLP]


  71. On the Number of Membranes in Unary P Systems [Citation Graph (, )][DBLP]


  72. Bounded Languages Meet Cellular Automata with Sparse Communication [Citation Graph (, )][DBLP]


  73. The Magic Number Problem for Subregular Language Families [Citation Graph (, )][DBLP]


  74. On One-way One-bit O (One)-message Cellular Automata. [Citation Graph (, )][DBLP]


Search in 0.216secs, Finished in 0.219secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002