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

Search the dblp DataBase

Title:
Author:
Markus Holzer: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Henning Bordihn, Henning Fernau, Markus Holzer
    On Iterated Sequential Transducers. [Citation Graph (0, 0)][DBLP]
    Grammars and Automata for String Processing, 2003, pp:121-130 [Conf]
  2. Henning Fernau, Markus Holzer
    External Contextual and Conditional Languages. [Citation Graph (0, 0)][DBLP]
    Recent Topics in Mathematical and Computational Linguistics, 2000, pp:104-120 [Conf]
  3. Henning Fernau, Markus Holzer
    Conditional Context-Free Languages of Finite Index. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:10-26 [Conf]
  4. Markus Holzer, Klaus-Jörn Lange
    On the Complexity of Iterated Insertions. [Citation Graph (0, 0)][DBLP]
    New Trends in Formal Languages, 1997, pp:440-453 [Conf]
  5. Carsten Damm, Markus Holzer, Pierre McKenzie
    The Complexity of Tensor Calculus. [Citation Graph (0, 0)][DBLP]
    IEEE Conference on Computational Complexity, 2000, pp:70-86 [Conf]
  6. Carsten Damm, Markus Holzer, Klaus-Jörn Lange, Peter Rossmanith
    Deterministic OL Languages are of Very Low Complexity: DOL is in AC0. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1993, pp:305-313 [Conf]
  7. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    On the Relationship between the McNaughton Families of Languages and the Chomsky Hierarchy. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2001, pp:340-348 [Conf]
  8. Maurice H. ter Beek, Erzsébet Csuhaj-Varjú, Markus Holzer, György Vaszil
    On Competence in CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2004, pp:76-88 [Conf]
  9. Henning Bordihn, Markus Holzer
    Cooperating distributed grammar systems with non-terminating components. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:305-315 [Conf]
  10. 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]
  11. Henning Bordihn, Markus Holzer, Martin Kutrib
    Revolving-Input Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:168-179 [Conf]
  12. Hermann Gruber, Markus Holzer
    Finding Lower Bounds for Nondeterministic State Complexity Is Hard. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2006, pp:363-374 [Conf]
  13. Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara König
    On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2005, pp:272-283 [Conf]
  14. Markus Holzer
    On Emptiness and Counting for Alternating Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1995, pp:88-97 [Conf]
  15. Markus Holzer
    On fixed and general membership for external and internal contextual languages. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 1999, pp:351-361 [Conf]
  16. 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]
  17. Markus Holzer, Barbara König
    On Deterministic Finite Automata and Syntactic Monoid Size. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2002, pp:258-269 [Conf]
  18. Markus Holzer, Barbara König
    On Deterministic Finite Automata and Syntactic Monoid Size, Continued. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:349-360 [Conf]
  19. 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]
  20. Markus Holzer, Klaus-Jörn Lange
    On the Complexities of Linear LL(1) and LR(1) Grammars. [Citation Graph (0, 0)][DBLP]
    FCT, 1993, pp:299-308 [Conf]
  21. Markus Holzer, Friedrich Otto
    Shrinking Multi-pushdown Automata. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:305-316 [Conf]
  22. Markus Holzer, Muriel Quenzer
    VisA: A Tool for Visualizing and Animating Automata and Formal Languages. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 1998, pp:450-451 [Conf]
  23. Henning Fernau, Rudolf Freund, Markus Holzer
    Regulated Array Grammars of Finite Index. Part I: Theoretical Investigations. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:157-181 [Conf]
  24. Henning Fernau, Rudolf Freund, Markus Holzer
    Regulated Array Grammars of Finite Index. Part II: Syntactic Pattern Recognition. [Citation Graph (0, 0)][DBLP]
    Grammatical Models of Multi-Agent Systems, 1999, pp:284-296 [Conf]
  25. 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]
  26. Henning Fernau, Rudolf Freund, Markus Holzer
    The Generative Power of d-Dimensional #-Context-Free Array Grammars. [Citation Graph (0, 0)][DBLP]
    MCU (2), 1998, pp:43-56 [Conf]
  27. Markus Holzer, Martin Kutrib
    Register Complexity of LOOP-, WHILE-, and GOTO-Programs. [Citation Graph (0, 0)][DBLP]
    MCU, 2004, pp:233-244 [Conf]
  28. Martin Beaudry, José M. Fernandez, Markus Holzer
    A Common Algebraic Description for Probabilistic and Quantum Computations (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    MFCS, 2004, pp:851-862 [Conf]
  29. Martin Beaudry, Markus Holzer
    The Complexity of Tensor Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
    MFCS, 2001, pp:173-185 [Conf]
  30. Carsten Damm, Markus Holzer
    Inductive Counting Below LOGSPACE. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:276-285 [Conf]
  31. Carsten Damm, Markus Holzer
    Automata That Take Advice. [Citation Graph (0, 0)][DBLP]
    MFCS, 1995, pp:149-158 [Conf]
  32. Carsten Damm, Markus Holzer, Klaus-Jörn Lange
    Parallel Complexity of Iterated Morphisms and the Arithmetic of Small Numbers. [Citation Graph (0, 0)][DBLP]
    MFCS, 1992, pp:227-235 [Conf]
  33. Markus Holzer
    Multi-Head Finite Automata: Data-Independent Versus Data-Dependent Computations. [Citation Graph (0, 0)][DBLP]
    MFCS, 1997, pp:299-308 [Conf]
  34. Markus Holzer, Pierre McKenzie
    Alternating and Empty Alternating Auxiliary Stack Automata. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:415-425 [Conf]
  35. Markus Holzer, Stefan Katzenbeisser, Christian Schallhart
    Towards Formal Semantics for ODRL. [Citation Graph (0, 0)][DBLP]
    ODRL Workshop, 2004, pp:137-148 [Conf]
  36. Henning Fernau, Rudolf Freund, Markus Holzer
    Character Recognition with k-Head Finite Array Automata. [Citation Graph (0, 0)][DBLP]
    SSPR/SPR, 1998, pp:282-291 [Conf]
  37. Felix Brandt, Felix A. Fischer, Markus Holzer
    Symmetries and the Complexity of Pure Nash Equilibrium. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:212-223 [Conf]
  38. Markus Holzer, Martin Kutrib
    Improving Raster Image Run-Length Encoding Using Data Order. [Citation Graph (0, 0)][DBLP]
    CIAA, 2001, pp:161-176 [Conf]
  39. Markus Holzer, Martin Kutrib
    State Complexity of Basic Operations on Nondeterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2002, pp:148-157 [Conf]
  40. 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]
  41. Henning Bordihn, Markus Holzer, Martin Kutrib
    Hybrid Extended Finite Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2006, pp:34-45 [Conf]
  42. Henning Bordihn, Markus Holzer
    Programmed grammars and their relation to the LBA problem. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 2006, v:43, n:4, pp:223-242 [Journal]
  43. Henning Fernau, Markus Holzer
    Accepting Multi-Agent Systems II. [Citation Graph (0, 0)][DBLP]
    Acta Cybern., 1996, v:12, n:4, pp:361-380 [Journal]
  44. Henning Fernau, Markus Holzer, Henning Bordihn
    Accepting Multi-Agent Systems. [Citation Graph (0, 0)][DBLP]
    Computers and Artificial Intelligence, 1996, v:15, n:2-3, pp:- [Journal]
  45. Carsten Damm, Markus Holzer, Pierre McKenzie
    The complexity of tensor calculus. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2002, v:11, n:1-2, pp:54-89 [Journal]
  46. Markus Holzer, Waltraud Holzer
    TantrixTM rotation puzzles are intractable. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:144, n:3, pp:345-358 [Journal]
  47. Markus Holzer, Barbara König
    Regular Languages, Sizes of Syntactic Monoids, Graph Colouring, State Complexity Results, and How These Topics are Related to Each Other (Column: Formal Language Theory). [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2004, v:83, n:, pp:139-155 [Journal]
  48. Carsten Damm, Markus Holzer, Pierre McKenzie
    The Complexity of Tensor Calculus [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2000, v:7, n:36, pp:- [Journal]
  49. Henning Bordihn, Henning Fernau, Markus Holzer
    On Accepting Pure Lindenmayer Systems. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1999, v:38, n:4, pp:365-375 [Journal]
  50. Henning Fernau, Rudolf Freund, Markus Holzer
    Representations of Recursively Enumerable Array Languages by Contextual Array Grammars. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2005, v:64, n:1-4, pp:159-170 [Journal]
  51. 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]
  52. Henning Bordihn, Markus Holzer
    Cooperating Distributed Grammar Systems as Models of Distributed Problem Solving, Revisited. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2007, v:76, n:3, pp:255-270 [Journal]
  53. Carsten Damm, Markus Holzer
    Inductive Counting for Width-Restricted Branching Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1996, v:130, n:1, pp:91-99 [Journal]
  54. Erzsébet Csuhaj-Varjú, Jürgen Dassow, Markus Holzer
    CD grammar systems with competence based entry conditions in their cooperation protocols. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Math., 2006, v:83, n:2, pp:159-169 [Journal]
  55. 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]
  56. Jürgen Dassow, Markus Holzer
    Language families defined by a ciliate bio-operation: hierarchies and decision problems. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:645-662 [Journal]
  57. 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]
  58. Henning Bordihn, Markus Holzer
    On a Hierarchy of Languages Generated by Cooperating Distributed Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1999, v:69, n:2, pp:59-62 [Journal]
  59. Felix A. Fischer, Markus Holzer, Stefan Katzenbeisser
    The influence of neighbourhood and choice on the complexity of finding pure Nash equilibria. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:6, pp:239-245 [Journal]
  60. Markus Holzer, Kai Salomaa, Sheng Yu
    On the State Complexity of k-Entry Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:453-466 [Journal]
  61. Henning Bordihn, Markus Holzer
    On the Number of Active Symbols in L and CD Grammar Systems. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2001, v:6, n:4, pp:411-426 [Journal]
  62. Henning Fernau, Markus Holzer
    Graph-Controlled Cooperating Distributed Grammar Systems with Singleton Components. [Citation Graph (0, 0)][DBLP]
    Journal of Automata, Languages and Combinatorics, 2002, v:7, n:4, pp:487-503 [Journal]
  63. Henning Bordihn, Markus Holzer
    Grammar Systems with Negated Conditions in their Cooperation Protocols [Citation Graph (0, 0)][DBLP]
    J. UCS, 2000, v:6, n:12, pp:1165-1184 [Journal]
  64. Henning Bordihn, Markus Holzer
    On the Computational Complexity of Synchronized Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2002, v:8, n:2, pp:119-140 [Journal]
  65. Carsten Damm, Markus Holzer, Peter Rossmanith
    Expressing Uniformity via Oracles. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 1997, v:30, n:4, pp:355-366 [Journal]
  66. Martin Beaudry, José M. Fernandez, Markus Holzer
    A common algebraic description for probabilistic and quantum computations, . [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:345, n:2-3, pp:206-234 [Journal]
  67. Martin Beaudry, Markus Holzer, Gundula Niemann, Friedrich Otto
    McNaughton families of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:290, n:3, pp:1581-1628 [Journal]
  68. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: internal versus external hybridization. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:259, n:1-2, pp:405-426 [Journal]
  69. Henning Fernau, Markus Holzer, Rudolf Freund
    Hybrid modes in cooperating distributed grammar systems: combining the t-mode with the modes le k and =k. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:633-662 [Journal]
  70. Markus Holzer
    Multi-head finite automata: data-independent versus data-dependent computations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2002, v:286, n:1, pp:97-116 [Journal]
  71. Markus Holzer, Barbara König
    On deterministic finite automata and syntactic monoid size. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:327, n:3, pp:319-347 [Journal]
  72. 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]
  73. Markus Holzer, Pierre McKenzie
    Alternating and empty alternating auxiliary stack automata. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:299, pp:307-326 [Journal]
  74. Markus Holzer, Stefan Schwoon
    Assembling molecules in ATOMIX is hard. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2004, v:303, n:3, pp:447-462 [Journal]
  75. Henning Bordihn, Henning Fernau, Markus Holzer, Vincenzo Manca, Carlos Martín-Vide
    Iterated sequential transducers as language generating devices. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:67-81 [Journal]
  76. Henning Bordihn, Markus Holzer, Martin Kutrib
    Hairpin Finite Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:108-119 [Conf]
  77. Hermann Gruber, Markus Holzer
    Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:205-216 [Conf]
  78. 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]
  79. Hermann Gruber, Markus Holzer, Oliver Ruepp
    Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:183-197 [Conf]
  80. Markus Holzer, Oliver Ruepp
    The Troubles of Interior Design-A Complexity Analysis of the Game Heyawake. [Citation Graph (0, 0)][DBLP]
    FUN, 2007, pp:198-212 [Conf]
  81. Martin Beaudry, Markus Holzer
    The Complexity of Tensor Circuit Evaluation. [Citation Graph (0, 0)][DBLP]
    Computational Complexity, 2007, v:16, n:1, pp:60-111 [Journal]

  82. Provably Shorter Regular Expressions from Deterministic Finite Automata. [Citation Graph (, )][DBLP]


  83. Bounding resources in Cooperating Distributed Grammar Systems. [Citation Graph (, )][DBLP]


  84. Tight Bounds on the Descriptional Complexity of Regular Expressions. [Citation Graph (, )][DBLP]


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


  86. Finite Automata, Digraph Connectivity, and Regular Expression Size. [Citation Graph (, )][DBLP]


  87. On Iterated Dominance, Matrix Elimination, and Matched Paths. [Citation Graph (, )][DBLP]


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


  89. Short Regular Expressions from Finite Automata: Empirical Results. [Citation Graph (, )][DBLP]


  90. An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. [Citation Graph (, )][DBLP]


  91. Equilibria of Graphical Games with Symmetries. [Citation Graph (, )][DBLP]


  92. The Computational Complexity of the Kakuro Puzzle, Revisited. [Citation Graph (, )][DBLP]


  93. The Computational Complexity of RaceTrack. [Citation Graph (, )][DBLP]


  94. VisA: towards a students' green card to automata theory and formal languages. [Citation Graph (, )][DBLP]


  95. Random Context in Regulated Rewriting VersusCooperating Distributed Grammar Systems. [Citation Graph (, )][DBLP]


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


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


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


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


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


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


  102. On Iterated Dominance, Matrix Elimination, and Matched Paths [Citation Graph (, )][DBLP]


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


  104. On Iterated Dominance, Matrix Elimination, and Matched Paths. [Citation Graph (, )][DBLP]


  105. Equilibria of Graphical Games with Symmetries. [Citation Graph (, )][DBLP]


  106. Finding Lower Bounds for Nondeterministic State Complexity is Hard. [Citation Graph (, )][DBLP]


  107. Symmetries and the Complexity of Pure Nash Equilibrium. [Citation Graph (, )][DBLP]


Search in 0.076secs, Finished in 0.084secs
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