Follow
Gadi Taubenfeld
Gadi Taubenfeld
IDC, Israel
Verified email at idc.ac.il - Homepage
Title
Cited by
Cited by
Year
Synchronization algorithms and concurrent programming
G Taubenfeld
Pearson Education, 2006
2632006
Script: A communication abstraction mechanism and its verification
N Francez, B Hailpern, G Taubenfeld
Science of Computer Programming 6, 35-88, 1986
108*1986
Computing with infinitely many processes: Under assumptions on concurrency and participation
M Merritt, G Taubenfeld
International Symposium on Distributed Computing, 164-178, 2000
1072000
Disentangling multi-object operations
Y Afek, M Merritt, G Taubenfeld, D Touitou
Proceedings of the sixteenth annual ACM symposium on Principles of …, 1997
981997
Results about fast mutual exclusion
R Alur, G Taubenfeld
Proceedings Real-Time Systems Symposium, 12, 13, 14, 15, 16, 17, 18, 19, 20 …, 1992
731992
The concurrency hierarchy, and algorithms for unbounded concurrency
E Gafni, M Merritt, G Taubenfeld
Proceedings of the twentieth annual ACM symposium on Principles of …, 2001
692001
The black-white bakery algorithm and related bounded-space, adaptive, local-spinning and FIFO algorithms
G Taubenfeld
International Symposium on Distributed Computing, 56-70, 2004
622004
Computing with faulty shared memory
Y Afek, DS Greenberg, M Merritt, G Taubenfeld
Proceedings of the eleventh annual ACM symposium on Principles of …, 1992
541992
Computing with faulty shared objects
Y Afek, DS Greenberg, M Merritt, G Taubenfeld
Journal of the ACM (JACM) 42 (6), 1231-1274, 1995
511995
Contention-sensitive data structures and algorithms
G Taubenfeld
Distributed Computing: 23rd International Symposium, DISC 2009, Elche, Spain …, 2009
50*2009
Automatic Discovery of Mutual Exclusion Algorithms: (Preliminary Version)
Y Bar-David, G Taubenfeld
International Symposium on Distributed Computing, 136-150, 2003
502003
Time-adaptive algorithms for synchronization
R Alur, H Attiya, G Taubenfeld
Proceedings of the twenty-sixth annual ACM symposium on Theory of Computing …, 1994
481994
Speeding Lamport's fast mutual exclusion algorithm
M Merritt, G Taubenfeld
Information Processing Letters 45 (3), 137-142, 1993
471993
Possibility and impossibility results in a shared memory environment
G Taubenfeld, S Moran
Acta Informatica 33 (1), 1-20, 1996
351996
Objects shared by Byzantine processes
D Malkhi, M Merritt, MK Reiter, G Taubenfeld
Distributed Computing 16, 37-48, 2003
332003
On asymmetric progress conditions
D Imbs, M Raynal, G Taubenfeld
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of …, 2010
312010
The computational structure of progress conditions
G Taubenfeld
Distributed Computing: 24th International Symposium, DISC 2010, Cambridge …, 2010
292010
Coordination without prior agreement
G Taubenfeld
Proceedings of the ACM Symposium on Principles of Distributed Computing, 325-334, 2017
272017
The computability of relaxed data structures: queues and stacks as examples
N Shavit, G Taubenfeld
Distributed Computing 29, 395-407, 2016
272016
The wakeup problem
MJ Fischer, S Moran, S Rudich, G Taubenfeld
SIAM Journal on Computing 25 (6), 1332-1357, 1996
261996
The system can't perform the operation now. Try again later.
Articles 1–20