Petr Kuznetsov, Ph.D.

Affiliations: 
1991-1997 ITMO University 
 2001-2005 École Polytechnique Fédérale de Lausanne, Lausanne, Switzerland 
 2005-2008 MPI SWS 
 2008-2013 Technische Universität Berlin, Berlin, Berlin, Germany 
 2013- Télécom ParisTech 
Area:
Computer Science; Distributed Computing
Website:
https://perso.telecom-paristech.fr/kuznetso/
Google:
"Petr Kuznetsov"
Mean distance: (not calculated yet)
 

Parents

Sign in to add mentor
Sergey Chivilikhin research assistant 1991-1997 ITMO University (Physics Tree)
Rachid GUERRAOUI grad student 2001-2005 EPFL (Cell Biology Tree)
BETA: Related publications

Publications

You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect.

Guerraoui R, Kuznetsov P, Monti M, et al. (2022) The consensus number of a cryptocurrency. Distributed Computing. 35: 1-15
Fraigniaud P, Rajsbaum S, Travers C, et al. (2020) Perfect failure detection with very few bits Information & Computation. 104604
Alistarh D, Kopinsky J, Kuznetsov P, et al. (2018) Inherent limitations of hybrid transactional memory Distributed Computing. 31: 167-185
Kuznetsov P, Ravi S. (2017) Grasping the gap between blocking and non-blocking transactional memories Journal of Parallel and Distributed Computing. 101: 1-16
Dubois S, Guerraoui R, Kuznetsov P, et al. (2017) The weakest failure detector for eventual consistency Distributed Computing. 32: 479-492
Delporte-Gallet C, Fauconnier H, Gafni E, et al. (2015) Wait-freedom with advice Distributed Computing. 28: 3-19
Kuznetsov P, Peri S. (2014) Non-interference and local correctness in transactional memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8314: 197-211
Kuznetsov P, Ravi S. (2012) WTTM 2012, the fourth workshop on the theory of transactional memory Sigact News. 43: 116-122
Guerraoui R, Hadzilacos V, Kuznetsov P, et al. (2012) The weakest failure detectors to solve quittable consensus and nonblocking a tomic commit Siam Journal On Computing. 41: 1343-1379
Afek Y, Kuznetsov P, Nir I. (2012) Renaming and the weakest family of failure detectors Distributed Computing. 25: 411-425
See more...