Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Michael Elberfeld
@article{DBLP:journals/lmcs/ChenEM19,
author = {Yijia Chen and
Michael Elberfeld and
Moritz M{\"{u}}ller},
title = {The parameterized space complexity of model-checking bounded variable
first-order logic},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {3},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(3:31)2019},
doi = {10.23638/LMCS-15(3:31)2019},
timestamp = {Thu, 18 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/ChenEM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/or/BenderBEH18,
author = {Marco Bender and
Sebastian Berckey and
Michael Elberfeld and
J{\"{o}}rg Herbers},
editor = {Bernard Fortz and
Martine Labb{\'{e}}},
title = {Real-World Staff Rostering via Branch-and-Price in a Declarative Framework},
booktitle = {Operations Research Proceedings 2018, Selected Papers of the Annual
International Conference of the German Operations Research Society
(GOR), Brussels, Belgium, September 12-14, 2018},
pages = {445--451},
publisher = {Springer},
year = {2018},
url = {https://doi.org/10.1007/978-3-030-18500-8\_55},
doi = {10.1007/978-3-030-18500-8\_55},
timestamp = {Mon, 16 Sep 2019 13:45:40 +0200},
biburl = {https://dblp.org/rec/conf/or/BenderBEH18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/EickmeyerEH17,
author = {Kord Eickmeyer and
Michael Elberfeld and
Frederik Harwath},
title = {Succinctness of Order-Invariant Logics on Depth-Bounded Structures},
journal = {{ACM} Trans. Comput. Log.},
volume = {18},
number = {4},
pages = {33:1--33:25},
year = {2017},
url = {https://doi.org/10.1145/3152770},
doi = {10.1145/3152770},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/EickmeyerEH17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/ElberfeldS17,
author = {Michael Elberfeld and
Pascal Schweitzer},
title = {Canonizing Graphs of Bounded Tree Width in Logspace},
journal = {{ACM} Trans. Comput. Theory},
volume = {9},
number = {3},
pages = {12:1--12:29},
year = {2017},
url = {https://doi.org/10.1145/3132720},
doi = {10.1145/3132720},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/ElberfeldS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ChenEM17,
author = {Yijia Chen and
Michael Elberfeld and
Moritz M{\"{u}}ller},
title = {The parameterized space complexity of model-checking bounded variable
first-order logic},
journal = {CoRR},
volume = {abs/1703.01860},
year = {2017},
url = {http://arxiv.org/abs/1703.01860},
eprinttype = {arXiv},
eprint = {1703.01860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ChenEM17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/Elberfeld16,
author = {Michael Elberfeld},
title = {Variants of Courcelle's Theorem for complexity classes inside {P}},
journal = {{ACM} {SIGLOG} News},
volume = {3},
number = {1},
pages = {23--32},
year = {2016},
url = {https://doi.org/10.1145/2893582.2893588},
doi = {10.1145/2893582.2893588},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siglog/Elberfeld16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/ElberfeldGT16,
author = {Michael Elberfeld and
Martin Grohe and
Till Tantau},
title = {Where First-Order and Monadic Second-Order Logic Coincide},
journal = {{ACM} Trans. Comput. Log.},
volume = {17},
number = {4},
pages = {25},
year = {2016},
url = {https://doi.org/10.1145/2946799},
doi = {10.1145/2946799},
timestamp = {Fri, 10 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/ElberfeldGT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Elberfeld16,
author = {Michael Elberfeld},
editor = {Jean{-}Marc Talbot and
Laurent Regnier},
title = {Context-Free Graph Properties via Definable Decompositions},
booktitle = {25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016,
August 29 - September 1, 2016, Marseille, France},
series = {LIPIcs},
volume = {62},
pages = {17:1--17:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CSL.2016.17},
doi = {10.4230/LIPICS.CSL.2016.17},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/csl/Elberfeld16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ElberfeldFG16,
author = {Michael Elberfeld and
Marlin Frickenschmidt and
Martin Grohe},
editor = {Martin Grohe and
Eric Koskinen and
Natarajan Shankar},
title = {Order Invariance on Decomposable Structures},
booktitle = {Proceedings of the 31st Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} '16, New York, NY, USA, July 5-8, 2016},
pages = {397--406},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2933575.2934517},
doi = {10.1145/2933575.2934517},
timestamp = {Wed, 11 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/ElberfeldFG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ElberfeldS16,
author = {Michael Elberfeld and
Pascal Schweitzer},
editor = {Nicolas Ollinger and
Heribert Vollmer},
title = {Canonizing Graphs of Bounded Tree Width in Logspace},
booktitle = {33rd Symposium on Theoretical Aspects of Computer Science, {STACS}
2016, February 17-20, 2016, Orl{\'{e}}ans, France},
series = {LIPIcs},
volume = {47},
pages = {32:1--32:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.STACS.2016.32},
doi = {10.4230/LIPICS.STACS.2016.32},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ElberfeldS16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/EickmeyerEH16,
author = {Kord Eickmeyer and
Michael Elberfeld and
Frederik Harwath},
title = {Succinctness of Order-Invariant Logics on Depth-Bounded Structures},
journal = {CoRR},
volume = {abs/1603.09055},
year = {2016},
url = {http://arxiv.org/abs/1603.09055},
eprinttype = {arXiv},
eprint = {1603.09055},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/EickmeyerEH16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElberfeldFG16,
author = {Michael Elberfeld and
Marlin Frickenschmidt and
Martin Grohe},
title = {Order Invariance on Decomposable Structures},
journal = {CoRR},
volume = {abs/1606.06557},
year = {2016},
url = {http://arxiv.org/abs/1606.06557},
eprinttype = {arXiv},
eprint = {1606.06557},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElberfeldFG16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/algorithmica/ElberfeldST15,
author = {Michael Elberfeld and
Christoph Stockhusen and
Till Tantau},
title = {On the Space and Circuit Complexity of Parameterized Problems: Classes
and Completeness},
journal = {Algorithmica},
volume = {71},
number = {3},
pages = {661--701},
year = {2015},
url = {https://doi.org/10.1007/s00453-014-9944-y},
doi = {10.1007/S00453-014-9944-Y},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/algorithmica/ElberfeldST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ElberfeldS15,
author = {Michael Elberfeld and
Pascal Schweitzer},
title = {Canonizing Graphs of Bounded Tree Width in Logspace},
journal = {CoRR},
volume = {abs/1506.07810},
year = {2015},
url = {http://arxiv.org/abs/1506.07810},
eprinttype = {arXiv},
eprint = {1506.07810},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/ElberfeldS15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/BerkholzE14,
author = {Christoph Berkholz and
Michael Elberfeld},
editor = {Venkatesh Raman and
S. P. Suresh},
title = {Parameterized Complexity of Fixed Variable Logics},
booktitle = {34th International Conference on Foundation of Software Technology
and Theoretical Computer Science, {FSTTCS} 2014, December 15-17, 2014,
New Delhi, India},
series = {LIPIcs},
volume = {29},
pages = {109--120},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2014},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2014.109},
doi = {10.4230/LIPICS.FSTTCS.2014.109},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/fsttcs/BerkholzE14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/EickmeyerEH14,
author = {Kord Eickmeyer and
Michael Elberfeld and
Frederik Harwath},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Martin Dietzfelbinger and
Zolt{\'{a}}n {\'{E}}sik},
title = {Expressivity and Succinctness of Order-Invariant Logics on Depth-Bounded
Structures},
booktitle = {Mathematical Foundations of Computer Science 2014 - 39th International
Symposium, {MFCS} 2014, Budapest, Hungary, August 25-29, 2014. Proceedings,
Part {I}},
series = {Lecture Notes in Computer Science},
volume = {8634},
pages = {256--266},
publisher = {Springer},
year = {2014},
url = {https://doi.org/10.1007/978-3-662-44522-8\_22},
doi = {10.1007/978-3-662-44522-8\_22},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/EickmeyerEH14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/ElberfeldK14,
author = {Michael Elberfeld and
Ken{-}ichi Kawarabayashi},
editor = {David B. Shmoys},
title = {Embedding and canonizing graphs of bounded genus in logspace},
booktitle = {Symposium on Theory of Computing, {STOC} 2014, New York, NY, USA,
May 31 - June 03, 2014},
pages = {383--392},
publisher = {{ACM}},
year = {2014},
url = {https://doi.org/10.1145/2591796.2591865},
doi = {10.1145/2591796.2591865},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/ElberfeldK14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/dnb/Elberfeld13,
author = {Michael Elberfeld},
title = {Space and circuit complexity of monadic second-order definable problemes
on tree-decomposable structures},
school = {University of L{\"{u}}beck},
year = {2013},
url = {http://www.students.informatik.uni-luebeck.de/zhb/ediss1201.pdf},
urn = {urn:nbn:de:gbv:841-2013030615},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/dnb/Elberfeld13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElberfeldSDSS13,
author = {Michael Elberfeld and
Danny Segev and
Colin R. Davidson and
Dana Silverbush and
Roded Sharan},
title = {Approximation algorithms for orienting mixed graphs},
journal = {Theor. Comput. Sci.},
volume = {483},
pages = {96--103},
year = {2013},
url = {https://doi.org/10.1016/j.tcs.2012.03.044},
doi = {10.1016/J.TCS.2012.03.044},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElberfeldSDSS13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/ElberfeldT12,
author = {Michael Elberfeld and
Till Tantau},
title = {Phylogeny- and parsimony-based haplotype inference with constraints},
journal = {Inf. Comput.},
volume = {213},
pages = {33--47},
year = {2012},
url = {https://doi.org/10.1016/j.ic.2011.03.009},
doi = {10.1016/J.IC.2011.03.009},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/ElberfeldT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElberfeldST12,
author = {Michael Elberfeld and
Ilka Schnoor and
Till Tantau},
title = {Influence of tree topology restrictions on the complexity of haplotyping
with missing data},
journal = {Theor. Comput. Sci.},
volume = {432},
pages = {38--51},
year = {2012},
url = {https://doi.org/10.1016/j.tcs.2012.01.015},
doi = {10.1016/J.TCS.2012.01.015},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElberfeldST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/iwpec/ElberfeldST12,
author = {Michael Elberfeld and
Christoph Stockhusen and
Till Tantau},
editor = {Dimitrios M. Thilikos and
Gerhard J. Woeginger},
title = {On the Space Complexity of Parameterized Problems},
booktitle = {Parameterized and Exact Computation - 7th International Symposium,
{IPEC} 2012, Ljubljana, Slovenia, September 12-14, 2012. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7535},
pages = {206--217},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-33293-7\_20},
doi = {10.1007/978-3-642-33293-7\_20},
timestamp = {Tue, 14 May 2019 10:00:45 +0200},
biburl = {https://dblp.org/rec/conf/iwpec/ElberfeldST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/ElberfeldGT12,
author = {Michael Elberfeld and
Martin Grohe and
Till Tantau},
title = {Where First-Order and Monadic Second-Order Logic Coincide},
booktitle = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012},
pages = {265--274},
publisher = {{IEEE} Computer Society},
year = {2012},
url = {https://doi.org/10.1109/LICS.2012.37},
doi = {10.1109/LICS.2012.37},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/ElberfeldGT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ElberfeldJT12,
author = {Michael Elberfeld and
Andreas Jakoby and
Till Tantau},
editor = {Christoph D{\"{u}}rr and
Thomas Wilke},
title = {Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic
Depth},
booktitle = {29th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2012, February 29th - March 3rd, 2012, Paris, France},
series = {LIPIcs},
volume = {14},
pages = {66--77},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2012},
url = {https://doi.org/10.4230/LIPIcs.STACS.2012.66},
doi = {10.4230/LIPICS.STACS.2012.66},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/ElberfeldJT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@incollection{DBLP:conf/gi/Elberfeld12,
author = {Michael Elberfeld},
editor = {Abraham Bernstein and
Wolfgang Effelsberg and
Steffen H{\"{o}}lldobler and
Hans{-}Peter Lenhof and
Klaus{-}Peter L{\"{o}}hr and
Paul Molitor and
Gustaf Neumann and
R{\"{u}}diger Reischuk and
Nicole Schweikardt and
Myra Spiliopoulou and
Harald St{\"{o}}rrle and
Sabine S{\"{u}}sstrunk},
title = {Platz- und Schaltkreiskomplexit{\"{a}}t von MSO-beschreibbaren
Problemen auf baumartig zerlegbaren Strukturen},
booktitle = {Ausgezeichnete Informatikdissertationen 2012},
series = {{LNI}},
volume = {{D-13}},
pages = {71--80},
publisher = {{GI}},
year = {2012},
url = {https://dl.gi.de/handle/20.500.12116/33722},
timestamp = {Tue, 04 Jul 2023 17:43:32 +0200},
biburl = {https://dblp.org/rec/conf/gi/Elberfeld12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1204-6291,
author = {Michael Elberfeld and
Martin Grohe and
Till Tantau},
title = {Where First-Order and Monadic Second-Order Logic Coincide},
journal = {CoRR},
volume = {abs/1204.6291},
year = {2012},
url = {http://arxiv.org/abs/1204.6291},
eprinttype = {arXiv},
eprint = {1204.6291},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1204-6291.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ElberfeldST12,
author = {Michael Elberfeld and
Christoph Stockhusen and
Till Tantau},
title = {On the Space Complexity of Parameterized Problems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-150}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/150},
eprinttype = {ECCC},
eprint = {TR12-150},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ElberfeldST12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/im/ElberfeldBGMSSZS11,
author = {Michael Elberfeld and
Vineet Bafna and
Iftah Gamzu and
Alexander Medvedovsky and
Danny Segev and
Dana Silverbush and
Uri Zwick and
Roded Sharan},
title = {On the Approximability of Reachability-Preserving Network Orientations},
journal = {Internet Math.},
volume = {7},
number = {4},
pages = {209--232},
year = {2011},
url = {https://doi.org/10.1080/15427951.2011.604554},
doi = {10.1080/15427951.2011.604554},
timestamp = {Mon, 26 Oct 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/im/ElberfeldBGMSSZS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcb/SilverbushES11,
author = {Dana Silverbush and
Michael Elberfeld and
Roded Sharan},
title = {Optimally Orienting Physical Networks},
journal = {J. Comput. Biol.},
volume = {18},
number = {11},
pages = {1437--1448},
year = {2011},
url = {https://doi.org/10.1089/cmb.2011.0163},
doi = {10.1089/CMB.2011.0163},
timestamp = {Thu, 12 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcb/SilverbushES11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/ElberfeldT11,
author = {Michael Elberfeld and
Johannes Textor},
title = {Negative selection algorithms on strings with efficient training and
linear-time classification},
journal = {Theor. Comput. Sci.},
volume = {412},
number = {6},
pages = {534--542},
year = {2011},
url = {https://doi.org/10.1016/j.tcs.2010.09.022},
doi = {10.1016/J.TCS.2010.09.022},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/ElberfeldT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ElberfeldSDSS11,
author = {Michael Elberfeld and
Danny Segev and
Colin R. Davidson and
Dana Silverbush and
Roded Sharan},
editor = {Raffaele Giancarlo and
Giovanni Manzini},
title = {Approximation Algorithms for Orienting Mixed Graphs},
booktitle = {Combinatorial Pattern Matching - 22nd Annual Symposium, {CPM} 2011,
Palermo, Italy, June 27-29, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6661},
pages = {416--428},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-21458-5\_35},
doi = {10.1007/978-3-642-21458-5\_35},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ElberfeldSDSS11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/recomb/SilverbushES11,
author = {Dana Silverbush and
Michael Elberfeld and
Roded Sharan},
editor = {Vineet Bafna and
S{\"{u}}leyman Cenk Sahinalp},
title = {Optimally Orienting Physical Networks},
booktitle = {Research in Computational Molecular Biology - 15th Annual International
Conference, {RECOMB} 2011, Vancouver, BC, Canada, March 28-31, 2011.
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6577},
pages = {424--436},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-20036-6\_39},
doi = {10.1007/978-3-642-20036-6\_39},
timestamp = {Mon, 13 May 2019 09:30:09 +0200},
biburl = {https://dblp.org/rec/conf/recomb/SilverbushES11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ElberfeldJT11,
author = {Michael Elberfeld and
Andreas Jakoby and
Till Tantau},
title = {Algorithmic Meta Theorems for Circuit Classes of Constant and Logarithmic
Depth},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-128}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/128},
eprinttype = {ECCC},
eprint = {TR11-128},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ElberfeldJT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cpm/ElberfeldT10,
author = {Michael Elberfeld and
Till Tantau},
editor = {Amihood Amir and
Laxmi Parida},
title = {Phylogeny- and Parsimony-Based Haplotype Inference with Constraints},
booktitle = {Combinatorial Pattern Matching, 21st Annual Symposium, {CPM} 2010,
New York, NY, USA, June 21-23, 2010. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6129},
pages = {177--189},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-13509-5\_17},
doi = {10.1007/978-3-642-13509-5\_17},
timestamp = {Tue, 14 May 2019 10:00:38 +0200},
biburl = {https://dblp.org/rec/conf/cpm/ElberfeldT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/ElberfeldJT10,
author = {Michael Elberfeld and
Andreas Jakoby and
Till Tantau},
title = {Logspace Versions of the Theorems of Bodlaender and Courcelle},
booktitle = {51th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2010, October 23-26, 2010, Las Vegas, Nevada, {USA}},
pages = {143--152},
publisher = {{IEEE} Computer Society},
year = {2010},
url = {https://doi.org/10.1109/FOCS.2010.21},
doi = {10.1109/FOCS.2010.21},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/ElberfeldJT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ElberfeldJT10,
author = {Michael Elberfeld and
Andreas Jakoby and
Till Tantau},
title = {Logspace Versions of the Theorems of Bodlaender and Courcelle},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-062}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/062},
eprinttype = {ECCC},
eprint = {TR10-062},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ElberfeldJT10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icaris/ElberfeldT09,
author = {Michael Elberfeld and
Johannes Textor},
editor = {Paul S. Andrews and
Jon Timmis and
Nick D. L. Owens and
Uwe Aickelin and
Emma Hart and
Andrew Hone and
Andy M. Tyrrell},
title = {Efficient Algorithms for String-Based Negative Selection},
booktitle = {Artificial Immune Systems, 8th International Conference, {ICARIS}
2009, York, UK, August 9-12, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5666},
pages = {109--121},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03246-2\_14},
doi = {10.1007/978-3-642-03246-2\_14},
timestamp = {Wed, 25 Sep 2019 18:22:30 +0200},
biburl = {https://dblp.org/rec/conf/icaris/ElberfeldT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/ElberfeldST09,
author = {Michael Elberfeld and
Ilka Schnoor and
Till Tantau},
editor = {Jianer Chen and
S. Barry Cooper},
title = {Influence of Tree Topology Restrictions on the Complexity of Haplotyping
with Missing Data},
booktitle = {Theory and Applications of Models of Computation, 6th Annual Conference,
{TAMC} 2009, Changsha, China, May 18-22, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5532},
pages = {201--210},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02017-9\_23},
doi = {10.1007/978-3-642-02017-9\_23},
timestamp = {Tue, 14 May 2019 10:00:46 +0200},
biburl = {https://dblp.org/rec/conf/tamc/ElberfeldST09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0905-0602,
author = {Michael Elberfeld},
title = {Perfect Phylogeny Haplotyping is Complete for Logspace},
journal = {CoRR},
volume = {abs/0905.0602},
year = {2009},
url = {http://arxiv.org/abs/0905.0602},
eprinttype = {arXiv},
eprint = {0905.0602},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0905-0602.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/ElberfeldT08,
author = {Michael Elberfeld and
Till Tantau},
editor = {Edward Ochmanski and
Jerzy Tyszkiewicz},
title = {Computational Complexity of Perfect-Phylogeny-Related Haplotyping
Problems},
booktitle = {Mathematical Foundations of Computer Science 2008, 33rd International
Symposium, {MFCS} 2008, Torun, Poland, August 25-29, 2008, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5162},
pages = {299--310},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-85238-4\_24},
doi = {10.1007/978-3-540-85238-4\_24},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/ElberfeldT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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.
last updated on 2023-09-27 22:43 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:
