Markus E. Nebel

According to our database1, Markus E. Nebel authored at least 56 papers between 1996 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2019
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051).
Dagstuhl Reports, 2019

Median-of-k Jumplists and Dangling-Min BSTs.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

Sesquickselect: One and a half pivots for cache-efficient selection.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach.
BMC Bioinformatics, 2018

2017
Optimizing sorting algorithms by using sorting networks.
Formal Asp. Comput., 2017

2016
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101).
Dagstuhl Reports, 2016

Median-of-k Jumplists.
CoRR, 2016

Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm.
Algorithmica, 2016

Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme.
Algorithmica, 2016

Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs.
Algorithmica, 2016

2015
Average Case and Distributional Analysis of Dual-Pivot Quicksort.
ACM Trans. Algorithms, 2015

Combinatorics of RNA Secondary Structures with Base Triples.
Journal of Computational Biology, 2015

Applying Sorting Networks to Synthesize Optimized Sorting Libraries.
Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

Analysis of Branch Misses in Quicksort.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014
Analysis of Pivot Sampling in Dual-Pivot Quicksort.
CoRR, 2014

Pivot Sampling in Java 7's Dual-Pivot Quicksort.
CoRR, 2014

2013
Uniform generation of RNA pseudoknot structures with genus filtration
CoRR, 2013

Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort
CoRR, 2013

Engineering Java 7's Dual Pivot Quicksort Using MaLiJan.
Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012
Algebraic and Combinatorial Properties of Common RNA Pseudoknot Classes with Applications.
Journal of Computational Biology, 2012

A Combinatorial Proof of the Recurrence for Rook Paths.
Electr. J. Comb., 2012

Evaluating the Effect of Disturbed Ensemble Distributions on SCFG Based Statistical Sampling of RNA Secondary Structures.
BMC Bioinformatics, 2012

Addendum: topology and prediction of RNA pseudoknots.
Bioinformatics, 2012

Average Case Analysis of Java 7's Dual Pivot Quicksort.
Proceedings of the Algorithms - ESA 2012, 2012

A n2 RNA Secondary Structure Prediction Algorithm.
Proceedings of the BIOINFORMATICS 2012 - Proceedings of the International Conference on Bioinformatics Models, Methods and Algorithms, Vilamoura, Algarve, Portugal, 1, 2012

The Expected Order of Saturated RNA Secondary Structures.
Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011
Evaluation of a sophisticated SCFG design for RNA secondary structure prediction.
Theory in Biosciences, 2011

Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model.
IEEE/ACM Trans. Comput. Biology Bioinform., 2011

Loops in Canonical RNA Pseudoknot Structures.
Journal of Computational Biology, 2011

Jaguc - a Software package for Environmental Diversity Analyses.
J. Bioinformatics and Computational Biology, 2011

Topology and prediction of RNA pseudoknots.
Bioinformatics, 2011

Random generation of RNA secondary structures according to native distributions.
Algorithms for Molecular Biology, 2011

Applying Length-Dependent Stochastic Context-Free Grammars to RNA Secondary Structure Prediction.
Algorithms, 2011

SMALTA: practical and near-optimal FIB aggregation.
Proceedings of the 2011 Conference on Emerging Networking Experiments and Technologies, 2011

Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm.
Proceedings of the Algorithms Unplugged, 2011

2010
Maximum likelihood analysis of algorithms and data structures.
Theor. Comput. Sci., 2010

Extending Stochastic Context-Free Grammars for an Application in Bioinformatics.
Proceedings of the Language and Automata Theory and Applications, 2010

2009
On quantitative effects of RNA shape abstraction.
Theory in Biosciences, 2009

Maximum Likelihood Analysis of Heapsort.
Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008
Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus.
Proceedings of the Taschenbuch der Algorithmen, 2008

2007
On the lexicographical generation of compressed codes.
Inf. Process. Lett., 2007

Compact Descriptions for Efficient Algorithms.
Proceedings of the 9th International Workshop on Descriptional Complexity of Formal Systems - DCFS 2007, High Tatras, Slovakia, July 20, 2007

2006
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm.
Theor. Comput. Sci., 2006

The scientific works of Rainer Kemp (1949-2004).
Theor. Comput. Sci., 2006

2004
Identifying Good Predictions of RNA Secondary Structure.
Proceedings of the Biocomputing 2004, 2004

2003
Combinatorial Properties of RNA Secondary Structures.
Journal of Computational Biology, 2003

2002
The stack-size of tries: a combinatorial study.
Theor. Comput. Sci., 2002

A unified approach to the analysis of Horton-Strahler parameters of binary tree structures.
Random Struct. Algorithms, 2002

The Stack-Size of Combinatorial Tries Revisited.
Discrete Mathematics & Theoretical Computer Science, 2002

2001
On the Power of Subroutines for Finite State Machines.
Journal of Automata, Languages and Combinatorics, 2001

On the Stack-Size of General Tries.
ITA, 2001

2000
On the Horton-Strahler number for combinatorial tries.
ITA, 2000

1997
Average-case-Analyse spezieller Baum-Parameter.
PhD thesis, 1997

New Results on the Stack Ramification of Binary Trees.
Journal of Automata, Languages and Combinatorics, 1997

On the Average Complexity of the Membership Problem for a Generalized Dyck Language.
Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996
Digital Search Trees with Keys of Variable Length.
ITA, 1996


  Loading...