Markus E. Nebel

From MaRDI portal
(Redirected from Person:235670)



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Multiway powersort2024-05-24Paper
On the average complexity of the membership problem for a generalized Dyck language
Fundamentals of Computation Theory
2022-12-09Paper
Sesquickselect: one and a half pivots for cache-efficient selection
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-18Paper
Median-of-\(k\) jumplists and dangling-min BSTs
2019 Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-18Paper
Analysis of Branch Misses in Quicksort
2015 Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-17Paper
The expected order of saturated RNA secondary structures
2012 Proceedings of the Ninth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-17Paper
Maximum likelihood analysis of heapsort
2009 Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics (ANALCO)
2019-09-16Paper
Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction
Algorithms
2019-03-26Paper
Average case and distributional analysis of dual-pivot quicksort
ACM Transactions on Algorithms
2018-10-30Paper
Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme
Algorithmica
2016-09-06Paper
Maximum likelihood analysis of the Ford-Fulkerson method on special graphs
Algorithmica
2016-05-31Paper
Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm
Algorithmica
2016-03-23Paper
Investigation of the Bernoulli model for RNA secondary structures
Bulletin of Mathematical Biology
2016-03-08Paper
Pivot sampling in dual-pivot quicksort: exploiting asymmetries in Yaroslavskiy's partitioning scheme2016-03-01Paper
RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup
Journal of Mathematical Biology
2016-02-18Paper
New proofs of two \(q\)-analogues of Koshy's formula
Proceedings of the American Mathematical Society
2015-11-02Paper
Pivot Sampling in Dual-Pivot Quicksort2014-03-26Paper
Generation of RNA pseudoknot structures with topological genus filtration
Mathematical Biosciences
2014-02-27Paper
Average case analysis of Java 7's dual pivot quicksort
Algorithms – ESA 2012
2012-09-25Paper
A combinatorial proof of the recurrence for rook paths
The Electronic Journal of Combinatorics
2012-06-12Paper
Extending stochastic context-free grammars for an application in bioinformatics
Language and Automata Theory and Applications
2010-05-26Paper
On the lexicographical generation of compressed codes
Information Processing Letters
2010-03-24Paper
Loops in canonical RNA pseudoknot structures2009-12-02Paper
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
2009-12-01Paper
Predicting RNA secondary structures with pseudoknots by MCMC sampling
Journal of Mathematical Biology
2008-08-18Paper
Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm
Theoretical Computer Science
2006-09-14Paper
A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures
Random Structures & Algorithms
2003-03-19Paper
The stack-size of tries: A combinatorial study
Theoretical Computer Science
2002-03-03Paper
On the power of subroutines for finite state machines
Journal of Automata, Languages and Combinatorics
2001-10-21Paper
On the Horton-Strahler Number for Combinatorial Tries
RAIRO - Theoretical Informatics and Applications
2001-02-11Paper
On the Horton-Strahler Number for Combinatorial Tries
RAIRO - Theoretical Informatics and Applications
2001-02-11Paper
scientific article; zbMATH DE number 1156488 (Why is no real title available?)1998-09-20Paper
Digital search trees with keys of variable length
RAIRO - Theoretical Informatics and Applications
1997-06-16Paper


Research outcomes over time


This page was built for person: Markus E. Nebel