List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Stellar consensus by instantiation | 2023-02-03 | Paper |
| scientific article; zbMATH DE number 7561269 (Why is no real title available?) | 2022-07-21 | Paper |
| The assignment problem Theoretical Computer Science | 2021-10-06 | Paper |
| Disk paxos Distributed Computing | 2020-12-04 | Paper |
| The BG distributed simulation algorithm Distributed Computing | 2020-12-03 | Paper |
| An adaptive collect algorithm with applications Distributed Computing | 2020-12-03 | Paper |
| A King in every two consecutive tournaments | 2019-10-21 | Paper |
| An algorithmic approach to the asynchronous computability theorem Journal of Applied and Computational Topology | 2018-11-06 | Paper |
| Elastic configuration maintenance via a parsimonious speculating snapshot solution | 2018-08-24 | Paper |
| Asynchronous computability theorems for \(t\)-resilient systems | 2018-08-16 | Paper |
| scientific article; zbMATH DE number 6905187 (Why is no real title available?) (available as arXiv preprint) | 2018-07-18 | Paper |
| A simple algorithmically reasoned characterization of wait-free computation (extended abstract) Proceedings of the sixteenth annual ACM symposium on Principles of distributed computing - PODC '97 | 2017-09-29 | Paper |
| Immediate atomic snapshots and fast renaming Proceedings of the twelfth annual ACM symposium on Principles of distributed computing - PODC '93 | 2017-09-29 | Paper |
| Consensus power makes (some) sense! (extended abstract) Proceedings of the thirteenth annual ACM symposium on Principles of distributed computing - PODC '94 | 2017-09-29 | Paper |
| Deterministic objects: life beyond consensus Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| Brief announcement: Asynchronous coordination with constraints and preferences Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing | 2017-09-29 | Paper |
| The slide mechanism with applications in dynamic networks (extended abstract) Proceedings of the eleventh annual ACM symposium on Principles of distributed computing - PODC '92 | 2017-08-21 | Paper |
| Asynchronous coordination under preferences and constraints Structural Information and Communication Complexity | 2016-12-01 | Paper |
| The concurrency hierarchy, and algorithms for unbounded concurrency Proceedings of the twentieth annual ACM symposium on Principles of distributed computing | 2016-03-04 | Paper |
| Round-by-round fault detectors (extended abstract), unifying synchrony and asynchrony Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
| Structured derivations of consensus algorithms for failure detectors Proceedings of the seventeenth annual ACM symposium on Principles of distributed computing - PODC '98 | 2016-03-02 | Paper |
| Analysis of timing-based mutual exclusion with random times Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing | 2015-09-11 | Paper |
| A generalized asynchronous computability theorem Proceedings of the 2014 ACM symposium on Principles of distributed computing | 2015-09-03 | Paper |
| Bootstrap network resynchronization (extended abstract) Proceedings of the tenth annual ACM symposium on Principles of distributed computing - PODC '91 | 2015-06-19 | Paper |
| Generalized FLP impossibility result for t-resilient asynchronous computations Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 | 2015-05-07 | Paper |
| Wait-freedom with advice Distributed Computing | 2015-03-25 | Paper |
| Common2 extended to stacks and unbounded concurrency Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
| The extended BG-simulation and the characterization of t-resiliency Proceedings of the forty-first annual ACM symposium on Theory of computing | 2015-02-04 | Paper |
| Musical Chairs SIAM Journal on Discrete Mathematics | 2014-12-22 | Paper |
| Wait-freedom with advice Proceedings of the 2012 ACM symposium on Principles of distributed computing | 2014-12-05 | Paper |
| A simple characterization of asynchronous computations Theoretical Computer Science | 2014-12-02 | Paper |
| Linear space bootstrap communication schemes Theoretical Computer Science | 2014-12-02 | Paper |
| The weakest failure detector for solving \(k\)-set agreement Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
| Sporadic solutions to zero-one exclusion tasks Automata, Languages, and Programming | 2014-07-01 | Paper |
| The \(k\)-simultaneous consensus problem Distributed Computing | 2013-06-28 | Paper |
| Renaming in synchronous message passing systems with Byzantine failures Distributed Computing | 2013-06-20 | Paper |
| Common2 extended to stacks and unbounded concurrency Distributed Computing | 2013-06-20 | Paper |
| The mailbox problem Distributed Computing | 2012-02-06 | Paper |
| On set consensus numbers Distributed Computing | 2012-02-06 | Paper |
| Oblivious Collaboration Lecture Notes in Computer Science | 2011-10-28 | Paper |
| Generalized Universality CONCUR 2011 – Concurrency Theory | 2011-09-02 | Paper |
| The complexity of early deciding set agreement SIAM Journal on Computing | 2011-05-17 | Paper |
| The complexity of early deciding set agreement SIAM Journal on Computing | 2011-05-17 | Paper |
| From a static impossibility to an adaptive lower bound: the complexity of early deciding set agreement Proceedings of the thirty-seventh annual ACM symposium on Theory of computing | 2010-08-16 | Paper |
| Uniform solvability with a finite number of MWMR registers. (Extended abstract) Lecture Notes in Computer Science | 2010-02-23 | Paper |
| On Set Consensus Numbers Lecture Notes in Computer Science | 2009-11-19 | Paper |
| Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus Lecture Notes in Computer Science | 2009-11-19 | Paper |
| From adaptive renaming to set agreement Theoretical Computer Science | 2009-03-30 | Paper |
| The Mailbox Problem Lecture Notes in Computer Science | 2008-11-20 | Paper |
| The Committee Decision Problem LATIN 2006: Theoretical Informatics | 2008-09-18 | Paper |
| Subconsensus Tasks: Renaming Is Weaker Than Set Agreement Lecture Notes in Computer Science | 2008-09-09 | Paper |
| N-Consensus is the Second Strongest Object for N + 1 Processes Lecture Notes in Computer Science | 2008-04-22 | Paper |
| STACS 2004 Lecture Notes in Computer Science | 2007-10-01 | Paper |
| Distributed Computing Lecture Notes in Computer Science | 2006-11-01 | Paper |
| Group-Solvability Lecture Notes in Computer Science | 2005-08-17 | Paper |
| Analysis of timing-based mutual exclusion with random times SIAM Journal on Computing | 2002-04-23 | Paper |
| scientific article; zbMATH DE number 1696684 (Why is no real title available?) | 2002-01-28 | Paper |
| scientific article; zbMATH DE number 1418306 (Why is no real title available?) | 2000-03-19 | Paper |
| Three-Processor Tasks Are Undecidable SIAM Journal on Computing | 1999-02-22 | Paper |
| Slide—The Key to Polynomial End-to-End Communication Journal of Algorithms | 1997-03-18 | Paper |
| Distributed Algorithms For Unidirectional Networks SIAM Journal on Computing | 1995-04-06 | Paper |
| Atomic snapshots of shared memory Journal of the ACM | 1994-03-20 | Paper |
| Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks SIAM Journal on Computing | 1991-01-01 | Paper |
| On separating the EREW and CREW PRAM models Theoretical Computer Science | 1989-01-01 | Paper |
| Sorting in constant number of row and column phases on a mesh Algorithmica | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4058842 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4055050 (Why is no real title available?) | 1988-01-01 | Paper |
| Asymptotic optimality of shortest path routing algorithms IEEE Transactions on Information Theory | 1987-01-01 | Paper |
| Distributed sorting algorithms for multi-channel broadcast networks Theoretical Computer Science | 1987-01-01 | Paper |
| Two-Metric Projection Methods for Constrained Optimization SIAM Journal on Control and Optimization | 1984-01-01 | Paper |
| Second Derivative Algorithms for Minimum Delay Distributed Routing in Networks IEEE Transactions on Communications | 1984-01-01 | Paper |
| Dynamic control of session input rates in communication networks IEEE Transactions on Automatic Control | 1984-01-01 | Paper |
| Projected Newton methods and optimization of multicommodity flows IEEE Transactions on Automatic Control | 1983-01-01 | Paper |
| Projection methods for variational inequalities with application to the traffic assignment problem Mathematical Programming Studies | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3666554 (Why is no real title available?) | 1979-01-01 | Paper |
Research outcomes over time
This page was built for person: Eli Gafni
