The following pages link to Markus E. Nebel (Q235670):
Displaying 29 items.
- Investigation of the Bernoulli model for RNA secondary structures (Q253601) (← links)
- Analysis of quickselect under Yaroslavskiy's dual-pivoting algorithm (Q261384) (← links)
- Maximum likelihood analysis of the Ford-Fulkerson method on special graphs (Q289909) (← links)
- Analysis of pivot sampling in dual-pivot Quicksort: a holistic analysis of Yaroslavskiy's partitioning scheme (Q308946) (← links)
- A combinatorial proof of the recurrence for rook paths (Q426830) (← links)
- Predicting RNA secondary structures with pseudoknots by MCMC sampling (Q938120) (← links)
- Maximum likelihood analysis of algorithms and data structures (Q1041238) (← links)
- Applying length-dependent stochastic context-free grammars to RNA secondary structure prediction (Q1736487) (← links)
- On the lexicographical generation of compressed codes (Q2380004) (← links)
- Generation of RNA pseudoknot structures with topological genus filtration (Q2437014) (← links)
- Fast string matching by using probabilities: on an optimal mismatch variant of Horspool's algorithm (Q2503305) (← links)
- RNA secondary structures in a polymer-zeta model how foldings should be shaped for sparsification to establish a linear speedup (Q2634744) (← links)
- (Q2708468) (← links)
- (Q2789570) (← links)
- Average Case Analysis of Java 7’s Dual Pivot Quicksort (Q2912899) (← links)
- New proofs of two $q$-analogues of Koshy’s formula (Q3450050) (← links)
- Extending Stochastic Context-Free Grammars for an Application in Bioinformatics (Q3564898) (← links)
- Digital search trees with keys of variable length (Q4341036) (← links)
- (Q4390536) (← links)
- On the Horton-Strahler Number for Combinatorial Tries (Q4761389) (← links)
- A unified approach to the analysis of Horton‐Strahler parameters of binary tree structures (Q4798167) (← links)
- Average Case and Distributional Analysis of Dual-Pivot Quicksort (Q4962180) (← links)
- On the average complexity of the membership problem for a generalized Dyck language (Q5055948) (← links)
- Maximum Likelihood Analysis of Heapsort (Q5194663) (← links)
- The Expected Order of Saturated RNA Secondary Structures (Q5194712) (← links)
- Analysis of Branch Misses in Quicksort (Q5194799) (← links)
- Sesquickselect: One and a half pivots for cache-efficient selection (Q5195231) (← links)
- Median-of-<i>k</i> Jumplists and Dangling-Min BSTs (Q5195235) (← links)
- The stack-size of tries: A combinatorial study (Q5958316) (← links)
