Albert Atserias 个人学术档案

引用次数

	总计	2019 年至今
引用	2321	1119
h 指数	24	18
i10 指数	34	28

260

130

195

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420 16 16 21 16 69 73 45 55 59 74 94 97 102 104 118 139 144 175 189 200 256 153

开放获取的出版物数量

查看全部

26 篇文章

0 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Anuj DawarUniversity of Cambridge在 cl.cam.ac.uk 的电子邮件经过验证
Phokion KolaitisDistinguished Research Professor, UC Santa Cuz and Principal Research Staff Member, IBM Research在 ucsc.edu 的电子邮件经过验证
Martin GroheProfessor of Computer Science, RWTH Aachen University在 informatik.rwth-aachen.de 的电子邮件经过验证
Maria Luisa BonetLSI, UPC在 lsi.upc.edu 的电子邮件经过验证
Andrei BulatovSimon Fraser University在 sfu.ca 的电子邮件经过验证
Jakob NordströmUniversity of Copenhagen and Lund University在 di.ku.dk 的电子邮件经过验证
Victor DalmauDepartment of Information and Communication Technologies, Universitat Pompeu Fabra在 upf.edu 的电子邮件经过验证
Moritz Müller在 uni-passau.de 的电子邮件经过验证
Elitza ManevaAutonomous University of Barcelona (UAB)在 berkeley.edu 的电子邮件经过验证
Dániel MarxCISPA Helmholtz Center for Information Security在 cispa.saarland 的电子邮件经过验证
Simone SeveriniAWS/UCL在 ucl.ac.uk 的电子邮件经过验证
Nicola GalesiSapienza University Rome在 uniroma1.it 的电子邮件经过验证
David E. RobersonTechnical University of Denmark在 dtu.dk 的电子邮件经过验证
Laura MančinskaAssociate Professor at QMATH, University of Copenhagen在 locc.la 的电子邮件经过验证
Robert Samalassociate professor, Computer Science Institute, Charles University在 iuuk.mff.cuni.cz 的电子邮件经过验证
Johannes K. FichteLinköping University在 liu.se 的电子邮件经过验证
Moshe Y. VardiRice University在 cs.rice.edu 的电子邮件经过验证
Ricard GavaldàUniversitat Politècnica de Catalunya + Amalfi Analytics在 cs.upc.edu 的电子邮件经过验证
Tuomas HakoniemiUniversity of Helsinki在 helsinki.fi 的电子邮件经过验证
Jose L. BalcazarProfessor, Computer Science, Universitat Politècnica de Catalunya在 upc.edu 的电子邮件经过验证

关注

Albert Atserias

Universitat Politècnica de Catalunya, Barcelona

在 cs.upc.edu 的电子邮件经过验证 - 首页

computational complexity logic in computer science combinatorics


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Size bounds and query plans for relational joins A Atserias, M Grohe, D Marx SIAM Journal on Computing 42 (4), 1737-1767, 2013	362	2013
A combinatorial characterization of resolution width A Atserias, V Dalmau Journal of Computer and System Sciences 74 (3), 323-334, 2008	184	2008
Clause-learning algorithms with many restarts and bounded-width resolution A Atserias, JK Fichte, M Thurley Journal of Artificial Intelligence Research 40, 353-373, 2011	152	2011
Affine systems of equations and counting infinitary logic A Atserias, A Bulatov, A Dawar Theoretical Computer Science 410 (18), 1666-1683, 2009	130	2009
Sherali--Adams relaxations and indistinguishability in counting logics A Atserias, E Maneva SIAM Journal on Computing 42 (1), 112-137, 2013	123	2013
On digraph coloring problems and treewidth duality A Atserias European Journal of Combinatorics 29 (4), 796-820, 2008	118	2008
Quantum and non-signalling graph isomorphisms A Atserias, L Mančinska, DE Roberson, R Šámal, S Severini, ... Journal of Combinatorial Theory, Series B 136, 289-328, 2019	107	2019
On preservation under homomorphisms and unions of conjunctive queries A Atserias, A Dawar, PG Kolaitis Journal of the ACM (JACM) 53 (2), 208-237, 2006	93	2006
Constraint propagation as a proof system A Atserias, PG Kolaitis, MY Vardi International Conference on Principles and Practice of Constraint …, 2004	90	2004
On the automatizability of resolution and related propositional proof systems A Atserias, ML Bonet Information and Computation 189 (2), 182-201, 2004	88	2004
On the Power of k-Consistency A Atserias, A Bulatov, V Dalmau International Colloquium on Automata, Languages, and Programming, 279-290, 2007	71	2007
Narrow proofs may be maximally long A Atserias, M Lauria, J Nordström ACM Transactions on Computational Logic (TOCL) 17 (3), 1-30, 2016	63	2016
Lower bounds for the weak pigeonhole principle and random formulas beyond resolution A Atserias, ML Bonet, JL Esteban Information and Computation 176 (2), 136-152, 2002	62*	2002
Automating resolution is NP-hard A Atserias, M Müller Journal of the ACM (JACM) 67 (5), 1-17, 2020	53	2020
Preservation under extensions on well-behaved finite structures A Atserias, A Dawar, M Grohe SIAM Journal on Computing 38 (4), 1364-1381, 2008	50	2008
On sufficient conditions for unsatisfiability of random formulas A Atserias Journal of the ACM (JACM) 51 (2), 281-311, 2004	44*	2004
Monotone simulations of non-monotone proofs A Atserias, N Galesi, P Pudlák Journal of Computer and System Sciences 65 (4), 626-638, 2002	43	2002
Bounded-width QBF is PSPACE-complete A Atserias, S Oliva Journal of Computer and System Sciences 80 (7), 1415-1429, 2014	41	2014
Monotone proofs of the pigeon hole principle A Atserias, N Galesi, R Gavaldá Mathematical Logic Quarterly: Mathematical Logic Quarterly 47 (4), 461-474, 2001	34	2001
Clique Is Hard on Average for Regular Resolution A Atserias, I Bonacina, SF de Rezende, M Lauria, J Nordström, ... Journal of the ACM 68 (4), 23:1-23:26, 2021	32	2021

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用