default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarkus E. Nebel
Person information
- affiliation: Universität Bielefeld, Germany
- affiliation (former): Technical University Kaiserslautern, Department of Computer Science
- affiliation (former): University of Southern Denmark, Odense, Department of Mathematics and Computer Science
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c16]William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild:
Multiway Powersort. ALENEX 2023: 190-200- 2022
- [i15]William Cawley Gelling, Markus E. Nebel, Benjamin Smith, Sebastian Wild
:
Multiway Powersort. CoRR abs/2209.06909 (2022) - 2021
- [i14]Gerth Stølting Brodal, John Iacono, Markus E. Nebel, Vijaya Ramachandran:
Scalable Data Structures (Dagstuhl Seminar 21071). Dagstuhl Reports 11(1): 1-23 (2021)
2010 – 2019
- 2019
- [c15]Conrado Martínez, Markus Nebel, Sebastian Wild:
Sesquickselect: One and a half pivots for cache-efficient selection. ANALCO 2019: 54-66 - [c14]Markus E. Nebel, Elisabeth Neumann, Sebastian Wild:
Median-of-k Jumplists and Dangling-Min BSTs. ANALCO 2019: 74-86 - [i13]Gerth Stølting Brodal, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick:
Data Structures for the Cloud and External Memory Data (Dagstuhl Seminar 19051). Dagstuhl Reports 9(1): 104-124 (2019) - 2018
- [j32]Robert Müller, Markus E. Nebel:
GeFaST: An improved method for OTU assignment by generalising Swarm's fastidious clustering approach. BMC Bioinform. 19(1): 321:1-321:14 (2018) - [e2]Markus E. Nebel, Stephan G. Wagner:
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018. SIAM 2018, ISBN 978-1-61197-506-2 [contents] - [i12]Conrado Martínez, Markus Nebel, Sebastian Wild:
Sesquickselect: One and a half pivots for cache-efficient selection. CoRR abs/1810.12322 (2018) - 2017
- [j31]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Optimizing sorting algorithms by using sorting networks. Formal Aspects Comput. 29(3): 559-579 (2017) - 2016
- [j30]Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect Under Yaroslavskiy's Dual-Pivoting Algorithm. Algorithmica 74(1): 485-506 (2016) - [j29]Ulrich Laube, Markus E. Nebel:
Maximum Likelihood Analysis of the Ford-Fulkerson Method on Special Graphs. Algorithmica 74(4): 1224-1266 (2016) - [j28]Markus E. Nebel, Sebastian Wild, Conrado Martínez:
Analysis of Pivot Sampling in Dual-Pivot Quicksort: A Holistic Analysis of Yaroslavskiy's Partitioning Scheme. Algorithmica 75(4): 632-683 (2016) - [i11]Markus E. Nebel, Elisabeth Neumann, Sebastian Wild:
Median-of-k Jumplists. CoRR abs/1609.08513 (2016) - [i10]Alejandro López-Ortiz, Ulrich Carsten Meyer, Markus E. Nebel, Robert Sedgewick:
Data Structures and Advanced Models of Computation on Big Data (Dagstuhl Seminar 16101). Dagstuhl Reports 6(3): 1-23 (2016) - 2015
- [j27]Robert Müller, Markus E. Nebel:
Combinatorics of RNA Secondary Structures with Base Triples. J. Comput. Biol. 22(7): 619-648 (2015) - [j26]Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Dual-Pivot Quicksort. ACM Trans. Algorithms 11(3): 22:1-22:42 (2015) - [c13]Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. ANALCO 2015: 114-128 - [c12]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. LOPSTR 2015: 127-142 - [i9]Michael Codish, Luís Cruz-Filipe, Markus Nebel, Peter Schneider-Kamp:
Applying Sorting Networks to Synthesize Optimized Sorting Libraries. CoRR abs/1505.01962 (2015) - 2014
- [i8]Markus E. Nebel, Sebastian Wild:
Pivot Sampling in Java 7's Dual-Pivot Quicksort. CoRR abs/1403.6602 (2014) - [i7]Conrado Martínez, Markus E. Nebel, Sebastian Wild:
Analysis of Branch Misses in Quicksort. CoRR abs/1411.2059 (2014) - [i6]Sebastian Wild, Markus E. Nebel, Conrado Martínez:
Analysis of Pivot Sampling in Dual-Pivot Quicksort. CoRR abs/1412.0193 (2014) - 2013
- [c11]Sebastian Wild, Markus E. Nebel, Raphael Reitzig, Ulrich Laube:
Engineering Java 7's Dual Pivot Quicksort Using MaLiJan. ALENEX 2013: 55-69 - [e1]Markus E. Nebel, Wojciech Szpankowski:
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, ANALCO 2013, New Orleans, Louisiana, USA, January 6, 2013. SIAM 2013, ISBN 978-1-61197-254-2 [contents] - [i5]Sebastian Wild, Markus E. Nebel, Ralph Neininger:
Average Case and Distributional Analysis of Java 7's Dual Pivot Quicksort. CoRR abs/1304.0988 (2013) - [i4]Fenix W. D. Huang, Markus E. Nebel, Christian M. Reidys:
Uniform generation of RNA pseudoknot structures with genus filtration. CoRR abs/1304.7397 (2013) - [i3]Sebastian Wild, Markus E. Nebel, Hosam M. Mahmoud:
Analysis of Quickselect under Yaroslavskiy's Dual-Pivoting Algorithm. CoRR abs/1306.3819 (2013) - [i2]Sebastian Wild, Markus E. Nebel:
Average Case Analysis of Java 7's Dual Pivot Quicksort. CoRR abs/1310.7409 (2013) - 2012
- [j25]Christian M. Reidys, Fenix W. D. Huang, Jørgen E. Andersen, Robert C. Penner, Peter F. Stadler, Markus E. Nebel:
Addendum: topology and prediction of RNA pseudoknots. Bioinform. 28(2): 300 (2012) - [j24]Anika Scheid, Markus E. Nebel:
Evaluating the Effect of Disturbed Ensemble Distributions on SCFG Based Statistical Sampling of RNA Secondary Structures. BMC Bioinform. 13: 159 (2012) - [j23]Emma Yu Jin, Markus E. Nebel:
A Combinatorial Proof of the Recurrence for Rook Paths. Electron. J. Comb. 19(1): 57 (2012) - [j22]Markus E. Nebel, Frank Weinberg:
Algebraic and Combinatorial Properties of Common RNA Pseudoknot Classes with Applications. J. Comput. Biol. 19(10): 1134-1150 (2012) - [c10]Emma Yu Jin, Markus E. Nebel:
The Expected Order of Saturated RNA Secondary Structures. ANALCO 2012: 84-91 - [c9]Markus E. Nebel, Anika Scheid:
A n2 RNA Secondary Structure Prediction Algorithm. BIOINFORMATICS 2012: 66-75 - [c8]Markus E. Nebel, Anika Scheid:
Fast RNA Secondary Structure Prediction Using Fuzzy Stochastic Models. BIOSTEC (Selected Papers) 2012: 175-194 - [c7]Sebastian Wild, Markus E. Nebel:
Average Case Analysis of Java 7's Dual Pivot Quicksort. ESA 2012: 825-836 - 2011
- [j21]Frank Weinberg, Markus E. Nebel:
Applying Length-Dependent Stochastic Context-Free Grammars to RNA Secondary Structure Prediction. Algorithms 4(4): 223-238 (2011) - [j20]Markus E. Nebel, Anika Scheid, Frank Weinberg:
Random generation of RNA secondary structures according to native distributions. Algorithms Mol. Biol. 6: 24 (2011) - [j19]Christian M. Reidys, Fenix W. D. Huang, Jørgen E. Andersen, Robert C. Penner, Peter F. Stadler, Markus E. Nebel:
Topology and prediction of RNA pseudoknots. Bioinform. 27(8): 1076-1085 (2011) - [j18]Markus E. Nebel, Sebastian Wild, Michael Holzhauser, Lars Huettenberger, Raphael Reitzig, Matthias Sperber, Thorsten Stoeck:
Jaguc - a Software package for Environmental Diversity Analyses. J. Bioinform. Comput. Biol. 9(6): 749-773 (2011) - [j17]Markus E. Nebel, Christian M. Reidys, Rita R. Wang:
Loops in Canonical RNA Pseudoknot Structures. J. Comput. Biol. 18(12): 1793-1806 (2011) - [j16]Markus E. Nebel, Anika Scheid:
Analysis of the Free Energy in a Stochastic RNA Secondary Structure Model. IEEE ACM Trans. Comput. Biol. Bioinform. 8(6): 1468-1482 (2011) - [j15]Markus E. Nebel, Anika Scheid:
Evaluation of a sophisticated SCFG design for RNA secondary structure prediction. Theory Biosci. 130(4): 313-336 (2011) - [c6]Zartash Afzal Uzmi, Markus E. Nebel, Ahsan Tariq, Sana Jawad, Ruichuan Chen, Aman Shaikh, Jia Wang, Paul Francis:
SMALTA: practical and near-optimal FIB aggregation. CoNEXT 2011: 29 - [p2]Markus E. Nebel:
Searching Texts - But Fast! The Boyer-Moore-Horspool Algorithm. Algorithms Unplugged 2011: 47-56 - [i1]Emma Yu Jin, Markus E. Nebel:
The Expected Order of Saturated RNA Secondary Structures. CoRR abs/1107.3033 (2011) - 2010
- [j14]Ulrich Laube, Markus E. Nebel:
Maximum likelihood analysis of algorithms and data structures. Theor. Comput. Sci. 411(1): 188-212 (2010) - [c5]Frank Weinberg, Markus E. Nebel:
Extending Stochastic Context-Free Grammars for an Application in Bioinformatics. LATA 2010: 585-595
2000 – 2009
- 2009
- [j13]Markus E. Nebel, Anika Scheid:
On quantitative effects of RNA shape abstraction. Theory Biosci. 128(4): 211-225 (2009) - [c4]Ulrich Laube, Markus E. Nebel:
Maximum Likelihood Analysis of Heapsort. ANALCO 2009: 41-50 - 2008
- [p1]Markus E. Nebel:
Texte durchsuchen - aber schnell! Der Boyer-Moore-Horspool Algorithmus. Taschenbuch der Algorithmen 2008: 51-60 - 2007
- [j12]Markus E. Nebel:
On the lexicographical generation of compressed codes. Inf. Process. Lett. 104(3): 95-100 (2007) - [c3]Markus E. Nebel:
Compact Descriptions for Efficient Algorithms. DCFS 2007: 27-40 - 2006
- [j11]Philippe Flajolet, Markus E. Nebel, Helmut Prodinger:
The scientific works of Rainer Kemp (1949-2004). Theor. Comput. Sci. 355(3): 371-381 (2006) - [j10]Markus E. Nebel:
Fast string matching by using probabilities: On an optimal mismatch variant of Horspool's algorithm. Theor. Comput. Sci. 359(1-3): 329-343 (2006) - 2004
- [c2]Markus E. Nebel:
Identifying Good Predictions of RNA Secondary Structure. Pacific Symposium on Biocomputing 2004: 423-434 - 2003
- [j9]Markus E. Nebel:
Combinatorial Properties of RNA Secondary Structures. J. Comput. Biol. 9(3): 541-573 (2003) - 2002
- [j8]Markus E. Nebel:
The Stack-Size of Combinatorial Tries Revisited. Discret. Math. Theor. Comput. Sci. 5(1): 1-16 (2002) - [j7]Markus E. Nebel:
A unified approach to the analysis of Horton-Strahler parameters of binary tree structures. Random Struct. Algorithms 21(3-4): 252-277 (2002) - [j6]Markus E. Nebel:
The stack-size of tries: a combinatorial study. Theor. Comput. Sci. 270(1-2): 441-461 (2002) - 2001
- [j5]Jérémie Bourdon, Markus E. Nebel, Brigitte Vallée:
On the Stack-Size of General Tries. RAIRO Theor. Informatics Appl. 35(2): 163-185 (2001) - [j4]Markus E. Nebel:
On the Power of Subroutines for Finite State Machines. J. Autom. Lang. Comb. 6(1): 51-74 (2001) - 2000
- [j3]Markus E. Nebel:
On the Horton-Strahler number for combinatorial tries. RAIRO Theor. Informatics Appl. 34(4): 279-296 (2000)
1990 – 1999
- 1997
- [b1]Markus E. Nebel:
Average-case-Analyse spezieller Baum-Parameter. Goethe University Frankfurt am Main, 1997, pp. 1-112 - [j2]Markus E. Nebel:
New Results on the Stack Ramification of Binary Trees. J. Autom. Lang. Comb. 2(3): 161-175 (1997) - [c1]Markus E. Nebel:
On the Average Complexity of the Membership Problem for a Generalized Dyck Language. FCT 1997: 352-363 - 1996
- [j1]Markus E. Nebel:
Digital Search Trees with Keys of Variable Length. RAIRO Theor. Informatics Appl. 30(6): 507-520 (1996)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-14 22:18 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
