Markus E. Nebel

Benjamin Smith

Proceedings of the Symposium on Algorithm Engineering and Experiments, 2023

2021

Scalable Data Structures (Dagstuhl Seminar 21071).

[BibT_eX]

[DOI]

Gerth Stølting Brodal

John Iacono

Vijaya Ramachandran

Dagstuhl Reports, 2021

2019

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

[BibT_eX]

[DOI]

Gerth Stølting Brodal

Ulrich Carsten Meyer

Robert Sedgewick

Dagstuhl Reports, 2019

Median-of-k Jumplists and Dangling-Min BSTs.

[BibT_eX]

[DOI]

Elisabeth Neumann

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

Sesquickselect: One and a half pivots for cache-efficient selection.

[BibT_eX]

[DOI]

Markus Nebel

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.

[BibT_eX]

[DOI]

Robert Müller

BMC Bioinform., 2018

2017

Optimizing sorting algorithms by using sorting networks.

[BibT_eX]

[DOI]

Formal Aspects Comput., 2017

2016

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

[BibT_eX]

[DOI]

Alejandro López-Ortiz

Ulrich Carsten Meyer

Robert Sedgewick

Dagstuhl Reports, 2016

Median-of-k Jumplists.

[BibT_eX]

[DOI]

Elisabeth Neumann

CoRR, 2016

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

[BibT_eX]

[DOI]

Hosam M. Mahmoud

Algorithmica, 2016

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

[BibT_eX]

[DOI]

Algorithmica, 2016

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

[BibT_eX]

[DOI]

Ulrich Laube

Algorithmica, 2016

2015

Average Case and Distributional Analysis of Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

Ralph Neininger

ACM Trans. Algorithms, 2015

Combinatorics of RNA Secondary Structures with Base Triples.

[BibT_eX]

[DOI]

Robert Müller

J. Comput. Biol., 2015

Applying Sorting Networks to Synthesize Optimized Sorting Libraries.

[BibT_eX]

[DOI]

Proceedings of the Logic-Based Program Synthesis and Transformation, 2015

Analysis of Branch Misses in Quicksort.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

Analysis of Pivot Sampling in Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

CoRR, 2014

Pivot Sampling in Java 7's Dual-Pivot Quicksort.

[BibT_eX]

[DOI]

CoRR, 2014

2013

Uniform generation of RNA pseudoknot structures with genus filtration

[BibT_eX]

[DOI]

Fenix W. D. Huang

Christian M. Reidys

CoRR, 2013

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

[BibT_eX]

[DOI]

Ralph Neininger

CoRR, 2013

Engineering Java 7's Dual Pivot Quicksort Using MaLiJan.

[BibT_eX]

[DOI]

Proceedings of the 15th Meeting on Algorithm Engineering and Experiments, 2013

2012

Algebraic and Combinatorial Properties of Common RNA Pseudoknot Classes with Applications.

[BibT_eX]

[DOI]

J. Comput. Biol., 2012

A Combinatorial Proof of the Recurrence for Rook Paths.

[BibT_eX]

[DOI]

Emma Yu Jin

Electron. J. Comb., 2012

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

[BibT_eX]

[DOI]

BMC Bioinform., 2012

Addendum: topology and prediction of RNA pseudoknots.

[BibT_eX]

[DOI]

Bioinform., 2012

Average Case Analysis of Java 7's Dual Pivot Quicksort.

[BibT_eX]

[DOI]

Proceedings of the Algorithms - ESA 2012, 2012

Fast RNA Secondary Structure Prediction Using Fuzzy Stochastic Models.

[BibT_eX]

[DOI]

Proceedings of the Biomedical Engineering Systems and Technologies, 2012

A n2 RNA Secondary Structure Prediction Algorithm.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Emma Yu Jin

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011

Evaluation of a sophisticated SCFG design for RNA secondary structure prediction.

[BibT_eX]

[DOI]

Theory Biosci., 2011

Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model.

[BibT_eX]

[DOI]

IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Loops in Canonical RNA Pseudoknot Structures.

[BibT_eX]

[DOI]

Christian M. Reidys

Rita R. Wang

J. Comput. Biol., 2011

Jaguc - a Software package for Environmental Diversity Analyses.

[BibT_eX]

[DOI]

J. Bioinform. Comput. Biol., 2011

Topology and prediction of RNA pseudoknots.

[BibT_eX]

[DOI]

Bioinform., 2011

Random generation of RNA secondary structures according to native distributions.

[BibT_eX]

[DOI]

Algorithms Mol. Biol., 2011

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

[BibT_eX]

[DOI]

Algorithms, 2011

SMALTA: practical and near-optimal FIB aggregation.

[BibT_eX]

[DOI]

Proceedings of the 2011 Conference on Emerging Networking Experiments and Technologies, 2011

Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm.

[BibT_eX]

[DOI]

Proceedings of the Algorithms Unplugged, 2011

2010

Maximum likelihood analysis of algorithms and data structures.

[BibT_eX]

[DOI]

Ulrich Laube

Theor. Comput. Sci., 2010

Extending Stochastic Context-Free Grammars for an Application in Bioinformatics.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2010

2009

On quantitative effects of RNA shape abstraction.

[BibT_eX]

[DOI]

Theory Biosci., 2009

Maximum Likelihood Analysis of Heapsort.

[BibT_eX]

[DOI]

Ulrich Laube

Proceedings of the Sixth Workshop on Analytic Algorithmics and Combinatorics, 2009

2008

Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus.

[BibT_eX]

[DOI]

Proceedings of the Taschenbuch der Algorithmen, 2008

2007

On the lexicographical generation of compressed codes.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2007

Compact Descriptions for Efficient Algorithms.

[BibT_eX]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The scientific works of Rainer Kemp (1949-2004).

[BibT_eX]

[DOI]

Philippe Flajolet

Helmut Prodinger

Theor. Comput. Sci., 2006

2004

Identifying Good Predictions of RNA Secondary Structure.

[BibT_eX]

[DOI]

Proceedings of the Biocomputing 2004, 2004

2003

Combinatorial Properties of RNA Secondary Structures.

[BibT_eX]

[DOI]

J. Comput. Biol., 2003

2002

The stack-size of tries: a combinatorial study.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

A unified approach to the analysis of Horton-Strahler parameters of binary tree structures.

[BibT_eX]

[DOI]

Random Struct. Algorithms, 2002

The Stack-Size of Combinatorial Tries Revisited.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2002

2001

On the Power of Subroutines for Finite State Machines.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2001

On the Stack-Size of General Tries.

[BibT_eX]

[DOI]

Jérémie Bourdon

Brigitte Vallée

RAIRO Theor. Informatics Appl., 2001

2000

On the Horton-Strahler number for combinatorial tries.

[BibT_eX]

[DOI]

RAIRO Theor. Informatics Appl., 2000

1997

Average-case-Analyse spezieller Baum-Parameter.

[BibT_eX]

[DOI]

PhD thesis, 1997

New Results on the Stack Ramification of Binary Trees.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 1997

On the Average Complexity of the Membership Problem for a Generalized Dyck Language.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 11th International Symposium, 1997

1996

Digital Search Trees with Keys of Variable Length.

[BibT_eX]

[DOI]