Andrei Krokhin 个人学术档案

引用次数

	总计	2019 年至今
引用	3430	969
h 指数	30	16
i10 指数	56	22

220

110

165

2002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202422 60 70 109 152 125 182 168 123 148 169 146 159 175 163 220 173 147 167 141 167 182 156

开放获取的出版物数量

查看全部

19 篇文章

0 篇文章

可查看的文章

无法查看的文章

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

合著作者

Peter JeavonsProfessor of Computer Science, University of Oxford在 cs.ox.ac.uk 的电子邮件经过验证
Andrei BulatovSimon Fraser University在 sfu.ca 的电子邮件经过验证
Victor DalmauDepartment of Information and Communication Technologies, Universitat Pompeu Fabra在 upf.edu 的电子邮件经过验证
Dave CohenProfessor of Computer Science, Royal Holloway, University of London在 rhul.ac.uk 的电子邮件经过验证
Benoit LaroseLacim, UQAM在 crcmail.net 的电子邮件经过验证
Martin CooperProfessor of Computer Science, IRIT, University of Toulouse在 irit.fr 的电子邮件经过验证
Jakub OpršalUniversity of Birmingham在 bham.ac.uk 的电子邮件经过验证
Stanislav ŽivnýProfessor of Computer Science, University of Oxford在 cs.ox.ac.uk 的电子邮件经过验证
Dániel MarxCISPA Helmholtz Center for Information Security在 cispa.saarland 的电子邮件经过验证
Marcin KozikProfessor of Computer Science, Jagiellonian University在 uj.edu.pl 的电子邮件经过验证
Libor BartoDepartment of Algebra, Charles University, Prague在 mff.cuni.cz 的电子邮件经过验证
Ross WillardPure Mathematics, University of Waterloo在 uwaterloo.ca 的电子邮件经过验证
Robert PowellDurham University在 durham.ac.uk 的电子邮件经过验证
Michal RolínekQuant Finance, Second Foundation在 second-foundation.eu 的电子邮件经过验证
Vladimir KolmogorovIST Austria在 ist.ac.at 的电子邮件经过验证
Gernot SalzerAssociate Professor of Computer Science, Technische Universität Wien在 logic.at 的电子邮件经过验证
Konstantin MakarychevNorthwestern University在 northwestern.edu 的电子邮件经过验证
Yury MakarychevProfessor of Computer Science, Toyota Technological Institute at Chicago在 ttic.edu 的电子邮件经过验证
Vladimir Deineko, PhD, DScFormer Associate Professor (Reader) Warwick Business School

关注

Andrei Krokhin

Professor of Computer Science, Durham University, UK

在 durham.ac.uk 的电子邮件经过验证 - 首页

Constraint Satisfaction Problems (CSPs)Algebra and Logic in Computer Science Complexity Theory


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
Classifying the complexity of constraints using finite algebras A Bulatov, P Jeavons, A Krokhin SIAM journal on computing 34 (3), 720-742, 2005	704	2005
Reasoning about temporal relations: The tractable subalgebras of Allen's interval algebra A Krokhin, P Jeavons, P Jonsson Journal of the ACM (JACM) 50 (5), 591-640, 2003	213	2003
Constraint satisfaction problems and finite algebras AA Bulatov, AA Krokhin, P Jeavons Automata, Languages and Programming: 27th International Colloquium, ICALP …, 2000	204	2000
The complexity of soft constraint satisfaction DA Cohen, MC Cooper, PG Jeavons, AA Krokhin Artificial Intelligence 170 (11), 983-1016, 2006	165	2006
Polymorphisms, and how to use them L Barto, A Krokhin, R Willard Dagstuhl Follow-Ups 7, 2017	161	2017
The complexity of maximal constraint languages A Bulatov, A Krokhin, P Jeavons Proceedings of the thirty-third annual ACM symposium on Theory of computing …, 2001	103	2001
The complexity of general-valued CSPs V Kolmogorov, A Krokhin, M Rolínek SIAM Journal on Computing 46 (3), 1087-1110, 2017	101	2017
Quantified constraints: Algorithms and complexity F Börner, A Bulatov, P Jeavons, A Krokhin Computer Science Logic: 17th International Workshop CSL 2003, 12th Annual …, 2003	90	2003
Algebraic approach to promise constraint satisfaction L Barto, J Bulín, A Krokhin, J Opršal Journal of the ACM (JACM) 68 (4), 1-66, 2021	88	2021
Dualities for constraint satisfaction problems AA Bulatov, A Krokhin, B Larose Complexity of Constraints: An Overview of Current Research Themes, 93-124, 2008	86	2008
Characterizations of several Maltsev conditions M Kozik, A Krokhin, M Valeriote, R Willard Algebra universalis 73 (3), 205-224, 2015	85	2015
The complexity of constraint satisfaction games and QCSP F Börner, A Bulatov, H Chen, P Jeavons, A Krokhin Information and Computation 207 (9), 923-944, 2009	66	2009
A maximal tractable class of soft constraints D Cohen, M Cooper, P Jeavons, A Krokhin Journal of Artificial Intelligence Research 22, 1-22, 2004	66	2004
Algebraic approach to promise constraint satisfaction J Bulín, A Krokhin, J Opršal Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing …, 2019	64	2019
The approximability of three-valued Max CSP P Jonsson, M Klasson, A Krokhin SIAM Journal on Computing 35 (6), 1329-1349, 2006	62	2006
Skew bisubmodularity and valued CSPs A Huber, A Krokhin, R Powell SIAM Journal on Computing 43 (3), 1064-1084, 2014	55	2014
The approximability of Max CSP with fixed-value constraints V Deineko, P Jonsson, M Klasson, A Krokhin Journal of the ACM (JACM) 55 (4), 1-37, 2008	55	2008
Supermodular functions and the complexity of MAX CSP D Cohen, M Cooper, P Jeavons, A Krokhin Discrete Applied Mathematics 149 (1-3), 53-72, 2005	52	2005
Majority constraints have bounded pathwidth duality V Dalmau, A Krokhin European Journal of Combinatorics 29 (4), 821-837, 2008	44	2008
The complexity of constraint satisfaction: an algebraic approach A Krokhin, A Bulatov, P Jeavons Structural Theory of Automata, Semigroups, and Universal Algebra …, 2005	41	2005

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

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用