BibTeX records: Thomas Thierauf

download as .bib file

@article{DBLP:journals/cc/GurjarKST17,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Nitin Saxena and
               Thomas Thierauf},
  title     = {Deterministic Identity Testing for Sum of Read-Once Oblivious Arithmetic
               Branching Programs},
  journal   = {Computational Complexity},
  volume    = {26},
  number    = {4},
  pages     = {835--880},
  year      = {2017},
  url       = {https://doi.org/10.1007/s00037-016-0141-z},
  doi       = {10.1007/s00037-016-0141-z},
  timestamp = {Wed, 22 Nov 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/cc/GurjarKST17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/sigact/FennerGT17,
  author    = {Stephen A. Fenner and
               Rohit Gurjar and
               Thomas Thierauf},
  title     = {Guest Column: Parallel Algorithms for Perfect Matching},
  journal   = {{SIGACT} News},
  volume    = {48},
  number    = {1},
  pages     = {102--109},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3061640.3061655},
  doi       = {10.1145/3061640.3061655},
  timestamp = {Tue, 21 Mar 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/sigact/FennerGT17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toct/GurjarKMT17,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Jochen Messner and
               Thomas Thierauf},
  title     = {Exact Perfect Matching in Complete Graphs},
  journal   = {{TOCT}},
  volume    = {9},
  number    = {2},
  pages     = {8:1--8:20},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3041402},
  doi       = {10.1145/3041402},
  timestamp = {Sun, 21 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/toct/GurjarKMT17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GurjarT17,
  author    = {Rohit Gurjar and
               Thomas Thierauf},
  title     = {Linear matroid intersection is in quasi-NC},
  booktitle = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  pages     = {821--830},
  year      = {2017},
  crossref  = {DBLP:conf/stoc/2017},
  url       = {http://doi.acm.org/10.1145/3055399.3055440},
  doi       = {10.1145/3055399.3055440},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/GurjarT17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-1708-02222,
  author    = {Rohit Gurjar and
               Thomas Thierauf and
               Nisheeth K. Vishnoi},
  title     = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular
               Faces},
  journal   = {CoRR},
  volume    = {abs/1708.02222},
  year      = {2017},
  url       = {http://arxiv.org/abs/1708.02222},
  archivePrefix = {arXiv},
  eprint    = {1708.02222},
  timestamp = {Tue, 05 Sep 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-1708-02222},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GurjarTV17,
  author    = {Rohit Gurjar and
               Thomas Thierauf and
               Nisheeth K. Vishnoi},
  title     = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular
               Faces},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {24},
  pages     = {127},
  year      = {2017},
  url       = {https://eccc.weizmann.ac.il/report/2017/127},
  timestamp = {Mon, 28 Aug 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GurjarTV17},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/StraubTW16,
  author    = {Simon Straub and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Counting the Number of Perfect Matchings in {K} 5-Free Graphs},
  journal   = {Theory Comput. Syst.},
  volume    = {59},
  number    = {3},
  pages     = {416--439},
  year      = {2016},
  url       = {https://doi.org/10.1007/s00224-015-9645-1},
  doi       = {10.1007/s00224-015-9645-1},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/StraubTW16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/toct/GurjarKMST16,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Jochen Messner and
               Simon Straub and
               Thomas Thierauf},
  title     = {Planarizing Gadgets for Perfect Matching Do Not Exist},
  journal   = {{TOCT}},
  volume    = {8},
  number    = {4},
  pages     = {14:1--14:15},
  year      = {2016},
  url       = {http://doi.acm.org/10.1145/2934310},
  doi       = {10.1145/2934310},
  timestamp = {Tue, 03 Jan 2017 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/journals/toct/GurjarKMST16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FennerGT16,
  author    = {Stephen A. Fenner and
               Rohit Gurjar and
               Thomas Thierauf},
  title     = {Bipartite perfect matching is in quasi-NC},
  booktitle = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  pages     = {754--763},
  year      = {2016},
  crossref  = {DBLP:conf/stoc/2016},
  url       = {http://doi.acm.org/10.1145/2897518.2897564},
  doi       = {10.1145/2897518.2897564},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/FennerGT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/FennerGT16,
  author    = {Stephen A. Fenner and
               Rohit Gurjar and
               Thomas Thierauf},
  title     = {Bipartite Perfect Matching is in quasi-NC},
  journal   = {CoRR},
  volume    = {abs/1601.06319},
  year      = {2016},
  url       = {http://arxiv.org/abs/1601.06319},
  archivePrefix = {arXiv},
  eprint    = {1601.06319},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/FennerGT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/KabanetsTTU16,
  author    = {Valentine Kabanets and
               Thomas Thierauf and
               Jacobo Tor{\'{a}}n and
               Christopher Umans},
  title     = {Algebraic Methods in Computational Complexity (Dagstuhl Seminar 16411)},
  journal   = {Dagstuhl Reports},
  volume    = {6},
  number    = {10},
  pages     = {13--32},
  year      = {2016},
  url       = {https://doi.org/10.4230/DagRep.6.10.13},
  doi       = {10.4230/DagRep.6.10.13},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dagstuhl-reports/KabanetsTTU16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GurjarT16,
  author    = {Rohit Gurjar and
               Thomas Thierauf},
  title     = {Linear Matroid Intersection is in quasi-NC},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {23},
  pages     = {182},
  year      = {2016},
  url       = {http://eccc.hpi-web.de/report/2016/182},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GurjarT16},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cjtcs/ThieraufW15,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {Reachability in K\({}_{\mbox{3,3}}\)-free and K\({}_{\mbox{5}}\)-free
               Graphs is in Unambiguous Logspace},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {2015},
  year      = {2015},
  url       = {http://cjtcs.cs.uchicago.edu/articles/2015/2/contents.html},
  timestamp = {Tue, 21 Apr 2015 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cjtcs/ThieraufW15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/GurjarKST15,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Nitin Saxena and
               Thomas Thierauf},
  title     = {Deterministic Identity Testing for Sum of Read-once Oblivious Arithmetic
               Branching Programs},
  booktitle = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
               2015, Portland, Oregon, {USA}},
  pages     = {323--346},
  year      = {2015},
  crossref  = {DBLP:conf/coco/2015},
  url       = {https://doi.org/10.4230/LIPIcs.CCC.2015.323},
  doi       = {10.4230/LIPIcs.CCC.2015.323},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/GurjarKST15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FennerGMST15,
  author    = {Stephen A. Fenner and
               Daniel Grier and
               Jochen Messner and
               Luke Schaeffer and
               Thomas Thierauf},
  title     = {Game Values and Computational Complexity: An Analysis via Black-White
               Combinatorial Games},
  booktitle = {Algorithms and Computation - 26th International Symposium, {ISAAC}
               2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
  pages     = {689--699},
  year      = {2015},
  crossref  = {DBLP:conf/isaac/2015},
  url       = {https://doi.org/10.1007/978-3-662-48971-0_58},
  doi       = {10.1007/978-3-662-48971-0_58},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/FennerGMST15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FennerGMST15,
  author    = {Stephen A. Fenner and
               Daniel Grier and
               Jochen Messner and
               Luke Schaeffer and
               Thomas Thierauf},
  title     = {Game Values and Computational Complexity: An Analysis via Black-White
               Combinatorial Games},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {21},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/021},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FennerGMST15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FennerGT15,
  author    = {Stephen A. Fenner and
               Rohit Gurjar and
               Thomas Thierauf},
  title     = {Bipartite Perfect Matching is in quasi-NC},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {22},
  pages     = {177},
  year      = {2015},
  url       = {http://eccc.hpi-web.de/report/2015/177},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FennerGT15},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cjtcs/ThieraufW14,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {Reachability in K\({}_{\mbox{\{3, 3\}}}\)-free and K\({}_{\mbox{5}}\)-free
               Graphs is in Unambiguous Logspace},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {2014},
  year      = {2014},
  url       = {http://cjtcs.cs.uchicago.edu/articles/2014/2/contents.html},
  timestamp = {Tue, 06 May 2014 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cjtcs/ThieraufW14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/StraubTW14,
  author    = {Simon Straub and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Counting the Number of Perfect Matchings in K5-Free Graphs},
  booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  pages     = {66--77},
  year      = {2014},
  crossref  = {DBLP:conf/coco/2014},
  url       = {https://doi.org/10.1109/CCC.2014.15},
  doi       = {10.1109/CCC.2014.15},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/StraubTW14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/GurjarKST14,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Nitin Saxena and
               Thomas Thierauf},
  title     = {Deterministic Identity Testing for Sum of Read Once ABPs},
  journal   = {CoRR},
  volume    = {abs/1411.7341},
  year      = {2014},
  url       = {http://arxiv.org/abs/1411.7341},
  archivePrefix = {arXiv},
  eprint    = {1411.7341},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/GurjarKST14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AgrawalKTU14,
  author    = {Manindra Agrawal and
               Valentine Kabanets and
               Thomas Thierauf and
               Christopher Umans},
  title     = {Algebra in Computational Complexity (Dagstuhl Seminar 14391)},
  journal   = {Dagstuhl Reports},
  volume    = {4},
  number    = {9},
  pages     = {85--105},
  year      = {2014},
  url       = {https://doi.org/10.4230/DagRep.4.9.85},
  doi       = {10.4230/DagRep.4.9.85},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dagstuhl-reports/AgrawalKTU14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/StraubTW14,
  author    = {Simon Straub and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Counting the Number of Perfect Matchings in K\({}_{\mbox{5}}\)-free
               Graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {79},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/079},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/StraubTW14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GurjarKST14,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Nitin Saxena and
               Thomas Thierauf},
  title     = {Deterministic Identity Testing for Sum of Read Once ABPs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {21},
  pages     = {158},
  year      = {2014},
  url       = {http://eccc.hpi-web.de/report/2014/158},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GurjarKST14},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/FennerGKT13,
  author    = {Stephen A. Fenner and
               Rohit Gurjar and
               Arpita Korwar and
               Thomas Thierauf},
  title     = {On Two-Level Poset Games},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {19},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/019},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/FennerGKT13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GurjarKMT13,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Jochen Messner and
               Thomas Thierauf},
  title     = {Exact Perfect Matching in Complete Graphs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {20},
  pages     = {112},
  year      = {2013},
  url       = {http://eccc.hpi-web.de/report/2013/112},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GurjarKMT13},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/MessnerT12,
  author    = {Jochen Messner and
               Thomas Thierauf},
  title     = {A Kolmogorov complexity proof of the Lov{\'{a}}sz Local Lemma
               for satisfiability},
  journal   = {Theor. Comput. Sci.},
  volume    = {461},
  pages     = {55--64},
  year      = {2012},
  url       = {https://doi.org/10.1016/j.tcs.2012.06.005},
  doi       = {10.1016/j.tcs.2012.06.005},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/MessnerT12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GurjarKMST12,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Jochen Messner and
               Simon Straub and
               Thomas Thierauf},
  title     = {Planarizing Gadgets for Perfect Matching Do Not Exist},
  booktitle = {Mathematical Foundations of Computer Science 2012 - 37th International
               Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
               Proceedings},
  pages     = {478--490},
  year      = {2012},
  crossref  = {DBLP:conf/mfcs/2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2_43},
  doi       = {10.1007/978-3-642-32589-2_43},
  timestamp = {Thu, 25 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/GurjarKMST12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AgrawalTU12,
  author    = {Manindra Agrawal and
               Thomas Thierauf and
               Christopher Umans},
  title     = {Algebraic and Combinatorial Methods in Computational Complexity (Dagstuhl
               Seminar 12421)},
  journal   = {Dagstuhl Reports},
  volume    = {2},
  number    = {10},
  pages     = {60--78},
  year      = {2012},
  url       = {https://doi.org/10.4230/DagRep.2.10.60},
  doi       = {10.4230/DagRep.2.10.60},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/dagstuhl-reports/AgrawalTU12},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MessnerT11,
  author    = {Jochen Messner and
               Thomas Thierauf},
  title     = {A Kolmogorov Complexity Proof of the Lov{\'{a}}sz Local Lemma
               for Satisfiability},
  booktitle = {Computing and Combinatorics - 17th Annual International Conference,
               {COCOON} 2011, Dallas, TX, USA, August 14-16, 2011. Proceedings},
  pages     = {168--179},
  year      = {2011},
  crossref  = {DBLP:conf/cocoon/2011},
  url       = {https://doi.org/10.1007/978-3-642-22685-4_15},
  doi       = {10.1007/978-3-642-22685-4_15},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/MessnerT11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/MessnerT11,
  author    = {Jochen Messner and
               Thomas Thierauf},
  title     = {A Kolmogorov Complexity Proof of the Lov{\'{a}}sz Local Lemma
               for Satisfiability},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {18},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/018},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/MessnerT11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/GurjarKMST11,
  author    = {Rohit Gurjar and
               Arpita Korwar and
               Jochen Messner and
               Simon Straub and
               Thomas Thierauf},
  title     = {Planarizing Gadgets for Perfect Matching do not Exist},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {18},
  pages     = {148},
  year      = {2011},
  url       = {http://eccc.hpi-web.de/report/2011/148},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/GurjarKMST11},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/HoangT10,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Complexity of the Inertia},
  journal   = {Computational Complexity},
  volume    = {19},
  number    = {4},
  pages     = {559--580},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00037-010-0295-z},
  doi       = {10.1007/s00037-010-0295-z},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/HoangT10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/DornT10,
  author    = {Sebastian D{\"{o}}rn and
               Thomas Thierauf},
  title     = {A note on the search for k elements via quantum walk},
  journal   = {Inf. Process. Lett.},
  volume    = {110},
  number    = {22},
  pages     = {975--978},
  year      = {2010},
  url       = {https://doi.org/10.1016/j.ipl.2010.08.004},
  doi       = {10.1016/j.ipl.2010.08.004},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/DornT10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/ThieraufW10,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous
               Logspace},
  journal   = {Theory Comput. Syst.},
  volume    = {47},
  number    = {3},
  pages     = {655--673},
  year      = {2010},
  url       = {https://doi.org/10.1007/s00224-009-9188-4},
  doi       = {10.1007/s00224-009-9188-4},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/ThieraufW10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/DattaNTW10,
  author    = {Samir Datta and
               Prajakta Nimbhorkar and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Graph Isomorphism for K\({}_{\mbox{\{3, 3\}}}\)-free and K\({}_{\mbox{5}}\)-free
               graphs is in Log-space},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {17},
  pages     = {50},
  year      = {2010},
  url       = {http://eccc.hpi-web.de/report/2010/050},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/DattaNTW10},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/DornT09,
  author    = {Sebastian D{\"{o}}rn and
               Thomas Thierauf},
  title     = {The quantum query complexity of the determinant},
  journal   = {Inf. Process. Lett.},
  volume    = {109},
  number    = {6},
  pages     = {325--328},
  year      = {2009},
  url       = {https://doi.org/10.1016/j.ipl.2008.11.006},
  doi       = {10.1016/j.ipl.2008.11.006},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/DornT09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/DattaLNTW09,
  author    = {Samir Datta and
               Nutan Limaye and
               Prajakta Nimbhorkar and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Planar Graph Isomorphism is in Log-Space},
  booktitle = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages     = {203--214},
  year      = {2009},
  crossref  = {DBLP:conf/coco/2009},
  url       = {https://doi.org/10.1109/CCC.2009.16},
  doi       = {10.1109/CCC.2009.16},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/DattaLNTW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fct/ThieraufW09,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {Reachability in \emph{K}\({}_{\mbox{3, 3}}\)-Free Graphs and \emph{K}\({}_{\mbox{5}}\)-Free
               Graphs Is in Unambiguous Log-Space},
  booktitle = {Fundamentals of Computation Theory, 17th International Symposium,
               {FCT} 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings},
  pages     = {323--334},
  year      = {2009},
  crossref  = {DBLP:conf/fct/2009},
  url       = {https://doi.org/10.1007/978-3-642-03409-1_29},
  doi       = {10.1007/978-3-642-03409-1_29},
  timestamp = {Wed, 17 May 2017 14:24:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fct/ThieraufW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaNTW09,
  author    = {Samir Datta and
               Prajakta Nimbhorkar and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Graph Isomorphism for K{\_}\{3, 3\}-free and K{\_}5-free graphs is
               in Log-space},
  booktitle = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
               {IIT} Kanpur, India},
  pages     = {145--156},
  year      = {2009},
  crossref  = {DBLP:conf/fsttcs/2009},
  url       = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2314},
  doi       = {10.4230/LIPIcs.FSTTCS.2009.2314},
  timestamp = {Wed, 24 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/DattaNTW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9421,
  editor    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {09421},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2009},
  url       = {http://drops.dagstuhl.de/portals/09421/},
  timestamp = {Wed, 08 Apr 2015 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2009P9421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09,
  author    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {09421 Abstracts Collection - Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  year      = {2009},
  crossref  = {DBLP:conf/dagstuhl/2009P9421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2418/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalFTU09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09a,
  author    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {09421 Executive Summary - Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  year      = {2009},
  crossref  = {DBLP:conf/dagstuhl/2009P9421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2410/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalFTU09a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DattaLNTW09,
  author    = {Samir Datta and
               Nutan Limaye and
               Prajakta Nimbhorkar and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {Planar Graph Isomorphism is in Log-Space},
  booktitle = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  year      = {2009},
  crossref  = {DBLP:conf/dagstuhl/2009P9421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2010/2416/},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/DattaLNTW09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/WagnerT09,
  author    = {Fabian Wagner and
               Thomas Thierauf},
  title     = {Reachability in K{\_}\{3, 3\}-free Graphs and K{\_}5-free Graphs is
               in Unambiguous Log-Space},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {29},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/029},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/WagnerT09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/WagnerDLNT09,
  author    = {Fabian Wagner and
               Samir Datta and
               Nutan Limaye and
               Prajakta Nimbhorkar and
               Thomas Thierauf},
  title     = {Planar Graph Isomorphism is in Log-space},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {16},
  pages     = {52},
  year      = {2009},
  url       = {http://eccc.hpi-web.de/report/2009/052},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/WagnerDLNT09},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DornT08,
  author    = {Sebastian D{\"{o}}rn and
               Thomas Thierauf},
  title     = {The Quantum Complexity of Group Testing},
  booktitle = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference
               on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
               Smokovec, Slovakia, January 19-25, 2008, Proceedings},
  pages     = {506--518},
  year      = {2008},
  crossref  = {DBLP:conf/sofsem/2008},
  url       = {https://doi.org/10.1007/978-3-540-77566-9_44},
  doi       = {10.1007/978-3-540-77566-9_44},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sofsem/DornT08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ThieraufW08,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous
               Logspace},
  booktitle = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
               Science, Bordeaux, France, February 21-23, 2008, Proceedings},
  pages     = {633--644},
  year      = {2008},
  crossref  = {DBLP:conf/stacs/2008},
  url       = {https://doi.org/10.4230/LIPIcs.STACS.2008.1327},
  doi       = {10.4230/LIPIcs.STACS.2008.1327},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/ThieraufW08},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7411,
  editor    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {07411},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  year      = {2008},
  url       = {http://drops.dagstuhl.de/portals/07411/},
  timestamp = {Wed, 19 Jun 2013 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2007P7411},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0802-2825,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous
               Logspace},
  journal   = {CoRR},
  volume    = {abs/0802.2825},
  year      = {2008},
  url       = {http://arxiv.org/abs/0802.2825},
  archivePrefix = {arXiv},
  eprint    = {0802.2825},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0802-2825},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/corr/abs-0809-2319,
  author    = {Samir Datta and
               Nutan Limaye and
               Prajakta Nimbhorkar and
               Thomas Thierauf and
               Fabian Wagner},
  title     = {A Log-space Algorithm for Canonization of Planar Graphs},
  journal   = {CoRR},
  volume    = {abs/0809.2319},
  year      = {2008},
  url       = {http://arxiv.org/abs/0809.2319},
  archivePrefix = {arXiv},
  eprint    = {0809.2319},
  timestamp = {Wed, 07 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/corr/abs-0809-2319},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fct/DornT07,
  author    = {Sebastian D{\"{o}}rn and
               Thomas Thierauf},
  title     = {The Quantum Query Complexity of Algebraic Properties},
  booktitle = {Fundamentals of Computation Theory, 16th International Symposium,
               {FCT} 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
  pages     = {250--260},
  year      = {2007},
  crossref  = {DBLP:conf/fct/2007},
  url       = {https://doi.org/10.1007/978-3-540-74240-1_22},
  doi       = {10.1007/978-3-540-74240-1_22},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fct/DornT07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AgrawalHT07,
  author    = {Manindra Agrawal and
               Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Polynomially Bounded Perfect Matching Problem Is in {NC} \({}^{\mbox{2}}\)},
  booktitle = {{STACS} 2007, 24th Annual Symposium on Theoretical Aspects of Computer
               Science, Aachen, Germany, February 22-24, 2007, Proceedings},
  pages     = {489--499},
  year      = {2007},
  crossref  = {DBLP:conf/stacs/2007},
  url       = {https://doi.org/10.1007/978-3-540-70918-3_42},
  doi       = {10.1007/978-3-540-70918-3_42},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/AgrawalHT07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07,
  author    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {07411 Executive Summary -- Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  year      = {2007},
  crossref  = {DBLP:conf/dagstuhl/2007P7411},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2008/1306},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalBFT07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07a,
  author    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {07411 Abstracts Collection -- Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  year      = {2007},
  crossref  = {DBLP:conf/dagstuhl/2007P7411},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2008/1307},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/AgrawalBFT07a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ThieraufW07,
  author    = {Thomas Thierauf and
               Fabian Wagner},
  title     = {The Isomorphism Problem for Planar 3-Connected Graphs is in Unambiguous
               Logspace},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {14},
  number    = {068},
  year      = {2007},
  url       = {http://eccc.hpi-web.de/eccc-reports/2007/TR07-068/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ThieraufW07},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HoangMT06,
  author    = {Thanh Minh Hoang and
               Meena Mahajan and
               Thomas Thierauf},
  title     = {On the Bipartite Unique Perfect Matching Problem},
  booktitle = {Automata, Languages and Programming, 33rd International Colloquium,
               {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
  pages     = {453--464},
  year      = {2006},
  crossref  = {DBLP:conf/icalp/2006-1},
  url       = {https://doi.org/10.1007/11786986_40},
  doi       = {10.1007/11786986_40},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/HoangMT06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalHT06,
  author    = {Manindra Agrawal and
               Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The polynomially bounded perfect matching problem is in NC{\^{}}2},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {13},
  number    = {129},
  year      = {2006},
  url       = {http://eccc.hpi-web.de/eccc-reports/2006/TR06-129/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/AgrawalHT06},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/HoangT05,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Complexity of the Inertia and Some Closure Properties of GapL},
  booktitle = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  pages     = {28--37},
  year      = {2005},
  crossref  = {DBLP:conf/coco/2005},
  url       = {https://doi.org/10.1109/CCC.2005.28},
  doi       = {10.1109/CCC.2005.28},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/HoangT05},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4421,
  editor    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {04421},
  publisher = {IBFI, Schloss Dagstuhl, Germany},
  year      = {2005},
  url       = {http://drops.dagstuhl.de/portals/04421/},
  timestamp = {Wed, 19 Jun 2013 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2004P4421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ijfcs/HoangT04,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {On The Minimal Polynomial Of {A} Matrix},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {15},
  number    = {1},
  pages     = {89--105},
  year      = {2004},
  url       = {https://doi.org/10.1142/S0129054104002327},
  doi       = {10.1142/S0129054104002327},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijfcs/HoangT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ijfcs/HoangT04a,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {Erratum: On The Minimal Polynomial Of {A} Matrix},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {15},
  number    = {4},
  pages     = {685},
  year      = {2004},
  url       = {https://doi.org/10.1142/S0129054104002613},
  doi       = {10.1142/S0129054104002613},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijfcs/HoangT04a},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanFT04,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {04421 Abstracts Collection - Algebraic Methods in Computational Complexity},
  booktitle = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  year      = {2004},
  crossref  = {DBLP:conf/dagstuhl/2004P4421},
  url       = {http://drops.dagstuhl.de/opus/volltexte/2005/116},
  timestamp = {Sun, 09 Jul 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/BuhrmanFT04},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-024,
  author    = {Thomas Thierauf and
               Thanh Minh Hoang},
  title     = {On Closure Properties of GapL},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  number    = {024},
  year      = {2004},
  url       = {http://eccc.hpi-web.de/eccc-reports/2004/TR04-024/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR04-024},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/tcs/HoangT03,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The complexity of the characteristic and the minimal polynomial},
  journal   = {Theor. Comput. Sci.},
  volume    = {295},
  pages     = {205--222},
  year      = {2003},
  url       = {https://doi.org/10.1016/S0304-3975(02)00404-8},
  doi       = {10.1016/S0304-3975(02)00404-8},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/tcs/HoangT03},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HoangT02,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {On the Minimal Polynomial of a Matrix},
  booktitle = {Computing and Combinatorics, 8th Annual International Conference,
               {COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
  pages     = {37--46},
  year      = {2002},
  crossref  = {DBLP:conf/cocoon/2002},
  url       = {https://doi.org/10.1007/3-540-45655-4_6},
  doi       = {10.1007/3-540-45655-4_6},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/HoangT02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HoangT02,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Complexity of the Inertia},
  booktitle = {{FST} {TCS} 2002: Foundations of Software Technology and Theoretical
               Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002,
               Proceedings},
  pages     = {206--217},
  year      = {2002},
  crossref  = {DBLP:conf/fsttcs/2002},
  url       = {https://doi.org/10.1007/3-540-36206-1_19},
  doi       = {10.1007/3-540-36206-1_19},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/HoangT02},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HoangT01,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Complexity of the Minimal Polynomial},
  booktitle = {Mathematical Foundations of Computer Science 2001, 26th International
               Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
               2001, Proceedings},
  pages     = {408--420},
  year      = {2001},
  crossref  = {DBLP:conf/mfcs/2001},
  url       = {https://doi.org/10.1007/3-540-44683-4_36},
  doi       = {10.1007/3-540-44683-4_36},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/HoangT01},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-028,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Complexity of the Minimal Polynomial},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {8},
  number    = {28},
  year      = {2001},
  url       = {http://eccc.hpi-web.de/eccc-reports/2001/TR01-028/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR01-028},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@book{DBLP:books/sp/Thierauf00,
  author    = {Thomas Thierauf},
  title     = {The Computational Complexity of Equivalence and Isomorphism Problems},
  series    = {Lecture Notes in Computer Science},
  volume    = {1852},
  publisher = {Springer},
  year      = {2000},
  url       = {https://doi.org/10.1007/3-540-45303-2},
  doi       = {10.1007/3-540-45303-2},
  isbn      = {3-540-41032-5},
  timestamp = {Tue, 16 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/books/sp/Thierauf00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/AgrawalT00,
  author    = {Manindra Agrawal and
               Thomas Thierauf},
  title     = {The Formula Isomorphism Problem},
  journal   = {{SIAM} J. Comput.},
  volume    = {30},
  number    = {3},
  pages     = {990--1009},
  year      = {2000},
  url       = {https://doi.org/10.1137/S0097539798343647},
  doi       = {10.1137/S0097539798343647},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/AgrawalT00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/HoangT00,
  author    = {Thanh Minh Hoang and
               Thomas Thierauf},
  title     = {The Complexity of Verifying the Characteristic Polynomial and Testing
               Similarity},
  booktitle = {Proceedings of the 15th Annual {IEEE} Conference on Computational
               Complexity, Florence, Italy, July 4-7, 2000},
  pages     = {87},
  year      = {2000},
  crossref  = {DBLP:conf/coco/2000},
  url       = {https://doi.org/10.1109/CCC.2000.856738},
  doi       = {10.1109/CCC.2000.856738},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/HoangT00},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cjtcs/FennerGHSTV99,
  author    = {Stephen A. Fenner and
               Frederic Green and
               Steven Homer and
               Alan L. Selman and
               Thomas Thierauf and
               Heribert Vollmer},
  title     = {Complements of Multivalued Functions},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {1999},
  year      = {1999},
  url       = {http://cjtcs.cs.uchicago.edu/articles/1999/3/contents.html},
  timestamp = {Thu, 08 Jul 2004 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cjtcs/FennerGHSTV99},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cjtcs/Thierauf98,
  author    = {Thomas Thierauf},
  title     = {The Isomorphism Problem for Read-Once Branching Programs and Arithmetic
               Circuits},
  journal   = {Chicago J. Theor. Comput. Sci.},
  volume    = {1998},
  year      = {1998},
  url       = {http://cjtcs.cs.uchicago.edu/articles/1998/1/contents.html},
  timestamp = {Thu, 08 Jul 2004 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cjtcs/Thierauf98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/BuhrmanKT98,
  author    = {Harry Buhrman and
               Jim Kadin and
               Thomas Thierauf},
  title     = {Functions Computable with Nonadaptive Queries to {NP}},
  journal   = {Theory Comput. Syst.},
  volume    = {31},
  number    = {1},
  pages     = {77--92},
  year      = {1998},
  url       = {https://doi.org/10.1007/s002240000079},
  doi       = {10.1007/s002240000079},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/BuhrmanKT98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanFT98,
  author    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Nonrelativizing Separations},
  booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages     = {8--12},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694585},
  doi       = {10.1109/CCC.1998.694585},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BuhrmanFT98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/AgrawalT98,
  author    = {Manindra Agrawal and
               Thomas Thierauf},
  title     = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
  booktitle = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  pages     = {81},
  year      = {1998},
  crossref  = {DBLP:conf/coco/1998},
  url       = {https://doi.org/10.1109/CCC.1998.694593},
  doi       = {10.1109/CCC.1998.694593},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/AgrawalT98},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/HanHT97,
  author    = {Yenjo Han and
               Lane A. Hemaspaandra and
               Thomas Thierauf},
  title     = {Threshold Computation and Cryptographic Security},
  journal   = {{SIAM} J. Comput.},
  volume    = {26},
  number    = {1},
  pages     = {59--78},
  year      = {1997},
  url       = {https://doi.org/10.1137/S0097539792240467},
  doi       = {10.1137/S0097539792240467},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/HanHT97},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR97-060,
  author    = {Manindra Agrawal and
               Thomas Thierauf},
  title     = {The Satisfiability Problem for Probabilistic Ordered Branching Programs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {4},
  number    = {60},
  year      = {1997},
  url       = {http://eccc.hpi-web.de/eccc-reports/1997/TR97-060/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR97-060},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/iandc/HanT96,
  author    = {Yenjo Han and
               Thomas Thierauf},
  title     = {Restricted Information from Nonadaptive Queries to {NP}},
  journal   = {Inf. Comput.},
  volume    = {128},
  number    = {2},
  pages     = {119--125},
  year      = {1996},
  url       = {https://doi.org/10.1006/inco.1996.0067},
  doi       = {10.1006/inco.1996.0067},
  timestamp = {Thu, 18 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/iandc/HanT96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ita/ThieraufTW96,
  author    = {Thomas Thierauf and
               Seinosuke Toda and
               Osamu Watanabe},
  title     = {On Sets Bounded Truth-Table Reducible to P-Selective Sets},
  journal   = {{ITA}},
  volume    = {30},
  number    = {2},
  pages     = {135--154},
  year      = {1996},
  timestamp = {Wed, 08 Oct 2014 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ita/ThieraufTW96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/jcss/OgiharaTTW96,
  author    = {Mitsunori Ogihara and
               Thomas Thierauf and
               Seinosuke Toda and
               Osamu Watanabe},
  title     = {On Closure Properties of {\#}P in the Context of {PF} {\textdegree}
               {\#}P},
  journal   = {J. Comput. Syst. Sci.},
  volume    = {53},
  number    = {2},
  pages     = {171--179},
  year      = {1996},
  url       = {https://doi.org/10.1006/jcss.1996.0059},
  doi       = {10.1006/jcss.1996.0059},
  timestamp = {Sat, 20 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/jcss/OgiharaTTW96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/mst/CaiGT96,
  author    = {Jin{-}yi Cai and
               Frederic Green and
               Thomas Thierauf},
  title     = {On the Correlation of Symmetric Functions},
  journal   = {Mathematical Systems Theory},
  volume    = {29},
  number    = {3},
  pages     = {245--258},
  year      = {1996},
  url       = {https://doi.org/10.1007/BF01201278},
  doi       = {10.1007/BF01201278},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/mst/CaiGT96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/FennerGHSTV96,
  author    = {Stephen A. Fenner and
               Frederic Green and
               Steven Homer and
               Alan L. Selman and
               Thomas Thierauf and
               Heribert Vollmer},
  title     = {Complements of Multivalued Functions},
  booktitle = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  pages     = {260--269},
  year      = {1996},
  crossref  = {DBLP:conf/coco/1996},
  url       = {https://doi.org/10.1109/CCC.1996.507688},
  doi       = {10.1109/CCC.1996.507688},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/FennerGHSTV96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/focs/AgrawalT96,
  author    = {Manindra Agrawal and
               Thomas Thierauf},
  title     = {The Boolean Isomorphism Problem},
  booktitle = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  pages     = {422--430},
  year      = {1996},
  crossref  = {DBLP:conf/focs/1996},
  url       = {https://doi.org/10.1109/SFCS.1996.548501},
  doi       = {10.1109/SFCS.1996.548501},
  timestamp = {Fri, 19 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/focs/AgrawalT96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalBT96,
  author    = {Manindra Agrawal and
               Richard Beigel and
               Thomas Thierauf},
  title     = {Pinpointing Computation with Modular Queries in the Boolean Hierarchy},
  booktitle = {Foundations of Software Technology and Theoretical Computer Science,
               16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
  pages     = {322--334},
  year      = {1996},
  crossref  = {DBLP:conf/fsttcs/1996},
  url       = {https://doi.org/10.1007/3-540-62034-6_60},
  doi       = {10.1007/3-540-62034-6_60},
  timestamp = {Mon, 22 May 2017 16:14:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/AgrawalBT96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanT96,
  author    = {Harry Buhrman and
               Thomas Thierauf},
  title     = {The Complexity of Generating and Checking Proffs of Membership},
  booktitle = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
               Science, Grenoble, France, February 22-24, 1996, Proceedings},
  pages     = {75--86},
  year      = {1996},
  crossref  = {DBLP:conf/stacs/1996},
  url       = {https://doi.org/10.1007/3-540-60922-9_7},
  doi       = {10.1007/3-540-60922-9_7},
  timestamp = {Mon, 22 May 2017 16:14:03 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/BuhrmanT96},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-001,
  author    = {Manindra Agrawal and
               Richard Beigel and
               Thomas Thierauf},
  title     = {Modulo Information from Nonadaptive Queries to {NP}},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {3},
  number    = {1},
  year      = {1996},
  url       = {http://eccc.hpi-web.de/eccc-reports/1996/TR96-001/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR96-001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-032,
  author    = {Manindra Agrawal and
               Thomas Thierauf},
  title     = {The Boolean Isomorphism Problem},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {3},
  number    = {32},
  year      = {1996},
  url       = {http://eccc.hpi-web.de/eccc-reports/1996/TR96-032/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR96-032},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-040,
  author    = {Thomas Thierauf},
  title     = {The Isomorphismproblem for One-Time-Only Branching Programs},
  journal   = {Electronic Colloquium on Computational Complexity {(ECCC)}},
  volume    = {3},
  number    = {40},
  year      = {1996},
  url       = {http://eccc.hpi-web.de/eccc-reports/1996/TR96-040/index.html},
  timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/eccc/ECCC-TR96-040},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ijfcs/HemaspaandraHNOSTW95,
  author    = {Lane A. Hemaspaandra and
               Albrecht Hoene and
               Ashish V. Naik and
               Mitsunori Ogihara and
               Alan L. Selman and
               Thomas Thierauf and
               Jie Wang},
  title     = {Nondeterministically Selective Sets},
  journal   = {Int. J. Found. Comput. Sci.},
  volume    = {6},
  number    = {4},
  pages     = {403--416},
  year      = {1995},
  url       = {https://doi.org/10.1142/S0129054195000214},
  doi       = {10.1142/S0129054195000214},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ijfcs/HemaspaandraHNOSTW95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/HanT95,
  author    = {Yenjo Han and
               Thomas Thierauf},
  title     = {Restricted Information from Nonadaptive Queries to {NP}},
  booktitle = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
               Minneapolis, Minnesota, USA, June 19-22, 1995},
  pages     = {206--213},
  year      = {1995},
  crossref  = {DBLP:conf/coco/1995},
  url       = {https://doi.org/10.1109/SCT.1995.514859},
  doi       = {10.1109/SCT.1995.514859},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/HanT95},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/cc/ThieraufTW94,
  author    = {Thomas Thierauf and
               Seinosuke Toda and
               Osamu Watanabe},
  title     = {On Closure Properties of GapP},
  journal   = {Computational Complexity},
  volume    = {4},
  pages     = {242--261},
  year      = {1994},
  url       = {https://doi.org/10.1007/BF01206638},
  doi       = {10.1007/BF01206638},
  timestamp = {Sun, 28 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/cc/ThieraufTW94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/ipl/MahajanTV94,
  author    = {Meena Mahajan and
               Thomas Thierauf and
               N. V. Vinodchandran},
  title     = {A Note on SpanP Functions},
  journal   = {Inf. Process. Lett.},
  volume    = {51},
  number    = {1},
  pages     = {7--10},
  year      = {1994},
  url       = {https://doi.org/10.1016/0020-0190(94)00068-9},
  doi       = {10.1016/0020-0190(94)00068-9},
  timestamp = {Fri, 26 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/ipl/MahajanTV94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@article{DBLP:journals/siamcomp/KoblerT94,
  author    = {Johannes K{\"{o}}bler and
               Thomas Thierauf},
  title     = {Complexity-Restricted Advice Functions},
  journal   = {{SIAM} J. Comput.},
  volume    = {23},
  number    = {2},
  pages     = {261--275},
  year      = {1994},
  url       = {https://doi.org/10.1137/S0097539791200351},
  doi       = {10.1137/S0097539791200351},
  timestamp = {Sat, 27 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/journals/siamcomp/KoblerT94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/BuhrmanKT94,
  author    = {Harry Buhrman and
               Jim Kadin and
               Thomas Thierauf},
  title     = {On Functions Computable with Nonadaptive Queries to {NP}},
  booktitle = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
               Amsterdam, The Netherlands, June 28 - July 1, 1994},
  pages     = {43--52},
  year      = {1994},
  crossref  = {DBLP:conf/coco/1994},
  url       = {https://doi.org/10.1109/SCT.1994.315819},
  doi       = {10.1109/SCT.1994.315819},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/BuhrmanKT94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ThieraufTW94,
  author    = {Thomas Thierauf and
               Seinosuke Toda and
               Osamu Watanabe},
  title     = {On Sets Bounded Truth-Table Reducible to P-selective Sets},
  booktitle = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
               Science, Caen, France, February 24-26, 1994, Proceedings},
  pages     = {427--438},
  year      = {1994},
  crossref  = {DBLP:conf/stacs/1994},
  url       = {https://doi.org/10.1007/3-540-57785-8_160},
  doi       = {10.1007/3-540-57785-8_160},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/ThieraufTW94},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/OgiwaraTTW93,
  author    = {Mitsunori Ogiwara and
               Thomas Thierauf and
               Seinosuke Toda and
               Osamu Watanabe},
  title     = {On Closure Properties of {\#}P in the Context of PF{\textdegree}{\#}P},
  booktitle = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
               San Diego, CA, USA, May 18-21, 1993},
  pages     = {139--146},
  year      = {1993},
  crossref  = {DBLP:conf/coco/1993},
  url       = {https://doi.org/10.1109/SCT.1993.336532},
  doi       = {10.1109/SCT.1993.336532},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/OgiwaraTTW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icci/HemachandraHOSTW93,
  author    = {Lane A. Hemachandra and
               Albrecht Hoene and
               Mitsunori Ogiwara and
               Alan L. Selman and
               Thomas Thierauf and
               Jie Wang},
  title     = {Selectivity},
  booktitle = {Computing and Information - ICCI'93, Fifth International Conference
               on Computing and Information, Sudbury, Ontario, Canada, May 27-29,
               1993, Proceedings},
  pages     = {55--59},
  year      = {1993},
  crossref  = {DBLP:conf/icci/1993},
  timestamp = {Fri, 15 Jan 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/icci/HemachandraHOSTW93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HanHT93,
  author    = {Yenjo Han and
               Lane A. Hemaspaandra and
               Thomas Thierauf},
  title     = {Threshold Computation and Cryptographic Security},
  booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
               Hong Kong, December 15-17, 1993, Proceedings},
  pages     = {230--239},
  year      = {1993},
  crossref  = {DBLP:conf/isaac/1993},
  url       = {https://doi.org/10.1007/3-540-57568-5_253},
  doi       = {10.1007/3-540-57568-5_253},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/HanHT93},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/ArvindHHKLMOSST92,
  author    = {Vikraman Arvind and
               Yenjo Han and
               Lane A. Hemachandra and
               Johannes K{\"{o}}bler and
               Antoni Lozano and
               Martin Mundhenk and
               Mitsunori Ogiwara and
               Uwe Sch{\"{o}}ning and
               Riccardo Silvestri and
               Thomas Thierauf},
  title     = {Reductions to Sets of Low Information Content},
  booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
               1992},
  pages     = {1--46},
  year      = {1992},
  crossref  = {DBLP:conf/dagstuhl/1992complexity},
  timestamp = {Wed, 26 Apr 2006 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/ArvindHHKLMOSST92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/icalp/ArvindHHKLMOSST92,
  author    = {Vikraman Arvind and
               Yenjo Han and
               Lane A. Hemachandra and
               Johannes K{\"{o}}bler and
               Antoni Lozano and
               Martin Mundhenk and
               Mitsunori Ogiwara and
               Uwe Sch{\"{o}}ning and
               Riccardo Silvestri and
               Thomas Thierauf},
  title     = {Reductions to Sets of Low Information Content},
  booktitle = {Automata, Languages and Programming, 19th International Colloquium,
               ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
  pages     = {162--173},
  year      = {1992},
  crossref  = {DBLP:conf/icalp/1992},
  url       = {https://doi.org/10.1007/3-540-55719-9_72},
  doi       = {10.1007/3-540-55719-9_72},
  timestamp = {Sat, 20 May 2017 15:32:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/ArvindHHKLMOSST92},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@phdthesis{DBLP:books/daglib/0070084,
  author    = {Thomas Thierauf},
  title     = {NP-uniforme Komplexit{\"{a}}tsklassen},
  school    = {University of Ulm, Germany},
  year      = {1990},
  url       = {http://d-nb.info/910431558},
  timestamp = {Wed, 30 Nov 2016 00:00:00 +0100},
  biburl    = {http://dblp.org/rec/bib/books/daglib/0070084},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@inproceedings{DBLP:conf/coco/KoblerT90,
  author    = {Johannes K{\"{o}}bler and
               Thomas Thierauf},
  title     = {Complexity Classes with Advice},
  booktitle = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
               Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
               8-11, 1990},
  pages     = {305--315},
  year      = {1990},
  crossref  = {DBLP:conf/coco/1990},
  url       = {https://doi.org/10.1109/SCT.1990.113979},
  doi       = {10.1109/SCT.1990.113979},
  timestamp = {Tue, 23 May 2017 01:00:00 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/KoblerT90},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2017,
  editor    = {Hamed Hatami and
               Pierre McKenzie and
               Valerie King},
  title     = {Proceedings of the 49th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2017, Montreal, QC, Canada, June 19-23, 2017},
  publisher = {{ACM}},
  year      = {2017},
  url       = {http://doi.acm.org/10.1145/3055399},
  doi       = {10.1145/3055399},
  isbn      = {978-1-4503-4528-6},
  timestamp = {Sat, 17 Jun 2017 18:46:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2017},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stoc/2016,
  editor    = {Daniel Wichs and
               Yishay Mansour},
  title     = {Proceedings of the 48th Annual {ACM} {SIGACT} Symposium on Theory
               of Computing, {STOC} 2016, Cambridge, MA, USA, June 18-21, 2016},
  publisher = {{ACM}},
  year      = {2016},
  url       = {http://dl.acm.org/citation.cfm?id=2897518},
  isbn      = {978-1-4503-4132-5},
  timestamp = {Fri, 10 Jun 2016 10:30:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stoc/2016},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2015,
  editor    = {David Zuckerman},
  title     = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
               2015, Portland, Oregon, {USA}},
  series    = {LIPIcs},
  volume    = {33},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2015},
  url       = {http://www.dagstuhl.de/dagpub/978-3-939897-81-1},
  isbn      = {978-3-939897-81-1},
  timestamp = {Wed, 10 Jun 2015 20:58:08 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/2015,
  editor    = {Khaled M. Elbassioni and
               Kazuhisa Makino},
  title     = {Algorithms and Computation - 26th International Symposium, {ISAAC}
               2015, Nagoya, Japan, December 9-11, 2015, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {9472},
  publisher = {Springer},
  year      = {2015},
  url       = {https://doi.org/10.1007/978-3-662-48971-0},
  doi       = {10.1007/978-3-662-48971-0},
  isbn      = {978-3-662-48970-3},
  timestamp = {Fri, 19 May 2017 01:26:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/2015},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2014,
  title     = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
               BC, Canada, June 11-13, 2014},
  publisher = {{IEEE} Computer Society},
  year      = {2014},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6875457},
  isbn      = {978-1-4799-3626-7},
  timestamp = {Fri, 13 May 2016 10:43:51 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2014},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2012,
  editor    = {Branislav Rovan and
               Vladimiro Sassone and
               Peter Widmayer},
  title     = {Mathematical Foundations of Computer Science 2012 - 37th International
               Symposium, {MFCS} 2012, Bratislava, Slovakia, August 27-31, 2012.
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {7464},
  publisher = {Springer},
  year      = {2012},
  url       = {https://doi.org/10.1007/978-3-642-32589-2},
  doi       = {10.1007/978-3-642-32589-2},
  isbn      = {978-3-642-32588-5},
  timestamp = {Thu, 25 May 2017 00:43:01 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2012},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2011,
  editor    = {Bin Fu and
               Ding{-}Zhu Du},
  title     = {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},
  publisher = {Springer},
  year      = {2011},
  url       = {https://doi.org/10.1007/978-3-642-22685-4},
  doi       = {10.1007/978-3-642-22685-4},
  isbn      = {978-3-642-22684-7},
  timestamp = {Tue, 23 May 2017 01:10:56 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/2011},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2009,
  title     = {Proceedings of the 24th Annual {IEEE} Conference on Computational
               Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  publisher = {{IEEE} Computer Society},
  year      = {2009},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5231175},
  isbn      = {978-0-7695-3717-7},
  timestamp = {Fri, 13 May 2016 10:27:38 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fct/2009,
  editor    = {Miroslaw Kutylowski and
               Witold Charatonik and
               Maciej Gebala},
  title     = {Fundamentals of Computation Theory, 17th International Symposium,
               {FCT} 2009, Wroclaw, Poland, September 2-4, 2009. Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {5699},
  publisher = {Springer},
  year      = {2009},
  url       = {https://doi.org/10.1007/978-3-642-03409-1},
  doi       = {10.1007/978-3-642-03409-1},
  isbn      = {978-3-642-03408-4},
  timestamp = {Wed, 17 May 2017 14:24:43 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fct/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2009,
  editor    = {Ravi Kannan and
               K. Narayan Kumar},
  title     = {{IARCS} Annual Conference on Foundations of Software Technology and
               Theoretical Computer Science, {FSTTCS} 2009, December 15-17, 2009,
               {IIT} Kanpur, India},
  series    = {LIPIcs},
  volume    = {4},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik},
  year      = {2009},
  isbn      = {978-3-939897-13-2},
  timestamp = {Wed, 20 Jan 2010 11:13:33 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/2009},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2009P9421,
  editor    = {Manindra Agrawal and
               Lance Fortnow and
               Thomas Thierauf and
               Christopher Umans},
  title     = {Algebraic Methods in Computational Complexity, 11.10. - 16.10.2009},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {09421},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
  year      = {2009},
  url       = {http://drops.dagstuhl.de/portals/09421/},
  timestamp = {Wed, 08 Apr 2015 19:31:21 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2009P9421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/sofsem/2008,
  editor    = {Viliam Geffert and
               Juhani Karhum{\"{a}}ki and
               Alberto Bertoni and
               Bart Preneel and
               Pavol N{\'{a}}vrat and
               M{\'{a}}ria Bielikov{\'{a}}},
  title     = {{SOFSEM} 2008: Theory and Practice of Computer Science, 34th Conference
               on Current Trends in Theory and Practice of Computer Science, Nov{\'{y}}
               Smokovec, Slovakia, January 19-25, 2008, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4910},
  publisher = {Springer},
  year      = {2008},
  url       = {https://doi.org/10.1007/978-3-540-77566-9},
  doi       = {10.1007/978-3-540-77566-9},
  isbn      = {978-3-540-77565-2},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/sofsem/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2008,
  editor    = {Susanne Albers and
               Pascal Weil},
  title     = {{STACS} 2008, 25th Annual Symposium on Theoretical Aspects of Computer
               Science, Bordeaux, France, February 21-23, 2008, Proceedings},
  series    = {LIPIcs},
  volume    = {1},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  year      = {2008},
  timestamp = {Tue, 26 Feb 2013 10:44:33 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2008},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fct/2007,
  editor    = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
               Zolt{\'{a}}n {\'{E}}sik},
  title     = {Fundamentals of Computation Theory, 16th International Symposium,
               {FCT} 2007, Budapest, Hungary, August 27-30, 2007, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {4639},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-74240-1},
  doi       = {10.1007/978-3-540-74240-1},
  isbn      = {978-3-540-74239-5},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fct/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/2007,
  editor    = {Wolfgang Thomas and
               Pascal Weil},
  title     = {{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},
  publisher = {Springer},
  year      = {2007},
  url       = {https://doi.org/10.1007/978-3-540-70918-3},
  doi       = {10.1007/978-3-540-70918-3},
  isbn      = {978-3-540-70917-6},
  timestamp = {Fri, 02 Jun 2017 13:01:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/2007},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2007P7411,
  editor    = {Manindra Agrawal and
               Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 07.10. - 12.10.2007},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {07411},
  publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
               (IBFI), Schloss Dagstuhl, Germany},
  year      = {2008},
  url       = {http://drops.dagstuhl.de/portals/07411/},
  timestamp = {Wed, 19 Jun 2013 12:10:46 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2007P7411},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/2006-1,
  editor    = {Michele Bugliesi and
               Bart Preneel and
               Vladimiro Sassone and
               Ingo Wegener},
  title     = {Automata, Languages and Programming, 33rd International Colloquium,
               {ICALP} 2006, Venice, Italy, July 10-14, 2006, Proceedings, Part {I}},
  series    = {Lecture Notes in Computer Science},
  volume    = {4051},
  publisher = {Springer},
  year      = {2006},
  url       = {https://doi.org/10.1007/11786986},
  doi       = {10.1007/11786986},
  isbn      = {3-540-35904-4},
  timestamp = {Fri, 02 Jun 2017 13:01:07 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/2006-1},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2005,
  title     = {20th Annual {IEEE} Conference on Computational Complexity {(CCC} 2005),
               11-15 June 2005, San Jose, CA, {USA}},
  publisher = {{IEEE} Computer Society},
  year      = {2005},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=9851},
  isbn      = {0-7695-2364-1},
  timestamp = {Fri, 13 May 2016 10:29:32 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2005},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/2004P4421,
  editor    = {Harry Buhrman and
               Lance Fortnow and
               Thomas Thierauf},
  title     = {Algebraic Methods in Computational Complexity, 10.-15. October 2004},
  series    = {Dagstuhl Seminar Proceedings},
  volume    = {04421},
  publisher = {IBFI, Schloss Dagstuhl, Germany},
  year      = {2005},
  url       = {http://drops.dagstuhl.de/portals/04421/},
  timestamp = {Wed, 19 Jun 2013 12:20:40 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/2004P4421},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/cocoon/2002,
  editor    = {Oscar H. Ibarra and
               Louxin Zhang},
  title     = {Computing and Combinatorics, 8th Annual International Conference,
               {COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2387},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-45655-4},
  doi       = {10.1007/3-540-45655-4},
  isbn      = {3-540-43996-X},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/cocoon/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/2002,
  editor    = {Manindra Agrawal and
               Anil Seth},
  title     = {{FST} {TCS} 2002: Foundations of Software Technology and Theoretical
               Computer Science, 22nd Conference Kanpur, India, December 12-14, 2002,
               Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2556},
  publisher = {Springer},
  year      = {2002},
  url       = {https://doi.org/10.1007/3-540-36206-1},
  doi       = {10.1007/3-540-36206-1},
  isbn      = {3-540-00225-1},
  timestamp = {Mon, 29 May 2017 16:53:44 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/2002},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/mfcs/2001,
  editor    = {Jir{\'{\i}} Sgall and
               Ales Pultr and
               Petr Kolman},
  title     = {Mathematical Foundations of Computer Science 2001, 26th International
               Symposium, {MFCS} 2001 Marianske Lazne, Czech Republic, August 27-31,
               2001, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {2136},
  publisher = {Springer},
  year      = {2001},
  url       = {https://doi.org/10.1007/3-540-44683-4},
  doi       = {10.1007/3-540-44683-4},
  isbn      = {3-540-42496-2},
  timestamp = {Fri, 26 May 2017 14:09:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/mfcs/2001},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/2000,
  title     = {Proceedings of the 15th Annual {IEEE} Conference on Computational
               Complexity, Florence, Italy, July 4-7, 2000},
  publisher = {{IEEE} Computer Society},
  year      = {2000},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=6911},
  isbn      = {0-7695-0674-7},
  timestamp = {Fri, 13 May 2016 10:31:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/2000},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1998,
  title     = {Proceedings of the 13th Annual {IEEE} Conference on Computational
               Complexity, Buffalo, New York, USA, June 15-18, 1998},
  publisher = {{IEEE} Computer Society},
  year      = {1998},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=5641},
  isbn      = {0-8186-8395-3},
  timestamp = {Fri, 13 May 2016 10:33:02 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1998},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1996,
  editor    = {Steven Homer and
               Jin{-}Yi Cai},
  title     = {Proceedings of the Eleveth Annual {IEEE} Conference on Computational
               Complexity, Philadelphia, Pennsylvania, USA, May 24-27, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3765},
  isbn      = {0-8186-7386-9},
  timestamp = {Fri, 13 May 2016 10:34:12 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/focs/1996,
  title     = {37th Annual Symposium on Foundations of Computer Science, {FOCS} '96,
               Burlington, Vermont, USA, 14-16 October, 1996},
  publisher = {{IEEE} Computer Society},
  year      = {1996},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=4141},
  isbn      = {0-8186-7594-2},
  timestamp = {Mon, 15 Dec 2014 18:48:44 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/focs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/fsttcs/1996,
  editor    = {Vijay Chandru and
               V. Vinay},
  title     = {Foundations of Software Technology and Theoretical Computer Science,
               16th Conference, Hyderabad, India, December 18-20, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1180},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-62034-6},
  doi       = {10.1007/3-540-62034-6},
  isbn      = {3-540-62034-6},
  timestamp = {Mon, 22 May 2017 16:14:06 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/fsttcs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1996,
  editor    = {Claude Puech and
               R{\"{u}}diger Reischuk},
  title     = {{STACS} 96, 13th Annual Symposium on Theoretical Aspects of Computer
               Science, Grenoble, France, February 22-24, 1996, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {1046},
  publisher = {Springer},
  year      = {1996},
  url       = {https://doi.org/10.1007/3-540-60922-9},
  doi       = {10.1007/3-540-60922-9},
  isbn      = {3-540-60922-9},
  timestamp = {Mon, 22 May 2017 16:14:03 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1996},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1995,
  title     = {Proceedings of the Tenth Annual Structure in Complexity Theory Conference,
               Minneapolis, Minnesota, USA, June 19-22, 1995},
  publisher = {{IEEE} Computer Society},
  year      = {1995},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=3938},
  isbn      = {0-8186-7052-5},
  timestamp = {Fri, 13 May 2016 10:37:15 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1995},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1994,
  title     = {Proceedings of the Ninth Annual Structure in Complexity Theory Conference,
               Amsterdam, The Netherlands, June 28 - July 1, 1994},
  publisher = {{IEEE} Computer Society},
  year      = {1994},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=967},
  isbn      = {0-8186-5670-0},
  timestamp = {Fri, 13 May 2016 10:38:10 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/stacs/1994,
  editor    = {Patrice Enjalbert and
               Ernst W. Mayr and
               Klaus W. Wagner},
  title     = {{STACS} 94, 11th Annual Symposium on Theoretical Aspects of Computer
               Science, Caen, France, February 24-26, 1994, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {775},
  publisher = {Springer},
  year      = {1994},
  url       = {https://doi.org/10.1007/3-540-57785-8},
  doi       = {10.1007/3-540-57785-8},
  isbn      = {3-540-57785-8},
  timestamp = {Sat, 20 May 2017 15:32:48 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/stacs/1994},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1993,
  title     = {Proceedings of the Eigth Annual Structure in Complexity Theory Conference,
               San Diego, CA, USA, May 18-21, 1993},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=920},
  isbn      = {0-8186-4070-7},
  timestamp = {Fri, 13 May 2016 10:38:29 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icci/1993,
  editor    = {Osman Abou{-}Rabia and
               Carl K. Chang and
               Waldemar W. Koczkodaj},
  title     = {Computing and Information - ICCI'93, Fifth International Conference
               on Computing and Information, Sudbury, Ontario, Canada, May 27-29,
               1993, Proceedings},
  publisher = {{IEEE} Computer Society},
  year      = {1993},
  isbn      = {0-8186-4212-2},
  timestamp = {Thu, 21 Mar 2002 14:11:16 +0100},
  biburl    = {http://dblp.org/rec/bib/conf/icci/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/isaac/1993,
  editor    = {Kam{-}Wing Ng and
               Prabhakar Raghavan and
               N. V. Balasubramanian and
               Francis Y. L. Chin},
  title     = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
               Hong Kong, December 15-17, 1993, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {762},
  publisher = {Springer},
  year      = {1993},
  url       = {https://doi.org/10.1007/3-540-57568-5},
  doi       = {10.1007/3-540-57568-5},
  isbn      = {3-540-57568-5},
  timestamp = {Sat, 20 May 2017 15:32:55 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/isaac/1993},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/dagstuhl/1992complexity,
  editor    = {Klaus Ambos{-}Spies and
               Steven Homer and
               Uwe Sch{\"{o}}ning},
  title     = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
               1992},
  publisher = {Cambridge University Press},
  year      = {1993},
  isbn      = {0-521-44220-6},
  timestamp = {Mon, 15 Jul 2002 11:29:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/dagstuhl/1992complexity},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/icalp/1992,
  editor    = {Werner Kuich},
  title     = {Automata, Languages and Programming, 19th International Colloquium,
               ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
  series    = {Lecture Notes in Computer Science},
  volume    = {623},
  publisher = {Springer},
  year      = {1992},
  url       = {https://doi.org/10.1007/3-540-55719-9},
  doi       = {10.1007/3-540-55719-9},
  isbn      = {3-540-55719-9},
  timestamp = {Sat, 20 May 2017 15:32:49 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/icalp/1992},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
@proceedings{DBLP:conf/coco/1990,
  title     = {Proceedings: Fifth Annual Structure in Complexity Theory Conference,
               Universitat Polit{\`{e}}cnica de Catalunya, Barcelona, Spain, July
               8-11, 1990},
  publisher = {{IEEE} Computer Society},
  year      = {1990},
  url       = {http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=476},
  isbn      = {0-8186-2072-2},
  timestamp = {Fri, 13 May 2016 10:39:30 +0200},
  biburl    = {http://dblp.org/rec/bib/conf/coco/1990},
  bibsource = {dblp computer science bibliography, http://dblp.org}
}
maintained by Schloss Dagstuhl LZI at University of Trier