Year |
Citation |
Score |
2014 |
Musial P, Nicolaou N, Shvartsman AA. Implementing distributed shared memory for dynamic networks Communications of the Acm. 57: 88-98. DOI: 10.1145/2500874 |
0.686 |
|
2014 |
Davtyan S, Prisco RD, Georgiou C, Shvartsman AA. Coordinated cooperative work using undependable processors with unreliable broadcast Proceedings - 2014 22nd Euromicro International Conference On Parallel, Distributed, and Network-Based Processing, Pdp 2014. 17-26. DOI: 10.1109/PDP.2014.11 |
0.541 |
|
2011 |
Georgiou C, Shvartsman AA. Cooperative Task-Oriented Computing: Algorithms and Complexity Synthesis Lectures On Distributed Computing Theory. 2: 1-167. DOI: 10.2200/S00376ED1V01Y201108DCT007 |
0.566 |
|
2011 |
Georgiou C, Nicolaou N, Russell AC, Shvartsman AA. Towards feasible implementations of low-latency multi-writer atomic registers Proceedings - 2011 Ieee International Symposium On Network Computing and Applications, Nca 2011. 75-82. DOI: 10.1109/NCA.2011.18 |
0.531 |
|
2009 |
Georgiou C, Musial PM, Shvartsman AA. Developing a consistent domain-oriented distributed object service Ieee Transactions On Parallel and Distributed Systems. 20: 1567-1585. DOI: 10.1109/Tpds.2008.243 |
0.577 |
|
2009 |
Antonyan T, Davtyan S, Kentros S, Kiayias A, Michel L, Nicolaou N, Russell A, Shvartsman AA. State-wide elections, optical scan voting systems, and the pursuit of integrity Ieee Transactions On Information Forensics and Security. 4: 597-610. DOI: 10.1109/Tifs.2009.2033232 |
0.648 |
|
2009 |
Chockler G, Gilbert S, Gramoli V, Musial PM, Shvartsman AA. Reconfigurable distributed storage for dynamic networks Journal of Parallel and Distributed Computing. 69: 100-116. DOI: 10.1016/J.Jpdc.2008.07.007 |
0.383 |
|
2009 |
Georgiou C, Nicolaou NC, Shvartsman AA. Fault-tolerant semifast implementations of atomic read/write registers Journal of Parallel and Distributed Computing. 69: 62-79. DOI: 10.1016/J.Jpdc.2008.05.004 |
0.756 |
|
2009 |
Englert B, Georgiou C, Musial PM, Nicolaou N, Shvartsman AA. On the efficiency of atomic multi-reader, multi-writer distributed memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5923: 240-254. DOI: 10.1007/978-3-642-10877-8_20 |
0.644 |
|
2009 |
Kentros S, Kiayias A, Nicolaou N, Shvartsman AA. At-most-once semantics in asynchronous shared memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5805: 258-273. DOI: 10.1007/978-3-642-04355-0_27 |
0.305 |
|
2008 |
Georgiou C, Shvartsman AA, Musial PM, Sonderegger EL. An abstract channel specification and an algorithm implementing it using Java sockets Proceedings of the 7th Ieee International Symposium On Networking Computing and Applications, Nca 2008. 211-219. DOI: 10.1109/NCA.2008.12 |
0.611 |
|
2008 |
Konwar KM, Musial PM, Shvartsman AA. Spontaneous, self-sampling quorum systems for ad hoc networks Proceedings of the 7th International Symposium On Parallel and Distributed Computing, Ispdc 2008. 367-374. DOI: 10.1109/ISPDC.2008.61 |
0.336 |
|
2008 |
Chlebus BS, Ga̧sieniec L, Kowalski DR, Shvartsman AA. A robust randomized algorithm to perform independent tasks Journal of Discrete Algorithms. 6: 651-665. DOI: 10.1016/J.Jda.2008.03.001 |
0.321 |
|
2008 |
Michel L, Shvartsman A, Sonderegger E, Van Hentenryck P. Optimal deployment of eventually-serializable data services Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5015: 188-202. DOI: 10.1007/S10479-010-0684-3 |
0.4 |
|
2008 |
Georgiou C, Nicolaou NC, Shvartsman AA. On the robustness of (semi) fast quorum-based implementations of atomic shared memory Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5218: 289-304. DOI: 10.1007/978-3-540-87779-0_20 |
0.756 |
|
2008 |
Georgiou C, Shvartsman AA. Do-all computing in distributed systems: Cooperation in the presence of adversity Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity. 1-219. DOI: 10.1007/978-0-387-69045-2 |
0.611 |
|
2007 |
Georgiou C, Musial PM, Shvartsman AA, Sonderegger EL. Brief announcement: A formal treatment of an abstract channel implementation using java sockets and TCP Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 334-335. DOI: 10.1145/1281100.1281159 |
0.583 |
|
2007 |
Georgiou C, Russell A, Shvartsman AA. Failure-sensitive analysis of parallel algorithms with controlled memory access concurrency Parallel Processing Letters. 17: 153-168. DOI: 10.1142/S0129626407002946 |
0.583 |
|
2007 |
Konwar KM, Musial PM, Nicolaou NC, Shvartsman AA. Implementing atomic data through indirect learning in dynamic networks Proceedings - 6th Ieee International Symposium On Network Computing and Applications, Nca 2007. 223-230. DOI: 10.1109/NCA.2007.30 |
0.702 |
|
2006 |
Dolev S, Segala R, Shvartsman A. Dynamic load balancing with group communication Theoretical Computer Science. 369: 348-360. DOI: 10.1016/J.Tcs.2006.09.020 |
0.426 |
|
2006 |
Malewicz G, Russell A, Shvartsman AA. Distributed scheduling for disconnected cooperation Distributed Computing. 18: 409-420. DOI: 10.1007/S00446-005-0149-0 |
0.739 |
|
2006 |
Georgiou C, Nicolaou NC, Shvartsman AA. Brief announcement: Fault-tolerant SemiFast implementations of atomic read/write registers Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4167: 537-539. |
0.709 |
|
2005 |
Georgiou C, Russell A, Shvartsman AA. Work-competitive scheduling for cooperative computing with dynamic groups Siam Journal On Computing. 34: 848-862. DOI: 10.1137/S0097539704440442 |
0.641 |
|
2005 |
Georgiou C, Musial PM, Shvartsman AA. Developing a consistent domain-oriented distributed object service Proceedings - Fourth Ieee International Symposium On Network Computing and Applications, Nca 2005. 2005: 149-158. DOI: 10.1109/NCA.2005.16 |
0.577 |
|
2005 |
Georgiou C, Kowalski DR, Shvartsman AA. Efficient gossip and robust distributed computation Theoretical Computer Science. 347: 130-166. DOI: 10.1016/J.Tcs.2005.05.019 |
0.588 |
|
2005 |
Fernández A, Georgiou C, Russell A, Shvartsman AA. The Do-All problem with Byzantine processor failures Theoretical Computer Science. 333: 433-454. DOI: 10.1016/J.Tcs.2004.06.034 |
0.623 |
|
2005 |
Kowalski DR, Shvartsman AA. Performing work with asynchronous processors: Message-delay-sensitive bounds Information and Computation. 203: 181-210. DOI: 10.1016/J.Ic.2005.08.002 |
0.352 |
|
2005 |
Dolev S, Gilbert S, Lynch NA, Shvartsman AA, Welch JL. GeoQuorums: Implementing atomic memory in mobile ad hoc networks Distributed Computing. 18: 125-155. DOI: 10.1007/S00446-005-0140-9 |
0.305 |
|
2004 |
Georgiou C, Musial PM, Shvartsman AA. Long-lived Rambo: Trading knowledge for communication Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3104: 185-196. DOI: 10.1016/j.tcs.2007.03.052 |
0.599 |
|
2004 |
Kowalski DR, Momenzadeh M, Shvartsman AA. Emulating shared-memory do-all algorithms in asynchronous message-passing systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3144: 210-222. DOI: 10.1016/J.Jpdc.2009.12.002 |
0.384 |
|
2004 |
Georgiou C, Musial PM, Shvartsman AA. Long-lived Rambo: Trading knowledge for communication Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 3104: 185-196. DOI: 10.1007/978-3-540-27796-5_17 |
0.599 |
|
2004 |
Kowalski DR, Shvartsman AA. Writing-all deterministically and optimally using a non-trivial number of asynchronous processors Annual Acm Symposium On Parallel Algorithms and Architectures. 16: 311-320. |
0.3 |
|
2004 |
Musial PM, Shvartsman AA. Implementing a reconfigurable atomic memory service for dynamic networks Proceedings - International Parallel and Distributed Processing Symposium, Ipdps 2004 (Abstracts and Cd-Rom). 18: 2887-2894. |
0.36 |
|
2003 |
Gilbert S, Lynch N, Shvartsman A. Rambo II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks Proceedings of the International Conference On Dependable Systems and Networks. 259-268. DOI: 10.1109/DSN.2003.1209936 |
0.362 |
|
2003 |
Georgiou C, Shvartsman AA. Cooperative computing with fragmentable and mergeable groups Journal of Discrete Algorithms. 1: 211-235. DOI: 10.1016/S1570-8667(03)00026-1 |
0.618 |
|
2003 |
Lynch N, Shvartsman A. Communication and data sharing for dynamic distributed systems Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2584: 62-67. DOI: 10.1007/3-540-37795-6_12 |
0.477 |
|
2003 |
Georgiou C, Russell A, Shvartsman AA. Distributed Cooperation and Adversity: Complexity Trade-Offs Principles of Computing and Knowledge: Paris C. Kanellakis Memorial Workshop. 60-71. |
0.61 |
|
2002 |
Keidar I, Khazan R, Lynch N, Shvartsman A. An inheritance-based technique for building simulation proofs incrementally Acm Transactions On Software Engineering and Methodology. 11: 63-91. DOI: 10.1145/504087.504090 |
0.318 |
|
2002 |
Georgiou C, Russell A, Shvartsman AA. Brief Announcement: Optimally work-competitive scheduling for cooperative computing with merging groups Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 132. |
0.599 |
|
2002 |
Chlebus BS, Gąsieniec L, Kowalski DR, Shvartsman AA. Bounding work and communication in robust cooperative computation Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2508: 295-310. |
0.321 |
|
2001 |
Fekete A, Lynch N, Shvartsman A. Specifying and using a partitionable group communication service Acm Transactions On Computer Systems. 19: 171-216. DOI: 10.1145/377769.377776 |
0.423 |
|
2001 |
Georgiou C, Russell A, Shvartsman AA. The complexity of synchronous iterative do-all with crashes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2180: 151-165. DOI: 10.1007/S00446-003-0099-3 |
0.607 |
|
2001 |
Georgiou C, Russell A, Shvartsman AA. The complexity of synchronous iterative do-all with crashes Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 2180: 151-165. |
0.351 |
|
2001 |
Englert B, Rudolph L, Shvartsman A. Developing and refining an adaptive token-passing strategy Proceedings - International Conference On Distributed Computing Systems. 597-605. |
0.316 |
|
2001 |
Malewicz GG, Russell A, Shvartsman A. Optimal scheduling for disconnected cooperation Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 305-307. |
0.72 |
|
2000 |
Malewicz GG, Russell A, Shvartsman AA. Distributed cooperation during the absence of communication Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1914: 119-133. DOI: 10.1007/3-540-40026-5_8 |
0.724 |
|
2000 |
Englert B, Shvartsman AA. Graceful quorum reconfiguration in a robust emulation of shared memory Proceedings - International Conference On Distributed Computing Systems. 454-463. |
0.391 |
|
1999 |
Fekete A, Gupta D, Luchangco V, Lynch N, Shvartsman A. Eventually-serializable data services Theoretical Computer Science. 220: 113-156. DOI: 10.1016/S0304-3975(98)00239-4 |
0.415 |
|
1992 |
Kanellakis PC, Shvartsman AA. Efficient parallel algorithms can be made robust Distributed Computing. 5: 201-217. DOI: 10.1007/Bf02277667 |
0.326 |
|
Show low-probability matches. |