2008 |
59 | | Gadi Taubenfeld:
Distributed Computing, 22nd International Symposium, DISC 2008, Arcachon, France, September 22-24, 2008. Proceedings
Springer 2008 |
58 | EE | Yehuda Afek,
Iftah Gamzu,
Irit Levy,
Michael Merritt,
Gadi Taubenfeld:
Group Renaming.
OPODIS 2008: 58-72 |
57 | EE | Gadi Taubenfeld:
Concurrent Programming, Mutual Exclusion.
Encyclopedia of Algorithms 2008 |
56 | EE | Marios Mavronicolas,
Michael Merritt,
Gadi Taubenfeld:
Sequentially consistent versus linearizable counting networks.
Distributed Computing 21(4): 249-269 (2008) |
2007 |
55 | EE | Gadi Taubenfeld:
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms.
DISC 2007: 450-464 |
54 | EE | Michel Raynal,
Gadi Taubenfeld:
The notion of a timed register and its application to indulgent synchronization.
SPAA 2007: 200-209 |
2006 |
53 | EE | Gadi Taubenfeld:
Computing in the Presence of Timing Failures.
ICDCS 2006: 16 |
2005 |
52 | EE | Noga Alon,
Michael Merritt,
Omer Reingold,
Gadi Taubenfeld,
Rebecca N. Wright:
Tight bounds for shared memory systems accessed by Byzantine processes.
Distributed Computing 18(2): 99-109 (2005) |
2004 |
51 | EE | Gadi Taubenfeld:
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms.
DISC 2004: 56-70 |
2003 |
50 | EE | Michael Merritt,
Gadi Taubenfeld:
Resilient Consensus for Infinitely Many Processes.
DISC 2003: 1-15 |
49 | EE | Yoah Bar-David,
Gadi Taubenfeld:
Automatic Discovery of Mutual Exclusion Algorithms.
DISC 2003: 136-150 |
48 | EE | Yoah Bar-David,
Gadi Taubenfeld:
Automatic discovery of mutual exclusion algorithms.
PODC 2003: 305 |
47 | EE | Dahlia Malkhi,
Michael Merritt,
Michael K. Reiter,
Gadi Taubenfeld:
Objects shared by Byzantine processes.
Distributed Computing 16(1): 37-48 (2003) |
2002 |
46 | EE | Michael Merritt,
Omer Reingold,
Gadi Taubenfeld,
Rebecca N. Wright:
Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.
DISC 2002: 222-236 |
45 | | Hagit Brit,
Shlomo Moran,
Gadi Taubenfeld:
Public data structures: counters as a special case.
Theor. Comput. Sci. 289(1): 401-423 (2002) |
2001 |
44 | EE | Eli Gafni,
Michael Merritt,
Gadi Taubenfeld:
The concurrency hierarchy, and algorithms for unbounded concurrency.
PODC 2001: 161-169 |
2000 |
43 | EE | Michael Merritt,
Gadi Taubenfeld:
Computing with Infinitely Many Processes.
DISC 2000: 164-178 |
42 | EE | Dahlia Malkhi,
Michael Merritt,
Michael K. Reiter,
Gadi Taubenfeld:
Objects Shared by Byzantine Processes.
DISC 2000: 345-359 |
1999 |
41 | EE | Marios Mavronicolas,
Michael Merritt,
Gadi Taubenfeld:
Sequentially Consistent versus Linearizable Counting Networks.
PODC 1999: 133-142 |
40 | EE | Frank A. Stomp,
Gadi Taubenfeld:
Constructing a Reliable Test&Set Bit.
IEEE Trans. Parallel Distrib. Syst. 10(3): 252-265 (1999) |
39 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld:
The Power of Multiobjects.
Inf. Comput. 153(1): 117-138 (1999) |
1998 |
38 | EE | Michael Merritt,
Gadi Taubenfeld:
Fairness of Shared Objects.
DISC 1998: 303-317 |
1997 |
37 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld,
Dan Touitou:
Disentangling Multi-Object Operations (Extended Abstract).
PODC 1997: 111-120 |
36 | | Shlomo Moran,
Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting.
J. Algorithms 24(1): 1-19 (1997) |
35 | | Rajeev Alur,
Hagit Attiya,
Gadi Taubenfeld:
Time-Adaptive Algorithms for Synchronization.
SIAM J. Comput. 26(2): 539-556 (1997) |
1996 |
34 | | Frank A. Stomp,
Gadi Taubenfeld:
Constructing a Reliable Test&Set Bit (Abstract).
PODC 1996: 177 |
33 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld:
The Power of Multi-objects (Extended Abstract).
PODC 1996: 213-222 |
32 | | Gadi Taubenfeld,
Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment.
Acta Inf. 33(1): 1-20 (1996) |
31 | | Rajeev Alur,
Gadi Taubenfeld:
Fast Timing-Based Algorithms.
Distributed Computing 10(1): 1-10 (1996) |
30 | | Rajeev Alur,
Gadi Taubenfeld:
Contention-Free Complexity of Shared Memory Algorithms.
Inf. Comput. 126(1): 62-73 (1996) |
29 | | Shlomo Moran,
Gadi Taubenfeld,
Irit Yadin:
Concurrent Counting.
J. Comput. Syst. Sci. 53(1): 61-78 (1996) |
28 | | Michael J. Fischer,
Shlomo Moran,
Steven Rudich,
Gadi Taubenfeld:
The Wakeup Problem.
SIAM J. Comput. 25(6): 1331-1332 (1996) |
1995 |
27 | | Hagit Brit,
Shlomo Moran,
Gadi Taubenfeld:
Public Data Structures: Counters as a Special Case (Abridged Version).
ISTCS 1995: 98-110 |
26 | EE | Ruben Michel,
Gadi Taubenfeld,
Andrew Berman:
A connection between random variables and latin k-cubes.
Discrete Mathematics 146(1-3): 313-320 (1995) |
25 | EE | Yehuda Afek,
David S. Greenberg,
Michael Merritt,
Gadi Taubenfeld:
Computing With Faulty Shared Objects.
J. ACM 42(6): 1231-1274 (1995) |
1994 |
24 | | Rajeev Alur,
Gadi Taubenfeld:
Contention-free Complexity of Shared Memory Algorithms.
PODC 1994: 61-70 |
23 | EE | Rajeev Alur,
Hagit Attiya,
Gadi Taubenfeld:
Time-adaptive algorithms for synchronization.
STOC 1994: 800-809 |
22 | | Michael Merritt,
Gadi Taubenfeld:
Atomic m-Register Operations.
Distributed Computing 7(4): 213-221 (1994) |
21 | | Gadi Taubenfeld,
Shmuel Katz,
Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes
Inf. Comput. 113(2): 173-198 (1994) |
1993 |
20 | | Shlomo Moran,
Gadi Taubenfeld:
A Lower Bound on Wait-Free Counting.
PODC 1993: 251-259 |
19 | | Rajeev Alur,
Gadi Taubenfeld:
How to Share an Object: A Fast Timing-Based Solution.
SPDP 1993: 470-477 |
18 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld:
Benign Failure Models for Shared Memory (Preliminary Version).
WDAG 1993: 69-83 |
17 | | Michael Merritt,
Gadi Taubenfeld:
Knowledge in Shared Memory Systems.
Distributed Computing 7(2): 99-109 (1993) |
16 | | Michael J. Fischer,
Shlomo Moran,
Gadi Taubenfeld:
Space-Efficient Asynchronous Consensus Without Shared Memory Initialization.
Inf. Process. Lett. 45(2): 101-105 (1993) |
15 | | Michael Merritt,
Gadi Taubenfeld:
Speeding Lamport's Fast Mutual Exclusion Algorithm.
Inf. Process. Lett. 45(3): 137-142 (1993) |
1992 |
14 | EE | Rajeev Alur,
Gadi Taubenfeld:
Results about Fast Mutual Exclusion.
IEEE Real-Time Systems Symposium 1992: 12-22 |
13 | | Yehuda Afek,
David S. Greenberg,
Michael Merritt,
Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract).
PODC 1992: 47-58 |
12 | | Shlomo Moran,
Gadi Taubenfeld,
Irit Yadin:
Concurrent Counting (Extended Abstract).
PODC 1992: 59-70 |
11 | | David S. Greenberg,
Gadi Taubenfeld,
Da-Wei Wang:
Choice Coordination with Multiple Alternatives (Preliminary Version).
WDAG 1992: 54-68 |
1991 |
10 | | Michael Merritt,
Gadi Taubenfeld:
Knowledge in Shared Memory Systems (Preliminary Version).
PODC 1991: 189-200 |
9 | | Michael Merritt,
Gadi Taubenfeld:
Atomic m-Register Operations (Extended Abstract).
WDAG 1991: 289-294 |
8 | | Gadi Taubenfeld:
On the Nonexistence of Resilient Consensus Protocols.
Inf. Process. Lett. 37(5): 285-289 (1991) |
1990 |
7 | | Michael J. Fischer,
Shlomo Moran,
Steven Rudich,
Gadi Taubenfeld:
The Wakeup Problem (Extended Abstract)
STOC 1990: 106-116 |
1989 |
6 | | Gadi Taubenfeld,
Shmuel Katz,
Shlomo Moran:
Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version).
FSTTCS 1989: 109-120 |
5 | | Gadi Taubenfeld,
Shlomo Moran:
Possibility and Impossibility Results in a Shared Memory Environment.
WDAG 1989: 254-267 |
4 | | Gadi Taubenfeld:
Leader Election in the Presence of n-1 Initial Failures.
Inf. Process. Lett. 33(1): 25-28 (1989) |
1986 |
3 | | Shmuel Katz,
Gadi Taubenfeld:
What Processes Know: Definitions and Proof Methods (Preliminary Version).
PODC 1986: 249-262 |
2 | | Nissim Francez,
Brent Hailpern,
Gadi Taubenfeld:
Script: A Communication Abstraction Mechanism and Its Verification.
Sci. Comput. Program. 6(1): 35-88 (1986) |
1984 |
1 | | Gadi Taubenfeld,
Nissim Francez:
Proof Rules for Communication Abstractions (Abstract).
FSTTCS 1984: 118 |