| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Yuval Lubowich, Gadi Taubenfeld |
On the performance of distributed lock-based synchronization?  |
Operating Systems Review  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Yuval Lubowich, Gadi Taubenfeld |
On the Performance of Distributed Lock-Based Synchronization. |
ICDCN |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
Tight Space Bounds for ℓ-Exclusion. |
DISC |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
Special issue on DISC 2008. |
Distributed Computing |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
The Computational Structure of Progress Conditions. |
DISC |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Damien Imbs, Michel Raynal, Gadi Taubenfeld |
On asymmetric progress conditions. |
PODC |
2010 |
DBLP DOI BibTeX RDF |
fault-freedom, progress condition, liveness, process crash, wait-freedom, obstruction-freedom, asynchronous shared memory system, consensus number |
| 1 | Gadi Taubenfeld |
On the Computational Power of Shared Objects. |
OPODIS |
2009 |
DBLP DOI BibTeX RDF |
power numbers, k-obstruction-freedom, wait-free hierarchy, power hierarchy, universality, Shared objects, wait-freedom, consensus numbers |
| 1 | Gadi Taubenfeld |
Contention-Sensitive Data Structures and Algorithms. |
DISC |
2009 |
DBLP DOI BibTeX RDF |
Contention-sensitive, shortcut code, disable-free, prevention-free, k-obstruction-free, synchronization, locks, wait-free, starvation, livelock |
| 1 | Gadi Taubenfeld |
Shared Memory Synchronization. |
Bulletin of the EATCS |
2008 |
DBLP BibTeX RDF |
|
| 1 | Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld |
Sequentially consistent versus linearizable counting networks. |
Distributed Computing |
2008 |
DBLP DOI BibTeX RDF |
Balancing networks, Inconsistency fractions, Sequential consistency, Linearizability, Counting networks |
| 1 | Gadi Taubenfeld |
Concurrent Programming, Mutual Exclusion. |
Encyclopedia of Algorithms |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Iftah Gamzu, Irit Levy, Michael Merritt, Gadi Taubenfeld |
Group Renaming. |
OPODIS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld (eds.) |
Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings |
DISC |
2008 |
DBLP BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms. |
DISC |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Michel Raynal, Gadi Taubenfeld |
The notion of a timed register and its application to indulgent synchronization. |
SPAA |
2007 |
DBLP DOI BibTeX RDF |
test&set, timing assumption, universal object, wait-free implementation, consensus, mutual exclusion, timing constraint, contention manager, process crash, simplicity, atomic register, renaming, concurrent object, asynchronous shared memory system |
| 1 | Gadi Taubenfeld |
Computing in the Presence of Timing Failures. |
ICDCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Noga Alon, Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright |
Tight bounds for shared memory systems accessed by Byzantine processes. |
Distributed Computing |
2005 |
DBLP DOI BibTeX RDF |
Sticky bits, Shared memory, Byzantine agreement, Distributed consensus |
| 1 | Gadi Taubenfeld |
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms. |
DISC |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld |
Objects shared by Byzantine processes. |
Distributed Computing |
2003 |
DBLP DOI BibTeX RDF |
shared memory, consensus, emulation, Byzantine faults |
| 1 | Yoah Bar-David, Gadi Taubenfeld |
Automatic Discovery of Mutual Exclusion Algorithms. |
DISC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Resilient Consensus for Infinitely Many Processes. |
DISC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Yoah Bar-David, Gadi Taubenfeld |
Automatic discovery of mutual exclusion algorithms. |
PODC |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hagit Brit, Shlomo Moran, Gadi Taubenfeld |
Public data structures: counters as a special case. |
Theor. Comput. Sci. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Omer Reingold, Gadi Taubenfeld, Rebecca N. Wright |
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes. |
DISC |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Eli Gafni, Michael Merritt, Gadi Taubenfeld |
The concurrency hierarchy, and algorithms for unbounded concurrency. |
PODC |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Dahlia Malkhi, Michael Merritt, Michael K. Reiter, Gadi Taubenfeld |
Objects Shared by Byzantine Processes. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Computing with Infinitely Many Processes. |
DISC |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Michael Merritt, Gadi Taubenfeld |
The Power of Multiobjects. |
Inf. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank A. Stomp, Gadi Taubenfeld |
Constructing a Reliable Test&Set Bit. |
IEEE Trans. Parallel Distrib. Syst. |
1999 |
DBLP DOI BibTeX RDF |
Test&set bits, omission faults, gracefully degradation, reliability, wait-free algorithms |
| 1 | Marios Mavronicolas, Michael Merritt, Gadi Taubenfeld |
Sequentially Consistent versus Linearizable Counting Networks. |
PODC |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Fairness of Shared Objects. |
DISC |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Moran, Gadi Taubenfeld |
A Lower Bound on Wait-Free Counting. |
J. Algorithms |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Hagit Attiya, Gadi Taubenfeld |
Time-Adaptive Algorithms for Synchronization. |
SIAM J. Comput. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Michael Merritt, Gadi Taubenfeld, Dan Touitou |
Disentangling Multi-Object Operations (Extended Abstract). |
PODC |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld, Shlomo Moran |
Possibility and Impossibility Results in a Shared Memory Environment. |
Acta Inf. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Gadi Taubenfeld |
Contention-Free Complexity of Shared Memory Algorithms. |
Inf. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Gadi Taubenfeld |
Fast Timing-Based Algorithms. |
Distributed Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Moran, Gadi Taubenfeld, Irit Yadin |
Concurrent Counting. |
J. Comput. Syst. Sci. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld |
The Wakeup Problem. |
SIAM J. Comput. |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Frank A. Stomp, Gadi Taubenfeld |
Constructing a Reliable Test&Set Bit (Abstract). |
PODC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Michael Merritt, Gadi Taubenfeld |
The Power of Multi-objects (Extended Abstract). |
PODC |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Ruben Michel, Gadi Taubenfeld, Andrew Berman |
A connection between random variables and latin k-cubes. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld |
Computing With Faulty Shared Objects. |
J. ACM |
1995 |
DBLP DOI BibTeX RDF |
synchronization, atomic operations |
| 1 | Hagit Brit, Shlomo Moran, Gadi Taubenfeld |
Public Data Structures: Counters as a Special Case (Abridged Version). |
ISTCS |
1995 |
DBLP BibTeX RDF |
|
| 1 | Gadi Taubenfeld, Shmuel Katz, Shlomo Moran |
Impossibility Results in the Presence of Multiple Faulty Processes |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Atomic m-Register Operations. |
Distributed Computing |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Gadi Taubenfeld |
Contention-free Complexity of Shared Memory Algorithms. |
PODC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Hagit Attiya, Gadi Taubenfeld |
Time-adaptive algorithms for synchronization. |
STOC |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Fischer, Shlomo Moran, Gadi Taubenfeld |
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Speeding Lamport's Fast Mutual Exclusion Algorithm. |
Inf. Process. Lett. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Knowledge in Shared Memory Systems. |
Distributed Computing |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, Michael Merritt, Gadi Taubenfeld |
Benign Failure Models for Shared Memory (Preliminary Version). |
WDAG |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Moran, Gadi Taubenfeld |
A Lower Bound on Wait-Free Counting. |
PODC |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Gadi Taubenfeld |
How to Share an Object: A Fast Timing-Based Solution. |
SPDP |
1993 |
DBLP BibTeX RDF |
|
| 1 | David S. Greenberg, Gadi Taubenfeld, Da-Wei Wang |
Choice Coordination with Multiple Alternatives (Preliminary Version). |
WDAG |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Rajeev Alur, Gadi Taubenfeld |
Results about Fast Mutual Exclusion. |
IEEE Real-Time Systems Symposium |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Shlomo Moran, Gadi Taubenfeld, Irit Yadin |
Concurrent Counting (Extended Abstract). |
PODC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Yehuda Afek, David S. Greenberg, Michael Merritt, Gadi Taubenfeld |
Computing with Faulty Shared Memory (Extended Abstract). |
PODC |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
On the Nonexistence of Resilient Consensus Protocols. |
Inf. Process. Lett. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Atomic m-Register Operations (Extended Abstract). |
WDAG |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Merritt, Gadi Taubenfeld |
Knowledge in Shared Memory Systems (Preliminary Version). |
PODC |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael J. Fischer, Shlomo Moran, Steven Rudich, Gadi Taubenfeld |
The Wakeup Problem (Extended Abstract) |
STOC |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld, Shmuel Katz, Shlomo Moran |
Initial failures in distributed computations. |
International Journal of Parallel Programming |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld |
Leader Election in the Presence of n-1 Initial Failures. |
Inf. Process. Lett. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld, Shlomo Moran |
Possibility and Impossibility Results in a Shared Memory Environment. |
WDAG |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld, Shmuel Katz, Shlomo Moran |
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version). |
FSTTCS |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Nissim Francez, Brent Hailpern, Gadi Taubenfeld |
Script: A Communication Abstraction Mechanism and Its Verification. |
Sci. Comput. Program. |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Shmuel Katz, Gadi Taubenfeld |
What Processes Know: Definitions and Proof Methods (Preliminary Version). |
PODC |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Gadi Taubenfeld, Nissim Francez |
Proof Rules for Communication Abstractions (Abstract). |
FSTTCS |
1984 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")