Search

Your search keyword '"Fauconnier, Hugues"' showing total 319 results
Start Over Author "Fauconnier, Hugues"
319 results on '"Fauconnier, Hugues"'

1. The Computational Power of Distributed Shared-Memory Models with Bounded-Size Registers

Author

Delporte, Carole, Fauconnier, Hugues, Fraigniaud, Pierre, Rajsbaum, Sergio, and Travers, Corentin

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

The celebrated Asynchronous Computability Theorem of Herlihy and Shavit (STOC 1993 and STOC 1994) provided a topological characterization of the tasks that are solvable in a distributed system where processes are communicating by writing and reading shared registers, and where any number of processes can fail by crashing. However, this characterization assumes the use of full-information protocols, that is, protocols in which each time any of the processes writes in the shared memory, it communicates everything it learned since the beginning of the execution. Thus, the characterization implicitly assumes that each register in the shared memory is of unbounded size. Whether unbounded size registers are unavoidable for the model of computation to be universal is the central question studied in this paper. Specifically, is any task that is solvable using unbounded registers solvable using registers of bounded size? More generally, when at most $t$ processes can crash, is the model with bounded size registers universal? These are the questions answered in this paper.

Published
2023

2. Some New Results With k-Set Agreement

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Safir, Mouna, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Castañeda, Armando, editor, Enea, Constantin, editor, and Gupta, Nirupam, editor

Published
2024
Full Text
View/download PDF

3. Non-negotiating Distributed Computing

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Fraigniaud, Pierre, Rajsbaum, Sergio, Travers, Corentin, Goos, Gerhard, Series Editor, Hartmanis, Juris, Founding Editor, van Leeuwen, Jan, Series Editor, Hutchison, David, Editorial Board Member, Kanade, Takeo, Editorial Board Member, Kittler, Josef, Editorial Board Member, Kleinberg, Jon M., Editorial Board Member, Kobsa, Alfred, Series Editor, Mattern, Friedemann, Editorial Board Member, Mitchell, John C., Editorial Board Member, Naor, Moni, Editorial Board Member, Nierstrasz, Oscar, Series Editor, Pandu Rangan, C., Editorial Board Member, Sudan, Madhu, Series Editor, Terzopoulos, Demetri, Editorial Board Member, Tygar, Doug, Editorial Board Member, Weikum, Gerhard, Series Editor, Vardi, Moshe Y, Series Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, and Emek, Yuval, editor

Published
2024
Full Text
View/download PDF

4. When Is Recoverable Consensus Harder Than Consensus?

Author

Delporte-Gallet, Carole, Fatourou, Panagiota, Fauconnier, Hugues, and Ruppert, Eric

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

We study the ability of different shared object types to solve recoverable consensus using non-volatile shared memory in a system with crashes and recoveries. In particular, we compare the difficulty of solving recoverable consensus to the difficulty of solving the standard wait-free consensus problem in a system with halting failures. We focus on the model where individual processes may crash and recover and the large class of object types that are equipped with a read operation. We characterize the readable object types that can solve recoverable consensus among a given number of processes. Using this characterization, we show that the number of processes that can solve consensus using a readable type can be larger than the number of processes that can solve recoverable consensus using that type, but only slightly larger., Comment: A shorter version of this paper will appear in Proceedings of the 2022 ACM Symposium on Principles of Distributed Computing (PODC '22), July 25-29, 2022, Salerno, Italy, https://doi.org/10.1145/3519270.3538418

Published
2022
Full Text
View/download PDF

7. $t$-Resilient $k$-Immediate Snapshot and its Relation with Agreement Problems

Author

Delporte, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, and Raynal, Michel

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

An immediate snapshot object is a high level communication object, built on top of a read/write distributed system in which all except one processes may crash. It allows a process to write a value and obtain a set of values that represent a snapshot of the values written to the object, occurring immediately after the write step. Considering an $n$-process model in which up to $t$ processes may crash, this paper introduces first the $k$-resilient immediate snapshot object, which is a natural generalization of the basic immediate snapshot (which corresponds to the case $k=t=n-1$). In addition to the set containment properties of the basic immediate snapshot, a $k$-resilient immediate snapshot object requires that each set returned to a process contains at least $(n-k)$ pairs. The paper first shows that, for $k,t

Published
2020

9. Distributed Computing in the Asynchronous LOCAL model

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Fraigniaud, Pierre, and Rabie, Mikaël

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

The LOCAL model is among the main models for studying locality in the framework of distributed network computing. This model is however subject to pertinent criticisms, including the facts that all nodes wake up simultaneously, perform in lock steps, and are failure-free. We show that relaxing these hypotheses to some extent does not hurt local computing. In particular, we show that, for any construction task $T$ associated to a locally checkable labeling (LCL), if $T$ is solvable in $t$ rounds in the LOCAL model, then $T$ remains solvable in $O(t)$ rounds in the asynchronous LOCAL model. This improves the result by Casta\~neda et al. [SSS 2016], which was restricted to 3-coloring the rings. More generally, the main contribution of this paper is to show that, perhaps surprisingly, asynchrony and failures in the computations do not restrict the power of the LOCAL model, as long as the communications remain synchronous and failure-free.

Published
2019

10. Optimal Algorithms for Synchronous Byzantine k-Set Agreement

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Raynal, Michel, Safir, Mouna, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Devismes, Stéphane, editor, Petit, Franck, editor, Altisen, Karine, editor, Di Luna, Giuseppe Antonio, editor, and Fernandez Anta, Antonio, editor

Published
2022
Full Text
View/download PDF

12. A characterization of colorless anonymous $t$-resilient task computability

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, and Yanagisawa, Nayuta

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

A task is a distributed problem for $n$ processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous shared-memory model where each process has a distinct identifier that can be used to access a single-writer/multi-reader shared register. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a recent topological characterization of the colorless tasks that are solvable when any number of asynchronous processes may crash. In this paper we study the case where at most $t$ processes may crash, where $1 \le t < n$. We prove that a colorless task is $t$-resilient solvable non-anonymously if and only if it is $t$-resilient solvable anonymously. This implies a complete characterization of colorless anonymous t-resilient asynchronous task computability.

Published
2017

13. Byzantine k-Set Agreement

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Safir, Mouna, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Georgiou, Chryssis, editor, and Majumdar, Rupak, editor

Published
2021
Full Text
View/download PDF

15. Set-Consensus Collections are Decidable

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Gafni, Eli, and Kuznetsov, Petr

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, C.2.4, D.4.1
Abstract

A natural way to measure the power of a distributed-computing model is to characterize the set of tasks that can be solved in it. %the model. In general, however, the question of whether a given task can be solved in a given model is undecidable, even if we only consider the wait-free shared-memory model. In this paper, we address this question for restricted classes of models and tasks. We show that the question of whether a collection $C$ of \emph{$(\ell,j)$-set consensus} objects, for various $\ell$ (the number of processes that can invoke the object) and $j$ (the number of distinct outputs the object returns), can be used by $n$ processes to solve wait-free $k$-set consensus is decidable. Moreover, we provide a simple $O(n^2)$ decision algorithm, based on a dynamic programming solution to the Knapsack optimization problem. We then present an \emph{adaptive} wait-free set-consensus algorithm that, for each set of participating processes, achieves the best level of agreement that is possible to achieve using $C$. Overall, this gives us a complete characterization of a read-write model defined by a collection of set-consensus objects through its \emph{set-consensus power}.

Published
2016

17. Beyond One Third Byzantine Failures

Author

Wang, Cheng, Delporte-Gallet, Carole, Fauconnier, Hugues, Guerraoui, Rachid, and Kermarrec, Anne-Marie

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

The Byzantine agreement problem requires a set of $n$ processes to agree on a value sent by a transmitter, despite a subset of $b$ processes behaving in an arbitrary, i.e. Byzantine, manner and sending corrupted messages to all processes in the system. It is well known that the problem has a solution in a (an eventually) synchronous message passing distributed system iff the number of processes in the Byzantine subset is less than one third of the total number of processes, i.e. iff $n > 3b+1$. The rest of the processes are expected to be correct: they should never deviate from the algorithm assigned to them and send corrupted messages. But what if they still do? We show in this paper that it is possible to solve Byzantine agreement even if, beyond the $ b$ ($< n/3 $) Byzantine processes, some of the other processes also send corrupted messages, as long as they do not send them to all. More specifically, we generalize the classical Byzantine model and consider that Byzantine failures might be partial. In each communication step, some of the processes might send corrupted messages to a subset of the processes. This subset of processes - to which corrupted messages might be sent - could change over time. We compute the exact number of processes that can commit such faults, besides those that commit classical Byzantine failures, while still solving Byzantine agreement. We present a corresponding Byzantine agreement algorithm and prove its optimality by giving resilience and complexity bounds.

Published
2015

18. On the Space Complexity of Set Agreement

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Kuznetsov, Petr, and Ruppert, Eric

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, C.2.4, D.4.1
Abstract

The $k$-set agreement problem is a generalization of the classical consensus problem in which processes are permitted to output up to $k$ different input values. In a system of $n$ processes, an $m$-obstruction-free solution to the problem requires termination only in executions where the number of processes taking steps is eventually bounded by $m$. This family of progress conditions generalizes wait-freedom ($m=n$) and obstruction-freedom ($m=1$). In this paper, we prove upper and lower bounds on the number of registers required to solve $m$-obstruction-free $k$-set agreement, considering both one-shot and repeated formulations. In particular, we show that repeated $k$ set agreement can be solved using $n+2m-k$ registers and establish a nearly matching lower bound of $n+m-k$.

Published
2015

19. On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Raynal, Michel, Kacprzyk, Janusz, Series Editor, Pal, Nikhil R., Advisory Editor, Bello Perez, Rafael, Advisory Editor, Corchado, Emilio S., Advisory Editor, Hagras, Hani, Advisory Editor, Kóczy, László T., Advisory Editor, Kreinovich, Vladik, Advisory Editor, Lin, Chin-Teng, Advisory Editor, Lu, Jie, Advisory Editor, Melin, Patricia, Advisory Editor, Nedjah, Nadia, Advisory Editor, Nguyen, Ngoc Thanh, Advisory Editor, Wang, Jun, Advisory Editor, Barolli, Leonard, editor, Takizawa, Makoto, editor, Xhafa, Fatos, editor, and Enokido, Tomoya, editor

Published
2020
Full Text
View/download PDF

20. k-Immediate Snapshot and x-Set Agreement: How Are They Related?

Author

Delporte, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Devismes, Stéphane, editor, and Mittal, Neeraj, editor

Published
2020
Full Text
View/download PDF

21. Communication Complexity of Wait-Free Computability in Dynamic Networks

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Richa, Andrea Werneck, editor, and Scheideler, Christian, editor

Published
2020
Full Text
View/download PDF

22. Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Fraigniaud, Pierre, Rabie, Mikaël, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Ghaffari, Mohsen, editor, Nesterenko, Mikhail, editor, Tixeuil, Sébastien, editor, Tucci, Sara, editor, and Yamauchi, Yukiko, editor

Published
2019
Full Text
View/download PDF

23. Towards Synthesis of Distributed Algorithms with SMT Solvers

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Jurski, Yan, Laroussinie, François, Sangnier, Arnaud, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, Atig, Mohamed Faouzi, editor, and Schwarzmann, Alexander A., editor

Published
2019
Full Text
View/download PDF

24. Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Raynal, Michel, Goos, Gerhard, Founding Editor, Hartmanis, Juris, Founding Editor, Bertino, Elisa, Editorial Board Member, Gao, Wen, Editorial Board Member, Steffen, Bernhard, Editorial Board Member, Woeginger, Gerhard, Editorial Board Member, Yung, Moti, Editorial Board Member, and Malyshkin, Victor, editor

Published
2019
Full Text
View/download PDF

25. An Anonymous Wait-Free Weak-Set Object Implementation

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Yanagisawa, Nayuta, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Podelski, Andreas, editor, and Taïani, François, editor

Published
2019
Full Text
View/download PDF

26. Wait-Freedom with Advice

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Gafni, Eli, and Kuznetsov, Petr

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing, Computer Science - Data Structures and Algorithms
Abstract

We motivate and propose a new way of thinking about failure detectors which allows us to define, quite surprisingly, what it means to solve a distributed task \emph{wait-free} \emph{using a failure detector}. In our model, the system is composed of \emph{computation} processes that obtain inputs and are supposed to output in a finite number of steps and \emph{synchronization} processes that are subject to failures and can query a failure detector. We assume that, under the condition that \emph{correct} synchronization processes take sufficiently many steps, they provide the computation processes with enough \emph{advice} to solve the given task wait-free: every computation process outputs in a finite number of its own steps, regardless of the behavior of other computation processes. Every task can thus be characterized by the \emph{weakest} failure detector that allows for solving it, and we show that every such failure detector captures a form of set agreement. We then obtain a complete classification of tasks, including ones that evaded comprehensible characterization so far, such as renaming or weak symmetry breaking.

Published
2011

27. Algorithms For Extracting Timeliness Graphs

Author

Delporte-Gallet, Carole, Devismes, Stéphane, Fauconnier, Hugues, and Larrea, Mikel

Subjects
Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

We consider asynchronous message-passing systems in which some links are timely and processes may crash. Each run defines a timeliness graph among correct processes: (p; q) is an edge of the timeliness graph if the link from p to q is timely (that is, there is bound on communication delays from p to q). The main goal of this paper is to approximate this timeliness graph by graphs having some properties (such as being trees, rings, ...). Given a family S of graphs, for runs such that the timeliness graph contains at least one graph in S then using an extraction algorithm, each correct process has to converge to the same graph in S that is, in a precise sense, an approximation of the timeliness graph of the run. For example, if the timeliness graph contains a ring, then using an extraction algorithm, all correct processes eventually converge to the same ring and in this ring all nodes will be correct processes and all links will be timely. We first present a general extraction algorithm and then a more specific extraction algorithm that is communication efficient (i.e., eventually all the messages of the extraction algorithm use only links of the extracted graph).

Published
2010
Full Text
View/download PDF

28. Fault-Tolerant Consensus in Unknown and Anonymous Networks

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, and Tielmann, Andreas

Subjects
Computer Science - Data Structures and Algorithms, Computer Science - Distributed, Parallel, and Cluster Computing
Abstract

This paper investigates under which conditions information can be reliably shared and consensus can be solved in unknown and anonymous message-passing networks that suffer from crash-failures. We provide algorithms to emulate registers and solve consensus under different synchrony assumptions. For this, we introduce a novel pseudo leader-election approach which allows a leader-based consensus implementation without breaking symmetry.

Published
2009

30. A Characterization of t-Resilient Colorless Task Anonymous Solvability

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Yanagisawa, Nayuta, Hutchison, David, Series Editor, Kanade, Takeo, Series Editor, Kittler, Josef, Series Editor, Kleinberg, Jon M., Series Editor, Mattern, Friedemann, Series Editor, Mitchell, John C., Series Editor, Naor, Moni, Series Editor, Pandu Rangan, C., Series Editor, Steffen, Bernhard, Series Editor, Terzopoulos, Demetri, Series Editor, Tygar, Doug, Series Editor, Weikum, Gerhard, Series Editor, Lotker, Zvi, editor, and Patt-Shamir, Boaz, editor

Published
2018
Full Text
View/download PDF

34. Asynchronous Consensus with Bounded Memory

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Abdulla, Parosh Aziz, editor, and Delporte-Gallet, Carole, editor

Published
2016
Full Text
View/download PDF

35. Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Carretero, Jesus, editor, Garcia-Blas, Javier, editor, Ko, Ryan K.L., editor, Mueller, Peter, editor, and Nakano, Koji, editor

Published
2016
Full Text
View/download PDF

36. Making Local Algorithms Wait-Free: The Case of Ring Coloring

Author

Castañeda, Armando, Delporte, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Bonakdarpour, Borzoo, editor, and Petit, Franck, editor

Published
2016
Full Text
View/download PDF

37. t-Resilient Immediate Snapshot Is Impossible

Author

Delporte, Carole, Fauconnier, Hugues, Rajsbaum, Sergio, Raynal, Michel, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Suomela, Jukka, editor

Published
2016
Full Text
View/download PDF

38. A Separation of n-consensus and (n + 1)-consensus Based on Process Scheduling

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Toueg, Sam, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, and Scheideler, Christian, editor

Published
2015
Full Text
View/download PDF

41. Leader Election in Rings with Homonyms

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Tran-The, Hung, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Kobsa, Alfred, Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Weikum, Gerhard, Series editor, Noubir, Guevara, editor, and Raynal, Michel, editor

Published
2014
Full Text
View/download PDF

43. Adaptive Register Allocation with a Linear Number of Registers

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Gafni, Eli, Lamport, Leslie, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, and Afek, Yehuda, editor

Published
2013
Full Text
View/download PDF

44. Black Art: Obstruction-Free k-set Agreement with |MWMR registers| < |proccesses

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Gafni, Eli, Rajsbaum, Sergio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Gramoli, Vincent, editor, and Guerraoui, Rachid, editor

Published
2013
Full Text
View/download PDF

45. Linear Space Bootstrap Communication Schemes

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Gafni, Eli, Rajsbaum, Sergio, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Frey, Davide, editor, Raynal, Michel, editor, Sarkar, Saswati, editor, Shyamasundar, Rudrapatna K., editor, and Sinha, Prasun, editor

Published
2013
Full Text
View/download PDF

46. Uniform Consensus with Homonyms and Omission Failures

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Tran-The, Hung, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Frey, Davide, editor, Raynal, Michel, editor, Sarkar, Saswati, editor, Shyamasundar, Rudrapatna K., editor, and Sinha, Prasun, editor

Published
2013
Full Text
View/download PDF

47. Homonyms with Forgeable Identifiers

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Tran-The, Hung, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Even, Guy, editor, and Halldórsson, Magnús M., editor

Published
2012
Full Text
View/download PDF

48. Byzantine Agreement with Homonyms in Synchronous Systems

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Tran-The, Hung, Hutchison, David, Series editor, Kanade, Takeo, Series editor, Kittler, Josef, Series editor, Kleinberg, Jon M., Series editor, Mattern, Friedemann, Series editor, Mitchell, John C., Series editor, Naor, Moni, Series editor, Nierstrasz, Oscar, Series editor, Pandu Rangan, C., Series editor, Steffen, Bernhard, Series editor, Sudan, Madhu, Series editor, Terzopoulos, Demetri, Series editor, Tygar, Doug, Series editor, Vardi, Moshe Y., Series editor, Weikum, Gerhard, Series editor, Bononi, Luciano, editor, Datta, Ajoy K., editor, Devismes, Stéphane, editor, and Misra, Archan, editor

Published
2012
Full Text
View/download PDF

49. Approximation of δ-Timeliness

Author

Delporte-Gallet, Carole, Devismes, Stéphane, Fauconnier, Hugues, Dolev, Shlomi, editor, Cobb, Jorge, editor, Fischer, Michael, editor, and Yung, Moti, editor

Published
2010
Full Text
View/download PDF

50. The Minimum Information about Failures for Solving Non-local Tasks in Message-Passing Systems

Author

Delporte-Gallet, Carole, Fauconnier, Hugues, Toueg, Sam, Hutchison, David, editor, Kanade, Takeo, editor, Kittler, Josef, editor, Kleinberg, Jon M., editor, Mattern, Friedemann, editor, Mitchell, John C., editor, Naor, Moni, editor, Nierstrasz, Oscar, editor, Pandu Rangan, C., editor, Steffen, Bernhard, editor, Sudan, Madhu, editor, Terzopoulos, Demetri, editor, Tygar, Doug, editor, Vardi, Moshe Y., editor, Weikum, Gerhard, editor, Abdelzaher, Tarek, editor, Raynal, Michel, editor, and Santoro, Nicola, editor

Published
2009
Full Text
View/download PDF

Catalog

Books, media, physical & digital resources
See catalog results