default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Thomas Thierauf
@article{DBLP:journals/cc/DuttaST24,
author = {Pranjal Dutta and
Nitin Saxena and
Thomas Thierauf},
title = {Weighted Sum-of-Squares Lower Bounds for Univariate Polynomials Imply
{VP} {\(\not =\)}q {VNP}},
journal = {Comput. Complex.},
volume = {33},
number = {1},
pages = {3},
year = {2024},
url = {https://doi.org/10.1007/s00037-024-00249-0},
doi = {10.1007/S00037-024-00249-0},
timestamp = {Sat, 08 Jun 2024 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/DuttaST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/approx/DuttaST24,
author = {Pranjal Dutta and
Amit Sinhababu and
Thomas Thierauf},
editor = {Amit Kumar and
Noga Ron{-}Zewi},
title = {Derandomizing Multivariate Polynomial Factoring for Low Degree Factors},
booktitle = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
and Techniques, {APPROX/RANDOM} 2024, August 28-30, 2024, London School
of Economics, London, {UK}},
series = {LIPIcs},
volume = {317},
pages = {75:1--75:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2024},
url = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2024.75},
doi = {10.4230/LIPICS.APPROX/RANDOM.2024.75},
timestamp = {Mon, 16 Sep 2024 17:07:54 +0200},
biburl = {https://dblp.org/rec/conf/approx/DuttaST24.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/FennerPT22,
author = {Stephen A. Fenner and
Daniel Pad{\'{e}} and
Thomas Thierauf},
title = {The complexity of regex crosswords},
journal = {Inf. Comput.},
volume = {286},
pages = {104777},
year = {2022},
url = {https://doi.org/10.1016/j.ic.2021.104777},
doi = {10.1016/J.IC.2021.104777},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/FennerPT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jgaa/FennerGGKT22,
author = {Stephen A. Fenner and
Daniel Grier and
Rohit Gurjar and
Arpita Korwar and
Thomas Thierauf},
title = {The Complexity of Poset Games},
journal = {J. Graph Algorithms Appl.},
volume = {26},
number = {1},
pages = {1--14},
year = {2022},
url = {https://doi.org/10.7155/jgaa.00578},
doi = {10.7155/JGAA.00578},
timestamp = {Wed, 12 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jgaa/FennerGGKT22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toct/DattaLNTW22,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
title = {Planar Graph Isomorphism Is in Log-Space},
journal = {{ACM} Trans. Comput. Theory},
volume = {14},
number = {2},
pages = {8:1--8:33},
year = {2022},
url = {https://doi.org/10.1145/3543686},
doi = {10.1145/3543686},
timestamp = {Mon, 05 Dec 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/toct/DattaLNTW22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/SinhababuT21,
author = {Amit Sinhababu and
Thomas Thierauf},
title = {Factorization of Polynomials Given by Arithmetic Branching Programs},
journal = {Comput. Complex.},
volume = {30},
number = {2},
pages = {15},
year = {2021},
url = {https://doi.org/10.1007/s00037-021-00215-0},
doi = {10.1007/S00037-021-00215-0},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cc/SinhababuT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/GurjarTV21,
author = {Rohit Gurjar and
Thomas Thierauf and
Nisheeth K. Vishnoi},
title = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular
Faces},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {2},
pages = {636--661},
year = {2021},
url = {https://doi.org/10.1137/19M1290802},
doi = {10.1137/19M1290802},
timestamp = {Sun, 16 May 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/GurjarTV21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/FennerGT21,
author = {Stephen A. Fenner and
Rohit Gurjar and
Thomas Thierauf},
title = {Bipartite Perfect Matching is in Quasi-NC},
journal = {{SIAM} J. Comput.},
volume = {50},
number = {3},
year = {2021},
url = {https://doi.org/10.1137/16M1097870},
doi = {10.1137/16M1097870},
timestamp = {Wed, 14 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/FennerGT21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/Dutta0T21,
author = {Pranjal Dutta and
Nitin Saxena and
Thomas Thierauf},
editor = {James R. Lee},
title = {A Largish Sum-Of-Squares Implies Circuit Hardness and Derandomization},
booktitle = {12th Innovations in Theoretical Computer Science Conference, {ITCS}
2021, January 6-8, 2021, Virtual Conference},
series = {LIPIcs},
volume = {185},
pages = {23:1--23:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2021},
url = {https://doi.org/10.4230/LIPIcs.ITCS.2021.23},
doi = {10.4230/LIPICS.ITCS.2021.23},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/innovations/Dutta0T21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/GurjarT20,
author = {Rohit Gurjar and
Thomas Thierauf},
title = {Linear Matroid Intersection is in Quasi-NC},
journal = {Comput. Complex.},
volume = {29},
number = {2},
pages = {9},
year = {2020},
url = {https://doi.org/10.1007/s00037-020-00200-z},
doi = {10.1007/S00037-020-00200-Z},
timestamp = {Mon, 30 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GurjarT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/SinhababuT20,
author = {Amit Sinhababu and
Thomas Thierauf},
editor = {Shubhangi Saraf},
title = {Factorization of Polynomials Given By Arithmetic Branching Programs},
booktitle = {35th Computational Complexity Conference, {CCC} 2020, July 28-31,
2020, Saarbr{\"{u}}cken, Germany (Virtual Conference)},
series = {LIPIcs},
volume = {169},
pages = {33:1--33:19},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.CCC.2020.33},
doi = {10.4230/LIPICS.CCC.2020.33},
timestamp = {Wed, 21 Aug 2024 22:46:00 +0200},
biburl = {https://dblp.org/rec/conf/coco/SinhababuT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2005-12169,
author = {Daniel Pad{\'{e}} and
Stephen A. Fenner and
Daniel Grier and
Thomas Thierauf},
title = {Depth-2 {QAC} circuits cannot simulate quantum parity},
journal = {CoRR},
volume = {abs/2005.12169},
year = {2020},
url = {https://arxiv.org/abs/2005.12169},
eprinttype = {arXiv},
eprint = {2005.12169},
timestamp = {Fri, 29 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2005-12169.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AgrawalGT20,
author = {Manindra Agrawal and
Rohit Gurjar and
Thomas Thierauf},
title = {Impossibility of Derandomizing the Isolation Lemma for all Families},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-098}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/098},
eprinttype = {ECCC},
eprint = {TR20-098},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalGT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/DuttaST20,
author = {Pranjal Dutta and
Nitin Saxena and
Thomas Thierauf},
title = {Lower bounds on the sum of 25th-powers of univariates lead to complete
derandomization of {PIT}},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-039}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/039},
eprinttype = {ECCC},
eprint = {TR20-039},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DuttaST20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SinhababuT20,
author = {Amit Sinhababu and
Thomas Thierauf},
title = {Factorization of Polynomials Given by Arithmetic Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR20-077}},
year = {2020},
url = {https://eccc.weizmann.ac.il/report/2020/077},
eprinttype = {ECCC},
eprint = {TR20-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/SinhababuT20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cacm/FennerGT19,
author = {Stephen A. Fenner and
Rohit Gurjar and
Thomas Thierauf},
title = {A deterministic parallel algorithm for bipartite perfect matching},
journal = {Commun. {ACM}},
volume = {62},
number = {3},
pages = {109--115},
year = {2019},
url = {https://doi.org/10.1145/3306208},
doi = {10.1145/3306208},
timestamp = {Thu, 09 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/cacm/FennerGT19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/GurjarTV18,
author = {Rohit Gurjar and
Thomas Thierauf and
Nisheeth K. Vishnoi},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {Isolating a Vertex via Lattices: Polytopes with Totally Unimodular
Faces},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {74:1--74:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.74},
doi = {10.4230/LIPICS.ICALP.2018.74},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/GurjarTV18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@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 = {Comput. Complex.},
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 = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/GurjarKST17.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://doi.org/10.1145/3061640.3061655},
doi = {10.1145/3061640.3061655},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/sigact/FennerGT17.bib},
bibsource = {dblp computer science bibliography, https://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 = {{ACM} Trans. Comput. Theory},
volume = {9},
number = {2},
pages = {8:1--8:20},
year = {2017},
url = {https://doi.org/10.1145/3041402},
doi = {10.1145/3041402},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GurjarKMT17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/GurjarT17,
author = {Rohit Gurjar and
Thomas Thierauf},
editor = {Hamed Hatami and
Pierre McKenzie and
Valerie King},
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},
publisher = {{ACM}},
year = {2017},
url = {https://doi.org/10.1145/3055399.3055440},
doi = {10.1145/3055399.3055440},
timestamp = {Sun, 02 Jun 2019 21:10:31 +0200},
biburl = {https://dblp.org/rec/conf/stoc/GurjarT17.bib},
bibsource = {dblp computer science bibliography, https://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},
eprinttype = {arXiv},
eprint = {1708.02222},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1708-02222.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR17-127}},
year = {2017},
url = {https://eccc.weizmann.ac.il/report/2017/127},
eprinttype = {ECCC},
eprint = {TR17-127},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurjarTV17.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/mst/StraubTW16.bib},
bibsource = {dblp computer science bibliography, https://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 = {{ACM} Trans. Comput. Theory},
volume = {8},
number = {4},
pages = {14:1--14:15},
year = {2016},
url = {https://doi.org/10.1145/2934310},
doi = {10.1145/2934310},
timestamp = {Mon, 08 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/toct/GurjarKMST16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/FennerGT16,
author = {Stephen A. Fenner and
Rohit Gurjar and
Thomas Thierauf},
editor = {Daniel Wichs and
Yishay Mansour},
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},
publisher = {{ACM}},
year = {2016},
url = {https://doi.org/10.1145/2897518.2897564},
doi = {10.1145/2897518.2897564},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/stoc/FennerGT16.bib},
bibsource = {dblp computer science bibliography, https://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},
eprinttype = {arXiv},
eprint = {1601.06319},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/FennerGT16.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/dagstuhl-reports/KabanetsTTU16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GurjarT16,
author = {Rohit Gurjar and
Thomas Thierauf},
title = {Linear Matroid Intersection is in quasi-NC},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR16-182}},
year = {2016},
url = {https://eccc.weizmann.ac.il/report/2016/182},
eprinttype = {ECCC},
eprint = {TR16-182},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurjarT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/GurjarKST15,
author = {Rohit Gurjar and
Arpita Korwar and
Nitin Saxena and
Thomas Thierauf},
editor = {David Zuckerman},
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}},
series = {LIPIcs},
volume = {33},
pages = {323--346},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2015},
url = {https://doi.org/10.4230/LIPIcs.CCC.2015.323},
doi = {10.4230/LIPICS.CCC.2015.323},
timestamp = {Thu, 02 Feb 2023 13:27:06 +0100},
biburl = {https://dblp.org/rec/conf/coco/GurjarKST15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/FennerGMST15,
author = {Stephen A. Fenner and
Daniel Grier and
Jochen Messner and
Luke Schaeffer and
Thomas Thierauf},
editor = {Khaled M. Elbassioni and
Kazuhisa Makino},
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},
series = {Lecture Notes in Computer Science},
volume = {9472},
pages = {689--699},
publisher = {Springer},
year = {2015},
url = {https://doi.org/10.1007/978-3-662-48971-0\_58},
doi = {10.1007/978-3-662-48971-0\_58},
timestamp = {Tue, 14 May 2019 10:00:50 +0200},
biburl = {https://dblp.org/rec/conf/isaac/FennerGMST15.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-021}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/021},
eprinttype = {ECCC},
eprint = {TR15-021},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FennerGMST15.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR15-177}},
year = {2015},
url = {https://eccc.weizmann.ac.il/report/2015/177},
eprinttype = {ECCC},
eprint = {TR15-177},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FennerGT15.bib},
bibsource = {dblp computer science bibliography, https://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 = {Chic. J. Theor. Comput. Sci.},
volume = {2014},
year = {2014},
url = {http://cjtcs.cs.uchicago.edu/articles/2014/2/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/ThieraufW14.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.15},
doi = {10.1109/CCC.2014.15},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/StraubTW14.bib},
bibsource = {dblp computer science bibliography, https://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},
eprinttype = {arXiv},
eprint = {1411.7341},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/GurjarKST14.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalKTU14.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-158}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/158},
eprinttype = {ECCC},
eprint = {TR14-158},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurjarKST14.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-079}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/079},
eprinttype = {ECCC},
eprint = {TR14-079},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/StraubTW14.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-019}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/019},
eprinttype = {ECCC},
eprint = {TR13-019},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/FennerGKT13.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-112}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/112},
eprinttype = {ECCC},
eprint = {TR13-112},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurjarKMT13.bib},
bibsource = {dblp computer science bibliography, https://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 = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/MessnerT12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/GurjarKMST12,
author = {Rohit Gurjar and
Arpita Korwar and
Jochen Messner and
Simon Straub and
Thomas Thierauf},
editor = {Branislav Rovan and
Vladimiro Sassone and
Peter Widmayer},
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},
series = {Lecture Notes in Computer Science},
volume = {7464},
pages = {478--490},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-32589-2\_43},
doi = {10.1007/978-3-642-32589-2\_43},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/GurjarKMST12.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/dagstuhl-reports/AgrawalTU12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/MessnerT11,
author = {Jochen Messner and
Thomas Thierauf},
editor = {Bin Fu and
Ding{-}Zhu Du},
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},
series = {Lecture Notes in Computer Science},
volume = {6842},
pages = {168--179},
publisher = {Springer},
year = {2011},
url = {https://doi.org/10.1007/978-3-642-22685-4\_15},
doi = {10.1007/978-3-642-22685-4\_15},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/MessnerT11.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-148}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/148},
eprinttype = {ECCC},
eprint = {TR11-148},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/GurjarKMST11.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-018}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/018},
eprinttype = {ECCC},
eprint = {TR11-018},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/MessnerT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/HoangT10,
author = {Thanh Minh Hoang and
Thomas Thierauf},
title = {The Complexity of the Inertia},
journal = {Comput. Complex.},
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, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/HoangT10.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/ipl/DornT10.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/mst/ThieraufW10.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-050}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/050},
eprinttype = {ECCC},
eprint = {TR10-050},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/DattaNTW10.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/ipl/DornT09.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {2009},
url = {https://doi.org/10.1109/CCC.2009.16},
doi = {10.1109/CCC.2009.16},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/ThieraufW09,
author = {Thomas Thierauf and
Fabian Wagner},
editor = {Miroslaw Kutylowski and
Witold Charatonik and
Maciej Gebala},
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},
series = {Lecture Notes in Computer Science},
volume = {5699},
pages = {323--334},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03409-1\_29},
doi = {10.1007/978-3-642-03409-1\_29},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/ThieraufW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/DattaNTW09,
author = {Samir Datta and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
editor = {Ravi Kannan and
K. Narayan Kumar},
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},
series = {LIPIcs},
volume = {4},
pages = {145--156},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2009},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2009.2314},
doi = {10.4230/LIPICS.FSTTCS.2009.2314},
timestamp = {Sun, 02 Oct 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/DattaNTW09.bib},
bibsource = {dblp computer science bibliography, https://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 = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2009P9421.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09,
author = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
editor = {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},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2418/},
timestamp = {Thu, 10 Jun 2021 13:02:05 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalFTU09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalFTU09a,
author = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
editor = {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},
series = {Dagstuhl Seminar Proceedings},
volume = {09421},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2009},
url = {http://drops.dagstuhl.de/opus/volltexte/2010/2410/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalFTU09a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/DattaLNTW09,
author = {Samir Datta and
Nutan Limaye and
Prajakta Nimbhorkar and
Thomas Thierauf and
Fabian Wagner},
editor = {Manindra Agrawal and
Lance Fortnow and
Thomas Thierauf and
Christopher Umans},
title = {Planar Graph Isomorphism is in Log-Space},
booktitle = {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/opus/volltexte/2010/2416/},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/DattaLNTW09.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-052}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/052},
eprinttype = {ECCC},
eprint = {TR09-052},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WagnerDLNT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/WagnerT09,
author = {Fabian Wagner and
Thomas Thierauf},
title = {Reachability in K\({}_{\mbox{3,3}}\)-free Graphs and K\({}_{\mbox{5}}\)-free
Graphs is in Unambiguous Log-Space},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR09-029}},
year = {2009},
url = {https://eccc.weizmann.ac.il/report/2009/029},
eprinttype = {ECCC},
eprint = {TR09-029},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/WagnerT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sofsem/DornT08,
author = {Sebastian D{\"{o}}rn and
Thomas Thierauf},
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 = {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},
series = {Lecture Notes in Computer Science},
volume = {4910},
pages = {506--518},
publisher = {Springer},
year = {2008},
url = {https://doi.org/10.1007/978-3-540-77566-9\_44},
doi = {10.1007/978-3-540-77566-9\_44},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/sofsem/DornT08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ThieraufW08,
author = {Thomas Thierauf and
Fabian Wagner},
editor = {Susanne Albers and
Pascal Weil},
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},
series = {LIPIcs},
volume = {1},
pages = {633--644},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik, Germany},
year = {2008},
url = {https://doi.org/10.4230/LIPIcs.STACS.2008.1327},
doi = {10.4230/LIPICS.STACS.2008.1327},
timestamp = {Tue, 22 Jun 2021 15:44:08 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ThieraufW08.bib},
bibsource = {dblp computer science bibliography, https://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 = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2007P7411.bib},
bibsource = {dblp computer science bibliography, https://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},
eprinttype = {arXiv},
eprint = {0802.2825},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0802-2825.bib},
bibsource = {dblp computer science bibliography, https://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},
eprinttype = {arXiv},
eprint = {0809.2319},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-0809-2319.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/DornT07,
author = {Sebastian D{\"{o}}rn and
Thomas Thierauf},
editor = {Erzs{\'{e}}bet Csuhaj{-}Varj{\'{u}} and
Zolt{\'{a}}n {\'{E}}sik},
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},
series = {Lecture Notes in Computer Science},
volume = {4639},
pages = {250--260},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-74240-1\_22},
doi = {10.1007/978-3-540-74240-1\_22},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/DornT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AgrawalHT07,
author = {Manindra Agrawal and
Thanh Minh Hoang and
Thomas Thierauf},
editor = {Wolfgang Thomas and
Pascal Weil},
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},
series = {Lecture Notes in Computer Science},
volume = {4393},
pages = {489--499},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-70918-3\_42},
doi = {10.1007/978-3-540-70918-3\_42},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/AgrawalHT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07,
author = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {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},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1306},
timestamp = {Thu, 10 Jun 2021 13:02:08 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalBFT07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/AgrawalBFT07a,
author = {Manindra Agrawal and
Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {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},
series = {Dagstuhl Seminar Proceedings},
volume = {07411},
publisher = {Internationales Begegnungs- und Forschungszentrum fuer Informatik
(IBFI), Schloss Dagstuhl, Germany},
year = {2007},
url = {http://drops.dagstuhl.de/opus/volltexte/2008/1307},
timestamp = {Thu, 23 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/AgrawalBFT07a.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR07-068}},
year = {2007},
url = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-068/index.html},
eprinttype = {ECCC},
eprint = {TR07-068},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ThieraufW07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/HoangMT06,
author = {Thanh Minh Hoang and
Meena Mahajan and
Thomas Thierauf},
editor = {Michele Bugliesi and
Bart Preneel and
Vladimiro Sassone and
Ingo Wegener},
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}},
series = {Lecture Notes in Computer Science},
volume = {4051},
pages = {453--464},
publisher = {Springer},
year = {2006},
url = {https://doi.org/10.1007/11786986\_40},
doi = {10.1007/11786986\_40},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/HoangMT06.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR06-129}},
year = {2006},
url = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-129/index.html},
eprinttype = {ECCC},
eprint = {TR06-129},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AgrawalHT06.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/CCC.2005.28},
doi = {10.1109/CCC.2005.28},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HoangT05.bib},
bibsource = {dblp computer science bibliography, https://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 = {Thu, 10 Jun 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/2004P4421.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/ijfcs/HoangT04.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/ijfcs/HoangT04a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/dagstuhl/BuhrmanFT04,
author = {Harry Buhrman and
Lance Fortnow and
Thomas Thierauf},
editor = {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},
series = {Dagstuhl Seminar Proceedings},
volume = {04421},
publisher = {IBFI, Schloss Dagstuhl, Germany},
year = {2004},
url = {http://drops.dagstuhl.de/opus/volltexte/2005/116},
timestamp = {Thu, 10 Jun 2021 13:02:11 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/BuhrmanFT04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR04-024,
author = {Thomas Thierauf and
Thanh Minh Hoang},
title = {On Closure Properties of GapL},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR04-024}},
year = {2004},
url = {https://eccc.weizmann.ac.il/eccc-reports/2004/TR04-024/index.html},
eprinttype = {ECCC},
eprint = {TR04-024},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR04-024.bib},
bibsource = {dblp computer science bibliography, https://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 = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/HoangT03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cocoon/HoangT02,
author = {Thanh Minh Hoang and
Thomas Thierauf},
editor = {Oscar H. Ibarra and
Louxin Zhang},
title = {On the Minimal Polynomial of a Matrix},
booktitle = {Computing and Combinatorics, 8th Annual International Conference,
{COCOON} 2002, Singapore, August 15-17, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2387},
pages = {37--46},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45655-4\_6},
doi = {10.1007/3-540-45655-4\_6},
timestamp = {Tue, 14 May 2019 10:00:35 +0200},
biburl = {https://dblp.org/rec/conf/cocoon/HoangT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/HoangT02,
author = {Thanh Minh Hoang and
Thomas Thierauf},
editor = {Manindra Agrawal and
Anil Seth},
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},
series = {Lecture Notes in Computer Science},
volume = {2556},
pages = {206--217},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-36206-1\_19},
doi = {10.1007/3-540-36206-1\_19},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/HoangT02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/HoangT01,
author = {Thanh Minh Hoang and
Thomas Thierauf},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
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},
series = {Lecture Notes in Computer Science},
volume = {2136},
pages = {408--420},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_36},
doi = {10.1007/3-540-44683-4\_36},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/HoangT01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR01-028,
author = {Thanh Minh Hoang and
Thomas Thierauf},
title = {The Complexity of the Minimal Polynomial},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR01-028}},
year = {2001},
url = {https://eccc.weizmann.ac.il/eccc-reports/2001/TR01-028/index.html},
eprinttype = {ECCC},
eprint = {TR01-028},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR01-028.bib},
bibsource = {dblp computer science bibliography, https://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, 14 May 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/sp/Thierauf00.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/siamcomp/AgrawalT00.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {2000},
url = {https://doi.org/10.1109/CCC.2000.856738},
doi = {10.1109/CCC.2000.856738},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HoangT00.bib},
bibsource = {dblp computer science bibliography, https://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 = {Chic. J. Theor. Comput. Sci.},
volume = {1999},
year = {1999},
url = {http://cjtcs.cs.uchicago.edu/articles/1999/3/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/FennerGHSTV99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/Thierauf98,
author = {Thomas Thierauf},
title = {The Isomorphism Problem for Read-Once Branching Programs and Arithmetic
Circuits},
journal = {Chic. J. Theor. Comput. Sci.},
volume = {1998},
year = {1998},
url = {http://cjtcs.cs.uchicago.edu/articles/1998/1/contents.html},
timestamp = {Thu, 11 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cjtcs/Thierauf98.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/mst/BuhrmanKT98.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694585},
doi = {10.1109/CCC.1998.694585},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanFT98.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1998},
url = {https://doi.org/10.1109/CCC.1998.694593},
doi = {10.1109/CCC.1998.694593},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AgrawalT98.bib},
bibsource = {dblp computer science bibliography, https://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 = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/HanHT97.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR97-060}},
year = {1997},
url = {https://eccc.weizmann.ac.il/eccc-reports/1997/TR97-060/index.html},
eprinttype = {ECCC},
eprint = {TR97-060},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR97-060.bib},
bibsource = {dblp computer science bibliography, https://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 = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/HanT96.bib},
bibsource = {dblp computer science bibliography, https://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 = {{RAIRO} Theor. Informatics Appl.},
volume = {30},
number = {2},
pages = {135--154},
year = {1996},
url = {https://doi.org/10.1051/ita/1996300201351},
doi = {10.1051/ITA/1996300201351},
timestamp = {Mon, 25 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ita/ThieraufTW96.bib},
bibsource = {dblp computer science bibliography, https://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 = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/OgiharaTTW96.bib},
bibsource = {dblp computer science bibliography, https://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 = {Math. Syst. Theory},
volume = {29},
number = {3},
pages = {245--258},
year = {1996},
url = {https://doi.org/10.1007/BF01201278},
doi = {10.1007/BF01201278},
timestamp = {Sun, 17 May 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/CaiGT96.bib},
bibsource = {dblp computer science bibliography, https://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},
editor = {Steven Homer and
Jin{-}Yi Cai},
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},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/CCC.1996.507688},
doi = {10.1109/CCC.1996.507688},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/FennerGHSTV96.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1996},
url = {https://doi.org/10.1109/SFCS.1996.548501},
doi = {10.1109/SFCS.1996.548501},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AgrawalT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/AgrawalBT96,
author = {Manindra Agrawal and
Richard Beigel and
Thomas Thierauf},
editor = {Vijay Chandru and
V. Vinay},
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},
series = {Lecture Notes in Computer Science},
volume = {1180},
pages = {322--334},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-62034-6\_60},
doi = {10.1007/3-540-62034-6\_60},
timestamp = {Tue, 14 May 2019 10:00:51 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/AgrawalBT96.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/BuhrmanT96,
author = {Harry Buhrman and
Thomas Thierauf},
editor = {Claude Puech and
R{\"{u}}diger Reischuk},
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},
series = {Lecture Notes in Computer Science},
volume = {1046},
pages = {75--86},
publisher = {Springer},
year = {1996},
url = {https://doi.org/10.1007/3-540-60922-9\_7},
doi = {10.1007/3-540-60922-9\_7},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/BuhrmanT96.bib},
bibsource = {dblp computer science bibliography, https://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 = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-001}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-001/index.html},
eprinttype = {ECCC},
eprint = {TR96-001},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-001.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-032,
author = {Manindra Agrawal and
Thomas Thierauf},
title = {The Boolean Isomorphism Problem},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-032}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-032/index.html},
eprinttype = {ECCC},
eprint = {TR96-032},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-032.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR96-040,
author = {Thomas Thierauf},
title = {The Isomorphismproblem for One-Time-Only Branching Programs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR96-040}},
year = {1996},
url = {https://eccc.weizmann.ac.il/eccc-reports/1996/TR96-040/index.html},
eprinttype = {ECCC},
eprint = {TR96-040},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR96-040.bib},
bibsource = {dblp computer science bibliography, https://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 = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/ijfcs/HemaspaandraHNOSTW95.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1995},
url = {https://doi.org/10.1109/SCT.1995.514859},
doi = {10.1109/SCT.1995.514859},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/HanT95.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/ThieraufTW94,
author = {Thomas Thierauf and
Seinosuke Toda and
Osamu Watanabe},
title = {On Closure Properties of GapP},
journal = {Comput. Complex.},
volume = {4},
pages = {242--261},
year = {1994},
url = {https://doi.org/10.1007/BF01206638},
doi = {10.1007/BF01206638},
timestamp = {Sun, 15 Mar 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/cc/ThieraufTW94.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/ipl/MahajanTV94.bib},
bibsource = {dblp computer science bibliography, https://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 = {https://dblp.org/rec/journals/siamcomp/KoblerT94.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1994},
url = {https://doi.org/10.1109/SCT.1994.315819},
doi = {10.1109/SCT.1994.315819},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/BuhrmanKT94.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/ThieraufTW94,
author = {Thomas Thierauf and
Seinosuke Toda and
Osamu Watanabe},
editor = {Patrice Enjalbert and
Ernst W. Mayr and
Klaus W. Wagner},
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},
series = {Lecture Notes in Computer Science},
volume = {775},
pages = {427--438},
publisher = {Springer},
year = {1994},
url = {https://doi.org/10.1007/3-540-57785-8\_160},
doi = {10.1007/3-540-57785-8\_160},
timestamp = {Tue, 14 May 2019 10:00:48 +0200},
biburl = {https://dblp.org/rec/conf/stacs/ThieraufTW94.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1993},
url = {https://doi.org/10.1109/SCT.1993.336532},
doi = {10.1109/SCT.1993.336532},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/OgiwaraTTW93.bib},
bibsource = {dblp computer science bibliography, https://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},
editor = {Osman Abou{-}Rabia and
Carl K. Chang and
Waldemar W. Koczkodaj},
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},
publisher = {{IEEE} Computer Society},
year = {1993},
timestamp = {Fri, 15 Jan 2016 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icci/HemachandraHOSTW93.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/isaac/HanHT93,
author = {Yenjo Han and
Lane A. Hemaspaandra and
Thomas Thierauf},
editor = {Kam{-}Wing Ng and
Prabhakar Raghavan and
N. V. Balasubramanian and
Francis Y. L. Chin},
title = {Threshold Computation and Cryptographic Security},
booktitle = {Algorithms and Computation, 4th International Symposium, {ISAAC} '93,
Hong Kong, December 15-17, 1993, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {762},
pages = {230--239},
publisher = {Springer},
year = {1993},
url = {https://doi.org/10.1007/3-540-57568-5\_253},
doi = {10.1007/3-540-57568-5\_253},
timestamp = {Mon, 16 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/isaac/HanHT93.bib},
bibsource = {dblp computer science bibliography, https://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},
editor = {Klaus Ambos{-}Spies and
Steven Homer and
Uwe Sch{\"{o}}ning},
title = {Reductions to Sets of Low Information Content},
booktitle = {Complexity Theory: Current Research, Dagstuhl Workshop, February 2-8,
1992},
pages = {1--46},
publisher = {Cambridge University Press},
year = {1992},
timestamp = {Wed, 26 Apr 2006 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/dagstuhl/ArvindHHKLMOSST92.bib},
bibsource = {dblp computer science bibliography, https://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},
editor = {Werner Kuich},
title = {Reductions to Sets of Low Information Content},
booktitle = {Automata, Languages and Programming, 19th International Colloquium,
ICALP92, Vienna, Austria, July 13-17, 1992, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {623},
pages = {162--173},
publisher = {Springer},
year = {1992},
url = {https://doi.org/10.1007/3-540-55719-9\_72},
doi = {10.1007/3-540-55719-9\_72},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/ArvindHHKLMOSST92.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:books/daglib/0070084,
author = {Thomas Thierauf},
title = {NP-uniforme Komplexit{\"{a}}tsklassen},
school = {University of Ulm, Germany},
year = {1990},
url = {https://d-nb.info/910431558},
timestamp = {Sat, 17 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/books/daglib/0070084.bib},
bibsource = {dblp computer science bibliography, https://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},
publisher = {{IEEE} Computer Society},
year = {1990},
url = {https://doi.org/10.1109/SCT.1990.113979},
doi = {10.1109/SCT.1990.113979},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/KoblerT90.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-18 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
