 | 2012 |
|---|
| 15 |       | Michael Elberfeld,
Andreas Jakoby,
Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.
STACS 2012: 66-77 |
| 14 | | Michael Elberfeld,
Martin Grohe,
Till Tantau:
Where First-Order and Monadic Second-Order Logic Coincide
CoRR abs/1204.6291: (2012) |
| 13 | | Michael Elberfeld,
Till Tantau:
Phylogeny- and parsimony-based haplotype inference with constraints.
Inf. Comput. 213: 33-47 (2012) |
| 2011 |
|---|
| 12 | | Michael Elberfeld,
Danny Segev,
Colin R. Davidson,
Dana Silverbush,
Roded Sharan:
Approximation Algorithms for Orienting Mixed Graphs.
CPM 2011: 416-428 |
| 11 | | Dana Silverbush,
Michael Elberfeld,
Roded Sharan:
Optimally Orienting Physical Networks.
RECOMB 2011: 424-436 |
| 10 | | Michael Elberfeld,
Andreas Jakoby,
Till Tantau:
Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic Depth.
Electronic Colloquium on Computational Complexity (ECCC) 18: 128 (2011) |
| 9 | | Michael Elberfeld,
Vineet Bafna,
Iftah Gamzu,
Alexander Medvedovsky,
Danny Segev,
Dana Silverbush,
Uri Zwick,
Roded Sharan:
On the Approximability of Reachability-Preserving Network Orientations.
Internet Mathematics 7(4): 209-232 (2011) |
| 8 | | Michael Elberfeld,
Johannes Textor:
Negative selection algorithms on strings with efficient training and linear-time classification.
Theor. Comput. Sci. 412(6): 534-542 (2011) |
| 2010 |
|---|
| 7 | | Michael Elberfeld,
Till Tantau:
Phylogeny- and Parsimony-Based Haplotype Inference with Constraints.
CPM 2010: 177-189 |
| 6 | | Michael Elberfeld,
Andreas Jakoby,
Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle.
FOCS 2010: 143-152 |
| 5 | | Michael Elberfeld,
Andreas Jakoby,
Till Tantau:
Logspace Versions of the Theorems of Bodlaender and Courcelle.
Electronic Colloquium on Computational Complexity (ECCC) 17: 62 (2010) |
| 2009 |
|---|
| 4 | | Michael Elberfeld,
Johannes Textor:
Efficient Algorithms for String-Based Negative Selection.
ICARIS 2009: 109-121 |
| 3 | | Michael Elberfeld,
Ilka Schnoor,
Till Tantau:
Influence of Tree Topology Restrictions on the Complexity of Haplotyping with Missing Data.
TAMC 2009: 201-210 |
| 2 | | Michael Elberfeld:
Perfect Phylogeny Haplotyping is Complete for Logspace
CoRR abs/0905.0602: (2009) |
| 2008 |
|---|
| 1 | | Michael Elberfeld,
Till Tantau:
Computational Complexity of Perfect-Phylogeny-Related Haplotyping Problems.
MFCS 2008: 299-310 |
Data released under the ODC-BY 1.0 license — See also our legal information page