The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Alexander A. Shvartsman: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
    Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. [Citation Graph (1, 0)][DBLP]
    CONCUR, 1994, pp:242-266 [Conf]
  2. Paris C. Kanellakis, Alexander A. Shvartsman
    Efficient Parallel Algorithms on Restartable Fail-Stop Processors. [Citation Graph (1, 0)][DBLP]
    PODC, 1991, pp:23-36 [Conf]
  3. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
    Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    WDAG, 1993, pp:99-114 [Conf]
  4. Paris C. Kanellakis, Alexander A. Shvartsman
    Efficient Parallel Algorithms can be Made Robust. [Citation Graph (1, 0)][DBLP]
    Distributed Computing, 1992, v:5, n:4, pp:201-217 [Journal]
  5. Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman
    Parallel Algorithms with Processor Failures and Delays. [Citation Graph (1, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:1, pp:45-86 [Journal]
  6. Vincent C. Gramoli, Peter M. Musial, Alexander A. Shvartsman
    Operation Liveness and Gossip Management in a Dynamic Distributed Atomic Data Service. [Citation Graph (0, 0)][DBLP]
    ISCA PDCS, 2005, pp:206-211 [Conf]
  7. Nancy A. Lynch, Alexander A. Shvartsman
    Communication and Data Sharing for Dynamic Distributed Systems. [Citation Graph (0, 0)][DBLP]
    Future Directions in Distributed Computing, 2003, pp:62-67 [Conf]
  8. Kishori M. Konwar, Ion I. Mandoiu, Alexander Russell, Alexander A. Shvartsman
    Improved algorithms for multiplex PCR primer set selection with amplification length constraints. [Citation Graph (0, 0)][DBLP]
    APBC, 2005, pp:41-50 [Conf]
  9. Serge Abiteboul, Gabriel M. Kuper, Alexander A. Shvartsman, Moshe Y. Vardi
    In Memoriam: Paris C. Kanellakis. [Citation Graph (0, 0)][DBLP]
    PCK50, 2003, pp:1-8 [Conf]
  10. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Distributed Cooperation and Adversity: Complexity Trade-Offs. [Citation Graph (0, 0)][DBLP]
    PCK50, 2003, pp:60-71 [Conf]
  11. Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch
    Autonomous virtual mobile nodes. [Citation Graph (0, 0)][DBLP]
    DIALM-POMC, 2005, pp:62-69 [Conf]
  12. Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman
    RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    DSN, 2003, pp:259-0 [Conf]
  13. Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman
    The Join Problem in Dynamic Network Algorithms. [Citation Graph (0, 0)][DBLP]
    DSN, 2004, pp:315-324 [Conf]
  14. Nancy A. Lynch, Alexander A. Shvartsman
    Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts. [Citation Graph (0, 0)][DBLP]
    FTCS, 1997, pp:272-281 [Conf]
  15. Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman
    Highly Scalable Algorithms for Robust String Barcoding. [Citation Graph (0, 0)][DBLP]
    International Conference on Computational Science (2), 2005, pp:1020-1028 [Conf]
  16. Burkhard Englert, Larry Rudolph, Alexander A. Shvartsman
    Developing and Refining an Adaptive Token-Passing Strategy. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2001, pp:597-605 [Conf]
  17. Burkhard Englert, Alexander A. Shvartsman
    Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2000, pp:454-463 [Conf]
  18. Dariusz R. Kowalski, Peter M. Musial, Alexander A. Shvartsman
    Explicit Combinatorial Structures for Cooperative Distributed Algorithms. [Citation Graph (0, 0)][DBLP]
    ICDCS, 2005, pp:49-58 [Conf]
  19. Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman
    An inheritance-based technique for building simulation proofs incrementally. [Citation Graph (0, 0)][DBLP]
    ICSE, 2000, pp:478-487 [Conf]
  20. Alexander A. Shvartsman
    A Historical Object Base in an Enterprise Management Director. [Citation Graph (0, 0)][DBLP]
    Integrated Network Management, 1993, pp:123-134 [Conf]
  21. Peter M. Musial, Alexander A. Shvartsman
    Implementing a Reconfigurable Atomic Memory Service for Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2004, pp:- [Conf]
  22. Kishori M. Konwar, Alexander A. Shvartsman
    Resource Discovery in Networks under Bandwidth Limitations. [Citation Graph (0, 0)][DBLP]
    ISPDC, 2006, pp:42-49 [Conf]
  23. Grzegorz Malewicz, Alexander A. Shvartsman
    An Auction-Based Flexible Pricing Scheme for Renegotiated QoS Connections and Its Evaluation. [Citation Graph (0, 0)][DBLP]
    MASCOTS, 1999, pp:244-251 [Conf]
  24. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Developing a Consistent Domain-Oriented Distributed Object Service. [Citation Graph (0, 0)][DBLP]
    NCA, 2005, pp:149-158 [Conf]
  25. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Local Scheduling for Distributed Cooperation. [Citation Graph (0, 0)][DBLP]
    NCA, 2001, pp:244-255 [Conf]
  26. Dariusz R. Kowalski, Mariam Momenzadeh, Alexander A. Shvartsman
    Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2003, pp:210-222 [Conf]
  27. M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman
    A Framework for Architectural Specification of Distributed Object Systems. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1999, pp:127-148 [Conf]
  28. M. Cecilia Bastarrica, Alexander A. Shvartsman, Steven A. Demurjian
    A Binary Integer Programming Model for Optimal Object Distribution. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1998, pp:211-226 [Conf]
  29. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Complexity of Distributed Cooperation in the Presence of Failures. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2000, pp:245-264 [Conf]
  30. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Failure sensitive analysis for parallel algorithm with controlled memory access concurrency. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2002, pp:125-136 [Conf]
  31. Oleg M. Cheiner, Alexander A. Shvartsman
    Implementing an EventuallySerializable Data Service as a Distributed System Building Block. [Citation Graph (0, 0)][DBLP]
    OPODIS, 1998, pp:9-24 [Conf]
  32. Gregory Chockler, Seth Gilbert, Vincent Gramoli, Peter M. Musial, Alexander A. Shvartsman
    Reconfigurable Distributed Storage for Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:351-365 [Conf]
  33. Kishori M. Konwar, Dariusz R. Kowalski, Alexander A. Shvartsman
    Node Discovery in Networks. [Citation Graph (0, 0)][DBLP]
    OPODIS, 2005, pp:206-220 [Conf]
  34. Oleg M. Cheiner, Alexander A. Shvartsman
    Implementing and Evaluating an Eventualy-Serializable Data Service. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:317- [Conf]
  35. 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. [Citation Graph (0, 0)][DBLP]
    PODC, 2004, pp:385- [Conf]
  36. Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman
    Eventually-Serializable Data Services. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:300-309 [Conf]
  37. Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman
    Specifying and Using a Partitionable Group Communication Service. [Citation Graph (0, 0)][DBLP]
    PODC, 1997, pp:53-62 [Conf]
  38. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Optimally work-competitive scheduling for cooperative computing with merging groups. [Citation Graph (0, 0)][DBLP]
    PODC, 2002, pp:132- [Conf]
  39. Paris C. Kanellakis, Alexander A. Shvartsman
    Efficient Parallel Algorithms Can Be Made Robust. [Citation Graph (0, 0)][DBLP]
    PODC, 1989, pp:211-219 [Conf]
  40. Dariusz R. Kowalski, Alexander A. Shvartsman
    Performing work with asynchronous processors: message-delay-sensitive bounds. [Citation Graph (0, 0)][DBLP]
    PODC, 2003, pp:265-274 [Conf]
  41. Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou
    Counting Networks are Practically Linearizable. [Citation Graph (0, 0)][DBLP]
    PODC, 1996, pp:280-289 [Conf]
  42. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Optimal scheduling for disconnected cooperation. [Citation Graph (0, 0)][DBLP]
    PODC, 2001, pp:305-307 [Conf]
  43. Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman
    A Dynamic View-Oriented Group Communication Service. [Citation Graph (0, 0)][DBLP]
    PODC, 1998, pp:227-236 [Conf]
  44. M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman
    Comprehensive Specification of Distributed Systems Using I5 and IOA. [Citation Graph (0, 0)][DBLP]
    SCCC, 2000, pp:74-82 [Conf]
  45. M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman
    Software Architectural Specification for Optimal Object Distribution. [Citation Graph (0, 0)][DBLP]
    SCCC, 1998, pp:25-31 [Conf]
  46. M. Cecilia Bastarrica, Rodrigo E. Caballero, Steven A. Demurjian, Alexander A. Shvartsman
    Two Optimization Techniques for Component-Based Systems Deployment. [Citation Graph (0, 0)][DBLP]
    SEKE, 2001, pp:153-162 [Conf]
  47. Stefan Dobrev, Roberto Segala, Alexander A. Shvartsman
    Irreversile Dynamos in Tori. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 1999, pp:111-125 [Conf]
  48. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Long-Lived Rambo: Trading Knowledge for Communication. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2004, pp:185-196 [Conf]
  49. Chryssis Georgiou, Alexander A. Shvartsman
    Cooperative computing with fragmentable and mergeable groups. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2000, pp:141-156 [Conf]
  50. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Optimal Scheduling for Distributed Cooperation Without Communication. [Citation Graph (0, 0)][DBLP]
    SIROCCO, 2001, pp:259-274 [Conf]
  51. Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto
    Towards practical deteministic write-all algorithms. [Citation Graph (0, 0)][DBLP]
    SPAA, 2001, pp:271-280 [Conf]
  52. Shlomi Dolev, Seth Gilbert, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch
    Autonomous virtual mobile nodes. [Citation Graph (0, 0)][DBLP]
    SPAA, 2005, pp:215- [Conf]
  53. Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman
    Fault-tolerant semifast implementations of atomic read/write registers. [Citation Graph (0, 0)][DBLP]
    SPAA, 2006, pp:281-290 [Conf]
  54. Dariusz R. Kowalski, Alexander A. Shvartsman
    Writing-all deterministically and optimally using a non-trivial number of asynchronous processors. [Citation Graph (0, 0)][DBLP]
    SPAA, 2004, pp:311-320 [Conf]
  55. Bogdan S. Chlebus, Dariusz R. Kowalski, Alexander A. Shvartsman
    Collective asynchronous reading with polylogarithmic worst-case overhead. [Citation Graph (0, 0)][DBLP]
    STOC, 2004, pp:321-330 [Conf]
  56. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Work-competitive scheduling for cooperative computing with dynamic groups. [Citation Graph (0, 0)][DBLP]
    STOC, 2003, pp:251-258 [Conf]
  57. Bogdan S. Chlebus, Leszek Gasieniec, Dariusz R. Kowalski, Alexander A. Shvartsman
    Bounding Work and Communication in Robust Cooperative Computation. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:295-310 [Conf]
  58. Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman
    Performing Tasks on Restartable Message-Passing Processors. [Citation Graph (0, 0)][DBLP]
    WDAG, 1997, pp:96-110 [Conf]
  59. Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman
    Efficient Gossip and Robust Distributed Computation. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:224-238 [Conf]
  60. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Complexity of Synchronous Iterative Do-All with Crashes. [Citation Graph (0, 0)][DBLP]
    DISC, 2001, pp:151-165 [Conf]
  61. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch
    Virtual Mobile Nodes for Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2004, pp:230-244 [Conf]
  62. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch
    GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2003, pp:306-320 [Conf]
  63. Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman
    A Dynamic Primary Configuration Group Communication Service. [Citation Graph (0, 0)][DBLP]
    DISC, 1999, pp:64-78 [Conf]
  64. Nancy A. Lynch, Alexander A. Shvartsman
    RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    DISC, 2002, pp:173-190 [Conf]
  65. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Distributed Cooperation During the Absence of Communication. [Citation Graph (0, 0)][DBLP]
    DISC, 2000, pp:119-133 [Conf]
  66. Chryssis Georgiou, Nicolas C. Nicolaou, Alexander A. Shvartsman
    Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:537-539 [Conf]
  67. Kishori M. Konwar, Sanguthevar Rajasekaran, Alexander A. Shvartsman
    Robust Network Supercomputing with Malicious Processes. [Citation Graph (0, 0)][DBLP]
    DISC, 2006, pp:474-488 [Conf]
  68. Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman
    DNA-BAR: distinguisher selection for DNA barcoding. [Citation Graph (0, 0)][DBLP]
    Bioinformatics, 2005, v:21, n:16, pp:3424-3426 [Journal]
  69. 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 [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  70. Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi
    In Memoriam Paris C. Kanellakis. [Citation Graph (0, 32)][DBLP]
    ACM Comput. Surv., 1996, v:28, n:1, pp:3-15 [Journal]
  71. Bogdan S. Chlebus, Roberto De Prisco, Alexander A. Shvartsman
    Performing tasks on synchronous restartable message-passing processors. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2001, v:14, n:1, pp:49-64 [Journal]
  72. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch
    GeoQuorums: implementing atomic memory in mobile ad hoc networks. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2005, v:18, n:2, pp:125-155 [Journal]
  73. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The complexity of synchronous iterative Do-All with crashes. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2004, v:17, n:1, pp:47-63 [Journal]
  74. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman
    Distributed scheduling for disconnected cooperation. [Citation Graph (0, 0)][DBLP]
    Distributed Computing, 2006, v:18, n:6, pp:409-420 [Journal]
  75. Alexander Russell, Alexander A. Shvartsman
    Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2002, v:77, n:, pp:120-131 [Journal]
  76. Dariusz R. Kowalski, Alexander A. Shvartsman
    Performing work with asynchronous processors: Message-delay-sensitive bounds. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2005, v:203, n:2, pp:181-210 [Journal]
  77. Alexander A. Shvartsman
    Editor's introduction. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2004, v:194, n:2, pp:77-78 [Journal]
  78. Alexander A. Shvartsman
    Achieving Optimal CRCW PRAM Fault-Tolerance. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1991, v:39, n:2, pp:59-66 [Journal]
  79. Alexander A. Shvartsman
    An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:4, pp:223-231 [Journal]
  80. Alexander A. Shvartsman
    In Memoriam: Paris C. Kanellakis (1953-1995). [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:20, n:2, pp:203-204 [Journal]
  81. Chryssis Georgiou, Alexander A. Shvartsman
    Cooperative computing with fragmentable and mergeable groups. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:2, pp:211-235 [Journal]
  82. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman
    Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 1995, v:2, n:2, pp:146-180 [Journal]
  83. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2005, v:34, n:4, pp:848-862 [Journal]
  84. Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    Analysis of memory access concurrency in robust parallel algorithms. [Citation Graph (0, 0)][DBLP]
    Stud. Inform. Univ., 2004, v:3, n:2, pp:125-150 [Journal]
  85. Antonio Fernández, Chryssis Georgiou, Alexander Russell, Alexander A. Shvartsman
    The Do-All problem with Byzantine processor failures. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:333, n:3, pp:433-454 [Journal]
  86. Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman
    Eventually-Serializable Data Services. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:113-156 [Journal]
  87. Chryssis Georgiou, Dariusz R. Kowalski, Alexander A. Shvartsman
    Efficient gossip and robust distributed computation. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:347, n:1-2, pp:130-166 [Journal]
  88. Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou
    Timing Conditions for Linearizability in Uniform Counting Networks. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:220, n:1, pp:67-91 [Journal]
  89. Shlomi Dolev, Roberto Segala, Alexander A. Shvartsman
    Dynamic load balancing with group communication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:369, n:1-3, pp:348-360 [Journal]
  90. Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman
    Specifying and using a partitionable group communication service. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Comput. Syst., 2001, v:19, n:2, pp:171-216 [Journal]
  91. Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman
    An inheritance-based technique for building simulation proofs incrementally. [Citation Graph (0, 0)][DBLP]
    ACM Trans. Softw. Eng. Methodol., 2002, v:11, n:1, pp:63-91 [Journal]
  92. Kishori M. Konwar, Peter M. Musial, Nicolas C. Nicolaou, Alexander A. Shvartsman
    Implementing Atomic Data through Indirect Learning in Dynamic Networks. [Citation Graph (0, 0)][DBLP]
    NCA, 2007, pp:223-230 [Conf]
  93. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman, Elaine L. Sonderegger
    A formal treatment of an abstract channel implementation using java sockets and TCP. [Citation Graph (0, 0)][DBLP]
    PODC, 2007, pp:334-335 [Conf]
  94. Bhaskar DasGupta, Kishori M. Konwar, Ion I. Mandoiu, Alexander A. Shvartsman
    Highly Scalable Algorithms for Robust String Barcoding [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  95. Chryssis Georgiou, Peter M. Musial, Alexander A. Shvartsman
    Long-lived Rambo: Trading knowledge for communication. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2007, v:383, n:1, pp:59-85 [Journal]

  96. Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting. [Citation Graph (, )][DBLP]


  97. Online Selection of Quorum Systems for RAMBO Reconfiguration. [Citation Graph (, )][DBLP]


  98. Optimal Deployment of Eventually-Serializable Data Services. [Citation Graph (, )][DBLP]


  99. Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services. [Citation Graph (, )][DBLP]


  100. Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks. [Citation Graph (, )][DBLP]


  101. An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets. [Citation Graph (, )][DBLP]


  102. On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory. [Citation Graph (, )][DBLP]


  103. Distributed cooperation in the absence of communication (brief announcement). [Citation Graph (, )][DBLP]


  104. On the robustness of (semi) fast quorum-based implementations of atomic shared memory. [Citation Graph (, )][DBLP]


  105. Taking total control of voting systems: firmware manipulations on an optical scan voting terminal. [Citation Graph (, )][DBLP]


  106. Optimizing Network Deployment of Formally-Specified Distributed Systems. [Citation Graph (, )][DBLP]


  107. At-most-once semantics in asynchronous shared memory. [Citation Graph (, )][DBLP]


  108. Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards. [Citation Graph (, )][DBLP]


  109. On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory. [Citation Graph (, )][DBLP]


  110. At-Most-Once Semantics in Asynchronous Shared Memory. [Citation Graph (, )][DBLP]


  111. Introduction to special issue dedicated to the DISC 20th anniversary. [Citation Graph (, )][DBLP]


Search in 0.059secs, Finished in 0.066secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002