| 2013 | ||
|---|---|---|
| c90 | Seda Davtyan, Kishori M. Konwar, Alexander Russell, Alexander A. Shvartsman: Dealing with Undependable Workers in Decentralized Network Supercomputing. ICDCN 2013: 27-41 | |
| c89 | Russell J. Jancewicz, Aggelos Kiayias, Laurent D. Michel, Alexander Russell, Alexander A. Shvartsman: Malicious takeover of voting systems: arbitrary code execution on optical scan voting terminals. SAC 2013: 1816-1823 | |
| 2012 | ||
| c88 | Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman: Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers. PODC 2012: 231-232 | |
| c87 | Seda Davtyan, Aggelos Kiayias, Laurent Michel, Alexander Russell, Alexander A. Shvartsman: Integrity of electronic voting systems: fallacious use of cryptography. SAC 2012: 1486-1493 | |
| 2011 | ||
| b2 | Chryssis Georgiou, Alexander A. Shvartsman: Cooperative Task-Oriented Computing: Algorithms and Complexity. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2011 | |
| j43 | Laurent D. Michel, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck: Optimal deployment of eventually-serializable data services. Annals OR 184(1): 273-294 (2011) | |
| c86 | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander Russell, Alexander A. Shvartsman: Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers. NCA 2011: 75-82 | |
| c85 | Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman: Robust Network Supercomputing without Centralized Control. OPODIS 2011: 435-450 | |
| c84 | Seda Davtyan, Kishori M. Konwar, Alexander A. Shvartsman: Robust network supercomputing without centralized control. PODC 2011: 293-294 | |
| e6 | Roberto Baldoni, Alexander A. Shvartsman (Eds.): Workshop on Theoretical Aspects on Dynamic Distributed Systems, TADDS '11, Rome, Italy, September 19, 2011. ACM 2011, isbn 978-1-4503-0946-2 | |
| 2010 | ||
| j42 | Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman: Rambo: a robust, reconfigurable atomic memory service for dynamic networks. Distributed Computing 23(4): 225-272 (2010) | |
| j41 | Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Shvartsman: Emulating shared-memory Do-All algorithms in asynchronous message-passing systems. J. Parallel Distrib. Comput. 70(6): 699-705 (2010) | |
| j40 | Alexander A. Shvartsman, Pascal Felber: Editors' preface. Theor. Comput. Sci. 411(14-15): 1543 (2010) | |
| c83 | Laurent Michel, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck: Load Balancing and Almost Symmetries for RAMBO Quorum Hosting. CP 2010: 598-612 | |
| e5 | Nancy A. Lynch, Alexander A. Shvartsman (Eds.): Distributed Computing, 24th International Symposium, DISC 2010, Cambridge, MA, USA, September 13-15, 2010. Proceedings. Lecture Notes in Computer Science 6343, Springer 2010, isbn 978-3-642-15762-2 | |
| 2009 | ||
| j39 | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman: Fault-tolerant semifast implementations of atomic read/write registers. J. Parallel Distrib. Comput. 69(1): 62-79 (2009) | |
| j38 | Gregory Chockler, Seth Gilbert, Vincent Gramoli, Peter M. Musial, Alexander A. Shvartsman: Reconfigurable distributed storage for dynamic networks. J. Parallel Distrib. Comput. 69(1): 100-116 (2009) | |
| j37 | Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman: Node discovery in networks. J. Parallel Distrib. Comput. 69(4): 337-348 (2009) | |
| j36 | Roberto Baldoni, Alexander A. Shvartsman: Theoretical aspects of dynamic distributed systems: report on the workshop, Elche, Spain, September 26, 2009. SIGACT News 40(4): 87-89 (2009) | |
| j35 | Ivan Lavallée, Alexander A. Shvartsman: Editors' preface. Theor. Comput. Sci. 410(6-7): 451-452 (2009) | |
| j34 | Tigran Antonyan, Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, Laurent Michel, Nicolas C. Nicolaou, Alexander Russell, Alexander A. Shvartsman: State-wide elections, optical scan voting systems, and the pursuit of integrity. IEEE Transactions on Information Forensics and Security 4(4): 597-610 (2009) | |
| j33 | Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman: Developing a Consistent Domain-Oriented Distributed Object Service. IEEE Trans. Parallel Distrib. Syst. 20(11): 1567-1585 (2009) | |
| c82 | Laurent Michel, Martijn Moraal, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck: Online Selection of Quorum Systems for RAMBO Reconfiguration. CP 2009: 88-103 | |
| c81 | Laurent D. Michel, Pascal Van Hentenryck, Elaine L. Sonderegger, Alexander A. Shvartsman, Martijn Moraal: Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services. CPAIOR 2009: 193-207 | |
| c80 | Burkhard Englert, Chryssis Georgiou, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman: On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. OPODIS 2009: 240-254 | |
| c79 | Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, Laurent D. Michel, Nicolas C. Nicolaou, Alexander Russell, Andrew See, Narasimha Shashidhar, Alexander A. Shvartsman: Taking total control of voting systems: firmware manipulations on an optical scan voting terminal. SAC 2009: 2049-2053 | |
| c78 | Carleton Coffrin, Laurent D. Michel, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck: Optimizing Network Deployment of Formally-Specified Distributed Systems. SEDE 2009: 230-237 | |
| c77 | Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman: At-most-once semantics in asynchronous shared memory. SPAA 2009: 43-44 | |
| c76 | Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman: At-Most-Once Semantics in Asynchronous Shared Memory. DISC 2009: 258-273 | |
| 2008 | ||
| b1 | Chryssis Georgiou, Alexander A. Shvartsman: Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity. Springer 2008, isbn 978-0-387-30918-7 | |
| j32 | Shlomi Dolev, Alexander A. Shvartsman: Introduction to special issue dedicated to the DISC 20th anniversary. Distributed Computing 20(6): 389-390 (2008) | |
| j31 | Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman: A robust randomized algorithm to perform independent tasks. J. Discrete Algorithms 6(4): 651-665 (2008) | |
| j30 | Dariusz R. Kowalski, Alexander A. Shvartsman: Writing-all deterministically and optimally using a nontrivial number of asynchronous processors. ACM Transactions on Algorithms 4(3) (2008) | |
| c75 | Laurent Michel, Alexander A. Shvartsman, Elaine L. Sonderegger, Pascal Van Hentenryck: Optimal Deployment of Eventually-Serializable Data Services. CPAIOR 2008: 188-202 | |
| c74 | Kishori M. Konwar, Peter M. Musial, Alexander A. Shvartsman: Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks. ISPDC 2008: 367-374 | |
| c73 | Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger: An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets. NCA 2008: 211-219 | |
| c72 | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman: On the robustness of (semi) fast quorum-based implementations of atomic shared memory. PODC 2008: 425 | |
| c71 | Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, Laurent Michel, Nicolas C. Nicolaou, Alexander Russell, Andrew See, Narasimha Shashidhar, Alexander A. Shvartsman: Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards. EVT 2008 | |
| c70 | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman: On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. DISC 2008: 289-304 | |
| e4 | Alexander A. Shvartsman, Pascal Felber (Eds.): Structural Information and Communication Complexity, 15th International Colloquium, SIROCCO 2008, Villars-sur-Ollon, Switzerland, June 17-20, 2008, Proceedings. Lecture Notes in Computer Science 5058, Springer 2008, isbn 978-3-540-69326-0 | |
| 2007 | ||
| j29 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency. Parallel Processing Letters 17(2): 153-168 (2007) | |
| j28 | Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman: Long-lived Rambo: Trading knowledge for communication. Theor. Comput. Sci. 383(1): 59-85 (2007) | |
| c69 | Aggelos Kiayias, Laurent Michel, Alexander Russell, Narasimha Shashidhar, Andrew See, Alexander A. Shvartsman, Seda Davtyan: Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting. ACSAC 2007: 30-39 | |
| c68 | Kishori M. Konwar, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman: Implementing Atomic Data through Indirect Learning in Dynamic Networks. NCA 2007: 223-230 | |
| c67 | Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger: A formal treatment of an abstract channel implementation using java sockets and TCP. PODC 2007: 334-335 | |
| 2006 | ||
| j27 | Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman: Distributed scheduling for disconnected cooperation. Distributed Computing 18(6): 409-420 (2006) | |
| j26 | James Aspnes, Costas Busch, Shlomi Dolev, Panagiota Fatourou, Chryssis Georgiou, Alexander A. Shvartsman, Paul G. Spirakis, Roger Wattenhofer: Eight Open Problems in Distributed Computing. Bulletin of the EATCS 90: 109-126 (2006) | |
| j25 | Shlomi Dolev, Roberto Segala, Alexander A. Shvartsman: Dynamic load balancing with group communication. Theor. Comput. Sci. 369(1-3): 348-360 (2006) | |
| c66 | Kishori M. Konwar, Alexander A. Shvartsman: Resource Discovery in Networks under Bandwidth Limitations. ISPDC 2006: 42-49 | |
| c65 | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman: Fault-tolerant semifast implementations of atomic read/write registers. SPAA 2006: 281-290 | |
| c64 | Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman: Robust Network Supercomputing with Malicious Processes. DISC 2006: 474-488 | |
| c63 | Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman: Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers. DISC 2006: 537-539 | |
| e3 | Alexander A. Shvartsman (Ed.): Principles of Distributed Systems, 10th International Conference, OPODIS 2006, Bordeaux, France, December 12-15, 2006, Proceedings. Lecture Notes in Computer Science 4305, Springer 2006, isbn 3-540-49990-3 | |
| 2005 | ||
| j24 | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: DNA-BAR: distinguisher selection for DNA barcoding. Bioinformatics 21(16): 3424-3426 (2005) | |
| j23 | Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch: GeoQuorums: implementing atomic memory in mobile ad hoc networks. Distributed Computing 18(2): 125-155 (2005) | |
| j22 | Dariusz R. Kowalski, Alexander A. Shvartsman: Performing work with asynchronous processors: Message-delay-sensitive bounds. Inf. Comput. 203(2): 181-210 (2005) | |
| j21 | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: Highly scalable algorithms for robust string barcoding. IJBRA 1(2): 145-161 (2005) | |
| j20 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups. SIAM J. Comput. 34(4): 848-862 (2005) | |
| j19 | Antonio Fernández, Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: The Do-All problem with Byzantine processor failures. Theor. Comput. Sci. 333(3): 433-454 (2005) | |
| j18 | Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman: Efficient gossip and robust distributed computation. Theor. Comput. Sci. 347(1-2): 130-166 (2005) | |
| c62 | Vincent Gramoli, Peter M. Musial, Alexander A. Shvartsman: Operation Liveness and Gossip Management in a Dynamic Distributed Atomic Data Service. ISCA PDCS 2005: 206-211 | |
| c61 | Kishori M. Konwar, Ion I. Mandoiu, Alexander Russell, Alexander A. Shvartsman: Improved algorithms for multiplex PCR primer set selection with amplification length constraints. APBC 2005: 41-50 | |
| c60 | Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch: Autonomous virtual mobile nodes. DIALM-POMC 2005: 62-69 | |
| c59 | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: Highly Scalable Algorithms for Robust String Barcoding. International Conference on Computational Science (2) 2005: 1020-1028 | |
| c58 | Dariusz R. Kowalski, Peter M. Musial, Alexander A. Shvartsman: Explicit Combinatorial Structures for Cooperative Distributed Algorithms. ICDCS 2005: 49-58 | |
| c57 | Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman: Developing a Consistent Domain-Oriented Distributed Object Service. NCA 2005: 149-158 | |
| c56 | Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman: Node Discovery in Networks. OPODIS 2005: 206-220 | |
| c55 | Gregory Chockler, Seth Gilbert, Vincent Gramoli, Peter M. Musial, Alexander A. Shvartsman: Reconfigurable Distributed Storage for Dynamic Networks. OPODIS 2005: 351-365 | |
| c54 | Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch: Autonomous virtual mobile nodes. SPAA 2005: 215 | |
| i2 | Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman: Highly Scalable Algorithms for Robust String Barcoding. CoRR abs/cs/0502065 (2005) | |
| 2004 | ||
| j17 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: The complexity of synchronous iterative Do-All with crashes. Distributed Computing 17(1): 47-63 (2004) | |
| j16 | ||
| j15 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Analysis of memory access concurrency in robust parallel algorithms. Stud. Inform. Univ. 3(2): 125-150 (2004) | |
| c53 | Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman: The Join Problem in Dynamic Network Algorithms. DSN 2004: 315-324 | |
| c52 | Peter M. Musial, Alexander A. Shvartsman: Implementing a Reconfigurable Atomic Memory Service for Dynamic Networks. IPDPS 2004 | |
| c51 | Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch: Brief announcement: virtual mobile nodes for mobile ad hoc networks. PODC 2004: 385 | |
| c50 | Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman: Long-Lived Rambo: Trading Knowledge for Communication. SIROCCO 2004: 185-196 | |
| c49 | Dariusz R. Kowalski, Alexander A. Shvartsman: Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. SPAA 2004: 311-320 | |
| c48 | Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman: Collective asynchronous reading with polylogarithmic worst-case overhead. STOC 2004: 321-330 | |
| c47 | Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch: Virtual Mobile Nodes for Mobile Ad Hoc Networks. DISC 2004: 230-244 | |
| i1 | Kishori M. Konwar, Ion I. Mandoiu, Alexander Russell, Alexander A. Shvartsman: Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints. CoRR cs.DS/0406053 (2004) | |
| 2003 | ||
| j14 | Chryssis Georgiou, Alexander A. Shvartsman: Cooperative computing with fragmentable and mergeable groups. J. Discrete Algorithms 1(2): 211-235 (2003) | |
| c46 | Nancy A. Lynch, Alexander A. Shvartsman: Communication and Data Sharing for Dynamic Distributed Systems. Future Directions in Distributed Computing 2003: 62-67 | |
| c45 | Serge Abiteboul, Gabriel M. Kuper, Alexander A. Shvartsman, Moshe Y. Vardi: In Memoriam: Paris C. Kanellakis. PCK50 2003: 1-8 | |
| c44 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Distributed Cooperation and Adversity: Complexity Trade-Offs. PCK50 2003: 60-71 | |
| c43 | Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman: RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. DSN 2003: 259-268 | |
| c42 | Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Shvartsman: Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems. OPODIS 2003: 210-222 | |
| c41 | Dariusz R. Kowalski, Alexander A. Shvartsman: Performing work with asynchronous processors: message-delay-sensitive bounds. PODC 2003: 265-274 | |
| c40 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Work-competitive scheduling for cooperative computing with dynamic groups. STOC 2003: 251-258 | |
| c39 | Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman: Efficient Gossip and Robust Distributed Computation. DISC 2003: 224-238 | |
| c38 | Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch: GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks. DISC 2003: 306-320 | |
| e2 | André Schiper, Alexander A. Shvartsman, Hakim Weatherspoon, Ben Y. Zhao (Eds.): Future Directions in Distributed Computing, Research and Position Papers. Lecture Notes in Computer Science 2584, Springer 2003, isbn 3-540-00912-4 | |
| e1 | Dina Q. Goldin, Alexander A. Shvartsman, Scott A. Smolka, Jeffrey Scott Vitter, Stanley B. Zdonik (Eds.): PCK50 - Principles of Computing & Knowledge, Paris C. Kanellakis Memorial Workshop, San Diego, California, USA, June 8th, 2003. ACM 2003, isbn 1-58113-604-8 | |
| 2002 | ||
| j13 | Alexander Russell, Alexander A. Shvartsman: Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation. Bulletin of the EATCS 77: 120-131 (2002) | |
| j12 | Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman: An inheritance-based technique for building simulation proofs incrementally. ACM Trans. Softw. Eng. Methodol. 11(1): 63-91 (2002) | |
| c37 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Failure sensitive analysis for parallel algorithm with controlled memory access concurrency. OPODIS 2002: 125-136 | |
| c36 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: Optimally work-competitive scheduling for cooperative computing with merging groups. PODC 2002: 132 | |
| c35 | Nancy A. Lynch, Alexander A. Shvartsman: RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. DISC 2002: 173-190 | |
| c34 | Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman: Bounding Work and Communication in Robust Cooperative Computation. DISC 2002: 295-310 | |
| 2001 | ||
| j11 | Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman: Performing tasks on synchronous restartable message-passing processors. Distributed Computing 14(1): 49-64 (2001) | |
| j10 | Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: Specifying and using a partitionable group communication service. ACM Trans. Comput. Syst. 19(2): 171-216 (2001) | |
| c33 | Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman: Developing and Refining an Adaptive Token-Passing Strategy. ICDCS 2001: 597-605 | |
| c32 | Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman: Local Scheduling for Distributed Cooperation. NCA 2001: 244-255 | |
| c31 | Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman: Optimal scheduling for disconnected cooperation. PODC 2001: 305-307 | |
| c30 | M. Cecilia Bastarrica, Rodrigo E. Caballero, Steven A. Demurjian, Alexander A. Shvartsman: Two Optimization Techniques for Component-Based Systems Deployment. SEKE 2001: 153-162 | |
| c29 | Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman: Optimal Scheduling for Distributed Cooperation Without Communication. SIROCCO 2001: 259-274 | |
| c28 | Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto: Towards practical deteministic write-all algorithms. SPAA 2001: 271-280 | |
| c27 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: The Complexity of Synchronous Iterative Do-All with Crashes. DISC 2001: 151-165 | |
| 2000 | ||
| c26 | Burkhard Englert, Alexander A. Shvartsman: Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory. ICDCS 2000: 454-463 | |
| c25 | Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman: An inheritance-based technique for building simulation proofs incrementally. ICSE 2000: 478-487 | |
| c24 | Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman: The Complexity of Distributed Cooperation in the Presence of Failures. OPODIS 2000: 245-264 | |
| c23 | Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman: Distributed cooperation in the absence of communication (brief announcement). PODC 2000: 339 | |
| c22 | M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman: Comprehensive Specification of Distributed Systems Using I5 and IOA. SCCC 2000: 74-82 | |
| c21 | Chryssis Georgiou, Alexander A. Shvartsman: Cooperative computing with fragmentable and mergeable groups. SIROCCO 2000: 141-156 | |
| c20 | Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman: Distributed Cooperation During the Absence of Communication. DISC 2000: 119-133 | |
| 1999 | ||
| j9 | Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou: Timing Conditions for Linearizability in Uniform Counting Networks. Theor. Comput. Sci. 220(1): 67-91 (1999) | |
| j8 | Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman: Eventually-Serializable Data Services. Theor. Comput. Sci. 220(1): 113-156 (1999) | |
| c19 | Grzegorz Malewicz, Alexander A. Shvartsman: An Auction-Based Flexible Pricing Scheme for Renegotiated QoS Connections and Its Evaluation. MASCOTS 1999: 244-251 | |
| c18 | M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman: A Framework for Architectural Specification of Distributed Object Systems. OPODIS 1999: 127-148 | |
| c17 | Stefan Dobrev, Roberto Segala, Alexander A. Shvartsman: Irreversile Dynamos in Tori. SIROCCO 1999: 111-125 | |
| c16 | Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: A Dynamic Primary Configuration Group Communication Service. DISC 1999: 64-78 | |
| 1998 | ||
| c15 | Oleg M. Cheiner, Alexander A. Shvartsman: Implementing an EventuallySerializable Data Service as a Distributed System Building Block. OPODIS 1998: 9-24 | |
| c14 | M. Cecilia Bastarrica, Alexander A. Shvartsman, Steven A. Demurjian: A Binary Integer Programming Model for Optimal Object Distribution. OPODIS 1998: 211-226 | |
| c13 | Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: A Dynamic View-Oriented Group Communication Service. PODC 1998: 227-236 | |
| c12 | Oleg M. Cheiner, Alexander A. Shvartsman: Implementing and Evaluating an Eventualy-Serializable Data Service. PODC 1998: 317 | |
| c11 | M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman: Software Architectural Specification for Optimal Object Distribution. SCCC 1998: 25-31 | |
| 1997 | ||
| c10 | Nancy A. Lynch, Alexander A. Shvartsman: Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts. FTCS 1997: 272-281 | |
| c9 | Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman: Specifying and Using a Partitionable Group Communication Service. PODC 1997: 53-62 | |
| c8 | Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman: Performing Tasks on Restartable Message-Passing Processors. WDAG 1997: 96-110 | |
| 1996 | ||
| j7 | Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi: In Memoriam Paris C. Kanellakis. ACM Comput. Surv. 28(1): 3-15 (1996) | |
| j6 | Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman: Parallel Algorithms with Processor Failures and Delays. J. Algorithms 20(1): 45-86 (1996) | |
| j5 | Alexander A. Shvartsman: In Memoriam: Paris C. Kanellakis (1953-1995). J. Algorithms 20(2): 203-204 (1996) | |
| c7 | Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou: Counting Networks are Practically Linearizable. PODC 1996: 280-289 | |
| c6 | Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman: Eventually-Serializable Data Services. PODC 1996: 300-309 | |
| 1995 | ||
| j4 | Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman: Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. Nord. J. Comput. 2(2): 146-180 (1995) | |
| 1994 | ||
| c5 | Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman: Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. CONCUR 1994: 242-266 | |
| 1993 | ||
| c4 | Alexander A. Shvartsman: A Historical Object Base in an Enterprise Management Director. Integrated Network Management 1993: 123-134 | |
| c3 | Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman: Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). WDAG 1993: 99-114 | |
| 1992 | ||
| j3 | Paris C. Kanellakis, Alexander A. Shvartsman: Efficient Parallel Algorithms can be Made Robust. Distributed Computing 5(4): 201-217 (1992) | |
| j2 | Alexander A. Shvartsman: An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory. Inf. Process. Lett. 44(4): 223-231 (1992) | |
| 1991 | ||
| j1 | Alexander A. Shvartsman: Achieving Optimal CRCW PRAM Fault-Tolerance. Inf. Process. Lett. 39(2): 59-66 (1991) | |
| c2 | Paris C. Kanellakis, Alexander A. Shvartsman: Efficient Parallel Algorithms on Restartable Fail-Stop Processors. PODC 1991: 23-36 | |
| 1989 | ||
| c1 | Paris C. Kanellakis, Alexander A. Shvartsman: Efficient Parallel Algorithms Can Be Made Robust. PODC 1989: 211-219 | |
Data released under the ODC-BY 1.0 license — See also our legal information page