BibTeX records: Iddo Tzameret

download as .bib file

@inproceedings{DBLP:conf/innovations/TzameretZ24,
  author       = {Iddo Tzameret and
                  Luming Zhang},
  editor       = {Venkatesan Guruswami},
  title        = {Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness},
  booktitle    = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
  series       = {LIPIcs},
  volume       = {287},
  pages        = {95:1--95:22},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2024.95},
  doi          = {10.4230/LIPICS.ITCS.2024.95},
  timestamp    = {Wed, 24 Jan 2024 15:25:09 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/TzameretZ24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2304-14700,
  author       = {Iddo Tzameret and
                  Luming Zhang},
  title        = {Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness},
  journal      = {CoRR},
  volume       = {abs/2304.14700},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2304.14700},
  doi          = {10.48550/ARXIV.2304.14700},
  eprinttype    = {arXiv},
  eprint       = {2304.14700},
  timestamp    = {Tue, 13 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2304-14700.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/TzameretZ23,
  author       = {Iddo Tzameret and
                  Luming Zhang},
  title        = {Stretching Demi-Bits and Nondeterministic-Secure Pseudorandomness},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-057}},
  year         = {2023},
  url          = {https://eccc.weizmann.ac.il/report/2023/057},
  eprinttype    = {ECCC},
  eprint       = {TR23-057},
  timestamp    = {Tue, 13 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/TzameretZ23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/GovindasamyHT22,
  author       = {Nashlen Govindasamy and
                  Tuomas Hakoniemi and
                  Iddo Tzameret},
  title        = {Simple Hard Instances for Low-Depth Algebraic Proofs},
  booktitle    = {63rd {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2022, Denver, CO, USA, October 31 - November 3, 2022},
  pages        = {188--199},
  publisher    = {{IEEE}},
  year         = {2022},
  url          = {https://doi.org/10.1109/FOCS54457.2022.00025},
  doi          = {10.1109/FOCS54457.2022.00025},
  timestamp    = {Sat, 31 Dec 2022 17:14:50 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GovindasamyHT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2205-07175,
  author       = {Nashlen Govindasamy and
                  Tuomas Hakoniemi and
                  Iddo Tzameret},
  title        = {Simple Hard Instances for Low-Depth Algebraic Proofs},
  journal      = {CoRR},
  volume       = {abs/2205.07175},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2205.07175},
  doi          = {10.48550/ARXIV.2205.07175},
  eprinttype    = {arXiv},
  eprint       = {2205.07175},
  timestamp    = {Tue, 17 May 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2205-07175.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/GovindasamyHT22,
  author       = {Nashlen Govindasamy and
                  Tuomas Hakoniemi and
                  Iddo Tzameret},
  title        = {Simple Hard Instances for Low-Depth Algebraic Proofs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-055}},
  year         = {2022},
  url          = {https://eccc.weizmann.ac.il/report/2022/055},
  eprinttype    = {ECCC},
  eprint       = {TR22-055},
  timestamp    = {Mon, 11 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/GovindasamyHT22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/PartT21,
  author       = {Fedor Part and
                  Iddo Tzameret},
  title        = {Resolution with Counting: Dag-Like Lower Bounds and Different Moduli},
  journal      = {Comput. Complex.},
  volume       = {30},
  number       = {1},
  pages        = {2},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00037-020-00202-x},
  doi          = {10.1007/S00037-020-00202-X},
  timestamp    = {Tue, 19 Jan 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cc/PartT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/TzameretC21,
  author       = {Iddo Tzameret and
                  Stephen A. Cook},
  title        = {Uniform, Integral, and Feasible Proofs for the Determinant Identities},
  journal      = {J. {ACM}},
  volume       = {68},
  number       = {2},
  pages        = {12:1--12:80},
  year         = {2021},
  url          = {https://doi.org/10.1145/3431922},
  doi          = {10.1145/3431922},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/jacm/TzameretC21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/toc/ForbesSTW21,
  author       = {Michael A. Forbes and
                  Amir Shpilka and
                  Iddo Tzameret and
                  Avi Wigderson},
  title        = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
  journal      = {Theory Comput.},
  volume       = {17},
  pages        = {1--88},
  year         = {2021},
  url          = {https://theoryofcomputing.org/articles/v017a010/},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/toc/ForbesSTW21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/PartTT21,
  author       = {Fedor Part and
                  Neil Thapen and
                  Iddo Tzameret},
  title        = {First-Order Reasoning and Efficient Semi-Algebraic Proofs},
  booktitle    = {36th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                  2021, Rome, Italy, June 29 - July 2, 2021},
  pages        = {1--13},
  publisher    = {{IEEE}},
  year         = {2021},
  url          = {https://doi.org/10.1109/LICS52264.2021.9470546},
  doi          = {10.1109/LICS52264.2021.9470546},
  timestamp    = {Fri, 09 Jul 2021 14:04:16 +0200},
  biburl       = {https://dblp.org/rec/conf/lics/PartTT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/SanthanamT21,
  author       = {Rahul Santhanam and
                  Iddo Tzameret},
  editor       = {Samir Khuller and
                  Virginia Vassilevska Williams},
  title        = {Iterated lower bound formulas: a diagonalization-based approach to
                  proof complexity},
  booktitle    = {{STOC} '21: 53rd Annual {ACM} {SIGACT} Symposium on Theory of Computing,
                  Virtual Event, Italy, June 21-25, 2021},
  pages        = {234--247},
  publisher    = {{ACM}},
  year         = {2021},
  url          = {https://doi.org/10.1145/3406325.3451010},
  doi          = {10.1145/3406325.3451010},
  timestamp    = {Sat, 08 Jan 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/SanthanamT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2105-07531,
  author       = {Fedor Part and
                  Neil Thapen and
                  Iddo Tzameret},
  title        = {First-Order Reasoning and Efficient Semi-Algebraic Proofs},
  journal      = {CoRR},
  volume       = {abs/2105.07531},
  year         = {2021},
  url          = {https://arxiv.org/abs/2105.07531},
  eprinttype    = {arXiv},
  eprint       = {2105.07531},
  timestamp    = {Tue, 18 May 2021 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2105-07531.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/SanthanamT21,
  author       = {Rahul Santhanam and
                  Iddo Tzameret},
  title        = {Iterated Lower Bound Formulas: {A} Diagonalization-Based Approach
                  to Proof Complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR21-138}},
  year         = {2021},
  url          = {https://eccc.weizmann.ac.il/report/2021/138},
  eprinttype    = {ECCC},
  eprint       = {TR21-138},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/SanthanamT21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Tzameret20,
  author       = {Iddo Tzameret},
  editor       = {Maribel Fern{\'{a}}ndez and
                  Anca Muscholl},
  title        = {From Classical Proof Theory to {P} versus {NP:} a Guide to Bounded
                  Theories (Invited Talk)},
  booktitle    = {28th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2020,
                  January 13-16, 2020, Barcelona, Spain},
  series       = {LIPIcs},
  volume       = {152},
  pages        = {5:1--5:2},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.CSL.2020.5},
  doi          = {10.4230/LIPICS.CSL.2020.5},
  timestamp    = {Mon, 06 Jan 2020 16:44:23 +0100},
  biburl       = {https://dblp.org/rec/conf/csl/Tzameret20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/PartT20,
  author       = {Fedor Part and
                  Iddo Tzameret},
  editor       = {Thomas Vidick},
  title        = {Resolution with Counting: Dag-Like Lower Bounds and Different Moduli},
  booktitle    = {11th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2020, January 12-14, 2020, Seattle, Washington, {USA}},
  series       = {LIPIcs},
  volume       = {151},
  pages        = {19:1--19:37},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2020},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2020.19},
  doi          = {10.4230/LIPICS.ITCS.2020.19},
  timestamp    = {Mon, 06 Jan 2020 16:50:09 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/PartT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AlekseevGHT20,
  author       = {Yaroslav Alekseev and
                  Dima Grigoriev and
                  Edward A. Hirsch and
                  Iddo Tzameret},
  editor       = {Konstantin Makarychev and
                  Yury Makarychev and
                  Madhur Tulsiani and
                  Gautam Kamath and
                  Julia Chuzhoy},
  title        = {Semi-algebraic proofs, {IPS} lower bounds, and the {\(\tau\)}-conjecture:
                  can a natural number be negative?},
  booktitle    = {Proceedings of the 52nd Annual {ACM} {SIGACT} Symposium on Theory
                  of Computing, {STOC} 2020, Chicago, IL, USA, June 22-26, 2020},
  pages        = {54--67},
  publisher    = {{ACM}},
  year         = {2020},
  url          = {https://doi.org/10.1145/3357713.3384245},
  doi          = {10.1145/3357713.3384245},
  timestamp    = {Mon, 18 Dec 2023 07:33:37 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/AlekseevGHT20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1911-06738,
  author       = {Yaroslav Alekseev and
                  Dima Grigoriev and
                  Edward A. Hirsch and
                  Iddo Tzameret},
  title        = {Semi-Algebraic Proofs, {IPS} Lower Bounds and the {\(\tau\)}-Conjecture:
                  Can a Natural Number be Negative?},
  journal      = {CoRR},
  volume       = {abs/1911.06738},
  year         = {2019},
  url          = {http://arxiv.org/abs/1911.06738},
  eprinttype    = {arXiv},
  eprint       = {1911.06738},
  timestamp    = {Mon, 02 Dec 2019 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1911-06738.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AlekseevGHT19,
  author       = {Yaroslav Alekseev and
                  Dima Grigoriev and
                  Edward A. Hirsch and
                  Iddo Tzameret},
  title        = {Semi-Algebraic Proofs, {IPS} Lower Bounds and the {\textdollar}{\textbackslash}tau{\textdollar}-Conjecture:
                  Can a Natural Number be Negative?},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-142}},
  year         = {2019},
  url          = {https://eccc.weizmann.ac.il/report/2019/142},
  eprinttype    = {ECCC},
  eprint       = {TR19-142},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AlekseevGHT19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ijac/LiT18,
  author       = {Fu Li and
                  Iddo Tzameret},
  title        = {Witnessing matrix identities and proof complexity},
  journal      = {Int. J. Algebra Comput.},
  volume       = {28},
  number       = {2},
  pages        = {217--256},
  year         = {2018},
  url          = {https://doi.org/10.1142/S021819671850011X},
  doi          = {10.1142/S021819671850011X},
  timestamp    = {Tue, 25 Aug 2020 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/ijac/LiT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/LiTW18,
  author       = {Fu Li and
                  Iddo Tzameret and
                  Zhengyu Wang},
  title        = {Characterizing Propositional Proofs as Noncommutative Formulas},
  journal      = {{SIAM} J. Comput.},
  volume       = {47},
  number       = {4},
  pages        = {1424--1462},
  year         = {2018},
  url          = {https://doi.org/10.1137/16M1107632},
  doi          = {10.1137/16M1107632},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/LiTW18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-09383,
  author       = {Fedor Part and
                  Iddo Tzameret},
  title        = {Resolution with Counting: Lower Bounds over Different Moduli},
  journal      = {CoRR},
  volume       = {abs/1806.09383},
  year         = {2018},
  url          = {http://arxiv.org/abs/1806.09383},
  eprinttype    = {arXiv},
  eprint       = {1806.09383},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1806-09383.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-04313,
  author       = {Iddo Tzameret and
                  Stephen A. Cook},
  title        = {Uniform, Integral and Feasible Proofs for the Determinant Identities},
  journal      = {CoRR},
  volume       = {abs/1811.04313},
  year         = {2018},
  url          = {http://arxiv.org/abs/1811.04313},
  eprinttype    = {arXiv},
  eprint       = {1811.04313},
  timestamp    = {Fri, 23 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1811-04313.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PartT18,
  author       = {Fedor Part and
                  Iddo Tzameret},
  title        = {Resolution with Counting: Lower Bounds over Different Moduli},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR18-117}},
  year         = {2018},
  url          = {https://eccc.weizmann.ac.il/report/2018/117},
  eprinttype    = {ECCC},
  eprint       = {TR18-117},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/PartT18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/TzameretC18,
  author       = {Iddo Tzameret and
                  Stephen A. Cook},
  title        = {Uniform, Integral and Feasible Proofs for the Determinant Identities},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR18-184}},
  year         = {2018},
  url          = {https://eccc.weizmann.ac.il/report/2018/184},
  eprinttype    = {ECCC},
  eprint       = {TR18-184},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/TzameretC18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/TzameretC17,
  author       = {Iddo Tzameret and
                  Stephen A. Cook},
  title        = {Uniform, integral and efficient proofs for the determinant identities},
  booktitle    = {32nd Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
                  2017, Reykjavik, Iceland, June 20-23, 2017},
  pages        = {1--12},
  publisher    = {{IEEE} Computer Society},
  year         = {2017},
  url          = {https://doi.org/10.1109/LICS.2017.8005099},
  doi          = {10.1109/LICS.2017.8005099},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/TzameretC17.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siglog/PitassiT16,
  author       = {Toniann Pitassi and
                  Iddo Tzameret},
  title        = {Algebraic proof complexity: progress, frontiers and challenges},
  journal      = {{ACM} {SIGLOG} News},
  volume       = {3},
  number       = {3},
  pages        = {21--43},
  year         = {2016},
  url          = {https://doi.org/10.1145/2984450.2984455},
  doi          = {10.1145/2984450.2984455},
  timestamp    = {Fri, 10 Jun 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siglog/PitassiT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/ForbesSTW16,
  author       = {Michael A. Forbes and
                  Amir Shpilka and
                  Iddo Tzameret and
                  Avi Wigderson},
  editor       = {Ran Raz},
  title        = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
  booktitle    = {31st Conference on Computational Complexity, {CCC} 2016, May 29 to
                  June 1, 2016, Tokyo, Japan},
  series       = {LIPIcs},
  volume       = {50},
  pages        = {32:1--32:17},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2016},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2016.32},
  doi          = {10.4230/LIPICS.CCC.2016.32},
  timestamp    = {Mon, 26 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/coco/ForbesSTW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/ForbesSTW16,
  author       = {Michael A. Forbes and
                  Amir Shpilka and
                  Iddo Tzameret and
                  Avi Wigderson},
  title        = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
  journal      = {CoRR},
  volume       = {abs/1606.05050},
  year         = {2016},
  url          = {http://arxiv.org/abs/1606.05050},
  eprinttype    = {arXiv},
  eprint       = {1606.05050},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/ForbesSTW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/PitassiT16,
  author       = {Toniann Pitassi and
                  Iddo Tzameret},
  title        = {Algebraic Proof Complexity: Progress, Frontiers and Challenges},
  journal      = {CoRR},
  volume       = {abs/1607.00443},
  year         = {2016},
  url          = {http://arxiv.org/abs/1607.00443},
  eprinttype    = {arXiv},
  eprint       = {1607.00443},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/PitassiT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ForbesSTW16,
  author       = {Michael A. Forbes and
                  Amir Shpilka and
                  Iddo Tzameret and
                  Avi Wigderson},
  title        = {Proof Complexity Lower Bounds from Algebraic Circuit Complexity},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR16-098}},
  year         = {2016},
  url          = {https://eccc.weizmann.ac.il/report/2016/098},
  eprinttype    = {ECCC},
  eprint       = {TR16-098},
  timestamp    = {Tue, 30 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ForbesSTW16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/PitassiT16,
  author       = {Toniann Pitassi and
                  Iddo Tzameret},
  title        = {Algebraic Proof Complexity: Progress, Frontiers and Challenges},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR16-101}},
  year         = {2016},
  url          = {https://eccc.weizmann.ac.il/report/2016/101},
  eprinttype    = {ECCC},
  eprint       = {TR16-101},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/PitassiT16.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/HrubesT15,
  author       = {Pavel Hrubes and
                  Iddo Tzameret},
  title        = {Short Proofs for the Determinant Identities},
  journal      = {{SIAM} J. Comput.},
  volume       = {44},
  number       = {2},
  pages        = {340--383},
  year         = {2015},
  url          = {https://doi.org/10.1137/130917788},
  doi          = {10.1137/130917788},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/siamcomp/HrubesT15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/LiTW15,
  author       = {Fu Li and
                  Iddo Tzameret and
                  Zhengyu Wang},
  editor       = {David Zuckerman},
  title        = {Non-Commutative Formulas and Frege Lower Bounds: a New Characterization
                  of Propositional Proofs},
  booktitle    = {30th Conference on Computational Complexity, {CCC} 2015, June 17-19,
                  2015, Portland, Oregon, {USA}},
  series       = {LIPIcs},
  volume       = {33},
  pages        = {412--432},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2015},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2015.412},
  doi          = {10.4230/LIPICS.CCC.2015.412},
  timestamp    = {Thu, 02 Feb 2023 13:27:06 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/LiTW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiTW15,
  author       = {Fu Li and
                  Iddo Tzameret and
                  Zhengyu Wang},
  title        = {Characterizing Propositional Proofs as Non-Commutative Formulas},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR15-134}},
  year         = {2015},
  url          = {https://eccc.weizmann.ac.il/report/2015/134},
  eprinttype    = {ECCC},
  eprint       = {TR15-134},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/LiTW15.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/MullerT14,
  author       = {Sebastian M{\"{u}}ller and
                  Iddo Tzameret},
  title        = {Short propositional refutations for dense random 3CNF formulas},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {165},
  number       = {12},
  pages        = {1864--1918},
  year         = {2014},
  url          = {https://doi.org/10.1016/j.apal.2014.08.001},
  doi          = {10.1016/J.APAL.2014.08.001},
  timestamp    = {Fri, 21 Feb 2020 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/apal/MullerT14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Tzameret14,
  author       = {Iddo Tzameret},
  editor       = {Javier Esparza and
                  Pierre Fraigniaud and
                  Thore Husfeldt and
                  Elias Koutsoupias},
  title        = {Sparser Random 3-SAT Refutation Algorithms and the Interpolation Problem
                  - (Extended Abstract)},
  booktitle    = {Automata, Languages, and Programming - 41st International Colloquium,
                  {ICALP} 2014, Copenhagen, Denmark, July 8-11, 2014, Proceedings, Part
                  {I}},
  series       = {Lecture Notes in Computer Science},
  volume       = {8572},
  pages        = {1015--1026},
  publisher    = {Springer},
  year         = {2014},
  url          = {https://doi.org/10.1007/978-3-662-43948-7\_84},
  doi          = {10.1007/978-3-662-43948-7\_84},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/Tzameret14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LiTW14,
  author       = {Fu Li and
                  Iddo Tzameret and
                  Zhengyu Wang},
  title        = {Non-Commutative Formulas and Frege Lower Bounds: a New Characterization
                  of Propositional Proofs},
  journal      = {CoRR},
  volume       = {abs/1412.8746},
  year         = {2014},
  url          = {http://arxiv.org/abs/1412.8746},
  eprinttype    = {arXiv},
  eprint       = {1412.8746},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LiTW14.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cjtcs/AllenderDFHT13,
  author       = {Eric Allender and
                  George Davie and
                  Luke Friedman and
                  Samuel Hopkins and
                  Iddo Tzameret},
  title        = {Kolmogorov Complexity, Circuits, and the Strength of Formal Theories
                  of Arithmetic},
  journal      = {Chic. J. Theor. Comput. Sci.},
  volume       = {2013},
  year         = {2013},
  url          = {http://cjtcs.cs.uchicago.edu/articles/2013/5/contents.html},
  timestamp    = {Thu, 11 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/cjtcs/AllenderDFHT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1305-0948,
  author       = {Iddo Tzameret},
  title        = {On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation},
  journal      = {CoRR},
  volume       = {abs/1305.0948},
  year         = {2013},
  url          = {http://arxiv.org/abs/1305.0948},
  eprinttype    = {arXiv},
  eprint       = {1305.0948},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1305-0948.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/LiT13a,
  author       = {Fu Li and
                  Iddo Tzameret},
  title        = {Generating Matrix Identities and Proof Complexity Lower Bounds},
  journal      = {CoRR},
  volume       = {abs/1312.6242},
  year         = {2013},
  url          = {http://arxiv.org/abs/1312.6242},
  eprinttype    = {arXiv},
  eprint       = {1312.6242},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/LiT13a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/LiT13,
  author       = {Fu Li and
                  Iddo Tzameret},
  title        = {Generating Matrix Identities and Proof Complexity Lower Bounds},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-185}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/185},
  eprinttype    = {ECCC},
  eprint       = {TR13-185},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/LiT13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Tzameret13,
  author       = {Iddo Tzameret},
  title        = {On Sparser Random 3SAT Refutation Algorithms and Feasible Interpolation},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR13-070}},
  year         = {2013},
  url          = {https://eccc.weizmann.ac.il/report/2013/070},
  eprinttype    = {ECCC},
  eprint       = {TR13-070},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Tzameret13.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/MullerT12,
  author       = {Sebastian M{\"{u}}ller and
                  Iddo Tzameret},
  title        = {Short Propositional Refutations for Dense Random 3CNF Formulas},
  booktitle    = {Proceedings of the 27th Annual {IEEE} Symposium on Logic in Computer
                  Science, {LICS} 2012, Dubrovnik, Croatia, June 25-28, 2012},
  pages        = {501--510},
  publisher    = {{IEEE} Computer Society},
  year         = {2012},
  url          = {https://doi.org/10.1109/LICS.2012.60},
  doi          = {10.1109/LICS.2012.60},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/lics/MullerT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/HrubesT12,
  author       = {Pavel Hrubes and
                  Iddo Tzameret},
  editor       = {Howard J. Karloff and
                  Toniann Pitassi},
  title        = {Short proofs for the determinant identities},
  booktitle    = {Proceedings of the 44th Symposium on Theory of Computing Conference,
                  {STOC} 2012, New York, NY, USA, May 19 - 22, 2012},
  pages        = {193--212},
  publisher    = {{ACM}},
  year         = {2012},
  url          = {https://doi.org/10.1145/2213977.2213998},
  doi          = {10.1145/2213977.2213998},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/stoc/HrubesT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AllenderDFHT12,
  author       = {Eric Allender and
                  George Davie and
                  Luke Friedman and
                  Samuel Hopkins and
                  Iddo Tzameret},
  title        = {Kolmogorov Complexity, Circuits, and the Strength of Formal Theories
                  of Arithmetic},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR12-028}},
  year         = {2012},
  url          = {https://eccc.weizmann.ac.il/report/2012/028},
  eprinttype    = {ECCC},
  eprint       = {TR12-028},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/AllenderDFHT12.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/Tzameret11,
  author       = {Iddo Tzameret},
  title        = {Algebraic proofs over noncommutative formulas},
  journal      = {Inf. Comput.},
  volume       = {209},
  number       = {10},
  pages        = {1269--1292},
  year         = {2011},
  url          = {https://doi.org/10.1016/j.ic.2011.07.004},
  doi          = {10.1016/J.IC.2011.07.004},
  timestamp    = {Fri, 12 Feb 2021 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/iandc/Tzameret11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1101-3970,
  author       = {Sebastian M{\"{u}}ller and
                  Iddo Tzameret},
  title        = {Average-Case Separation in Proof Complexity: Short Propositional Refutations
                  for Random 3CNF Formulas},
  journal      = {CoRR},
  volume       = {abs/1101.3970},
  year         = {2011},
  url          = {http://arxiv.org/abs/1101.3970},
  eprinttype    = {arXiv},
  eprint       = {1101.3970},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1101-3970.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1112-6265,
  author       = {Pavel Hrubes and
                  Iddo Tzameret},
  title        = {Short Proofs for the Determinant Identities},
  journal      = {CoRR},
  volume       = {abs/1112.6265},
  year         = {2011},
  url          = {http://arxiv.org/abs/1112.6265},
  eprinttype    = {arXiv},
  eprint       = {1112.6265},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1112-6265.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/HrubesT11,
  author       = {Pavel Hrubes and
                  Iddo Tzameret},
  title        = {Short Proofs for the Determinant Identities},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-174}},
  year         = {2011},
  url          = {https://eccc.weizmann.ac.il/report/2011/174},
  eprinttype    = {ECCC},
  eprint       = {TR11-174},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/HrubesT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/MullerT11,
  author       = {Sebastian M{\"{u}}ller and
                  Iddo Tzameret},
  title        = {Average-Case Separation in Proof Complexity: Short Propositional Refutations
                  for Random 3CNF Formulas},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR11-006}},
  year         = {2011},
  url          = {https://eccc.weizmann.ac.il/report/2011/006},
  eprinttype    = {ECCC},
  eprint       = {TR11-006},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/MullerT11.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/DershowitzT10,
  author       = {Nachum Dershowitz and
                  Iddo Tzameret},
  title        = {Complexity of propositional proofs under a promise},
  journal      = {{ACM} Trans. Comput. Log.},
  volume       = {11},
  number       = {3},
  pages        = {18:1--18:30},
  year         = {2010},
  url          = {https://doi.org/10.1145/1740582.1740586},
  doi          = {10.1145/1740582.1740586},
  timestamp    = {Tue, 06 Nov 2018 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tocl/DershowitzT10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/tamc/Tzameret10,
  author       = {Iddo Tzameret},
  editor       = {Jan Kratochv{\'{\i}}l and
                  Angsheng Li and
                  Jir{\'{\i}} Fiala and
                  Petr Kolman},
  title        = {Algebraic Proofs over Noncommutative Formulas},
  booktitle    = {Theory and Applications of Models of Computation, 7th Annual Conference,
                  {TAMC} 2010, Prague, Czech Republic, June 7-11, 2010. Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {6108},
  pages        = {60--71},
  publisher    = {Springer},
  year         = {2010},
  url          = {https://doi.org/10.1007/978-3-642-13562-0\_7},
  doi          = {10.1007/978-3-642-13562-0\_7},
  timestamp    = {Tue, 14 May 2019 10:00:46 +0200},
  biburl       = {https://dblp.org/rec/conf/tamc/Tzameret10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1004-2159,
  author       = {Iddo Tzameret},
  title        = {Algebraic Proofs over Noncommutative Formulas},
  journal      = {CoRR},
  volume       = {abs/1004.2159},
  year         = {2010},
  url          = {http://arxiv.org/abs/1004.2159},
  eprinttype    = {arXiv},
  eprint       = {1004.2159},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-1004-2159.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/Tzameret10,
  author       = {Iddo Tzameret},
  title        = {Algebraic Proofs over Noncommutative Formulas},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR10-097}},
  year         = {2010},
  url          = {https://eccc.weizmann.ac.il/report/2010/097},
  eprinttype    = {ECCC},
  eprint       = {TR10-097},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/Tzameret10.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/HrubesT09,
  author       = {Pavel Hrubes and
                  Iddo Tzameret},
  title        = {The Proof Complexity of Polynomial Identities},
  booktitle    = {Proceedings of the 24th Annual {IEEE} Conference on Computational
                  Complexity, {CCC} 2009, Paris, France, 15-18 July 2009},
  pages        = {41--51},
  publisher    = {{IEEE} Computer Society},
  year         = {2009},
  url          = {https://doi.org/10.1109/CCC.2009.9},
  doi          = {10.1109/CCC.2009.9},
  timestamp    = {Fri, 24 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/HrubesT09.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@phdthesis{DBLP:phd/il/Tzameret08,
  author       = {Iddo Tzameret},
  title        = {Studies in algebraic and propositional proof complexity},
  school       = {Tel Aviv University, Israel},
  year         = {2008},
  url          = {https://tau.primo.exlibrisgroup.com/permalink/972TAU\_INST/bai57q/alma990021955740204146},
  timestamp    = {Fri, 03 Nov 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/phd/il/Tzameret08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/apal/RazT08,
  author       = {Ran Raz and
                  Iddo Tzameret},
  title        = {Resolution over linear equations and multilinear proofs},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {155},
  number       = {3},
  pages        = {194--224},
  year         = {2008},
  url          = {https://doi.org/10.1016/j.apal.2008.04.001},
  doi          = {10.1016/J.APAL.2008.04.001},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/apal/RazT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/cc/RazT08,
  author       = {Ran Raz and
                  Iddo Tzameret},
  title        = {The Strength of Multilinear Proofs},
  journal      = {Comput. Complex.},
  volume       = {17},
  number       = {3},
  pages        = {407--457},
  year         = {2008},
  url          = {https://doi.org/10.1007/s00037-008-0246-0},
  doi          = {10.1007/S00037-008-0246-0},
  timestamp    = {Sat, 30 Sep 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/RazT08.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/DershowitzT07,
  author       = {Nachum Dershowitz and
                  Iddo Tzameret},
  editor       = {Lars Arge and
                  Christian Cachin and
                  Tomasz Jurdzinski and
                  Andrzej Tarlecki},
  title        = {Complexity of Propositional Proofs Under a Promise},
  booktitle    = {Automata, Languages and Programming, 34th International Colloquium,
                  {ICALP} 2007, Wroclaw, Poland, July 9-13, 2007, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {4596},
  pages        = {291--302},
  publisher    = {Springer},
  year         = {2007},
  url          = {https://doi.org/10.1007/978-3-540-73420-8\_27},
  doi          = {10.1007/978-3-540-73420-8\_27},
  timestamp    = {Tue, 14 May 2019 10:00:44 +0200},
  biburl       = {https://dblp.org/rec/conf/icalp/DershowitzT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0707-4255,
  author       = {Nachum Dershowitz and
                  Iddo Tzameret},
  title        = {Complexity of Propositional Proofs under a Promise},
  journal      = {CoRR},
  volume       = {abs/0707.4255},
  year         = {2007},
  url          = {http://arxiv.org/abs/0707.4255},
  eprinttype    = {arXiv},
  eprint       = {0707.4255},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0707-4255.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-0708-1529,
  author       = {Ran Raz and
                  Iddo Tzameret},
  title        = {Resolution over Linear Equations and Multilinear Proofs},
  journal      = {CoRR},
  volume       = {abs/0708.1529},
  year         = {2007},
  url          = {http://arxiv.org/abs/0708.1529},
  eprinttype    = {arXiv},
  eprint       = {0708.1529},
  timestamp    = {Mon, 13 Aug 2018 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-0708-1529.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/RazT07,
  author       = {Ran Raz and
                  Iddo Tzameret},
  title        = {Resolution over Linear Equations and Multilinear Proofs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR07-078}},
  year         = {2007},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2007/TR07-078/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR07-078},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/RazT07.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR06-001,
  author       = {Ran Raz and
                  Iddo Tzameret},
  title        = {The Strength of Multilinear Proofs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR06-001}},
  year         = {2006},
  url          = {https://eccc.weizmann.ac.il/eccc-reports/2006/TR06-001/index.html},
  eprinttype    = {ECCC},
  eprint       = {TR06-001},
  timestamp    = {Wed, 28 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ECCC-TR06-001.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:journals/entcs/DershowitzT03,
  author       = {Nachum Dershowitz and
                  Iddo Tzameret},
  editor       = {Ruy J. G. B. de Queiroz and
                  Elaine Pimentel and
                  Luc{\'{\i}}lia Figueiredo},
  title        = {Gap Embedding for Well-Quasi-Orderings},
  booktitle    = {10th Workshop on Logic, Language, Information and Computation, WoLLIC
                  2003, Ouro Preto, Minas Gerais, Brazil, July 29 - August 1, 2003},
  series       = {Electronic Notes in Theoretical Computer Science},
  volume       = {84},
  pages        = {80--90},
  publisher    = {Elsevier},
  year         = {2003},
  url          = {https://doi.org/10.1016/S1571-0661(04)80846-6},
  doi          = {10.1016/S1571-0661(04)80846-6},
  timestamp    = {Mon, 05 Dec 2022 16:22:59 +0100},
  biburl       = {https://dblp.org/rec/journals/entcs/DershowitzT03.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics