Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBibTeX records: Albert Atserias
@article{DBLP:journals/siamcomp/AtseriasF23,
author = {Albert Atserias and
Joanna Fijalkow},
title = {Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Graph
Isomorphism Problem},
journal = {{SIAM} J. Comput.},
volume = {52},
number = {5},
pages = {1193--1229},
year = {2023},
url = {https://doi.org/10.1137/20m1338435},
doi = {10.1137/20M1338435},
timestamp = {Thu, 09 Nov 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasF23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AtseriasL23,
author = {Albert Atserias and
Massimo Lauria},
title = {Circular (Yet Sound) Proofs in Propositional Logic},
journal = {{ACM} Trans. Comput. Log.},
volume = {24},
number = {3},
pages = {20:1--20:26},
year = {2023},
url = {https://doi.org/10.1145/3579997},
doi = {10.1145/3579997},
timestamp = {Fri, 21 Jul 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/AtseriasL23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AtseriasBM23,
author = {Albert Atserias and
Sam Buss and
Moritz M{\"{u}}ller},
editor = {Barna Saha and
Rocco A. Servedio},
title = {On the Consistency of Circuit Lower Bounds for Non-deterministic Time},
booktitle = {Proceedings of the 55th Annual {ACM} Symposium on Theory of Computing,
{STOC} 2023, Orlando, FL, USA, June 20-23, 2023},
pages = {1257--1270},
publisher = {{ACM}},
year = {2023},
url = {https://doi.org/10.1145/3564246.3585253},
doi = {10.1145/3564246.3585253},
timestamp = {Mon, 22 May 2023 13:01:48 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AtseriasBM23.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2303-01016,
author = {Albert Atserias and
Sam Buss and
Moritz M{\"{u}}ller},
title = {On the Consistency of Circuit Lower Bounds for Non-Deterministic Time},
journal = {CoRR},
volume = {abs/2303.01016},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2303.01016},
doi = {10.48550/ARXIV.2303.01016},
eprinttype = {arXiv},
eprint = {2303.01016},
timestamp = {Mon, 06 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2303-01016.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2312-02023,
author = {Albert Atserias and
Phokion G. Kolaitis},
title = {Consistency of Relations over Monoids},
journal = {CoRR},
volume = {abs/2312.02023},
year = {2023},
url = {https://doi.org/10.48550/arXiv.2312.02023},
doi = {10.48550/ARXIV.2312.02023},
eprinttype = {arXiv},
eprint = {2312.02023},
timestamp = {Tue, 12 Dec 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2312-02023.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/sigmod/AtseriasK22,
author = {Albert Atserias and
Phokion G. Kolaitis},
title = {Structure and Complexity of Bag Consistency},
journal = {{SIGMOD} Rec.},
volume = {51},
number = {1},
pages = {78--85},
year = {2022},
url = {https://doi.org/10.1145/3542700.3542719},
doi = {10.1145/3542700.3542719},
timestamp = {Fri, 08 Jul 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/sigmod/AtseriasK22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/Atserias22,
author = {Albert Atserias},
editor = {Mikolaj Bojanczyk and
Emanuela Merelli and
David P. Woodruff},
title = {Towards a Theory of Algorithmic Proof Complexity (Invited Talk)},
booktitle = {49th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2022, July 4-8, 2022, Paris, France},
series = {LIPIcs},
volume = {229},
pages = {1:1--1:2},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2022},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2022.1},
doi = {10.4230/LIPICS.ICALP.2022.1},
timestamp = {Tue, 28 Jun 2022 15:52:51 +0200},
biburl = {https://dblp.org/rec/conf/icalp/Atserias22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/soda/AtseriasD22,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
editor = {Joseph (Seffi) Naor and
Niv Buchbinder},
title = {Promise Constraint Satisfaction and Width},
booktitle = {Proceedings of the 2022 {ACM-SIAM} Symposium on Discrete Algorithms,
{SODA} 2022, Virtual Conference / Alexandria, VA, USA, January 9 -
12, 2022},
pages = {1129--1153},
publisher = {{SIAM}},
year = {2022},
url = {https://doi.org/10.1137/1.9781611977073.48},
doi = {10.1137/1.9781611977073.48},
timestamp = {Tue, 12 Apr 2022 11:24:56 +0200},
biburl = {https://dblp.org/rec/conf/soda/AtseriasD22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AtseriasBEO22,
author = {Albert Atserias and
Christoph Berkholz and
Kousha Etessami and
Joanna Ochremiak},
title = {Finite and Algorithmic Model Theory (Dagstuhl Seminar 22051)},
journal = {Dagstuhl Reports},
volume = {12},
number = {1},
pages = {101--118},
year = {2022},
url = {https://doi.org/10.4230/DagRep.12.1.101},
doi = {10.4230/DAGREP.12.1.101},
timestamp = {Mon, 26 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AtseriasBEO22.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasBRLNR21,
author = {Albert Atserias and
Ilario Bonacina and
Susanna F. de Rezende and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Alexander A. Razborov},
title = {Clique Is Hard on Average for Regular Resolution},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {23:1--23:26},
year = {2021},
url = {https://doi.org/10.1145/3449352},
doi = {10.1145/3449352},
timestamp = {Mon, 28 Aug 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasBRLNR21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasDO21,
author = {Albert Atserias and
Anuj Dawar and
Joanna Ochremiak},
title = {On the Power of Symmetric Linear Programs},
journal = {J. {ACM}},
volume = {68},
number = {4},
pages = {26:1--26:35},
year = {2021},
url = {https://doi.org/10.1145/3456297},
doi = {10.1145/3456297},
timestamp = {Thu, 19 Aug 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasDO21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AtseriasKW21,
author = {Albert Atserias and
Phokion G. Kolaitis and
Wei{-}Lin Wu},
title = {On the Expressive Power of Homomorphism Counts},
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.9470543},
doi = {10.1109/LICS52264.2021.9470543},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/AtseriasKW21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AtseriasK21,
author = {Albert Atserias and
Phokion G. Kolaitis},
editor = {Leonid Libkin and
Reinhard Pichler and
Paolo Guagliardo},
title = {Structure and Complexity of Bag Consistency},
booktitle = {PODS'21: Proceedings of the 40th {ACM} {SIGMOD-SIGACT-SIGAI} Symposium
on Principles of Database Systems, Virtual Event, China, June 20-25,
2021},
pages = {247--259},
publisher = {{ACM}},
year = {2021},
url = {https://doi.org/10.1145/3452021.3458329},
doi = {10.1145/3452021.3458329},
timestamp = {Mon, 21 Jun 2021 12:19:15 +0200},
biburl = {https://dblp.org/rec/conf/pods/AtseriasK21.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2101-12733,
author = {Albert Atserias and
Phokion G. Kolaitis and
Wei{-}Lin Wu},
title = {On the Expressive Power of Homomorphism Counts},
journal = {CoRR},
volume = {abs/2101.12733},
year = {2021},
url = {https://arxiv.org/abs/2101.12733},
eprinttype = {arXiv},
eprint = {2101.12733},
timestamp = {Tue, 02 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2101-12733.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2107-05886,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
title = {Promise Constraint Satisfaction and Width},
journal = {CoRR},
volume = {abs/2107.05886},
year = {2021},
url = {https://arxiv.org/abs/2107.05886},
eprinttype = {arXiv},
eprint = {2107.05886},
timestamp = {Wed, 21 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2107-05886.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasM20,
author = {Albert Atserias and
Moritz M{\"{u}}ller},
title = {Automating Resolution is NP-Hard},
journal = {J. {ACM}},
volume = {67},
number = {5},
pages = {31:1--31:17},
year = {2020},
url = {https://doi.org/10.1145/3409472},
doi = {10.1145/3409472},
timestamp = {Fri, 06 Nov 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasM20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fsttcs/Atserias20,
author = {Albert Atserias},
editor = {Nitin Saxena and
Sunil Simon},
title = {Proofs of Soundness and Proof Search (Invited Talk)},
booktitle = {40th {IARCS} Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, {FSTTCS} 2020, December 14-18, 2020,
{BITS} Pilani, {K} {K} Birla Goa Campus, Goa, India (Virtual Conference)},
series = {LIPIcs},
volume = {182},
pages = {2:1--2:1},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2020},
url = {https://doi.org/10.4230/LIPIcs.FSTTCS.2020.2},
doi = {10.4230/LIPICS.FSTTCS.2020.2},
timestamp = {Thu, 16 Sep 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/fsttcs/Atserias20.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2009-09488,
author = {Albert Atserias and
Phokion G. Kolaitis},
title = {Consistency, Acyclicity, and Positive Semirings},
journal = {CoRR},
volume = {abs/2009.09488},
year = {2020},
url = {https://arxiv.org/abs/2009.09488},
eprinttype = {arXiv},
eprint = {2009.09488},
timestamp = {Wed, 23 Sep 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-2009-09488.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-09476,
author = {Albert Atserias and
Ilario Bonacina and
Susanna F. de Rezende and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Alexander A. Razborov},
title = {Clique Is Hard on Average for Regular Resolution},
journal = {CoRR},
volume = {abs/2012.09476},
year = {2020},
url = {https://arxiv.org/abs/2012.09476},
eprinttype = {arXiv},
eprint = {2012.09476},
timestamp = {Sun, 03 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-09476.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-2012-12126,
author = {Albert Atserias and
Phokion G. Kolaitis},
title = {Structure and Complexity of Bag Consistency},
journal = {CoRR},
volume = {abs/2012.12126},
year = {2020},
url = {https://arxiv.org/abs/2012.12126},
eprinttype = {arXiv},
eprint = {2012.12126},
timestamp = {Tue, 05 Jan 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-2012-12126.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AtseriasKS19,
author = {Albert Atserias and
Phokion G. Kolaitis and
Simone Severini},
title = {Generalized satisfiability problems via operator assignments},
journal = {J. Comput. Syst. Sci.},
volume = {105},
pages = {171--198},
year = {2019},
url = {https://doi.org/10.1016/j.jcss.2019.05.003},
doi = {10.1016/J.JCSS.2019.05.003},
timestamp = {Mon, 03 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AtseriasKS19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jct/AtseriasMRSSV19,
author = {Albert Atserias and
Laura Mancinska and
David E. Roberson and
Robert S{\'{a}}mal and
Simone Severini and
Antonios Varvitsiotis},
title = {Quantum and non-signalling graph isomorphisms},
journal = {J. Comb. Theory, Ser. {B}},
volume = {136},
pages = {289--328},
year = {2019},
url = {https://doi.org/10.1016/j.jctb.2018.11.002},
doi = {10.1016/J.JCTB.2018.11.002},
timestamp = {Mon, 26 Jun 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jct/AtseriasMRSSV19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/lmcs/AtseriasBP19,
author = {Albert Atserias and
Jos{\'{e}} L. Balc{\'{a}}zar and
Marie Ely Piceno},
title = {Relative Entailment Among Probabilistic Implications},
journal = {Log. Methods Comput. Sci.},
volume = {15},
number = {1},
year = {2019},
url = {https://doi.org/10.23638/LMCS-15(1:10)2019},
doi = {10.23638/LMCS-15(1:10)2019},
timestamp = {Sun, 25 Jul 2021 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/lmcs/AtseriasBP19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/logcom/AtseriasD19,
author = {Albert Atserias and
Anuj Dawar},
title = {Definable inapproximability: new challenges for duplicator},
journal = {J. Log. Comput.},
volume = {29},
number = {8},
pages = {1185--1210},
year = {2019},
url = {https://doi.org/10.1093/logcom/exz022},
doi = {10.1093/LOGCOM/EXZ022},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/logcom/AtseriasD19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AtseriasO19,
author = {Albert Atserias and
Joanna Ochremiak},
title = {Proof Complexity Meets Algebra},
journal = {{ACM} Trans. Comput. Log.},
volume = {20},
number = {1},
pages = {1:1--1:46},
year = {2019},
url = {https://doi.org/10.1145/3265985},
doi = {10.1145/3265985},
timestamp = {Sat, 08 Jan 2022 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/AtseriasO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasH19,
author = {Albert Atserias and
Tuomas Hakoniemi},
editor = {Amir Shpilka},
title = {Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz
Proofs},
booktitle = {34th Computational Complexity Conference, {CCC} 2019, July 18-20,
2019, New Brunswick, NJ, {USA}},
series = {LIPIcs},
volume = {137},
pages = {24:1--24:20},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2019},
url = {https://doi.org/10.4230/LIPIcs.CCC.2019.24},
doi = {10.4230/LIPICS.CCC.2019.24},
timestamp = {Thu, 02 Feb 2023 13:27:04 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasH19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AtseriasM19,
author = {Albert Atserias and
Moritz M{\"{u}}ller},
editor = {David Zuckerman},
title = {Automating Resolution is NP-Hard},
booktitle = {60th {IEEE} Annual Symposium on Foundations of Computer Science, {FOCS}
2019, Baltimore, Maryland, USA, November 9-12, 2019},
pages = {498--509},
publisher = {{IEEE} Computer Society},
year = {2019},
url = {https://doi.org/10.1109/FOCS.2019.00038},
doi = {10.1109/FOCS.2019.00038},
timestamp = {Tue, 07 Jan 2020 13:25:31 +0100},
biburl = {https://dblp.org/rec/conf/focs/AtseriasM19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AtseriasDO19,
author = {Albert Atserias and
Anuj Dawar and
Joanna Ochremiak},
title = {On the Power of Symmetric Linear Programs},
booktitle = {34th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2019, Vancouver, BC, Canada, June 24-27, 2019},
pages = {1--13},
publisher = {{IEEE}},
year = {2019},
url = {https://doi.org/10.1109/LICS.2019.8785792},
doi = {10.1109/LICS.2019.8785792},
timestamp = {Mon, 15 Jun 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/lics/AtseriasDO19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/AtseriasL19,
author = {Albert Atserias and
Massimo Lauria},
editor = {Mikol{\'{a}}s Janota and
In{\^{e}}s Lynce},
title = {Circular (Yet Sound) Proofs},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2019 - 22nd
International Conference, {SAT} 2019, Lisbon, Portugal, July 9-12,
2019, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {11628},
pages = {1--18},
publisher = {Springer},
year = {2019},
url = {https://doi.org/10.1007/978-3-030-24258-9\_1},
doi = {10.1007/978-3-030-24258-9\_1},
timestamp = {Wed, 25 Sep 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/sat/AtseriasL19.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1901-07825,
author = {Albert Atserias and
Anuj Dawar and
Joanna Ochremiak},
title = {On the Power of Symmetric Linear Programs},
journal = {CoRR},
volume = {abs/1901.07825},
year = {2019},
url = {http://arxiv.org/abs/1901.07825},
eprinttype = {arXiv},
eprint = {1901.07825},
timestamp = {Sat, 02 Feb 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1901-07825.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1904-02991,
author = {Albert Atserias and
Moritz M{\"{u}}ller},
title = {Automating Resolution is NP-Hard},
journal = {CoRR},
volume = {abs/1904.02991},
year = {2019},
url = {http://arxiv.org/abs/1904.02991},
eprinttype = {arXiv},
eprint = {1904.02991},
timestamp = {Wed, 24 Apr 2019 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1904-02991.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/AtseriasD18,
author = {Albert Atserias and
Anuj Dawar},
editor = {Dan R. Ghica and
Achim Jung},
title = {Definable Inapproximability: New Challenges for Duplicator},
booktitle = {27th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2018,
September 4-7, 2018, Birmingham, {UK}},
series = {LIPIcs},
volume = {119},
pages = {7:1--7:21},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.CSL.2018.7},
doi = {10.4230/LIPICS.CSL.2018.7},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/csl/AtseriasD18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasKN18,
author = {Albert Atserias and
Stephan Kreutzer and
Marc Noy},
editor = {Ioannis Chatzigiannakis and
Christos Kaklamanis and
D{\'{a}}niel Marx and
Donald Sannella},
title = {On Zero-One and Convergence Laws for Graphs Embeddable on a Fixed
Surface},
booktitle = {45th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2018, July 9-13, 2018, Prague, Czech Republic},
series = {LIPIcs},
volume = {107},
pages = {116:1--116:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2018},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2018.116},
doi = {10.4230/LIPICS.ICALP.2018.116},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasKN18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AtseriasO18,
author = {Albert Atserias and
Joanna Ochremiak},
editor = {Anuj Dawar and
Erich Gr{\"{a}}del},
title = {Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism
Problem},
booktitle = {Proceedings of the 33rd Annual {ACM/IEEE} Symposium on Logic in Computer
Science, {LICS} 2018, Oxford, UK, July 09-12, 2018},
pages = {66--75},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3209108.3209186},
doi = {10.1145/3209108.3209186},
timestamp = {Wed, 21 Nov 2018 12:44:18 +0100},
biburl = {https://dblp.org/rec/conf/lics/AtseriasO18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stoc/AtseriasBRLNR18,
author = {Albert Atserias and
Ilario Bonacina and
Susanna F. de Rezende and
Massimo Lauria and
Jakob Nordstr{\"{o}}m and
Alexander A. Razborov},
editor = {Ilias Diakonikolas and
David Kempe and
Monika Henzinger},
title = {Clique is hard on average for regular resolution},
booktitle = {Proceedings of the 50th Annual {ACM} {SIGACT} Symposium on Theory
of Computing, {STOC} 2018, Los Angeles, CA, USA, June 25-29, 2018},
pages = {866--877},
publisher = {{ACM}},
year = {2018},
url = {https://doi.org/10.1145/3188745.3188856},
doi = {10.1145/3188745.3188856},
timestamp = {Sat, 09 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/stoc/AtseriasBRLNR18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-02388,
author = {Albert Atserias and
Joanna Ochremiak},
title = {Definable Ellipsoid Method, Sums-of-Squares Proofs, and the Isomorphism
Problem},
journal = {CoRR},
volume = {abs/1802.02388},
year = {2018},
url = {http://arxiv.org/abs/1802.02388},
eprinttype = {arXiv},
eprint = {1802.02388},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-02388.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1802-05266,
author = {Albert Atserias and
Massimo Lauria},
title = {Circular (Yet Sound) Proofs},
journal = {CoRR},
volume = {abs/1802.05266},
year = {2018},
url = {http://arxiv.org/abs/1802.05266},
eprinttype = {arXiv},
eprint = {1802.05266},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1802-05266.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1806-11307,
author = {Albert Atserias and
Anuj Dawar},
title = {Definable Inapproximability: New Challenges for Duplicator},
journal = {CoRR},
volume = {abs/1806.11307},
year = {2018},
url = {http://arxiv.org/abs/1806.11307},
eprinttype = {arXiv},
eprint = {1806.11307},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1806-11307.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1811-01351,
author = {Albert Atserias and
Tuomas Hakoniemi},
title = {Size-Degree Trade-Offs for Sums-of-Squares and Positivstellensatz
Proofs},
journal = {CoRR},
volume = {abs/1811.01351},
year = {2018},
url = {http://arxiv.org/abs/1811.01351},
eprinttype = {arXiv},
eprint = {1811.01351},
timestamp = {Thu, 22 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/corr/abs-1811-01351.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/dagstuhl-reports/AtseriasNPS18,
author = {Albert Atserias and
Jakob Nordstr{\"{o}}m and
Pavel Pudl{\'{a}}k and
Rahul Santhanam},
title = {Proof Complexity (Dagstuhl Seminar 18051)},
journal = {Dagstuhl Reports},
volume = {8},
number = {1},
pages = {124--157},
year = {2018},
url = {https://doi.org/10.4230/DagRep.8.1.124},
doi = {10.4230/DAGREP.8.1.124},
timestamp = {Mon, 23 Jul 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/dagstuhl-reports/AtseriasNPS18.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/fct/AtseriasKS17,
author = {Albert Atserias and
Phokion G. Kolaitis and
Simone Severini},
editor = {Ralf Klasing and
Marc Zeitoun},
title = {Generalized Satisfiability Problems via Operator Assignments},
booktitle = {Fundamentals of Computation Theory - 21st International Symposium,
{FCT} 2017, Bordeaux, France, September 11-13, 2017, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {10472},
pages = {56--68},
publisher = {Springer},
year = {2017},
url = {https://doi.org/10.1007/978-3-662-55751-8\_6},
doi = {10.1007/978-3-662-55751-8\_6},
timestamp = {Tue, 14 May 2019 10:00:53 +0200},
biburl = {https://dblp.org/rec/conf/fct/AtseriasKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasO17,
author = {Albert Atserias and
Joanna Ochremiak},
editor = {Ioannis Chatzigiannakis and
Piotr Indyk and
Fabian Kuhn and
Anca Muscholl},
title = {Proof Complexity Meets Algebra},
booktitle = {44th International Colloquium on Automata, Languages, and Programming,
{ICALP} 2017, July 10-14, 2017, Warsaw, Poland},
series = {LIPIcs},
volume = {80},
pages = {110:1--110:14},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2017},
url = {https://doi.org/10.4230/LIPIcs.ICALP.2017.110},
doi = {10.4230/LIPICS.ICALP.2017.110},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasO17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AtseriasKS17,
author = {Albert Atserias and
Phokion G. Kolaitis and
Simone Severini},
title = {Generalized Satisfiability Problems via Operator Assignments},
journal = {CoRR},
volume = {abs/1704.01736},
year = {2017},
url = {http://arxiv.org/abs/1704.01736},
eprinttype = {arXiv},
eprint = {1704.01736},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AtseriasKS17.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-03860,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size bounds and query plans for relational joins},
journal = {CoRR},
volume = {abs/1711.03860},
year = {2017},
url = {http://arxiv.org/abs/1711.03860},
eprinttype = {arXiv},
eprint = {1711.03860},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-03860.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/abs-1711-07320,
author = {Albert Atserias and
Joanna Ochremiak},
title = {Proof Complexity Meets Algebra},
journal = {CoRR},
volume = {abs/1711.07320},
year = {2017},
url = {http://arxiv.org/abs/1711.07320},
eprinttype = {arXiv},
eprint = {1711.07320},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/abs-1711-07320.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AtseriasLN16,
author = {Albert Atserias and
Massimo Lauria and
Jakob Nordstr{\"{o}}m},
title = {Narrow Proofs May Be Maximally Long},
journal = {{ACM} Trans. Comput. Log.},
volume = {17},
number = {3},
pages = {19},
year = {2016},
url = {https://doi.org/10.1145/2898435},
doi = {10.1145/2898435},
timestamp = {Mon, 13 Jun 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/tocl/AtseriasLN16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/AtseriasT16,
author = {Albert Atserias and
Szymon Torunczyk},
editor = {Jean{-}Marc Talbot and
Laurent Regnier},
title = {Non-Homogenizable Classes of Finite Structures},
booktitle = {25th {EACSL} Annual Conference on Computer Science Logic, {CSL} 2016,
August 29 - September 1, 2016, Marseille, France},
series = {LIPIcs},
volume = {62},
pages = {16:1--16:16},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2016},
url = {https://doi.org/10.4230/LIPIcs.CSL.2016.16},
doi = {10.4230/LIPICS.CSL.2016.16},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/csl/AtseriasT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AtseriasT16,
author = {Albert Atserias and
Szymon Torunczyk},
title = {Non-Homogenizable Classes of Finite Structures},
journal = {CoRR},
volume = {abs/1605.01199},
year = {2016},
url = {http://arxiv.org/abs/1605.01199},
eprinttype = {arXiv},
eprint = {1605.01199},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AtseriasT16.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/aml/AtseriasM15,
author = {Albert Atserias and
Moritz M{\"{u}}ller},
title = {Partially definable forcing and bounded arithmetic},
journal = {Arch. Math. Log.},
volume = {54},
number = {1-2},
pages = {1--33},
year = {2015},
url = {https://doi.org/10.1007/s00153-014-0398-3},
doi = {10.1007/S00153-014-0398-3},
timestamp = {Sat, 27 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/aml/AtseriasM15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jsyml/AtseriasMO15,
author = {Albert Atserias and
Moritz M{\"{u}}ller and
Sergi Oliva},
title = {Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole
Principle},
journal = {J. Symb. Log.},
volume = {80},
number = {2},
pages = {450--476},
year = {2015},
url = {https://doi.org/10.1017/jsl.2014.56},
doi = {10.1017/JSL.2014.56},
timestamp = {Sun, 28 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/jsyml/AtseriasMO15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AtseriasB15,
author = {Albert Atserias and
Jos{\'{e}} L. Balc{\'{a}}zar},
title = {Entailment among Probabilistic Implications},
booktitle = {30th Annual {ACM/IEEE} Symposium on Logic in Computer Science, {LICS}
2015, Kyoto, Japan, July 6-10, 2015},
pages = {621--632},
publisher = {{IEEE} Computer Society},
year = {2015},
url = {https://doi.org/10.1109/LICS.2015.63},
doi = {10.1109/LICS.2015.63},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AtseriasB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AtseriasB15,
author = {Albert Atserias and
Jos{\'{e}} L. Balc{\'{a}}zar},
title = {Entailment among probabilistic implications},
journal = {CoRR},
volume = {abs/1501.04826},
year = {2015},
url = {http://arxiv.org/abs/1501.04826},
eprinttype = {arXiv},
eprint = {1501.04826},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AtseriasB15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/Atserias15,
author = {Albert Atserias},
title = {A Note on Semi-Algebraic Proofs and Gaussian Elimination over Prime
Fields},
journal = {CoRR},
volume = {abs/1502.03974},
year = {2015},
url = {http://arxiv.org/abs/1502.03974},
eprinttype = {arXiv},
eprint = {1502.03974},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/Atserias15.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AtseriasO14,
author = {Albert Atserias and
Sergi Oliva},
title = {Bounded-width {QBF} is PSPACE-complete},
journal = {J. Comput. Syst. Sci.},
volume = {80},
number = {7},
pages = {1415--1429},
year = {2014},
url = {https://doi.org/10.1016/j.jcss.2014.04.014},
doi = {10.1016/J.JCSS.2014.04.014},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AtseriasO14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AtseriasD14,
author = {Albert Atserias and
Anuj Dawar},
title = {Degree lower bounds of tower-type for approximating formulas with
parity quantifiers},
journal = {{ACM} Trans. Comput. Log.},
volume = {15},
number = {1},
pages = {6:1--6:24},
year = {2014},
url = {https://doi.org/10.1145/2559948},
doi = {10.1145/2559948},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/AtseriasD14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tocl/AtseriasT14,
author = {Albert Atserias and
Neil Thapen},
title = {The Ordering Principle in a Fragment of Approximate Counting},
journal = {{ACM} Trans. Comput. Log.},
volume = {15},
number = {4},
pages = {29:1--29:11},
year = {2014},
url = {https://doi.org/10.1145/2629555},
doi = {10.1145/2629555},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tocl/AtseriasT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasLN14,
author = {Albert Atserias and
Massimo Lauria and
Jakob Nordstr{\"{o}}m},
title = {Narrow Proofs May Be Maximally Long},
booktitle = {{IEEE} 29th Conference on Computational Complexity, {CCC} 2014, Vancouver,
BC, Canada, June 11-13, 2014},
pages = {286--297},
publisher = {{IEEE} Computer Society},
year = {2014},
url = {https://doi.org/10.1109/CCC.2014.36},
doi = {10.1109/CCC.2014.36},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AtseriasFT14,
author = {Albert Atserias and
Johannes Klaus Fichte and
Marc Thurley},
title = {Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution},
journal = {CoRR},
volume = {abs/1401.3868},
year = {2014},
url = {http://arxiv.org/abs/1401.3868},
eprinttype = {arXiv},
eprint = {1401.3868},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AtseriasFT14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/corr/AtseriasLN14,
author = {Albert Atserias and
Massimo Lauria and
Jakob Nordstr{\"{o}}m},
title = {Narrow Proofs May Be Maximally Long},
journal = {CoRR},
volume = {abs/1409.2731},
year = {2014},
url = {http://arxiv.org/abs/1409.2731},
eprinttype = {arXiv},
eprint = {1409.2731},
timestamp = {Mon, 13 Aug 2018 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/corr/AtseriasLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasLN14,
author = {Albert Atserias and
Massimo Lauria and
Jakob Nordstr{\"{o}}m},
title = {Narrow Proofs May Be Maximally Long},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR14-118}},
year = {2014},
url = {https://eccc.weizmann.ac.il/report/2014/118},
eprinttype = {ECCC},
eprint = {TR14-118},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasLN14.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasM13,
author = {Albert Atserias and
Elitza N. Maneva},
title = {Sherali-Adams Relaxations and Indistinguishability in Counting Logics},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {1},
pages = {112--137},
year = {2013},
url = {https://doi.org/10.1137/120867834},
doi = {10.1137/120867834},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasGM13,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size Bounds and Query Plans for Relational Joins},
journal = {{SIAM} J. Comput.},
volume = {42},
number = {4},
pages = {1737--1767},
year = {2013},
url = {https://doi.org/10.1137/110859440},
doi = {10.1137/110859440},
timestamp = {Thu, 08 Jun 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasGM13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasMO13,
author = {Albert Atserias and
Moritz M{\"{u}}ller and
Sergi Oliva},
title = {Lower Bounds for DNF-refutations of a Relativized Weak Pigeonhole
Principle},
booktitle = {Proceedings of the 28th Conference on Computational Complexity, {CCC}
2013, K.lo Alto, California, USA, 5-7 June, 2013},
pages = {109--120},
publisher = {{IEEE} Computer Society},
year = {2013},
url = {https://doi.org/10.1109/CCC.2013.20},
doi = {10.1109/CCC.2013.20},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasMO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/Atserias13,
author = {Albert Atserias},
editor = {Matti J{\"{a}}rvisalo and
Allen Van Gelder},
title = {The Proof-Search Problem between Bounded-Width Resolution and Bounded-Degree
Semi-algebraic Proofs},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2013 - 16th
International Conference, Helsinki, Finland, July 8-12, 2013. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {7962},
pages = {1--17},
publisher = {Springer},
year = {2013},
url = {https://doi.org/10.1007/978-3-642-39071-5\_1},
doi = {10.1007/978-3-642-39071-5\_1},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/Atserias13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/stacs/AtseriasO13,
author = {Albert Atserias and
Sergi Oliva},
editor = {Natacha Portier and
Thomas Wilke},
title = {Bounded-width {QBF} is PSPACE-complete},
booktitle = {30th International Symposium on Theoretical Aspects of Computer Science,
{STACS} 2013, February 27 - March 2, 2013, Kiel, Germany},
series = {LIPIcs},
volume = {20},
pages = {44--54},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum f{\"{u}}r Informatik},
year = {2013},
url = {https://doi.org/10.4230/LIPIcs.STACS.2013.44},
doi = {10.4230/LIPICS.STACS.2013.44},
timestamp = {Tue, 11 Feb 2020 15:52:14 +0100},
biburl = {https://dblp.org/rec/conf/stacs/AtseriasO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasMO13,
author = {Albert Atserias and
Moritz M{\"{u}}ller and
Sergi Oliva},
title = {Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole
Principle},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-116}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/116},
eprinttype = {ECCC},
eprint = {TR13-116},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasMO13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasT13,
author = {Albert Atserias and
Neil Thapen},
title = {The Ordering Principle in a Fragment of Approximate Counting},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR13-149}},
year = {2013},
url = {https://eccc.weizmann.ac.il/report/2013/149},
eprinttype = {ECCC},
eprint = {TR13-149},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasT13.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasD12,
author = {Albert Atserias and
Anuj Dawar},
editor = {Artur Czumaj and
Kurt Mehlhorn and
Andrew M. Pitts and
Roger Wattenhofer},
title = {Degree Lower Bounds of Tower-Type for Approximating Formulas with
Parity Quantifiers},
booktitle = {Automata, Languages, and Programming - 39th International Colloquium,
{ICALP} 2012, Warwick, UK, July 9-13, 2012, Proceedings, Part {II}},
series = {Lecture Notes in Computer Science},
volume = {7392},
pages = {67--78},
publisher = {Springer},
year = {2012},
url = {https://doi.org/10.1007/978-3-642-31585-5\_10},
doi = {10.1007/978-3-642-31585-5\_10},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/innovations/AtseriasM12,
author = {Albert Atserias and
Elitza N. Maneva},
editor = {Shafi Goldwasser},
title = {Sherali-Adams relaxations and indistinguishability in counting logics},
booktitle = {Innovations in Theoretical Computer Science 2012, Cambridge, MA, USA,
January 8-10, 2012},
pages = {367--379},
publisher = {{ACM}},
year = {2012},
url = {https://doi.org/10.1145/2090236.2090265},
doi = {10.1145/2090236.2090265},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/innovations/AtseriasM12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasD12,
author = {Albert Atserias and
Anuj Dawar},
title = {Degree Lower Bounds of Tower-Type for Approximating Formulas with
Parity Quantifiers},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-015}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/015},
eprinttype = {ECCC},
eprint = {TR12-015},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasD12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasO12,
author = {Albert Atserias and
Sergi Oliva},
title = {Bounded-width {QBF} is PSPACE-complete},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR12-096}},
year = {2012},
url = {https://eccc.weizmann.ac.il/report/2012/096},
eprinttype = {ECCC},
eprint = {TR12-096},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasO12.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AtseriasM11,
author = {Albert Atserias and
Elitza N. Maneva},
title = {Mean-payoff games and propositional proofs},
journal = {Inf. Comput.},
volume = {209},
number = {4},
pages = {664--691},
year = {2011},
url = {https://doi.org/10.1016/j.ic.2011.01.003},
doi = {10.1016/J.IC.2011.01.003},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AtseriasM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jair/AtseriasFT11,
author = {Albert Atserias and
Johannes Klaus Fichte and
Marc Thurley},
title = {Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution},
journal = {J. Artif. Intell. Res.},
volume = {40},
pages = {353--373},
year = {2011},
url = {https://doi.org/10.1613/jair.3152},
doi = {10.1613/JAIR.3152},
timestamp = {Mon, 21 Jan 2019 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jair/AtseriasFT11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mst/AtseriasBCFGR11,
author = {Albert Atserias and
Mikolaj Bojanczyk and
Balder ten Cate and
Ronald Fagin and
Floris Geerts and
Kenneth A. Ross},
title = {Foreword},
journal = {Theory Comput. Syst.},
volume = {49},
number = {2},
pages = {365--366},
year = {2011},
url = {https://doi.org/10.1007/s00224-011-9329-4},
doi = {10.1007/S00224-011-9329-4},
timestamp = {Fri, 08 Apr 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mst/AtseriasBCFGR11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Atserias11,
author = {Albert Atserias},
title = {A Why-on-Earth Tutorial on Finite Model Theory},
booktitle = {Proceedings of the 26th Annual {IEEE} Symposium on Logic in Computer
Science, {LICS} 2011, June 21-24, 2011, Toronto, Ontario, Canada},
pages = {3},
publisher = {{IEEE} Computer Society},
year = {2011},
url = {https://doi.org/10.1109/LICS.2011.52},
doi = {10.1109/LICS.2011.52},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Atserias11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasM11,
author = {Albert Atserias and
Elitza N. Maneva},
title = {Graph Isomorphism, Sherali-Adams Relaxations and Expressibility in
Counting Logics},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR11-077}},
year = {2011},
url = {https://eccc.weizmann.ac.il/report/2011/077},
eprinttype = {ECCC},
eprint = {TR11-077},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasM11.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasM10,
author = {Albert Atserias and
Elitza N. Maneva},
editor = {Samson Abramsky and
Cyril Gavoille and
Claude Kirchner and
Friedhelm Meyer auf der Heide and
Paul G. Spirakis},
title = {Mean-Payoff Games and Propositional Proofs},
booktitle = {Automata, Languages and Programming, 37th International Colloquium,
{ICALP} 2010, Bordeaux, France, July 6-10, 2010, Proceedings, Part
{I}},
series = {Lecture Notes in Computer Science},
volume = {6198},
pages = {102--113},
publisher = {Springer},
year = {2010},
url = {https://doi.org/10.1007/978-3-642-14165-2\_10},
doi = {10.1007/978-3-642-14165-2\_10},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/AtseriasM10,
author = {Albert Atserias and
Elitza N. Maneva},
title = {Mean-payoff games and propositional proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR10-197}},
year = {2010},
url = {https://eccc.weizmann.ac.il/report/2010/197},
eprinttype = {ECCC},
eprint = {TR10-197},
timestamp = {Tue, 27 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/AtseriasM10.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/AtseriasBD09,
author = {Albert Atserias and
Andrei A. Bulatov and
Anuj Dawar},
title = {Affine systems of equations and counting infinitary logic},
journal = {Theor. Comput. Sci.},
volume = {410},
number = {18},
pages = {1666--1683},
year = {2009},
url = {https://doi.org/10.1016/j.tcs.2008.12.049},
doi = {10.1016/J.TCS.2008.12.049},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/AtseriasBD09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/AtseriasW09,
author = {Albert Atserias and
Mark Weyer},
editor = {Erich Gr{\"{a}}del and
Reinhard Kahle},
title = {Decidable Relationships between Consistency Notions for Constraint
Satisfaction Problems},
booktitle = {Computer Science Logic, 23rd international Workshop, {CSL} 2009, 18th
Annual Conference of the EACSL, Coimbra, Portugal, September 7-11,
2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5771},
pages = {102--116},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-04027-6\_10},
doi = {10.1007/978-3-642-04027-6\_10},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/AtseriasW09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Atserias09,
author = {Albert Atserias},
editor = {Rastislav Kr{\'{a}}lovic and
Damian Niwinski},
title = {Four Subareas of the Theory of Constraints, and Their Links},
booktitle = {Mathematical Foundations of Computer Science 2009, 34th International
Symposium, {MFCS} 2009, Novy Smokovec, High Tatras, Slovakia, August
24-28, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5734},
pages = {1},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-03816-7\_1},
doi = {10.1007/978-3-642-03816-7\_1},
timestamp = {Tue, 14 May 2019 10:00:37 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Atserias09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/sat/AtseriasFT09,
author = {Albert Atserias and
Johannes Klaus Fichte and
Marc Thurley},
editor = {Oliver Kullmann},
title = {Clause-Learning Algorithms with Many Restarts and Bounded-Width Resolution},
booktitle = {Theory and Applications of Satisfiability Testing - {SAT} 2009, 12th
International Conference, {SAT} 2009, Swansea, UK, June 30 - July
3, 2009. Proceedings},
series = {Lecture Notes in Computer Science},
volume = {5584},
pages = {114--127},
publisher = {Springer},
year = {2009},
url = {https://doi.org/10.1007/978-3-642-02777-2\_13},
doi = {10.1007/978-3-642-02777-2\_13},
timestamp = {Tue, 14 May 2019 10:00:41 +0200},
biburl = {https://dblp.org/rec/conf/sat/AtseriasFT09.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/csr/Atserias08,
author = {Albert Atserias},
title = {E. Gr{\"{a}}del, P. Kolaitis, L. Libkin, M. Marx, I. Spencer,
M. Vardi, Y. Venema and S. Weinstein , Finite Model Theory and Its
Applications, Springer-Verlag {(2007)}},
journal = {Comput. Sci. Rev.},
volume = {2},
number = {1},
pages = {55--59},
year = {2008},
url = {https://doi.org/10.1016/j.cosrev.2008.01.001},
doi = {10.1016/J.COSREV.2008.01.001},
timestamp = {Thu, 20 Feb 2020 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/csr/Atserias08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/ejc/Atserias08,
author = {Albert Atserias},
title = {On digraph coloring problems and treewidth duality},
journal = {Eur. J. Comb.},
volume = {29},
number = {4},
pages = {796--820},
year = {2008},
url = {https://doi.org/10.1016/j.ejc.2007.11.004},
doi = {10.1016/J.EJC.2007.11.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/ejc/Atserias08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AtseriasD08,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
title = {A combinatorial characterization of resolution width},
journal = {J. Comput. Syst. Sci.},
volume = {74},
number = {3},
pages = {323--334},
year = {2008},
url = {https://doi.org/10.1016/j.jcss.2007.06.025},
doi = {10.1016/J.JCSS.2007.06.025},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AtseriasD08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/siamcomp/AtseriasDG08,
author = {Albert Atserias and
Anuj Dawar and
Martin Grohe},
title = {Preservation under Extensions on Well-Behaved Finite Structures},
journal = {{SIAM} J. Comput.},
volume = {38},
number = {4},
pages = {1364--1381},
year = {2008},
url = {https://doi.org/10.1137/060658709},
doi = {10.1137/060658709},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/siamcomp/AtseriasDG08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/focs/AtseriasGM08,
author = {Albert Atserias and
Martin Grohe and
D{\'{a}}niel Marx},
title = {Size Bounds and Query Plans for Relational Joins},
booktitle = {49th Annual {IEEE} Symposium on Foundations of Computer Science, {FOCS}
2008, October 25-28, 2008, Philadelphia, PA, {USA}},
pages = {739--748},
publisher = {{IEEE} Computer Society},
year = {2008},
url = {https://doi.org/10.1109/FOCS.2008.43},
doi = {10.1109/FOCS.2008.43},
timestamp = {Thu, 23 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/focs/AtseriasGM08.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Atserias07,
author = {Albert Atserias},
title = {Conjunctive query evaluation by search-tree revisited},
journal = {Theor. Comput. Sci.},
volume = {371},
number = {3},
pages = {155--168},
year = {2007},
url = {https://doi.org/10.1016/j.tcs.2006.11.005},
doi = {10.1016/J.TCS.2006.11.005},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Atserias07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasBD07,
author = {Albert Atserias and
Andrei A. Bulatov and
V{\'{\i}}ctor Dalmau},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {On the Power of \emph{k} -Consistency},
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 = {279--290},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_26},
doi = {10.1007/978-3-540-73420-8\_26},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasBD07.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasBD07a,
author = {Albert Atserias and
Andrei A. Bulatov and
Anuj Dawar},
editor = {Lars Arge and
Christian Cachin and
Tomasz Jurdzinski and
Andrzej Tarlecki},
title = {Affine Systems of Equations and Counting Infinitary Logic},
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 = {558--570},
publisher = {Springer},
year = {2007},
url = {https://doi.org/10.1007/978-3-540-73420-8\_49},
doi = {10.1007/978-3-540-73420-8\_49},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasBD07a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/AtseriasDK06,
author = {Albert Atserias and
Anuj Dawar and
Phokion G. Kolaitis},
title = {On preservation under homomorphisms and unions of conjunctive queries},
journal = {J. {ACM}},
volume = {53},
number = {2},
pages = {208--237},
year = {2006},
url = {https://doi.org/10.1145/1131342.1131344},
doi = {10.1145/1131342.1131344},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/AtseriasDK06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/Atserias06,
author = {Albert Atserias},
title = {Distinguishing {SAT} from Polynomial-Size Circuits, through Black-Box
Queries},
booktitle = {21st Annual {IEEE} Conference on Computational Complexity {(CCC} 2006),
16-20 July 2006, Prague, Czech Republic},
pages = {88--95},
publisher = {{IEEE} Computer Society},
year = {2006},
url = {https://doi.org/10.1109/CCC.2006.17},
doi = {10.1109/CCC.2006.17},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/Atserias06.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasDG05,
author = {Albert Atserias and
Anuj Dawar and
Martin Grohe},
editor = {Lu{\'{\i}}s Caires and
Giuseppe F. Italiano and
Lu{\'{\i}}s Monteiro and
Catuscia Palamidessi and
Moti Yung},
title = {Preservation Under Extensions on Well-Behaved Finite Structures},
booktitle = {Automata, Languages and Programming, 32nd International Colloquium,
{ICALP} 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3580},
pages = {1437--1449},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/11523468\_116},
doi = {10.1007/11523468\_116},
timestamp = {Tue, 14 May 2019 10:00:44 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasDG05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icdt/Atserias05,
author = {Albert Atserias},
editor = {Thomas Eiter and
Leonid Libkin},
title = {Conjunctive Query Evaluation by Search Tree Revisited},
booktitle = {Database Theory - {ICDT} 2005, 10th International Conference, Edinburgh,
UK, January 5-7, 2005, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3363},
pages = {53--67},
publisher = {Springer},
year = {2005},
url = {https://doi.org/10.1007/978-3-540-30570-5\_4},
doi = {10.1007/978-3-540-30570-5\_4},
timestamp = {Tue, 14 May 2019 10:00:54 +0200},
biburl = {https://dblp.org/rec/conf/icdt/Atserias05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Atserias05,
author = {Albert Atserias},
title = {On Digraph Coloring Problems and Treewidth Duality},
booktitle = {20th {IEEE} Symposium on Logic in Computer Science {(LICS} 2005),
26-29 June 2005, Chicago, IL, USA, Proceedings},
pages = {106--115},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/LICS.2005.31},
doi = {10.1109/LICS.2005.31},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Atserias05.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Atserias05a,
author = {Albert Atserias},
title = {Definability on a Random 3-CNF Formula},
booktitle = {20th {IEEE} Symposium on Logic in Computer Science {(LICS} 2005),
26-29 June 2005, Chicago, IL, USA, Proceedings},
pages = {458--466},
publisher = {{IEEE} Computer Society},
year = {2005},
url = {https://doi.org/10.1109/LICS.2005.14},
doi = {10.1109/LICS.2005.14},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Atserias05a.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR05-154,
author = {Albert Atserias},
title = {Non-Uniform Hardness for {NP} via Black-Box Adversaries},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR05-154}},
year = {2005},
url = {https://eccc.weizmann.ac.il/eccc-reports/2005/TR05-154/index.html},
eprinttype = {ECCC},
eprint = {TR05-154},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR05-154.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AtseriasB04,
author = {Albert Atserias and
Maria Luisa Bonet},
title = {On the automatizability of resolution and related propositional proof
systems},
journal = {Inf. Comput.},
volume = {189},
number = {2},
pages = {182--201},
year = {2004},
url = {https://doi.org/10.1016/j.ic.2003.10.004},
doi = {10.1016/J.IC.2003.10.004},
timestamp = {Fri, 12 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/iandc/AtseriasB04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jacm/Atserias04,
author = {Albert Atserias},
title = {On sufficient conditions for unsatisfiability of random formulas},
journal = {J. {ACM}},
volume = {51},
number = {2},
pages = {281--311},
year = {2004},
url = {https://doi.org/10.1145/972639.972645},
doi = {10.1145/972639.972645},
timestamp = {Tue, 06 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jacm/Atserias04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/cp/AtseriasKV04,
author = {Albert Atserias and
Phokion G. Kolaitis and
Moshe Y. Vardi},
editor = {Mark Wallace},
title = {Constraint Propagation as a Proof System},
booktitle = {Principles and Practice of Constraint Programming - {CP} 2004, 10th
International Conference, {CP} 2004, Toronto, Canada, September 27
- October 1, 2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3258},
pages = {77--91},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30201-8\_9},
doi = {10.1007/978-3-540-30201-8\_9},
timestamp = {Fri, 27 Mar 2020 09:00:36 +0100},
biburl = {https://dblp.org/rec/conf/cp/AtseriasKV04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Atserias04,
author = {Albert Atserias},
editor = {Jerzy Marcinkowski and
Andrzej Tarlecki},
title = {Notions of Average-Case Complexity for Random 3-SAT},
booktitle = {Computer Science Logic, 18th International Workshop, {CSL} 2004, 13th
Annual Conference of the EACSL, Karpacz, Poland, September 20-24,
2004, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {3210},
pages = {1--5},
publisher = {Springer},
year = {2004},
url = {https://doi.org/10.1007/978-3-540-30124-0\_1},
doi = {10.1007/978-3-540-30124-0\_1},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Atserias04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/pods/AtseriasDK04,
author = {Albert Atserias and
Anuj Dawar and
Phokion G. Kolaitis},
editor = {Catriel Beeri and
Alin Deutsch},
title = {On Preservation under Homomorphisms and Unions of Conjunctive Queries},
booktitle = {Proceedings of the Twenty-third {ACM} {SIGACT-SIGMOD-SIGART} Symposium
on Principles of Database Systems, June 14-16, 2004, Paris, France},
pages = {319--329},
publisher = {{ACM}},
year = {2004},
url = {https://doi.org/10.1145/1055558.1055602},
doi = {10.1145/1055558.1055602},
timestamp = {Wed, 14 Nov 2018 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/pods/AtseriasDK04.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/tcs/Atserias03,
author = {Albert Atserias},
title = {Improved bounds on the Weak Pigeonhole Principle and infinitely many
primes from weaker axioms},
journal = {Theor. Comput. Sci.},
volume = {295},
pages = {27--39},
year = {2003},
url = {https://doi.org/10.1016/S0304-3975(02)00394-8},
doi = {10.1016/S0304-3975(02)00394-8},
timestamp = {Wed, 17 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/tcs/Atserias03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasD03,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
title = {A Combinatorial Characterization of Resolution Width},
booktitle = {18th Annual {IEEE} Conference on Computational Complexity (Complexity
2003), 7-10 July 2003, Aarhus, Denmark},
pages = {239--247},
publisher = {{IEEE} Computer Society},
year = {2003},
url = {https://doi.org/10.1109/CCC.2003.1214424},
doi = {10.1109/CCC.2003.1214424},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasD03.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR03-041,
author = {Albert Atserias and
Maria Luisa Bonet and
Jordi Levy},
title = {On Chvatal Rank and Cutting Planes Proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR03-041}},
year = {2003},
url = {https://eccc.weizmann.ac.il/eccc-reports/2003/TR03-041/index.html},
eprinttype = {ECCC},
eprint = {TR03-041},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR03-041.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/iandc/AtseriasBE02,
author = {Albert Atserias and
Maria Luisa Bonet and
Juan Luis Esteban},
title = {Lower Bounds for the Weak Pigeonhole Principle and Random Formulas
beyond Resolution},
journal = {Inf. Comput.},
volume = {176},
number = {2},
pages = {136--152},
year = {2002},
url = {https://doi.org/10.1006/inco.2002.3114},
doi = {10.1006/INCO.2002.3114},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/iandc/AtseriasBE02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/jcss/AtseriasGP02,
author = {Albert Atserias and
Nicola Galesi and
Pavel Pudl{\'{a}}k},
title = {Monotone simulations of non-monotone proofs},
journal = {J. Comput. Syst. Sci.},
volume = {65},
number = {4},
pages = {626--638},
year = {2002},
url = {https://doi.org/10.1016/S0022-0000(02)00020-X},
doi = {10.1016/S0022-0000(02)00020-X},
timestamp = {Tue, 16 Feb 2021 00:00:00 +0100},
biburl = {https://dblp.org/rec/journals/jcss/AtseriasGP02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/AtseriasB02,
author = {Albert Atserias and
Maria Luisa Bonet},
editor = {Julian C. Bradfield},
title = {On the Automatizability of Resolution and Related Propositional Proof
Systems},
booktitle = {Computer Science Logic, 16th International Workshop, {CSL} 2002, 11th
Annual Conference of the EACSL, Edinburgh, Scotland, UK, September
22-25, 2002, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2471},
pages = {569--583},
publisher = {Springer},
year = {2002},
url = {https://doi.org/10.1007/3-540-45793-3\_38},
doi = {10.1007/3-540-45793-3\_38},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/AtseriasB02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/Atserias02,
author = {Albert Atserias},
title = {Unsatisfiable Random Formulas Are Hard to Certify},
booktitle = {17th {IEEE} Symposium on Logic in Computer Science {(LICS} 2002),
22-25 July 2002, Copenhagen, Denmark, Proceedings},
pages = {325--334},
publisher = {{IEEE} Computer Society},
year = {2002},
url = {https://doi.org/10.1109/LICS.2002.1029840},
doi = {10.1109/LICS.2002.1029840},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/Atserias02.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-010,
author = {Albert Atserias and
Maria Luisa Bonet},
title = {On the Automatizability of Resolution and Related Propositional Proof
Systems},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-010}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-010/index.html},
eprinttype = {ECCC},
eprint = {TR02-010},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-010.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR02-035,
author = {Albert Atserias and
V{\'{\i}}ctor Dalmau},
title = {A Combinatorial Characterization of Resolution Width},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR02-035}},
year = {2002},
url = {https://eccc.weizmann.ac.il/eccc-reports/2002/TR02-035/index.html},
eprinttype = {ECCC},
eprint = {TR02-035},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR02-035.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/mlq/AtseriasGG01,
author = {Albert Atserias and
Nicola Galesi and
Ricard Gavald{\`{a}}},
title = {Monotone Proofs of the Pigeon Hole Principle},
journal = {Math. Log. Q.},
volume = {47},
number = {4},
pages = {461--474},
year = {2001},
url = {https://doi.org/10.1002/1521-3870(200111)47:4\&\#60;461::AID-MALQ461\&\#62;3.0.CO;2-B},
doi = {10.1002/1521-3870(200111)47:4\&\#60;461::AID-MALQ461\&\#62;3.0.CO;2-B},
timestamp = {Wed, 17 May 2017 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/mlq/AtseriasGG01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/coco/AtseriasGP01,
author = {Albert Atserias and
Nicola Galesi and
Pavel Pudl{\'{a}}k},
title = {Monotone Simulations of Nonmonotone Proofs},
booktitle = {Proceedings of the 16th Annual {IEEE} Conference on Computational
Complexity, Chicago, Illinois, USA, June 18-21, 2001},
pages = {36--41},
publisher = {{IEEE} Computer Society},
year = {2001},
url = {https://doi.org/10.1109/CCC.2001.933870},
doi = {10.1109/CCC.2001.933870},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/coco/AtseriasGP01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasBE01,
author = {Albert Atserias and
Maria Luisa Bonet and
Juan Luis Esteban},
editor = {Fernando Orejas and
Paul G. Spirakis and
Jan van Leeuwen},
title = {Lower Bounds for the Weak Pigeonhole Principle Beyond Resolution},
booktitle = {Automata, Languages and Programming, 28th International Colloquium,
{ICALP} 2001, Crete, Greece, July 8-12, 2001, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {2076},
pages = {1005--1016},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-48224-5\_81},
doi = {10.1007/3-540-48224-5\_81},
timestamp = {Sat, 30 Sep 2023 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasBE01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/mfcs/Atserias01,
author = {Albert Atserias},
editor = {Jir{\'{\i}} Sgall and
Ales Pultr and
Petr Kolman},
title = {Improved Bounds on the Weak Pigeonhole Principle and Infinitely Many
Primes from Weaker Axioms},
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 = {148--158},
publisher = {Springer},
year = {2001},
url = {https://doi.org/10.1007/3-540-44683-4\_14},
doi = {10.1007/3-540-44683-4\_14},
timestamp = {Sat, 19 Oct 2019 20:31:50 +0200},
biburl = {https://dblp.org/rec/conf/mfcs/Atserias01.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/csl/Atserias00,
author = {Albert Atserias},
editor = {Peter Clote and
Helmut Schwichtenberg},
title = {The Descriptive Comlexity of the Fixed-Points of Bounded Formulas},
booktitle = {Computer Science Logic, 14th Annual Conference of the EACSL, Fischbachau,
Germany, August 21-26, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1862},
pages = {172--186},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-44622-2\_11},
doi = {10.1007/3-540-44622-2\_11},
timestamp = {Tue, 14 May 2019 10:00:42 +0200},
biburl = {https://dblp.org/rec/conf/csl/Atserias00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/icalp/AtseriasGG00,
author = {Albert Atserias and
Nicola Galesi and
Ricard Gavald{\`{a}}},
editor = {Ugo Montanari and
Jos{\'{e}} D. P. Rolim and
Emo Welzl},
title = {Monotone Proofs of the Pigeon Hole Principle},
booktitle = {Automata, Languages and Programming, 27th International Colloquium,
{ICALP} 2000, Geneva, Switzerland, July 9-15, 2000, Proceedings},
series = {Lecture Notes in Computer Science},
volume = {1853},
pages = {151--162},
publisher = {Springer},
year = {2000},
url = {https://doi.org/10.1007/3-540-45022-X\_13},
doi = {10.1007/3-540-45022-X\_13},
timestamp = {Sun, 25 Oct 2020 01:00:00 +0200},
biburl = {https://dblp.org/rec/conf/icalp/AtseriasGG00.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-008,
author = {Albert Atserias and
Nicola Galesi and
Ricard Gavald{\`{a}}},
title = {Monotone Proofs of the Pigeon Hole Principle},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-008}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-008/index.html},
eprinttype = {ECCC},
eprint = {TR00-008},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-008.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@article{DBLP:journals/eccc/ECCC-TR00-087,
author = {Albert Atserias and
Nicola Galesi and
Pavel Pudl{\'{a}}k},
title = {Monotone simulations of nonmonotone propositional proofs},
journal = {Electron. Colloquium Comput. Complex.},
volume = {{TR00-087}},
year = {2000},
url = {https://eccc.weizmann.ac.il/eccc-reports/2000/TR00-087/index.html},
eprinttype = {ECCC},
eprint = {TR00-087},
timestamp = {Wed, 28 Sep 2022 01:00:00 +0200},
biburl = {https://dblp.org/rec/journals/eccc/ECCC-TR00-087.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
@inproceedings{DBLP:conf/lics/AtseriasK99,
author = {Albert Atserias and
Phokion G. Kolaitis},
title = {First-Order Logic vs. Fixed-Point Logic in Finite Set Theory},
booktitle = {14th Annual {IEEE} Symposium on Logic in Computer Science, Trento,
Italy, July 2-5, 1999},
pages = {275--284},
publisher = {{IEEE} Computer Society},
year = {1999},
url = {https://doi.org/10.1109/LICS.1999.782622},
doi = {10.1109/LICS.1999.782622},
timestamp = {Fri, 24 Mar 2023 00:00:00 +0100},
biburl = {https://dblp.org/rec/conf/lics/AtseriasK99.bib},
bibsource = {dblp computer science bibliography, https://dblp.org}
}
a service of 
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 2023-12-13 20:38 CET 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:
