S
Sergio Rajsbaum
Researcher at National Autonomous University of Mexico
Publications - 256
Citations - 4386
Sergio Rajsbaum is an academic researcher from National Autonomous University of Mexico. The author has contributed to research in topics: Distributed algorithm & Asynchronous communication. The author has an hindex of 34, co-authored 244 publications receiving 4092 citations. Previous affiliations of Sergio Rajsbaum include Massachusetts Institute of Technology & Technion – Israel Institute of Technology.
Papers
More filters
Book
Distributed Computing Through Combinatorial Topology
TL;DR: This book describes techniques for analyzing distributed algorithms based on award winning combinatorial topology research, and presents unique insights applicable to multiple computing fields, including multicore microprocessors, wireless networks, distributed systems, and Internet protocols.
Journal ArticleDOI
The BG distributed simulation algorithm
TL;DR: 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, satisfies the requirements of a fault-tolerant distributed simulation.
Journal ArticleDOI
A Layered Analysis of Consensus
Yoram Moses,Sergio Rajsbaum +1 more
TL;DR: A new notion of connectivity among states in runs of a consensus protocol, called potence connectivity, is introduced, which is more general than previous notions of connectivity used for this purpose and plays a key role in the uniform analysis of consensus.
Journal ArticleDOI
Conditions on input vectors for consensus solvability in asynchronous distributed systems
TL;DR: The condition-based approach to solve the consensus problem in asynchronous systems is introduced and two examples of realistic acceptable conditions are presented, and proved to be maximal, in the sense that they cannot be extended and remain acceptable.
Book ChapterDOI
On the Cost of Fault-Tolerant Consensus When There Are No Faults – A Tutorial
Idit Keidar,Sergio Rajsbaum +1 more
TL;DR: Algorithms and lower bounds are described that show that two communication steps are necessary and sufficient for solving consensus in realistic partial synchrony and timed asynchronous models where processes can crash.