Sergio Rajsbaum (born March 3, 1962, in Mexico City, Mexico) is a Mexican computer scientist, working in the field of Theoretical Computer Science, specifically concurrent and distributed computing.
He is a Professor of the Instituto de Matemáticas of Universidad Nacional Autónoma de México, where he has been a member of the faculty since 1991.
He was a visiting researcher of Institut de recherche en informatique fondamentale (IRIF) on a Sabbatical academic year 2022 to 2023.. [1] [2]
Rajsbaum was educated at the Facultad de Ingeniería of UNAM, earning a B.S. in computer engineering in 1985.
Rajsbaum obtained his PhD from the Technion, Israel in 1991, with thesis Synchronization in Distributed Networks written under the direction of Shimon Even. His thesis introduced the unison problem . [2]
He did postdoctoral studies from 1993 to 1995 at the Massachusetts Institute of Technology under Nancy Lynch. The research resulted in contributions to three topics. A method to computing the achievable clock synchronization precision based on the communication and individual clock drift bounds of a given network. A simulation [3] for direct translations of algorithms and impossibility results from a model with some resiliency to a model with a different resiliency. The study of the deep connection between distributed computing and algebraic topology, [4] an example of the interplay between mathematics and computation [5]
The collaboration that started in 1994 with Maurice Herlihy was the beginning of a research project that has lasted over 30 years, and overviewed in the book "Distributed Computing Through Combinatorial Topology", which they wrote together with mathematician Dmitry Feichtner-Kozlov. The topological perspective has gone beyond distributed computing [6] leading to work in combinatorial topology [7] and directed topology, [8] and connections with logic, runtime verification, and social choice theory.
{{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help){{cite journal}}: Cite journal requires |journal= (help)With his co-workers, Rajsbaum received Best Paper Awards at the following scientific conferences. DISC (2011) for his paper "Locality and Checkability in Wait-Free computing" and SSS (2019) for his paper "Synchronous t-Resilient Consensus in Arbitrary Graphs".
His work "New combinatorial topology bounds for renaming: the upper bound" with his PhD student Armando Castañeda was recognized in the ACM Notable Computing Books and Articles of 2012 and received the Best Student Paper Award at PODC (2008).
His book "Distributed Computing Through Combinatorial Topology" was selected as a Notable Book on the Best of Computing 2013 list by the Association for Computing Machinery.
Rajsbaum received the Premio Nacional de Computación 2022 by the Academia Mexicana de Computación.
His Erdös number is 2 because Rajsbaum is coauthor of Shlomo Moran, who is coauthor of Paul Erdös.
A distributed system is a system whose components are located on different networked computers, which communicate and coordinate their actions by passing messages to one another. Distributed computing is a field of computer science that studies distributed systems.
In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread; for some operations, these algorithms provide a useful alternative to traditional blocking implementations. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress, and wait-free if there is also guaranteed per-thread progress. "Non-blocking" was used as a synonym for "lock-free" in the literature until the introduction of obstruction-freedom in 2003.
The Gödel Prize is an annual prize for outstanding papers in the area of theoretical computer science, given jointly by the European Association for Theoretical Computer Science (EATCS) and the Association for Computing Machinery Special Interest Group on Algorithms and Computational Theory. The award is named in honor of Kurt Gödel. Gödel's connection to theoretical computer science is that he was the first to mention the "P versus NP" question, in a 1956 letter to John von Neumann in which Gödel asked whether a certain NP-complete problem could be solved in quadratic or linear time.
In concurrent programming, an operation is linearizable if it consists of an ordered list of invocation and response events, that may be extended by adding response events such that:
In computer science, load-linked/store-conditional (LL/SC), sometimes known as load-reserved/store-conditional (LR/SC), are a pair of instructions used in multithreading to achieve synchronization. Load-link returns the current value of a memory location, while a subsequent store-conditional to the same memory location will store a new value only if no updates have occurred to that location since the load-link. Together, this implements a lock-free, atomic, read-modify-write operation.
Shlomi Dolev is a Rita Altura Trust Chair Professor in Computer Science at Ben-Gurion University of the Negev (BGU) and the head of the BGU Negev Hi-Tech Faculty Startup Accelerator.
A fundamental problem in distributed computing and multi-agent systems is to achieve overall system reliability in the presence of a number of faulty processes. This often requires coordinating processes to reach consensus, or agree on some data value that is needed during computation. Example applications of consensus include agreeing on what transactions to commit to a database in which order, state machine replication, and atomic broadcasts. Real-world applications often requiring consensus include cloud computing, clock synchronization, PageRank, opinion formation, smart power grids, state estimation, control of UAVs, load balancing, blockchain, and others.
Maurice Peter Herlihy is a computer scientist active in the field of multiprocessor synchronization. Herlihy has contributed to areas including theoretical foundations of wait-free synchronization, linearizable data structures, applications of combinatorial topology to distributed computing, as well as hardware and software transactional memory. He is the An Wang Professor of Computer Science at Brown University, where he has been a member of the faculty since 1994.
A gossip protocol or epidemic protocol is a procedure or process of computer peer-to-peer communication that is based on the way epidemics spread. Some distributed systems use peer-to-peer gossip to ensure that data is disseminated to all members of a group. Some ad-hoc networks have no central registry and the only way to spread common data is to rely on each member to pass it along to their neighbors.
Clyde P. Kruskal is an American computer scientist, working on parallel computing architectures, models, and algorithms. As part of the ultracomputer project, he was one of the inventors of the read–modify–write concept in parallel and distributed computing. He is an associate professor of computer science at the University of Maryland, College Park.
Larry Joseph Stockmeyer was an American computer scientist. He was one of the pioneers in the field of computational complexity theory, and he also worked in the field of distributed computing. He died of pancreatic cancer.
Michael John Fischer is an American computer scientist who works in the fields of distributed computing, parallel computing, cryptography, algorithms and data structures, and computational complexity.
A distributed operating system is system software over a collection of independent software, networked, communicating, and physically separate computational nodes. They handle jobs which are serviced by multiple CPUs. Each individual node holds a specific software subset of the global aggregate operating system. Each subset is a composite of two distinct service provisioners. The first is a ubiquitous minimal kernel, or microkernel, that directly controls that node's hardware. Second is a higher-level collection of system management components that coordinate the node's individual and collaborative activities. These components abstract microkernel functions and support user applications.
Baruch Awerbuch is an Israeli-American computer scientist and a professor of computer science at Johns Hopkins University. He is known for his research on distributed computing.
Michel Raynal is a French informatics scientist, professor at IRISA, University of Rennes, France. He is known for his contributions in the fields of algorithms, computability, and fault-tolerance in the context of concurrent and distributed systems. Michel Raynal is also Distinguished Chair professor at the Hong Kong Polytechnic University and editor of the “Synthesis Lectures on Distributed Computing Theory” published by Morgan & Claypool. He is a senior member of Institut Universitaire de France and a member of Academia Europaea.
Ramesh Govindan is an Indian-American professor of computer science. He is the Northrop Grumman Chair in Engineering and Professor of Computer Science and Electrical Engineering at the University of Southern California.
Roger Wattenhofer, born in 1969, is a Swiss computer scientist, active in the field of distributed computing, networking, and algorithms. He is a professor at ETH Zurich (Switzerland) since 2001. He has published numerous research articles in computer science and a book on Bitcoin.
Dmitry Feichtner-Kozlov is a Russian-German mathematician.
Rachid Guerraoui is a Moroccan-Swiss computer scientist and a professor at the School of Computer and Communication Sciences at École Polytechnique Fédérale de Lausanne (EPFL), known for his contributions in the fields of concurrent and distributed computing. He is an ACM Fellow and the Chair in Informatics and Computational Science for the year 2018–2019 at Collège de France for distributed computing.
Multitier programming is a programming paradigm for distributed software, which typically follows a multitier architecture, physically separating different functional aspects of the software into different tiers. Multitier programming allows functionalities that span multiple of such tiers to be developed in a single compilation unit using a single programming language. Without multitier programming, tiers are developed using different languages, e.g., JavaScript for the Web client, PHP for the Web server and SQL for the database. Multitier programming is often integrated into general-purpose languages by extending them with support for distribution.
| International | |
|---|---|
| National | |
| Academics | |
| Other | |
 | This article needs additional or more specific categories .(May 2023) |
