#### Filter Results:

- Full text PDF available (105)

#### Publication Year

1990

2017

- This year (7)
- Last 5 years (49)
- Last 10 years (91)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Sergio Rajsbaum, Paulo E. Verı́ssimo
- 2006

The Distributed Computing Column covers the theory of systems that are composed of a number of interacting computing elements. These include problems of communication and networking, databases, distributed shared memory, multiprocessor architectures, operating systems, verification, Internet, and the Web. This issue consists of: • “Travelling through… (More)

- Boaz Patt-Shamir, Sergio Rajsbaum
- STOC
- 1994

EXTENDED ABSTRACT Boaz Patt-Shamir* Sergio Raj sbaumt Laboratory for Computer Science Massachusetts Institute of Technology

- Elizabeth Borowsky, Eli Gafni, Nancy A. Lynch, Sergio Rajsbaum
- Distributed Computing
- 2001

We present a shared memory algorithm that allows a set of f+1 processes to wait-free “simulate” a larger system of n processes, that may also exhibit up to f stopping failures. Applying this simulation algorithm to the k-set-agreement problem enables conversion of an arbitrary k-fault-tolerant{\it n}-process solution for the k-set-agreement problem into a… (More)

- Achour Mostéfaoui, Sergio Rajsbaum, Michel Raynal
- J. ACM
- 2001

This paper introduces and explores a new <italic>condition based</italic> approach to solve the consensus problem in asynchronous systems. The approach consists of identifying sets of input vectors, called <italic>conditions</italic>, for which it is possible to design a protocol solving consensus despite the occurrence of up to <italic>f</italic> process… (More)

- Idit Keidar, Sergio Rajsbaum
- LADC
- 2003

- Hagit Attiya, Amir Herzberg, Sergio Rajsbaum
- SIAM J. Comput.
- 1996

The problem of achieving optimal clock synchronization in a communication network with arbitrary topology and perfect clocks (that do not drift) is studied. Clock synchronization algorithms are presented for a large family of delay assumptions. Our algorithms are modular and consist of three major components. The first component holds for any type of delay… (More)

- Yoram Moses, Sergio Rajsbaum
- SIAM J. Comput.
- 2002

This paper introduces a simple notion of layering as a tool for analyzing well-behaved runs of a given model of distributed computation. Using layering, a model-independent analysis of the consensus problem is performed and then applied to proving lower bounds and impossibility results for consensus in a number of familiar and less familiar models. The… (More)

- Idit Keidar, Sergio Rajsbaum
- Inf. Process. Lett.
- 2003

We give a simple and intuitive proof of an f + 2 round lower bound for uniform consensus. That is, we show that for every uniform consensus algorithm tolerating t failures, and for every f t − 2, there is an execution with f failures that requires f + 2 rounds. 2002 Elsevier Science B.V. All rights reserved.

- Maurice Herlihy, Sergio Rajsbaum
- Mathematical Structures in Computer Science
- 2000

Topological methods have yielded a variety of lower bounds and impossibility results for distributed computing. In this paper, we introduce a new tool for proving impossibility results, based on a core theorem of algebraic topology, the acyclic carrier theorem, which uniies, generalizes, and extends earlier results.

- Maurice Herlihy, Sergio Rajsbaum, Mark R. Tuttle
- PODC
- 1998

We take a signi cant step toward unifying the synchronous semi synchronous and asynchronous message passing models of distributed computation The key idea is the concept of a pseudosphere a new combinatorial structure in which each process from a set of processes is independently assigned a value from a set of values Pseudospheres have a number of nice… (More)