BibTeX records: Artur Riazanov

download as .bib file

@inproceedings{DBLP:conf/innovations/FilmusHRSV24,
  author       = {Yuval Filmus and
                  Edward A. Hirsch and
                  Artur Riazanov and
                  Alexander Smal and
                  Marc Vinyals},
  editor       = {Venkatesan Guruswami},
  title        = {Proving Unsatisfiability with Hitting Formulas},
  booktitle    = {15th Innovations in Theoretical Computer Science Conference, {ITCS}
                  2024, January 30 to February 2, 2024, Berkeley, CA, {USA}},
  series       = {LIPIcs},
  volume       = {287},
  pages        = {48:1--48:20},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2024},
  url          = {https://doi.org/10.4230/LIPIcs.ITCS.2024.48},
  doi          = {10.4230/LIPICS.ITCS.2024.48},
  timestamp    = {Wed, 24 Jan 2024 15:25:09 +0100},
  biburl       = {https://dblp.org/rec/conf/innovations/FilmusHRSV24.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/apal/GalesiIRS23,
  author       = {Nicola Galesi and
                  Dmitry Itsykson and
                  Artur Riazanov and
                  Anastasia Sofronova},
  title        = {Bounded-depth Frege complexity of Tseitin formulas for all graphs},
  journal      = {Ann. Pure Appl. Log.},
  volume       = {174},
  number       = {1},
  pages        = {103166},
  year         = {2023},
  url          = {https://doi.org/10.1016/j.apal.2022.103166},
  doi          = {10.1016/J.APAL.2022.103166},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/apal/GalesiIRS23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/approx/FilmusLR023,
  author       = {Yuval Filmus and
                  Itai Leigh and
                  Artur Riazanov and
                  Dmitry Sokolov},
  editor       = {Nicole Megow and
                  Adam D. Smith},
  title        = {Sampling and Certifying Symmetric Functions},
  booktitle    = {Approximation, Randomization, and Combinatorial Optimization. Algorithms
                  and Techniques, {APPROX/RANDOM} 2023, September 11-13, 2023, Atlanta,
                  Georgia, {USA}},
  series       = {LIPIcs},
  volume       = {275},
  pages        = {36:1--36:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2023},
  url          = {https://doi.org/10.4230/LIPIcs.APPROX/RANDOM.2023.36},
  doi          = {10.4230/LIPICS.APPROX/RANDOM.2023.36},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/approx/FilmusLR023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/focs/GoosRS023,
  author       = {Mika G{\"{o}}{\"{o}}s and
                  Artur Riazanov and
                  Anastasia Sofronova and
                  Dmitry Sokolov},
  title        = {Top-Down Lower Bounds for Depth-Four Circuits},
  booktitle    = {64th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
                  2023, Santa Cruz, CA, USA, November 6-9, 2023},
  pages        = {1048--1055},
  publisher    = {{IEEE}},
  year         = {2023},
  url          = {https://doi.org/10.1109/FOCS57990.2023.00063},
  doi          = {10.1109/FOCS57990.2023.00063},
  timestamp    = {Tue, 02 Jan 2024 14:56:14 +0100},
  biburl       = {https://dblp.org/rec/conf/focs/GoosRS023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2302-06241,
  author       = {Yuval Filmus and
                  Edward A. Hirsch and
                  Artur Riazanov and
                  Alexander Smal and
                  Marc Vinyals},
  title        = {Proving Unsatisfiability with Hitting Formulas},
  journal      = {CoRR},
  volume       = {abs/2302.06241},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2302.06241},
  doi          = {10.48550/ARXIV.2302.06241},
  eprinttype    = {arXiv},
  eprint       = {2302.06241},
  timestamp    = {Mon, 20 Feb 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2302-06241.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2304-02555,
  author       = {Mika G{\"{o}}{\"{o}}s and
                  Artur Riazanov and
                  Anastasia Sofronova and
                  Dmitry Sokolov},
  title        = {Top-Down Lower Bounds for Depth-Four Circuits},
  journal      = {CoRR},
  volume       = {abs/2304.02555},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2304.02555},
  doi          = {10.48550/ARXIV.2304.02555},
  eprinttype    = {arXiv},
  eprint       = {2304.02555},
  timestamp    = {Tue, 18 Apr 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2304-02555.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2305-04363,
  author       = {Yuval Filmus and
                  Itai Leigh and
                  Artur Riazanov and
                  Dmitry Sokolov},
  title        = {Sampling and Certifying Symmetric Functions},
  journal      = {CoRR},
  volume       = {abs/2305.04363},
  year         = {2023},
  url          = {https://doi.org/10.48550/arXiv.2305.04363},
  doi          = {10.48550/ARXIV.2305.04363},
  eprinttype    = {arXiv},
  eprint       = {2305.04363},
  timestamp    = {Fri, 12 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2305-04363.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/FilmusHRSV23,
  author       = {Yuval Filmus and
                  Edward A. Hirsch and
                  Artur Riazanov and
                  Alexander Smal and
                  Marc Vinyals},
  title        = {Proving Unsatisfiability with Hitting Formulas},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-016}},
  year         = {2023},
  url          = {https://eccc.weizmann.ac.il/report/2023/016},
  eprinttype    = {ECCC},
  eprint       = {TR23-016},
  timestamp    = {Mon, 06 Mar 2023 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eccc/FilmusHRSV23.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/FilmusLR023,
  author       = {Yuval Filmus and
                  Itai Leigh and
                  Artur Riazanov and
                  Dmitry Sokolov},
  title        = {Sampling and Certifying Symmetric Functions},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-071}},
  year         = {2023},
  url          = {https://eccc.weizmann.ac.il/report/2023/071},
  eprinttype    = {ECCC},
  eprint       = {TR23-071},
  timestamp    = {Tue, 13 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/FilmusLR023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/GoosNR023,
  author       = {Mika G{\"{o}}{\"{o}}s and
                  Ilan Newman and
                  Artur Riazanov and
                  Dmitry Sokolov},
  title        = {Hardness Condensation by Restriction},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-181}},
  year         = {2023},
  url          = {https://eccc.weizmann.ac.il/report/2023/181},
  eprinttype    = {ECCC},
  eprint       = {TR23-181},
  timestamp    = {Wed, 10 Jan 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/eccc/GoosNR023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/GoosRS023,
  author       = {Mika G{\"{o}}{\"{o}}s and
                  Artur Riazanov and
                  Anastasia Sofronova and
                  Dmitry Sokolov},
  title        = {Top-Down Lower Bounds for Depth-Four Circuits},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR23-049}},
  year         = {2023},
  url          = {https://eccc.weizmann.ac.il/report/2023/049},
  eprinttype    = {ECCC},
  eprint       = {TR23-049},
  timestamp    = {Tue, 13 Jun 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/GoosRS023.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/corr/abs-2212-14685,
  author       = {Yuval Filmus and
                  Edward A. Hirsch and
                  Sascha Kurz and
                  Ferdinand Ihringer and
                  Artur Riazanov and
                  Alexander Smal and
                  Marc Vinyals},
  title        = {Irreducible subcube partitions},
  journal      = {CoRR},
  volume       = {abs/2212.14685},
  pages        = {1--38},
  year         = {2022},
  url          = {https://doi.org/10.48550/arXiv.2212.14685},
  doi          = {10.48550/ARXIV.2212.14685},
  eprinttype    = {arXiv},
  eprint       = {2212.14685},
  timestamp    = {Mon, 15 May 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/corr/abs-2212-14685.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/latin/GlinskihR22,
  author       = {Ludmila Glinskih and
                  Artur Riazanov},
  editor       = {Armando Casta{\~{n}}eda and
                  Francisco Rodr{\'{\i}}guez{-}Henr{\'{\i}}quez},
  title        = {{MCSP} is Hard for Read-Once Nondeterministic Branching Programs},
  booktitle    = {{LATIN} 2022: Theoretical Informatics - 15th Latin American Symposium,
                  Guanajuato, Mexico, November 7-11, 2022, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {13568},
  pages        = {626--640},
  publisher    = {Springer},
  year         = {2022},
  url          = {https://doi.org/10.1007/978-3-031-20624-5\_38},
  doi          = {10.1007/978-3-031-20624-5\_38},
  timestamp    = {Thu, 03 Nov 2022 11:43:27 +0100},
  biburl       = {https://dblp.org/rec/conf/latin/GlinskihR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/ItsyksonR22,
  author       = {Dmitry Itsykson and
                  Artur Riazanov},
  editor       = {Stefan Szeider and
                  Robert Ganian and
                  Alexandra Silva},
  title        = {Automating {OBDD} proofs is NP-hard},
  booktitle    = {47th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2022, August 22-26, 2022, Vienna, Austria},
  series       = {LIPIcs},
  volume       = {241},
  pages        = {59:1--59:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2022.59},
  doi          = {10.4230/LIPICS.MFCS.2022.59},
  timestamp    = {Mon, 26 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/ItsyksonR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/sat/ItsyksonRS22,
  author       = {Dmitry Itsykson and
                  Artur Riazanov and
                  Petr Smirnov},
  editor       = {Kuldeep S. Meel and
                  Ofer Strichman},
  title        = {Tight Bounds for Tseitin Formulas},
  booktitle    = {25th International Conference on Theory and Applications of Satisfiability
                  Testing, {SAT} 2022, August 2-5, 2022, Haifa, Israel},
  series       = {LIPIcs},
  volume       = {236},
  pages        = {6:1--6:21},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2022},
  url          = {https://doi.org/10.4230/LIPIcs.SAT.2022.6},
  doi          = {10.4230/LIPICS.SAT.2022.6},
  timestamp    = {Wed, 07 Dec 2022 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/conf/sat/ItsyksonRS22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ItsyksonR22,
  author       = {Dmitry Itsykson and
                  Artur Riazanov},
  title        = {Automating {OBDD} proofs is NP-hard},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR22-046}},
  year         = {2022},
  url          = {https://eccc.weizmann.ac.il/report/2022/046},
  eprinttype    = {ECCC},
  eprint       = {TR22-046},
  timestamp    = {Mon, 11 Jul 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ItsyksonR22.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/ItsyksonRSS21,
  author       = {Dmitry Itsykson and
                  Artur Riazanov and
                  Danil Sagunov and
                  Petr Smirnov},
  title        = {Near-Optimal Lower Bounds on Regular Resolution Refutations of Tseitin
                  Formulas for All Constant-Degree Graphs},
  journal      = {Comput. Complex.},
  volume       = {30},
  number       = {2},
  pages        = {13},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00037-021-00213-2},
  doi          = {10.1007/S00037-021-00213-2},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/ItsyksonRSS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/cc/ItsyksonRSS21a,
  author       = {Dmitry Itsykson and
                  Artur Riazanov and
                  Danil Sagunov and
                  Petr Smirnov},
  title        = {Correction to: Near-Optimal Lower Bounds on Regular Resolution Refutations
                  of Tseitin Formulas for All Constant-Degree Graphs},
  journal      = {Comput. Complex.},
  volume       = {30},
  number       = {2},
  pages        = {16},
  year         = {2021},
  url          = {https://doi.org/10.1007/s00037-021-00216-z},
  doi          = {10.1007/S00037-021-00216-Z},
  timestamp    = {Mon, 28 Aug 2023 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/cc/ItsyksonRSS21a.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/tocl/BussIKRS21,
  author       = {Sam Buss and
                  Dmitry Itsykson and
                  Alexander Knop and
                  Artur Riazanov and
                  Dmitry Sokolov},
  title        = {Lower Bounds on {OBDD} Proofs with Several Orders},
  journal      = {{ACM} Trans. Comput. Log.},
  volume       = {22},
  number       = {4},
  pages        = {26:1--26:30},
  year         = {2021},
  url          = {https://doi.org/10.1145/3468855},
  doi          = {10.1145/3468855},
  timestamp    = {Mon, 05 Feb 2024 00:00:00 +0100},
  biburl       = {https://dblp.org/rec/journals/tocl/BussIKRS21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/coco/ItsyksonR21,
  author       = {Dmitry Itsykson and
                  Artur Riazanov},
  editor       = {Valentine Kabanets},
  title        = {Proof Complexity of Natural Formulas via Communication Arguments},
  booktitle    = {36th Computational Complexity Conference, {CCC} 2021, July 20-23,
                  2021, Toronto, Ontario, Canada (Virtual Conference)},
  series       = {LIPIcs},
  volume       = {200},
  pages        = {3:1--3:34},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2021},
  url          = {https://doi.org/10.4230/LIPIcs.CCC.2021.3},
  doi          = {10.4230/LIPICS.CCC.2021.3},
  timestamp    = {Thu, 02 Feb 2023 13:27:03 +0100},
  biburl       = {https://dblp.org/rec/conf/coco/ItsyksonR21.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/BussIKRS20,
  author       = {Sam Buss and
                  Dmitry Itsykson and
                  Alexander Knop and
                  Artur Riazanov and
                  Dmitry Sokolov},
  title        = {Lower Bounds on {OBDD} Proofs with Several Orders},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR20-073}},
  year         = {2020},
  url          = {https://eccc.weizmann.ac.il/report/2020/073},
  eprinttype    = {ECCC},
  eprint       = {TR20-073},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/BussIKRS20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ItsyksonR20,
  author       = {Dmitry Itsykson and
                  Artur Riazanov},
  title        = {Proof complexity of natural formulas via communication arguments},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR20-184}},
  year         = {2020},
  url          = {https://eccc.weizmann.ac.il/report/2020/184},
  eprinttype    = {ECCC},
  eprint       = {TR20-184},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ItsyksonR20.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/mfcs/GalesiIRS19,
  author       = {Nicola Galesi and
                  Dmitry Itsykson and
                  Artur Riazanov and
                  Anastasia Sofronova},
  editor       = {Peter Rossmanith and
                  Pinar Heggernes and
                  Joost{-}Pieter Katoen},
  title        = {Bounded-Depth Frege Complexity of Tseitin Formulas for All Graphs},
  booktitle    = {44th International Symposium on Mathematical Foundations of Computer
                  Science, {MFCS} 2019, August 26-30, 2019, Aachen, Germany},
  series       = {LIPIcs},
  volume       = {138},
  pages        = {49:1--49:15},
  publisher    = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
  year         = {2019},
  url          = {https://doi.org/10.4230/LIPIcs.MFCS.2019.49},
  doi          = {10.4230/LIPICS.MFCS.2019.49},
  timestamp    = {Fri, 30 Aug 2019 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/conf/mfcs/GalesiIRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/GalesiIRS19,
  author       = {Nicola Galesi and
                  Dmitry Itsykson and
                  Artur Riazanov and
                  Anastasia Sofronova},
  title        = {Bounded-depth Frege complexity of Tseitin formulas for all graphs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-069}},
  year         = {2019},
  url          = {https://eccc.weizmann.ac.il/report/2019/069},
  eprinttype    = {ECCC},
  eprint       = {TR19-069},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/GalesiIRS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@article{DBLP:journals/eccc/ItsyksonRSS19,
  author       = {Dmitry Itsykson and
                  Artur Riazanov and
                  Danil Sagunov and
                  Petr Smirnov},
  title        = {Almost Tight Lower Bounds on Regular Resolution Refutations of Tseitin
                  Formulas for All Constant-Degree Graphs},
  journal      = {Electron. Colloquium Comput. Complex.},
  volume       = {{TR19-178}},
  year         = {2019},
  url          = {https://eccc.weizmann.ac.il/report/2019/178},
  eprinttype    = {ECCC},
  eprint       = {TR19-178},
  timestamp    = {Tue, 27 Sep 2022 01:00:00 +0200},
  biburl       = {https://dblp.org/rec/journals/eccc/ItsyksonRSS19.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}

@inproceedings{DBLP:conf/csr/Riazanov18,
  author       = {Artur Riazanov},
  editor       = {Fedor V. Fomin and
                  Vladimir V. Podolskii},
  title        = {On the Decision Trees with Symmetries},
  booktitle    = {Computer Science - Theory and Applications - 13th International Computer
                  Science Symposium in Russia, {CSR} 2018, Moscow, Russia, June 6-10,
                  2018, Proceedings},
  series       = {Lecture Notes in Computer Science},
  volume       = {10846},
  pages        = {282--294},
  publisher    = {Springer},
  year         = {2018},
  url          = {https://doi.org/10.1007/978-3-319-90530-3\_24},
  doi          = {10.1007/978-3-319-90530-3\_24},
  timestamp    = {Tue, 14 May 2019 10:00:51 +0200},
  biburl       = {https://dblp.org/rec/conf/csr/Riazanov18.bib},
  bibsource    = {dblp computer science bibliography, https://dblp.org}
}
a service of  Schloss Dagstuhl - Leibniz Center for Informatics

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.