Alexander A. Schwarzmann

According to our database1, Alexander A. Schwarzmann
  • authored at least 164 papers between 1989 and 2018.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Unleashing and Speeding Up Readers in Atomic Object Implementations.
CoRR, 2018

Consistent Distributed Memory Services: Resilience and Efficiency (Invited Paper).
Proceedings of the 45th International Colloquium on Automata, Languages, and Programming, 2018

2017
Coordinated cooperative task computing using crash-prone processors with unreliable multicast.
J. Parallel Distrib. Comput., 2017

Special issue containing selected expanded papers from the 17th International Symposium on Stabilization, Safety and Security of Distributed Systems (SSS 2015).
Inf. Comput., 2017

Doing-it-All with bounded work and communication.
Inf. Comput., 2017

Oh-RAM! One and a Half Round Atomic Memory.
Proceedings of the Networked Systems - 5th International Conference, 2017

2016
Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems.
CoRR, 2016

Oh-RAM! One and a Half Round Atomic Memory.
CoRR, 2016

Brief Announcement: Oh-RAM! One and a Half Round Read/Write Atomic Memory.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Storage-Optimized Data-Atomic Algorithms for Handling Erasures and Errors in Distributed Storage Systems.
Proceedings of the 2016 IEEE International Parallel and Distributed Processing Symposium, 2016

2015
Dealing with undependable workers in decentralized network supercomputing.
Theor. Comput. Sci., 2015

Robust network supercomputing with unreliable workers.
J. Parallel Distrib. Comput., 2015

2014
Technical Report: Estimating Reliability of Workers for Cooperative Distributed Computing.
CoRR, 2014

Technical Report: Dealing with Undependable Workers in Decentralized Network Supercomputing.
CoRR, 2014

Doing-it-All with Bounded Work and Communication.
CoRR, 2014

Implementing distributed shared memory for dynamic networks.
Commun. ACM, 2014

A Systematic Approach to Analyzing Voting Terminal Event Logs.
Proceedings of the 2014 Electronic Voting Technology Workshop/Workshop on Trustworthy Elections, 2014

Dependable Decentralized Cooperation with the Help of Reliability Estimation.
Proceedings of the Stabilization, Safety, and Security of Distributed Systems, 2014

Coordinated Cooperative Work Using Undependable Processors with Unreliable Broadcast.
Proceedings of the 22nd Euromicro International Conference on Parallel, 2014

2013
Special issue on DISC 2010.
Distributed Computing, 2013

Malicious takeover of voting systems: arbitrary code execution on optical scan voting terminals.
Proceedings of the 28th Annual ACM Symposium on Applied Computing, 2013

Brief announcement: self-stabilizing resource discovery algorithm.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

Self-stabilizing Resource Discovery Algorithm.
Proceedings of the Principles of Distributed Systems - 17th International Conference, 2013

Estimating Reliability of Workers for Cooperative Distributed Computing.
Proceedings of the IEEE 12th International Symposium on Parallel and Distributed Computing, 2013

Dealing with Undependable Workers in Decentralized Network Supercomputing.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
Integrity of electronic voting systems: fallacious use of cryptography.
Proceedings of the ACM Symposium on Applied Computing, 2012

Brief announcement: decentralized network supercomputing in the presence of malicious and crash-prone workers.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
Cooperative Task-Oriented Computing: Algorithms and Complexity
Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers, 2011

Optimal deployment of eventually-serializable data services.
Annals OR, 2011

Robust network supercomputing without centralized control.
Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing, 2011

Robust Network Supercomputing without Centralized Control.
Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Towards Feasible Implementations of Low-Latency Multi-writer Atomic Registers.
Proceedings of The Tenth IEEE International Symposium on Networking Computing and Applications, 2011

2010
Editors' preface.
Theor. Comput. Sci., 2010

Emulating shared-memory Do-All algorithms in asynchronous message-passing systems.
J. Parallel Distrib. Comput., 2010

Rambo: a robust, reconfigurable atomic memory service for dynamic networks.
Distributed Computing, 2010

Determining the Causes of AccuVote Optical Scan Voting Terminal Memory Card Failures.
Proceedings of the 2010 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2010

Load Balancing and Almost Symmetries for RAMBO Quorum Hosting.
Proceedings of the Principles and Practice of Constraint Programming - CP 2010, 2010

2009
Developing a Consistent Domain-Oriented Distributed Object Service.
IEEE Trans. Parallel Distrib. Syst., 2009

State-wide elections, optical scan voting systems, and the pursuit of integrity.
IEEE Trans. Information Forensics and Security, 2009

Editors' preface.
Theor. Comput. Sci., 2009

Theoretical aspects of dynamic distributed systems: report on the workshop, Elche, Spain, September 26, 2009.
SIGACT News, 2009

Node discovery in networks.
J. Parallel Distrib. Comput., 2009

Fault-tolerant semifast implementations of atomic read/write registers.
J. Parallel Distrib. Comput., 2009

Reconfigurable distributed storage for dynamic networks.
J. Parallel Distrib. Comput., 2009

At-Most-Once Semantics in Asynchronous Shared Memory.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

Automating Voting Terminal Event Log Analysis.
Proceedings of the 2009 Electronic Voting Technology Workshop / Workshop on Trustworthy Elections, 2009

At-most-once semantics in asynchronous shared memory.
Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

Optimizing Network Deployment of Formally-Specified Distributed Systems.
Proceedings of the 18th International Conference on Software Engineering and Data Engineering (SEDE-2009), 2009

Taking total control of voting systems: firmware manipulations on an optical scan voting terminal.
Proceedings of the 2009 ACM Symposium on Applied Computing (SAC), 2009

On the Efficiency of Atomic Multi-reader, Multi-writer Distributed Memory.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

Bandwidth-Limited Optimal Deployment of Eventually-Serializable Data Services.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2009

Online Selection of Quorum Systems for RAMBO Reconfiguration.
Proceedings of the Principles and Practice of Constraint Programming, 2009

2008
Writing-all deterministically and optimally using a nontrivial number of asynchronous processors.
ACM Trans. Algorithms, 2008

A robust randomized algorithm to perform independent tasks.
J. Discrete Algorithms, 2008

Introduction to special issue dedicated to the DISC 20th anniversary.
Distributed Computing, 2008

On the Robustness of (Semi) Fast Quorum-Based Implementations of Atomic Shared Memory.
Proceedings of the Distributed Computing, 22nd International Symposium, 2008

Pre-Election Testing and Post-Election Audit of Optical Scan Voting Terminal Memory Cards.
Proceedings of the 2008 USENIX/ACCURATE Electronic Voting Workshop, 2008

On the robustness of (semi) fast quorum-based implementations of atomic shared memory.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

An Abstract Channel Specification and an Algorithm Implementing It Using Java Sockets.
Proceedings of The Seventh IEEE International Symposium on Networking Computing and Applications, 2008

Spontaneous, Self-Sampling Quorum Systems for Ad Hoc Networks.
Proceedings of the 7th International Symposium on Parallel and Distributed Computing (ISPDC 2008), 2008

Optimal Deployment of Eventually-Serializable Data Services.
Proceedings of the Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems, 2008

Do-All Computing in Distributed Systems: Cooperation in the Presence of Adversity.
Springer, ISBN: 978-0-387-30918-7, 2008

2007
Long-lived Rambo: Trading knowledge for communication.
Theor. Comput. Sci., 2007

Failure-Sensitive Analysis of Parallel Algorithms with Controlled Memory Access Concurrency.
Parallel Processing Letters, 2007

An Authentication and Ballot Layout Attack Against an Optical Scan Voting Terminal.
Proceedings of the 2007 USENIX/ACCURATE Electronic Voting Technology Workshop, 2007

A formal treatment of an abstract channel implementation using java sockets and TCP.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Implementing Atomic Data through Indirect Learning in Dynamic Networks.
Proceedings of the Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007), 12, 2007

Tampering with Special Purpose Trusted Computing Devices: A Case Study in Optical Scan E-Voting.
Proceedings of the 23rd Annual Computer Security Applications Conference (ACSAC 2007), 2007

2006
Dynamic load balancing with group communication.
Theor. Comput. Sci., 2006

Eight Open Problems in Distributed Computing.
Bulletin of the EATCS, 2006

Distributed scheduling for disconnected cooperation.
Distributed Computing, 2006

Robust Network Supercomputing with Malicious Processes.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Brief Announcement: Fault-Tolerant SemiFast Implementations of Atomic Read/Write Registers.
Proceedings of the Distributed Computing, 20th International Symposium, 2006

Fault-tolerant semifast implementations of atomic read/write registers.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Resource Discovery in Networks under Bandwidth Limitations.
Proceedings of the 5th International Symposium on Parallel and Distributed Computing (ISPDC 2006), 2006

2005
Efficient gossip and robust distributed computation.
Theor. Comput. Sci., 2005

The Do-All problem with Byzantine processor failures.
Theor. Comput. Sci., 2005

Work-Competitive Scheduling for Cooperative Computing with Dynamic Groups.
SIAM J. Comput., 2005

Highly scalable algorithms for robust string barcoding.
IJBRA, 2005

Performing work with asynchronous processors: Message-delay-sensitive bounds.
Inf. Comput., 2005

GeoQuorums: implementing atomic memory in mobile ad hoc networks.
Distributed Computing, 2005

Highly Scalable Algorithms for Robust String Barcoding
CoRR, 2005

DNA-BAR: distinguisher selection for DNA barcoding.
Bioinformatics, 2005

Autonomous virtual mobile nodes.
Proceedings of the SPAA 2005: Proceedings of the 17th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2005

Node Discovery in Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Reconfigurable Distributed Storage for Dynamic Networks.
Proceedings of the Principles of Distributed Systems, 9th International Conference, 2005

Developing a Consistent Domain-Oriented Distributed Object Service.
Proceedings of the Fourth IEEE International Symposium on Network Computing and Applications (NCA 2005), 2005

Explicit Combinatorial Structures for Cooperative Distributed Algorithms.
Proceedings of the 25th International Conference on Distributed Computing Systems (ICDCS 2005), 2005

Highly Scalable Algorithms for Robust String Barcoding.
Proceedings of the Computational Science, 2005

Autonomous virtual mobile nodes.
Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing, 2005

Improved algorithms for multiplex PCR primer set selection with amplification length constraints.
Proceedings of 3rd Asia-Pacific Bioinformatics Conference, 17-21 January 2005, Singapore, 2005

Operation Liveness and Gossip Management in a Dynamic Distributed Atomic Data Service.
Proceedings of the ISCA 18th International Conference on Parallel and Distributed Computing Systems, 2005

2004
Analysis of memory access concurrency in robust parallel algorithms.
Stud. Inform. Univ., 2004

Editor's introduction.
Inf. Comput., 2004

The complexity of synchronous iterative Do-All with crashes.
Distributed Computing, 2004

Approximation Algorithms for Minimum PCR Primer Set Selection with Amplification Length and Uniqueness Constraints
CoRR, 2004

Virtual Mobile Nodes for Mobile Ad Hoc Networks.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Collective asynchronous reading with polylogarithmic worst-case overhead.
Proceedings of the 36th Annual ACM Symposium on Theory of Computing, 2004

Writing-all deterministically and optimally using a non-trivial number of asynchronous processors.
Proceedings of the SPAA 2004: Proceedings of the Sixteenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2004

Long-Lived Rambo: Trading Knowledge for Communication.
Proceedings of the Structural Information and Communication Complexity, 2004

Brief announcement: virtual mobile nodes for mobile ad hoc networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Implementing a Reconfigurable Atomic Memory Service for Dynamic Networks.
Proceedings of the 18th International Parallel and Distributed Processing Symposium (IPDPS 2004), 2004

The Join Problem in Dynamic Network Algorithms.
Proceedings of the 2004 International Conference on Dependable Systems and Networks (DSN 2004), 28 June, 2004

2003
Cooperative computing with fragmentable and mergeable groups.
J. Discrete Algorithms, 2003

Efficient Gossip and Robust Distributed Computation.
Proceedings of the Distributed Computing, 17th International Conference, 2003

GeoQuorums: Implementing Atomic Memory in Mobile Ad Hoc Networks.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Work-competitive scheduling for cooperative computing with dynamic groups.
Proceedings of the 35th Annual ACM Symposium on Theory of Computing, 2003

Performing work with asynchronous processors: message-delay-sensitive bounds.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Emulating Shared-Memory Do-All Algorithms in Asynchronous Message-Passing Systems.
Proceedings of the Principles of Distributed Systems, 7th International Conference, 2003

RAMBO II: Rapidly Reconfigurable Atomic Memory for Dynamic Networks.
Proceedings of the 2003 International Conference on Dependable Systems and Networks (DSN 2003), 2003

Distributed Cooperation and Adversity: Complexity Trade-Offs.
Proceedings of the PCK50, 2003

In Memoriam: Paris C. Kanellakis.
Proceedings of the PCK50, 2003

Communication and Data Sharing for Dynamic Distributed Systems.
Proceedings of the Future Directions in Distributed Computing, 2003

2002
An inheritance-based technique for building simulation proofs incrementally.
ACM Trans. Softw. Eng. Methodol., 2002

Distributed Computation Meets Design Theory: Local Scheduling for Disconnected Cooperation.
Bulletin of the EATCS, 2002

RAMBO: A Reconfigurable Atomic Memory Service for Dynamic Networks.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Bounding Work and Communication in Robust Cooperative Computation.
Proceedings of the Distributed Computing, 16th International Conference, 2002

Optimally work-competitive scheduling for cooperative computing with merging groups.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Failure sensitive analysis for parallel algorithm with controlled memory access concurrency.
Proceedings of the Procedings of the 6th International Conference on Principles of Distributed Systems. OPODIS 2002, 2002

2001
Specifying and using a partitionable group communication service.
ACM Trans. Comput. Syst., 2001

Performing tasks on synchronous restartable message-passing processors.
Distributed Computing, 2001

The Complexity of Synchronous Iterative Do-All with Crashes.
Proceedings of the Distributed Computing, 15th International Conference, 2001

Towards practical deteministic write-all algorithms.
SPAA, 2001

Optimal Scheduling for Distributed Cooperation Without Communication.
Proceedings of the SIROCCO 8, 2001

Two Optimization Techniques for Component-Based Systems Deployment.
Proceedings of the Thirteenth International Conference on Software Engineering & Knowledge Engineering (SEKE'2001), 2001

Optimal scheduling for disconnected cooperation.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

Local Scheduling for Distributed Cooperation.
Proceedings of the IEEE International Symposium on Network Computing and Applications (NCA 2001), 2001

Developing and Refining an Adaptive Token-Passing Strategy.
Proceedings of the 21st International Conference on Distributed Computing Systems (ICDCS 2001), 2001

2000
Distributed Cooperation During the Absence of Communication.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Cooperative computing with fragmentable and mergeable groups.
Proceedings of the SIROCCO 7, 2000

Comprehensive Specification of Distributed Systems Using I5 and IOA.
Proceedings of the 20st International Conference of the Chilean Computer Science Society (SCCC 2000), 2000

Distributed cooperation in the absence of communication (brief announcement).
Proceedings of the Nineteenth Annual ACM Symposium on Principles of Distributed Computing, 2000

The Complexity of Distributed Cooperation in the Presence of Failures.
Proceedings of the Procedings of the 4th International Conference on Principles of Distributed Systems, 2000

An inheritance-based technique for building simulation proofs incrementally.
Proceedings of the 22nd International Conference on on Software Engineering, 2000

Graceful Quorum Reconfiguration in a Robust Emulation of Shared Memory.
Proceedings of the 20th International Conference on Distributed Computing Systems, 2000

1999
Timing Conditions for Linearizability in Uniform Counting Networks.
Theor. Comput. Sci., 1999

Eventually-Serializable Data Services.
Theor. Comput. Sci., 1999

A Dynamic Primary Configuration Group Communication Service.
Proceedings of the Distributed Computing, 1999

Dynamic Load Balancing with Group Communication.
Proceedings of the SIROCCO'99, 1999

A Framework for Architectural Specification of Distributed Object Systems.
Proceedings of the Procedings of the 3rd International Conference on Principles of Distributed Systems. OPODIS 99, 1999

An Auction-Based Flexible Pricing Scheme for Renegotiated QoS Connections and Its Evaluation.
Proceedings of the MASCOTS 1999, 1999

1998
Software Architectural Specification for Optimal Object Distribution.
Proceedings of 18th International Conference of the Chilean Computer Science Society (SCCC '98), 1998

A Dynamic View-Oriented Group Communication Service.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Implementing and Evaluating an Eventualy-Serializable Data Service.
Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

Implementing an EventuallySerializable Data Service as a Distributed System Building Block.
Proceedings of the Distributed Computing, 1998

A Binary Integer Programming Model for Optimal Object Distribution.
Proceedings of the Distributed Computing, 1998

1997
Performing Tasks on Restartable Message-Passing Processors.
Proceedings of the Distributed Algorithms, 11th International Workshop, 1997

Specifying and Using a Partitionable Group Communication Service.
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

Robust Emulation of Shared Memory Using Dynamic Quorum-Acknowledged Broadcasts.
Proceedings of the Digest of Papers: FTCS-27, 1997

Implementing an eventually-serializable data service as a distributed system building block.
Proceedings of the Networks in Distributed Computing, 1997

1996
In Memoriam: Paris C. Kanellakis (1953-1995).
J. Algorithms, 1996

Parallel Algorithms with Processor Failures and Delays.
J. Algorithms, 1996

In Memoriam Paris C. Kanellakis.
ACM Comput. Surv., 1996

Counting Networks are Practically Linearizable.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

Eventually-Serializable Data Services.
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms.
Nord. J. Comput., 1995

1994
Efficient Parallelism vs Reliable Distribution: A Trade-off for Concurrent Computations.
Proceedings of the CONCUR '94, 1994

1993
Controlling Memory Access Concurrency in Efficient Fault-Tolerant Parallel Algorithms (Extended Abstract).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

A Historical Object Base in an Enterprise Management Director.
Proceedings of the Integrated Network Management III, 1993

1992
An Efficient Write-All Algorithm for Fail-Stop PRAM Without Initialized Memory.
Inf. Process. Lett., 1992

Efficient Parallel Algorithms can be Made Robust.
Distributed Computing, 1992

1991
Achieving Optimal CRCW PRAM Fault-Tolerance.
Inf. Process. Lett., 1991

Efficient Parallel Algorithms on Restartable Fail-Stop Processors.
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1989
Efficient Parallel Algorithms Can Be Made Robust.
Proceedings of the Eighth Annual ACM Symposium on Principles of Distributed Computing, 1989


  Loading...