default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Stephen D. Travers
@article{DBLP:journals/jcss/GlasserTW14,
author = {Christian Gla{\ss}er and
Stephen D. Travers and
Klaus W. Wagner},
title = {Perfect correspondences between dot-depth and polynomial-time hierarchies},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {7},
pages = {1359--1373},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.03.006},
doi = {10.1016/J.JCSS.2014.03.006},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GlasserTW14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/GlasserHPT14,
author = {Christian Gla{\ss}er and
John M. Hitchcock and
Aduri Pavan and
Stephen D. Travers},
title = {Unions of Disjoint NP-Complete Sets},
journal = {{ACM} Trans. Comput. Theory},
volume = {6},
number = {1},
pages = {3:1--3:10},
year = {2014},
url = {https://doi.org/10.1145/2591508},
doi = {10.1145/2591508},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GlasserHPT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/GlasserPT11,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Stephen D. Travers},
title = {The fault tolerance of NP-hard problems},
journal = {Inf. Comput.},
volume = {209},
number = {3},
pages = {443--455},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2010.11.012},
doi = {10.1016/J.IC.2010.11.012},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/GlasserPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/GlasserHPT11,
author = {Christian Gla{\ss}er and
John M. Hitchcock and
Aduri Pavan and
Stephen D. Travers},
editor = {Bin Fu and
Ding{-}Zhu Du},
title = {Unions of Disjoint NP-Complete Sets},
booktitle = {Computing and Combinatorics - 17th Annual International Conference,
{COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {240--251},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_22},
doi = {10.1007/978-3-642-22685-4\_22},
timestamp = {Tue, 07 May 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/GlasserHPT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dam/GlasserRTW10,
author = {Christian Gla{\ss}er and
Christian Reitwie{\ss}ner and
Stephen D. Travers and
Matthias Waldherr},
title = {Satisfiability of algebraic circuits over sets of natural numbers},
journal = {Discret. Appl. Math.},
volume = {158},
number = {13},
pages = {1394--1403},
year = {2010},
url = {https://doi.org/10.1016/j.dam.2010.04.001},
doi = {10.1016/J.DAM.2010.04.001},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/dam/GlasserRTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GlasserHRTW10,
author = {Christian Gla{\ss}er and
Katrin Herr and
Christian Reitwie{\ss}ner and
Stephen D. Travers and
Matthias Waldherr},
title = {Equivalence Problems for Circuits over Sets of Natural Numbers},
journal = {Theory Comput. Syst.},
volume = {46},
number = {1},
pages = {80--103},
year = {2010},
url = {https://doi.org/10.1007/s00224-008-9144-8},
doi = {10.1007/S00224-008-9144-8},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GlasserHRTW10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/GlasserT09,
author = {Christian Gla{\ss}er and
Stephen D. Travers},
title = {Machines that Can Output Empty Words},
journal = {Theory Comput. Syst.},
volume = {44},
number = {3},
pages = {369--390},
year = {2009},
url = {https://doi.org/10.1007/s00224-007-9087-5},
doi = {10.1007/S00224-007-9087-5},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/GlasserT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/GlasserSTZ09,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Liyu Zhang},
title = {Non-mitotic sets},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {21-23},
pages = {2011--2023},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.043},
doi = {10.1016/J.TCS.2008.12.043},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/GlasserSTZ09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lata/GlasserPT09,
author = {Christian Gla{\ss}er and
Aduri Pavan and
Stephen D. Travers},
editor = {Adrian{-}Horia Dediu and
Armand{-}Mihai Ionescu and
Carlos Mart{\'{\i}}n{-}Vide},
title = {The Fault Tolerance of NP-Hard Problems},
booktitle = {Language and Automata Theory and Applications, Third International
Conference, {LATA} 2009, Tarragona, Spain, April 2-8, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5457},
pages = {374--385},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-00982-2\_32},
doi = {10.1007/978-3-642-00982-2\_32},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/lata/GlasserPT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/GlasserSTW08,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Klaus W. Wagner},
title = {The complexity of unions of disjoint sets},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {7},
pages = {1173--1187},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2008.05.001},
doi = {10.1016/J.JCSS.2008.05.001},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/GlasserSTW08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/basesearch/Travers07,
author = {Stephen D. Travers},
title = {Structural Properties of NP-Hard Sets and Uniform Characterisations
of Complexity Classes (Strukturelle Eigenschaften NP-harter Mengen
und uniforme Charakterisierungen von Komplexit{\"{a}}tsklassen)},
school = {W{\"{u}}rzburg University, Germany},
year = {2007},
url = {https://opus.bibliothek.uni-wuerzburg.de/frontdoor/index/index/docId/2319},
urn = {urn:nbn:de:bvb:20-opus-27124},
timestamp = {Fri, 12 Apr 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/phd/basesearch/Travers07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csr/GlasserHRTW07,
author = {Christian Gla{\ss}er and
Katrin Herr and
Christian Reitwie{\ss}ner and
Stephen D. Travers and
Matthias Waldherr},
editor = {Volker Diekert and
Mikhail V. Volkov and
Andrei Voronkov},
title = {Equivalence Problems for Circuits over Sets of Natural Numbers},
booktitle = {Computer Science - Theory and Applications, Second International Symposium
on Computer Science in Russia, {CSR} 2007, Ekaterinburg, Russia, September
3-7, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4649},
pages = {127--138},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74510-5\_15},
doi = {10.1007/978-3-540-74510-5\_15},
timestamp = {Thu, 09 Nov 2023 20:20:35 +0100},
biburl = {https://dblp.org/rec/conf/csr/GlasserHRTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GlasserSTZ07,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Liyu Zhang},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {Non-mitotic Sets},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {146--157},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_12},
doi = {10.1007/978-3-540-77050-3\_12},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GlasserSTZ07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/GlasserRTW07,
author = {Christian Gla{\ss}er and
Christian Reitwie{\ss}ner and
Stephen D. Travers and
Matthias Waldherr},
editor = {Vikraman Arvind and
Sanjiva Prasad},
title = {Satisfiability of Algebraic Circuits over Sets of Natural Numbers},
booktitle = {{FSTTCS} 2007: Foundations of Software Technology and Theoretical
Computer Science, 27th International Conference, New Delhi, India,
December 12-14, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4855},
pages = {253--264},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-77050-3\_21},
doi = {10.1007/978-3-540-77050-3\_21},
timestamp = {Wed, 24 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/GlasserRTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/GlasserSTW07,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Klaus W. Wagner},
editor = {Wolfgang Thomas and
Pascal Weil},
title = {The Complexity of Unions of Disjoint Sets},
booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
Science, Aachen, Germany, February 22-24, 2007, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {248--259},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_22},
doi = {10.1007/978-3-540-70918-3\_22},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/GlasserSTW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Travers06,
author = {Stephen D. Travers},
title = {The complexity of membership problems for circuits over sets of integers},
journal = {Theor. Comput. Sci.},
volume = {369},
number = {1-3},
pages = {211--229},
year = {2006},
url = {https://doi.org/10.1016/j.tcs.2006.08.017},
doi = {10.1016/J.TCS.2006.08.017},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Travers06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dlt/GlasserTW06,
author = {Christian Gla{\ss}er and
Stephen D. Travers and
Klaus W. Wagner},
editor = {Oscar H. Ibarra and
Zhe Dang},
title = {Perfect Correspondences Between Dot-Depth and Polynomial-Time Hierarchy},
booktitle = {Developments in Language Theory, 10th International Conference, {DLT}
2006, Santa Barbara, CA, USA, June 26-29, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4036},
pages = {408--419},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11779148\_37},
doi = {10.1007/11779148\_37},
timestamp = {Tue, 14 May 2019 10:00:40 +0200},
biburl = {https://dblp.org/rec/conf/dlt/GlasserTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GlasserT06,
author = {Christian Gla{\ss}er and
Stephen D. Travers},
editor = {Rastislav Kralovic and
Pawel Urzyczyn},
title = {Machines that Can Output Empty Words},
booktitle = {Mathematical Foundations of Computer Science 2006, 31st International
Symposium, {MFCS} 2006, Star{\'{a}} Lesn{\'{a}}, Slovakia,
August 28-September 1, 2006, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {4162},
pages = {436--446},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11821069\_38},
doi = {10.1007/11821069\_38},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GlasserT06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GlasserSTW06,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Klaus W. Wagner},
title = {The Complexity of Unions of Disjoint Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-069}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-069/index.html},
eprinttype = {ECCC},
eprint = {TR06-069},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GlasserSTW06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GlasserSTZ06,
author = {Christian Gla{\ss}er and
Alan L. Selman and
Stephen D. Travers and
Liyu Zhang},
title = {Non-Mitotic Sets},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-090}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-090/index.html},
eprinttype = {ECCC},
eprint = {TR06-090},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GlasserSTZ06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-035,
author = {Christian Gla{\ss}er and
Stephen D. Travers and
Klaus W. Wagner},
title = {A Reducibility that Corresponds to Unbalanced Leaf-Language Classes},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-035}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-035/index.html},
eprinttype = {ECCC},
eprint = {TR05-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-147,
author = {Christian Gla{\ss}er and
Stephen D. Travers},
title = {Machines that can Output Empty Words},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-147}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-147/index.html},
eprinttype = {ECCC},
eprint = {TR05-147},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-147.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Travers04,
author = {Stephen D. Travers},
editor = {Jir{\'{\i}} Fiala and
V{\'{a}}clav Koubek and
Jan Kratochv{\'{\i}}l},
title = {The Complexity of Membership Problems for Circuits over Sets of Integers},
booktitle = {Mathematical Foundations of Computer Science 2004, 29th International
Symposium, {MFCS} 2004, Prague, Czech Republic, August 22-27, 2004,
Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3153},
pages = {322--333},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-28629-5\_23},
doi = {10.1007/978-3-540-28629-5\_23},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Travers04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
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 2024-05-08 21: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:
