TU Berlin

Internet Network ArchitecturesPetr Kuznetsov's Publications

Page Content

to Navigation

Petr Kuznetsov's Publications

A

Alistarh, Dan and Kopinsky, Justin and Kuznetsov, Petr and Ravi, Srivatsan and Shavit, Nir (2014). Inherent Limitations of Hybrid Transactional Memory. CoRR


Alistarh, Dan and Trédan, Gilles and Avramopoulos, Ioannis and Kuznetsov, Petr (2010). Routing Attacks as a Viable Threat: Can Software Systems Protect Themselves?. Sixth Workshop on Hot Topics in System Dependability (HotDep 2010, poster session), 1–3.


Attie, Paul and Guerraoui, Rachid and Kouznetsov, Petr and Lynch, Nancy and Rajsbaum, Sergio (2005). The Impossibility of Boosting Distributed Service Resilience. Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (ICDCS '05), 39–48.


Attie, Paul and Guerraoui, Rachid and Kuznetsov, Petr and Lynch, Nancy and Rajsbaum, Sergio (2011). The Impossibility of Boosting Distributed Service Resilience. Information and Computation. Elsevier, 927–950.


Attiya, Hagit and Hans, Sandeep and Kuznetsov, Petr and Ravi, Srivatsan (2013). Safety of Deferred Update in Transactional Memory. IEEE 33rd International Conference on Distributed Computing Systems, ICDCS 2013, 8-11 July, 2013, Philadelphia, Pennsylvania, USA, 601–610.


Attiya, Hagit and Hendler, Danny and Guerraoui, Rachid and Kuznetsov, Petr and Michael, Maged M. and Vechev, Martin (2011). Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated. Proceedings of Symposium on Principles of Programming Languages (POPL '11). ACM, 487–498.


Attiya, Hagit and Guerraoui, Rachid and Hendler, Danny and Kouznetsov, Petr (2006). Synchronizing without Locks is Inherently Expensive. Proceedings of the 25th ACM Symposium on Principles of Distributed Computing (PODC 06), 300–307.


Attiya, Hagit and Guerraoui, Rachid and Kouznetsov, Petr (2005). Computing with Reads and Writes in the Absence of Step Contention. Proceedings of the 19th International Conference on Distributed Computing (DISC '05). Springer, 122–136.


Attiya, Hagit and Guerraoui, Rachid and Kouznetsov, Petr (2005). Computing with Reads and Writes in the Absence of Step Contention. (Technical Report)


Attiya, Hagit and Guerraoui, Rachid and Hendler, Danny and Kuznetsov, Petr (2009). The Complexity of Obstruction-Free Implementations. Journal of the ACM, 1–33.


B

Bhattacharjee, Bobby and Rodrigues, Rodrigo and Kouznetsov, Petr (2007). Secure Lookup without (Constrained) Flooding. Workshop on Recent Advances on Intrusion-Tolerant Systems (WRAITS '07). Department of Informatics, University of Lisbon, 22–26.


Blanc, Sylvestre and Guerraoui, Rachid and Hess, Kathryn and Kouznetsov, Petr and Parent, Paul-Eugéne and Pochon, Bastian and Sauvageot, Orin (2002). Using the Topological Characterization of Synchronous Models. Workshop on Geometric and Topological Methods in Concurrency and Distributed Systems Theory (GETCO 2002). Elsevier, 36–47.


C

Canini, Marco and Kuznetsov, Petr and Levin, Dan and Schmid, Stefan (2013). Software Transactional Networking: Concurrent and Consistent Policy Composition. Proceedings ACM SIGCOMM Workshop on Hot Topics in Software Defined Networking (HotSDN)


Canini, Marco and Kuznetsov, Petr and Levin, Dan and Schmid, Stefan (2013). The Case for Reliable Software Transactional Networking. CoRR


Canini, Marco and De Cicco, Daniele and Kuznetsov, Petr and Levin, Dan and Schmid, Stefan and Vissicchio, Stefano (2014). STN: A Robust and Distributed SDN Control Plane. Proc. Open Networking Summit (ONS)


Marco Canini and Petr Kuznetsov and Dan Levin and Stefan Schmid (2015). A Distributed and Robust SDN Control Plane for Transactional Network Updates. Proc. 34th IEEE Conference on Computer Communications (INFOCOM)


D

Delporte-Gallet, Carole and Fauconnier, Hugues and Guerraoui, Rachid and Kouznetsov, Petr (2005). Mutual Exclusion in Asynchronous Systems with Failure Detectors. Journal of Parallel and Distributed Computing (JPDC), 492–505.


Delporte-Gallet, Carole and Fauconnier, Hugues and Hadzilacos, Vassos and Guerraoui, Rachid and Kouznetsov, Petr and Toueg, Sam (2004). The Weakest Failure Detectors to Solve Certain Fundamental Problems in Distributed Computing. Proceedings of the 23rd ACM Symposium on Principles of Distributed Computing (PODC '04). ACM, 338–346.


Delporte-Gallet, Carole and Fauconnier, Hugues and Gafni, Eli and Kuznetsov, Petr (2011). On the Meaning of Solving a Task with a Failure Dectector. Proceedings of the 25th International Symposium on Distributed Computing (DISC '11). Springer, 145–146.


E

Eugster, Patrick Thomas and Guerraoui, Rachid and Handurukande, Sidath Bandara and Kermarrec, Anne-Marie and Kouznetsov, Petr (2003). Lightweight Probabilistic Broadcast. ACM Transactions on Computer Systems, 341–374.


Eugster, Patrick Thomas and Guerraoui, Rachid and Kouznetsov, Petr (2004). Δ-Reliability: A Probabilistic Measure of Broadcast Reliability. Proceedings of the 24th IEEE International Conference on Distributed Computing Systems (ICDCS 2004), 636–643.


Eugster, Patrick Thomas and Guerraoui, Rachid and Handurukande, Sidath B. and Kermarrec, Anne-Marie and Kouznetsov, Petr (2001). Lightweight Probabilistic Broadcast. International Conference on Dependable Systems and Networks (DSN 2001), 443–452.


G

Gafni, Eli and Kuznetsov, Petr (2011). Relating L-Resilience and Wait-Freedom via Hitting Sets. 12th International Conference on Distributed Computing and Networking (ICDCN '11). Springer, 191–202.


Gafni, Eli and Kuznetsov, Petr (2010). Turning Adversaries into Friends: Simplified, Made Constructive, and Extended. Proceedings of 14th International Conference On Principles Of Distributed Systems (OPODIS '10). Springer, 380–394.


Gafni, Eli and Kuznetsov, Petr (2010). On L-Resilient Adversaries, Hitting Sets and Colorless Tasks. 29th ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC 2010). ACM, 81–82.


Gafni, Eli and Kuznetsov, Petr (2010). On L-Resilient Adversaries, Hitting Sets and Colorless Tasks. (Technical Report)


Gafni, Eli and Kuznetsov, Petr (2007). N-Consensus is the Second Strongest Object for N+1 Processes. 11th International Conference On Principles Of DIstributed Systems (OPODIS 2007). Springer, 260–273.


Gafni, Eli and Kuznetsov, Petr (2011). On Set Consensus Numbers. Distributed Computing. Springer, 149-163.


Gafni, Eli and Kuznetsov, Petr (2009). On Set Consensus Numbers. (Technical Report)


Gafni, Eli and Kuznetsov, Petr (2009). The Weakest Failure Detector for Solving k-Set Agreement. (Forschungsbericht (Research report))


Gafni, Eli and Kuznetsov, Petr (2009). On Set Consensus Numbers. Distributed Computing (Proceedings of the 23rd International Symposium on Distributed Computing (DISC 2009)). Springer, 35–47.


Gafni, Eli and Kuznetsov, Petr (2009). The Weakest Failure Detector for Solving k-Set Agreement. 28th ACM SIGACT/SIGOPS Symposium on Principles of Distributed Computing (PODC 2009). ACM, 83–91.


Gramoli, Vincent and Kuznetsov, Petr and Ravi, Srivatsan and Shang, Di (2015). A Concurrency-Optimal List-Based Set. CoRR


Guerraoui, Rachid and Kouznetsov, Petr (2008). Failure Detectors as Type Boosters. Distributed Computing Journal (DC). Springer, 343–358.


Guerraoui, Rachid and Kouznetsov, Petr (2008). The Gap in Circumventing the Impossibility of Consensus. Journal of Computer and System Sciences (JCSS), 823–830.


Guerraoui, Rachid and Kapalka, Michal and Kouznetsov, Petr (2008). The Weakest Failure Detectors to Boost Obstruction-Freedom. Distributed Computing Journal (DC). Springer, 415–433.


Guerraoui, Rachid and Herlihy, Maurice and Kouznetsov, Petr and Lynch, Nancy and Newport, Calvin (2007). On the Weakest Failure Detector Ever. Proceedings of the 26th ACM Symposium on Principles of Distributed Computing (PODC 07), 235–243.


Guerraoui, Rachid and Herlihy, Maurice and Kouznetsov, Petr and Lynch, Nancy and Newport, Calvin (2007). On the Weakest Failure Detector Ever. (MPI-SWS Technical Report)


Guerraoui, Rachid and Kapalka, Michal and Kouznetsov, Petr (2006). The Weakest Failure Detectors to Boost Obstruction-Freedom. Proceedings of the 20th International Conference on Distributed Computing (DISC '06). Springer, 399–412.


Guerraoui, Rachid and Kouznetsov, Petr (2003). On Failure Detectors and Type Boosters. 17th International Conference on Distributed Computing (DISC). Springer, 292-305.


Guerraoui, Rachid and Kouznetsov, Petr (2003). On Failure Detectors and Type Boosters. (Technical report)


Guerraoui, Rachid and Kouznetsov, Petr and Pochon, Bastian (2002). A Note on Set Agreement with Omission Failures. Workshop on Geometric and Topological Methods in Concurrency and Distributed Systems Theory (GETCO 2002). Elsevier, 48–58.


Guerraoui, Rachid and Kouznetsov, Petr (2002). On the weakest failure detector for non-blocking atomic commit. International Conference on Theoretical Computer Science (TCS 2002). Kluwer, 461–473.


Guerraoui, Rachid and Handurukande, Sidath B. and Kermarrec, Anne-Marie and Kouznetsov, Petr (2001). Reducing Noise in Gossip-Based Reliable Broadcast. 20th Symposium on Reliable Distributed Systems (SRDS 2001), 186–189.


Guerraoui, Rachid and Kouznetsov, Petr (2003). Finally the Weakest Failure Detector for Non-Blocking Atomic Commit. (Technical report)


Guerraoui, Rachid and Kouznetsov, Petr (2003). The Weakest Failure Detector for Non-Blocking Atomic Commit. (Technical report)


Guerraoui, Rachid and Herlihy, Maurice and Kuznetsov, Petr and Lynch, Nancy and Newport, Calvin (2009). On the Weakest Failure Detector Ever. Distributed Computing Journal (DC). Springer, 353–366.


Guerraoui, Rachid and Freiling, Felix and Kuznetsov, Petr (2011). The Failure Detector Abstraction. ACM Computing Surveys (CSUR)


H

Haeberlen, Andreas and Kouznetsov, Petr and Druschel, Peter (2007). PeerReview: Practical Accountability for Distributed Systems. 21st ACM Symposium on Operating Systems Principles (SOSP 2007), 175–188.


Haeberlen, Andreas and Kouznetsov, Petr and Druschel, Peter (2006). The Case for Byzantine Fault Detection. Second Workshop on Hot Topics in System Dependability (HotDep '06)


Navigation

Quick Access

Schnellnavigation zur Seite über Nummerneingabe