Petr Kuznetsov

According to our database1, Petr Kuznetsov
  • authored at least 102 papers between 2001 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
The First Summer School on Practice and Theory of Concurrent Computing SPTCC 2017.
SIGACT News, 2018

2017
Non-interference and local correctness in transactional memory.
Theor. Comput. Sci., 2017

Grasping the gap between blocking and non-blocking transactional memories.
J. Parallel Distrib. Comput., 2017

On the uncontended complexity of anonymous agreement.
Distributed Computing, 2017

Parallel Combining: Making Use of Free Cycles.
CoRR, 2017

Progress-Space Tradeoffs in Single-Writer Memory Implementations.
CoRR, 2017

Agreement Functions for Distributed Computing Models.
CoRR, 2017

Flat Parallelization.
CoRR, 2017

A Concurrency-Optimal Binary Search Tree.
CoRR, 2017

Brief Announcement: Compact Topology of Shared-Memory Adversaries.
Proceedings of the 31st International Symposium on Distributed Computing, 2017

Progress-Space Tradeoffs in Single-Writer Memory Implementations.
Proceedings of the 21st International Conference on Principles of Distributed Systems, 2017

Agreement Functions for Distributed Computing Models.
Proceedings of the Networked Systems - 5th International Conference, 2017

A Concurrency-Optimal Binary Search Tree.
Proceedings of the Euro-Par 2017: Parallel Processing - 23rd International Conference on Parallel and Distributed Computing, Santiago de Compostela, Spain, August 28, 2017

2016
In the Search of Optimal Concurrency.
CoRR, 2016

Read-Write Memory and k-Set Consensus as an Affine Task.
CoRR, 2016

Set-Consensus Collections are Decidable.
CoRR, 2016

In-Band Synchronization for Distributed SDN Control Planes.
Computer Communication Review, 2016

Perfect Failure Detection with Very Few Bits.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2016

In the Search for Optimal Concurrency.
Proceedings of the Structural Information and Communication Complexity, 2016

Read-Write Memory and k-Set Consensus as an Affine Task.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

Set-Consensus Collections are Decidable.
Proceedings of the 20th International Conference on Principles of Distributed Systems, 2016

2015
Wait-freedom with advice.
Distributed Computing, 2015

Progressive Transactional Memory in Time and Space.
CoRR, 2015

Why Transactional Memory Should Not Be Obstruction-Free.
CoRR, 2015

A Concurrency-Optimal List-Based Set.
CoRR, 2015

The Weakest Failure Detector for Eventual Consistency.
CoRR, 2015

On the Space Complexity of Set Agreement.
CoRR, 2015

Grasping the Gap Between Blocking and Non-Blocking Transactional Memories.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

Inherent Limitations of Hybrid Transactional Memory.
Proceedings of the Distributed Computing - 29th International Symposium, 2015

The Weakest Failure Detector for Eventual Consistency.
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

On the Space Complexity of Set Agreement?
Proceedings of the 2015 ACM Symposium on Principles of Distributed Computing, 2015

Progressive Transactional Memory in Time and Space.
Proceedings of the Parallel Computing Technologies - 13th International Conference, PaCT 2015, Petrozavodsk, Russia, August 31, 2015

On the Uncontended Complexity of Anonymous Consensus.
Proceedings of the 19th International Conference on Principles of Distributed Systems, 2015

A distributed and robust SDN control plane for transactional network updates.
Proceedings of the 2015 IEEE Conference on Computer Communications, 2015

On Partial Wait-Freedom in Transactional Memory.
Proceedings of the 2015 International Conference on Distributed Computing and Networking, 2015

Safety and Deferred Update in Transactional Memory.
Proceedings of the Transactional Memory. Foundations, Algorithms, Tools, and Applications, 2015

2014
On Partial Wait-Freedom in Transactional Memory.
CoRR, 2014

Live Equals Fast in Iterated Models.
CoRR, 2014

Inherent Limitations of Hybrid Transactional Memory.
CoRR, 2014

A generalized asynchronous computability theorem.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Strong Equivalence Relations for Iterated Models.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

Non-interference and Local Correctness in Transactional Memory.
Proceedings of the Distributed Computing and Networking - 15th International Conference, 2014

2013
A generalized asynchronous computability theorem
CoRR, 2013

Safety of Deferred Update in Transactional Memory
CoRR, 2013

Simple CHT: A New Derivation of the Weakest Failure Detector for Consensus.
CoRR, 2013

A Distributed SDN Control Plane for Consistent Policy Updates.
CoRR, 2013

Universal Model Simulation: BG and Extended BG as Examples.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2013

Software transactional networking: concurrent and consistent policy composition.
Proceedings of the Second ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking, 2013

Safety of Deferred Update in Transactional Memory.
Proceedings of the IEEE 33rd International Conference on Distributed Computing Systems, 2013

2012
WTTM 2011: the third workshop on the theory of transactional memory.
SIGACT News, 2012

The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit.
SIAM J. Comput., 2012

Understanding Non-Uniform Failure Models.
Bulletin of the EATCS, 2012

Renaming and the weakest family of failure detectors.
Distributed Computing, 2012

On Non-Interference of Transactions
CoRR, 2012

From Sequential to Concurrent: Correctness and Relative Efficiency
CoRR, 2012

On the cost of composing shared-memory algorithms.
Proceedings of the 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012

Brief announcement: From sequential to concurrent: correctness and relative efficiency.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

Wait-freedom with advice.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
The impossibility of boosting distributed service resilience.
Inf. Comput., 2011

On set consensus numbers.
Distributed Computing, 2011

The failure detector abstraction.
ACM Comput. Surv., 2011

Impersonal Failure Detection
CoRR, 2011

On the Cost of Concurrency in Transactional Memory
CoRR, 2011

Brief Announcement: On the Meaning of Solving a Task with a Failure Detector.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

Autonomous Storage Management for Personal Devices with PodBase.
Proceedings of the 2011 USENIX Annual Technical Conference, 2011

Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated.
Proceedings of the 38th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, 2011

On the Cost of Concurrency in Transactional Memory.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Relating L\mathcal{L}-Resilience and Wait-Freedom via Hitting Sets.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010
L-Resilient Adversaries and Hitting Sets
CoRR, 2010

Towards Network Games with Social Preferences
CoRR, 2010

Towards Network Games with Social Preferences.
Proceedings of the Structural Information and Communication Complexity, 2010

Brief announcement: on L-resilience, hitting sets, and colorless tasks.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Turning Adversaries into Friends: Simplified, Made Constructive, and Extended.
Proceedings of the Principles of Distributed Systems - 14th International Conference, 2010

2009
BFTW3: why? when? where? workshop on the theory and practice of byzantine fault tolerance.
SIGACT News, 2009

The complexity of obstruction-free implementations.
J. ACM, 2009

On the weakest failure detector ever.
Distributed Computing, 2009

On Set Consensus Numbers.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

The weakest failure detector for solving k-set agreement.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

The Fault Detection Problem.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Zeno: Eventually Consistent Byzantine-Fault Tolerance.
Proceedings of the 6th USENIX Symposium on Networked Systems Design and Implementation, 2009

2008
The gap in circumventing the impossibility of consensus.
J. Comput. Syst. Sci., 2008

The weakest failure detectors to boost obstruction-freedom.
Distributed Computing, 2008

Failure detectors as type boosters.
Distributed Computing, 2008

PodBase: transparent storage management for personal devices.
Proceedings of the 7th international conference on Peer-to-peer systems, 2008

2007
PeerReview: practical accountability for distributed systems.
Proceedings of the 21st ACM Symposium on Operating Systems Principles 2007, 2007

On the weakest failure detector ever.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

N-Consensus is the Second Strongest Object for N+1 Processes.
Proceedings of the Principles of Distributed Systems, 11th International Conference, 2007

2006
The Weakest Failure Detectors to Boost Obstruction-Freedom.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Synchronizing without locks is inherently expensive.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

The Case for Byzantine Fault Detection.
Proceedings of the Second Workshop on Hot Topics in System Dependability, 2006

Abstracting out Byzantine Behavior.
Proceedings of the From Security to Dependability, 10.09. - 15.09.2006, 2006

2005
Mutual exclusion in asynchronous systems with failure detectors.
J. Parallel Distrib. Comput., 2005

Computing with Reads and Writes in the Absence of Step Contention.
Proceedings of the Distributed Computing, 19th International Conference, 2005

The Impossibility of Boosting Distributed Service Resilience.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

2004
The weakest failure detectors to solve certain fundamental problems in distributed computing.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

D-Reliable Broadcast: A Probabilistic Measure of Broadcast Reliability.
Proceedings of the 24th International Conference on Distributed Computing Systems (ICDCS 2004), 2004

2003
Lightweight probabilistic broadcast.
ACM Trans. Comput. Syst., 2003

A Note on Set Agreement with Omission Failures.
Electr. Notes Theor. Comput. Sci., 2003

On Failure Detectors and Type Boosters.
Proceedings of the Distributed Computing, 17th International Conference, 2003

2002
On the Weakest Failure Detector for Non-Blocking Atomic Commit.
Proceedings of the Foundations of Information Technology in the Era of Networking and Mobile Computing, 2002

2001
Reducing Noise in Gossip-Based Reliable Broadcast.
Proceedings of the 20th Symposium on Reliable Distributed Systems (SRDS 2001), 2001

Lightweight Probabilistic Broadcast.
Proceedings of the 2001 International Conference on Dependable Systems and Networks (DSN 2001) (formerly: FTCS), 2001


  Loading...