Alexander A. Shvartsman

Bing Citeseer DBLP Google Google Scholar Kosmix Wikipedia Yahoo!
Loading Google Thumbnails...
2010
51Rambo: a robust, reconfigurable atomic memory service for dynamic networks. Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman. Distributed Computing (23): 225-272 (2010). Web SearchBibTeXDownload
50Editors' preface. Alexander A. Shvartsman, Alexander A. Shvartsman, M. Kuwada, T. Shohoji. Theor. Comput. Sci. (411): 1543 (2010). Web SearchBibTeXDownload
2009
49At-Most-Once Semantics in Asynchronous Shared Memory. Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman. DISC 2009, 258-273. Web SearchBibTeXDownload
48State-wide elections, optical scan voting systems, and the pursuit of integrity. Tigran Antonyan, Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, Laurent Michel, Nicolas C. Nicolaou, Alexander Russell, Alexander A. Shvartsman. IEEE Transactions on Information Forensics and Security (4): 597-610 (2009). Web SearchBibTeXDownload
47Taking total control of voting systems: firmware manipulations on an optical scan voting terminal. Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, Laurent D. Michel, Nicolas C. Nicolaou, Alexander Russell, Andrew See, Narasimha Shashidhar, Alexander A. Shvartsman. SAC 2009, 2049-2053. Web SearchBibTeXDownload
46At-most-once semantics in asynchronous shared memory. Sotiris Kentros, Aggelos Kiayias, Nicolas C. Nicolaou, Alexander A. Shvartsman. SPAA 2009, 43-44. Web SearchBibTeXDownload
45Editors' preface. Alexander A. Shvartsman, Alexander A. Shvartsman, M. Kuwada, T. Shohoji. Theor. Comput. Sci. (410): 451-452 (2009). Web SearchBibTeXDownload
2008
44Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards. Seda Davtyan, Sotiris Kentros, Aggelos Kiayias, Laurent Michel, Nicolas C. Nicolaou, Alexander Russell, Andrew See, Narasimha Shashidhar, Alexander A. Shvartsman. EVT 2008. Web SearchBibTeXDownload
2007
43Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting. Aggelos Kiayias, Laurent Michel, Alexander Russell, Narasimha Shashidhar, Andrew See, Alexander A. Shvartsman, Seda Davtyan. ACSAC 2007, 30-39. Web SearchBibTeXDownload
2006
42Distributed scheduling for disconnected cooperation. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. Distributed Computing (18): 409-420 (2006). Web SearchBibTeXDownload
2005
41GeoQuorums: implementing atomic memory in mobile ad hoc networks. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch. Distributed Computing (18): 125-155 (2005). Web SearchBibTeXDownload
2004
40Virtual Mobile Nodes for Mobile Ad Hoc Networks. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch. DISC 2004, 230-244. Web SearchBibTeXDownload
39Editor's introduction. Vincent Conitzer, Alan B. Salisbury, Carolina Cruz-Neira. Inf. Comput. (194): 77-78 (2004). Web SearchBibTeXDownload
38Brief announcement: virtual mobile nodes for mobile ad hoc networks. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Elad Schiller, Alexander A. Shvartsman, Jennifer L. Welch. PODC 2004, 385. Web SearchBibTeXDownload
2003
37GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks. Shlomi Dolev, Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman, Jennifer L. Welch. DISC 2003, 306-320. Web SearchBibTeXDownload
36RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks. Seth Gilbert, Nancy A. Lynch, Alexander A. Shvartsman. DSN 2003, 259-268. Web SearchBibTeXDownload
35Communication and Data Sharing for Dynamic Distributed Systems. Nancy A. Lynch, Alexander A. Shvartsman. Future Directions in Distributed Computing 2003, 62-67. Web SearchBibTeXDownload
34In Memoriam: Paris C. Kanellakis. Pascal Van Hentenryck, Gabriel M. Kuper, Christos H. Papadimitriou, Moshe Y. Vardi. PCK50 2003, 1-8. Cited by 2Web SearchBibTeX
2002
33An inheritance-based technique for building simulation proofs incrementally. Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman. ACM Trans. Softw. Eng. Methodol. (11): 63-91 (2002). Web SearchBibTeXDownload
32RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks. Nancy A. Lynch, Alexander A. Shvartsman. DISC 2002, 173-190. Web SearchBibTeXDownload
2001
31Specifying and using a partitionable group communication service. Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman. ACM Trans. Comput. Syst. (19): 171-216 (2001). Cited by 192Web SearchBibTeXDownload
30Local Scheduling for Distributed Cooperation. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. NCA 2001, 244-255. Web SearchBibTeXDownload
29Optimal scheduling for disconnected cooperation. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. PODC 2001, 305-307. Web SearchBibTeXDownload
28Two Optimization Techniques for Component-Based Systems Deployment. M. Cecilia Bastarrica, Rodrigo E. Caballero, Steven A. Demurjian, Alexander A. Shvartsman. SEKE 2001, 153-162. Web SearchBibTeX
27Optimal Scheduling for Distributed Cooperation Without Communication. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. SIROCCO 2001, 259-274. Web SearchBibTeX
26Towards practical deteministic write-all algorithms. Bogdan S. Chlebus, Stefan Dobrev, Dariusz R. Kowalski, Grzegorz Malewicz, Alexander A. Shvartsman, Imrich Vrto. SPAA 2001, 271-280. Web SearchBibTeXDownload
2000
25Distributed Cooperation During the Absence of Communication. Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. DISC 2000, 119-133. Web SearchBibTeXDownload
24An inheritance-based technique for building simulation proofs incrementally. Idit Keidar, Roger Khazan, Nancy A. Lynch, Alexander A. Shvartsman. ICSE 2000, 478-487. Web SearchBibTeXDownload
23Distributed cooperation in the absence of communication (brief announcement). Grzegorz Malewicz, Alexander Russell, Alexander A. Shvartsman. PODC 2000, 339. Web SearchBibTeXDownload
22Comprehensive Specification of Distributed Systems Using I5 and IOA. M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman. SCCC 2000, 74-82. Web SearchBibTeXDownload
1999
21A Dynamic Primary Configuration Group Communication Service. Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman. DISC 1999, 64-78. Cited by 45Web SearchBibTeXDownload
20An Auction-Based Flexible Pricing Scheme for Renegotiated QoS Connections and Its Evaluation. Grzegorz Malewicz, Alexander A. Shvartsman. MASCOTS 1999, 244-251. Web SearchBibTeXDownload
19A Framework for Architectural Specification of Distributed Object Systems. M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman. OPODIS 1999, 127-148. Web SearchBibTeX
18Eventually-Serializable Data Services. Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman. Theor. Comput. Sci. (220): 113-156 (1999). Cited by 70Web SearchBibTeXDownload
17Timing Conditions for Linearizability in Uniform Counting Networks. Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou. Theor. Comput. Sci. (220): 67-91 (1999). Web SearchBibTeXDownload
1998
16A Binary Integer Programming Model for Optimal Object Distribution. M. Cecilia Bastarrica, Alexander A. Shvartsman, Steven A. Demurjian. OPODIS 1998, 211-226. Web SearchBibTeX
15A Dynamic View-Oriented Group Communication Service. Roberto De Prisco, Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman. PODC 1998, 227-236. Cited by 55Web SearchBibTeXDownload
14Software Architectural Specification for Optimal Object Distribution. M. Cecilia Bastarrica, Steven A. Demurjian, Alexander A. Shvartsman. SCCC 1998, 25-31. Web SearchBibTeXDownload
1997
13Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts. Nancy A. Lynch, Alexander A. Shvartsman. FTCS 1997, 272-281. Web SearchBibTeXDownload
12Specifying and Using a Partitionable Group Communication Service. Alan Fekete, Nancy A. Lynch, Alexander A. Shvartsman. PODC 1997, 53-62. Cited by 2Web SearchBibTeX
1996
11In Memoriam Paris C. Kanellakis. Serge Abiteboul, Gabriel M. Kuper, Harry G. Mairson, Alexander A. Shvartsman, Moshe Y. Vardi. ACM Comput. Surv. (28): 3-15 (1996). Cited by 2Web SearchBibTeXDownload
10In Memoriam: Paris C. Kanellakis (1953-1995). Alexander A. Shvartsman. J. Algorithms (20): 203-204 (1996). Web SearchBibTeXDownload
9Parallel Algorithms with Processor Failures and Delays. Jonathan F. Buss, Paris C. Kanellakis, Prabhakar Ragde, Alexander A. Shvartsman. J. Algorithms (20): 45-86 (1996). Web SearchBibTeXDownload
8Counting Networks are Practically Linearizable. Nancy A. Lynch, Nir Shavit, Alexander A. Shvartsman, Dan Touitou. PODC 1996, 280-289. Web SearchBibTeX
7Eventually-Serializable Data Services. Alan Fekete, David Gupta, Victor Luchangco, Nancy A. Lynch, Alexander A. Shvartsman. PODC 1996, 300-309. Cited by 70Web SearchBibTeX
1995
6Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. Nord. J. Comput. (2): 146-180 (1995). Web SearchBibTeX
1994
5Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations. Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. CONCUR 1994, 242-266. Web SearchBibTeXDownload
1993
4Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract). Paris C. Kanellakis, Dimitrios Michailidis, Alexander A. Shvartsman. WDAG 1993, 99-114. Web SearchBibTeXDownload
1992
3Efficient Parallel Algorithms can be Made Robust. Paris C. Kanellakis, Alexander A. Shvartsman. Distributed Computing (5): 201-217 (1992). Web SearchBibTeXDownload
1991
2Efficient Parallel Algorithms on Restartable Fail-Stop Processors. Paris C. Kanellakis, Alexander A. Shvartsman. PODC 1991, 23-36. Web SearchBibTeX
1989
1Efficient Parallel Algorithms Can Be Made Robust. Paris C. Kanellakis, Alexander A. Shvartsman. PODC 1989, 211-219. Web SearchBibTeX
from DBLP and Google Scholar
Developed by the Database Group at the University of Wisconsin and Yahoo! Research