Markus E. Nebel On the Average Complexity of the Membership Problem for a Generalized Dyck Language. [Citation Graph (0, 0)][DBLP] FCT, 1997, pp:352-363 [Conf]
Markus E. Nebel Identifying Good Predictions of RNA Secondary Structure. [Citation Graph (0, 0)][DBLP] Pacific Symposium on Biocomputing, 2004, pp:423-434 [Conf]
Markus E. Nebel The Stack-Size of Combinatorial Tries Revisited. [Citation Graph (0, 0)][DBLP] Discrete Mathematics & Theoretical Computer Science, 2002, v:5, n:1, pp:1-16 [Journal]
Markus E. Nebel On the Power of Subroutines for Finite State Machines. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2001, v:6, n:1, pp:51-74 [Journal]
Markus E. Nebel New Results on the Stack Ramification of Binary Trees. [Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 1997, v:2, n:3, pp:161-176 [Journal]
Markus E. Nebel Combinatorial Properties of RNA Secondary Structures. [Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2003, v:9, n:3, pp:541-574 [Journal]
Markus E. Nebel A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. [Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 2002, v:21, n:3-4, pp:252-277 [Journal]
Markus E. Nebel Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. [Citation Graph (0, 0)][DBLP] Theor. Comput. Sci., 2006, v:359, n:1-3, pp:329-343 [Journal]