Publications


B. Englert and A.A. Shvartsman, Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory, in Proc. International Conference on Distributed Computer Systems (ICDCS'2000), pp. 454-463, 2000. [Abs][]
I. Keidar, R. Khazan, N. Lynch and A. Shvartsman, An Inheritance-Based Technique for Building Simulation Proofs Incrementally, to appear in the Proc. of the 22nd IEEE International Conference on Software Engineering, ICSE'2000, 2000. [Abs][]
C. Georgiou and A.A. Shvartsman, Cooperative Computing with Fragmentable and Mergeable Groups, to appear in 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO'2000), 2000. [Abs][]
G. Malewicz, A.C. Russell and A.A. Shvartsman, Distributed Cooperation in the Absence of Communication, to appear in Proc. of 16th ACM Symp. on Principles of Distributed Computing, (PODC'2000), brief announc., 2000. [Abs][]
M.C. Bastarrica, S. Craig, S. Demurjian and A.A. Shvartsman, Structural Specification of a Distributed System Using I5, in the Proc. of the 5th International Conference on Computer Science and Informatics, (IC2000), 2000. [Abs][]
S. Dolev, R. Segala and A.A. Shvartsman, Dynamic Load Balancing with Group Communication, 6th International Colloquium on Structural Information and Communication Complexity (SIROCCO'99), 1999. [Abs][]
R. De Prisco, A. Fekete, N. Lynch and A.A. Shvartsman, A Dynamic Primary Configuration Group Communication Service, in Proc. of 13th International Symposium on Distributed Computing (DISC'99), 1999. [Abs][]
G. Malewicz and A.A. Shvartsman, An Auction-Based Flexible Pricing Scheme for Renegotiated QoS Connections and Its Evaluation, in Proc. of Seventh International Symposium on Modeling, Analysis and Simulation of Computer and Telecommunication Systems (MASCOTS'99), 1999. [Abs][]
C. Bastarrica, S. Demurjian, and A.A. Shvartsman, I5: A Framework for Architectural Specification of Distributed Systems, in Proc. of the International Conference on Principles of Distributed Computing (OPODIS'99), 1999. [Abs][]
A. Clements, D. Dupont, W.K. King C. Lu and A.A. Shvartsman, Towards a Modern Computer Architecture Curriculum, in Proc. of the Frontiers in Education Conference (FIE'99), 1999. [Abs][]
O. Cheiner and A.A. Shvartsman, Implementing and Evaluating an Eventually-Serializable Data Service as a Distributed System Building Block, Networks in Distributed Computing, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, volume 45, pp. 43-71, AMS, 1999. [Abs][]
N. Lynch, N. Shavit, A. Shvartsman and D. Touitou, Timing Conditions for Linearizability in Uniform Counting Networks, Theoretical Computer Science special issue on Distributed Algorithms, 1999. [Abs][]
Fekete, D. Gupta, N. Lynch, V. Luchangco and A. Shvartsman, Eventually-Serializable Data Services, Theoretical Computer Science special issue on Distributed Algorithms, 1999. [Abs][]
C. Bastarrica, S. Demurjian and A.A. Shvartsman, Software Architectural Specification for Optimal Object Distribution, in Proc. of XVIII International Conference of the Chilean Society of Computer Science, IEEE Press, pp. 25-31, 1998. [Abs][]
C. Bastarrica, A.A. Shvartsman and S. Demurjian, A Binary Integer Programming Model for Optimal Object Distribution, International Conference on Principles of Distributed Computing OPODIS'98, pp. 91-105, 1998. [Abs][]
R. De Prisco, A. Fekete, N. Lynch and A. Shvartsman, A Dynamic View-Oriented Group Communication Service, in Proc. of 16th ACM Symp. on Principles of Distributed Computing, 1998. [Abs][]
S. Dolev, R. Segala and A. Shvartsman, Dynamic Load Balancing with Group Communication, MIT-LCS-TM-588, 1998. [Abs][]
O. Cheiner and A.A. Shvartsman, Implementation of an Eventually Serializable Data Service, International Conference on Principles of Distributed Computing OPODISí98, pp. 11-25, 1998. (Short abstract in Proc. of 16th ACM Symposium on Principles of Distributed Computing, 1998.) [Abs][]
A.A. Shvartsman, Enterprise Architecture: A Layered Approach, Research Report, MITRE Corp., 1998. [Abs][]
B. Chlebus, R. De Prisco and A. Shvartsman, Performing Tasks on Restartable Message-Passing Processors, in Proc. of 11th International Workshop on Distributed Algorithms, pp. 99-114, 1997. [Abs][]
N. Lynch and A.A. Shvartsmn, Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts, in Proc. of 27th Symp. on Fault-Tolerant Computer Systems (FTCS), pp. 272-281, 1997. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Fault-Tolerant Parallel Computation, Kluwer Academic Publishers, 1997. [Abs][Order]
A. Fekete, N. Lynch and A.A. Shvartsman, Specifying and Using a Group Communication Service, in Proc. of 15th ACM Symposium on Principles of Distributed Computing, pp. 53-62, 1997. [Abs][]
A.A. Shvartsman, Interoperability of Unix and Windows NT Systems, Research Report, MITRE Corp., 1997. [Abs][]
A. Fekete, D. Gupta, V. Luchangco, N. Lynch, A.A. Shvartsman, Eventually-Serializable Data Services, in Proc. of 15th ACM Symp. on Principles of Distributed Computing, 1996. [Abs][]
N. Lynch, N. Shavit, A.A. Shvartsman, D. Touitou, Counting Networks are Practically Linearizable, in Proc. of 15th ACM Symp. on Principles of Distributed Computing, 1996. [Abs][]
S. Abiteboul, G. Kuper, H. Mairson, A. Shvartsman, M. Vardi, Paris C. Kanellakis: In Memoriam, A Technical Obituary, ACM Computing Surveys, March 1996. [Abs][]
J.F. Buss, P.C. Kanellakis, P. L. Ragde, A.A. Shvartsman, Parallel Algorithms with Processor Failures and Delays, Journal of Algorithms, vol. 20, pp. 45-86, 1996. [Abs][]
P.C. Kanellakis, D. Michailidis and A.A. Shvartsman, Controlling Memory Access in Efficient Fault-Tolerant Parallel Algorithms, Nordic Journal of Computing, vol. 2, pp. 146-180, 1995. [Abs][]
A.A. Shvartsman, Integrating Distributed Multimedia Systems and Interactive Television Networks, Proc. of SPIE Conf. on Integration. Issues in Large Media Delivery Systems, Vol. 2615, pp. 142-153, 1995. [Abs][]
P.C. Kanellakis, D. Michailidis and A.A. Shvartsman, Concurrency = Fault-Tolerance in Parallel Computation, Proceedings of the 5th Int-l Conf. on Concurrency Theory (CONCURí94), pp. 242-266, 1994. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Fault-Tolerance and Efficiency in Massively Parallel Algorithms, book chapter, in Foundations of Ultradependable Computing, Kluwer Academic Publishers, 1994. [Abs][]
A.A. Shvartsman and C. Strutt, Distributed Object Management and Generic Applications, Computer Science Tech. Report TR 94-176, Brandeis University, 1994. [][]
A.A. Shvartsman, Information Systems Architectures, Digital Applied Technology Reports, vol. 4, 1994. [][]
A.A. Shvartsman, POLYCENTER and OpenView: Digital New Enterprise Management Platform Strategy, Digital Applied Technology Reports, vol. 1, 1994. [][]
A.A. Shvartsman, Megaprogramming, Digital Applied Technology Reports, vol. 3, 1994. [][]
A.A. Shvartsman, Dealing with History and Time in a Distributed Enterprise Manager, IEEE Network, vol. 7, no. 6, pp. 32-43, 1993. [Abs][]
P.C. Kanellakis, D. Michailidis and A.A. Shvartsman, Controlling Memory Access in Efficient Fault-Tolerant Parallel Algorithms, (preliminary), Proceedings of 7th International Workshop on Distributed Algorithms, pp. 99-114, 1993. [Abs][]
A.A. Shvartsman, An Historical Object Base in an Enterprise Management Director, Proceedings of the IFIP/IEEE 3rd International Symposium on Integrated Network Management, pp. 123-134, 1993. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Parallel Computation With Constant Overhead, IEEE Workshop on Fault and Error Models of Failures in Computer Systems, FL, 1993. [Abs][]
A. Allister Shvartsman, Fault-Tolerant and Efficient Parallel Computation, Doctoral Dissertation, Computer Science, Brown University, Rhode Island, May 1992. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust, Distributed Computing, vol. 5, no. 4, pp. 201-217, 1992. [Abs][]
A.A. Shvartsman, An Efficient Write-All Algorithm for Fail-Stop PRAMs Without Initialized Memory, Information Processing Letters, vol. 44, no. 6, pp. 223-231, 1992. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, On the Complexity of Parallel Computation Using Fail-Stop Processors and Contaminated Memory, Workshop on Real-Time Dependable Parallel Computing, NY, 1992. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Efficient Parallel Algorithms On Restartable Fail-Stop Processors, Proc. of 10th ACM Symp. on Principles of Distributed Computing, pp. 23-36, 1991. [Abs][]
A.A. Shvartsman, Achieving Optimal CRCW PRAM Fault-Tolerance, Information Processing Letters, vol. 39, no. 2, pp. 59-66, 1991. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Robust Computing with Fail-Stop Processors, Proceedings of 2nd ONR Symposium on Ultradependable Multicomputers, 1991. [Abs][]
P.C. Kanellakis and A.A. Shvartsman, Efficient Parallel Algorithms Can Be Made Robust, in Proc. of 8th ACM Symp. on Principles of Distributed Computing, pp. 211-222, 1989. [Abs][]