Selected publications of Gadi Taubenfeld (The list does not include versions of conference papers that have beed accepted for journal publications.) |
|
Weak read/write Registers Proc. of the 14th international conf. on distributed computing and networking (ICDCN 2013), Mumbai,
India, January 2013. To appear. |
|
A closer look at fault
tolerance G. Taubenfeld |
|
Tight space bounds for l-exclusion Proceedings of the 25th international symposium on distributed computing (DISC 2011), Rome,
Italy, September 2011. In: LNCS 6950 Springer Verlag 2011,
110--124 |
|
On the performance of distributed lock-based synchronization ACM Operating Systems Review 45 (2): 28-37 (2011). Also in: Proc. of the 12th international conf. on distributed computing and networking (ICDCN 2011), Bangalore,
India, January 2011. In: LNCS 6522 Springer Verlag 2011,
131--142 |
|
The computational structure of progress conditions Proceedings of the 24th international symposium on distributed computing (DISC 2010), Cambridge,
Massachusetts, September 2010. In: LNCS 6343 Springer Verlag 2010,
221--235 |
|
On asymmetric progress
conditions D. Imbs, M. Raynal and G. Taubenfeld |
|
On
the computational power of shared objects Nimes,
France, December 2009. In: LNCS 5923 Springer Verlag 2009,
270--284 (Best paper award) |
|
Contention-sensitive data structures and algorithms Proceedings of the 23rd international symposium on distributed computing (DISC 2009), Elche,
Spain, September 2009. In: LNCS 5805 Springer Verlag 2009,
157--171 |
|
Group renaming Luxor,
Egypt, December 2008. In: LNCS 5401 Springer Verlag 2008,
58--72 |
|
Shared memory synchronization Distributed computing column of the Bulletin of the European Association for Theoretical Computer Science (BEATCS), October 2008 G. Taubenfeld |
|
Concurrent programming, mutual exclusion (1965;
Dijkstra) Encyclopedia of Algorithms (2008) 188--191 G. Taubenfeld |
Sequentially consistent versus
linearizable counting networks M. Mavronicolas, M. Merritt and G. Taubenfeld |
Efficient transformations of obstruction-free algorithms into non-blocking
algorithms Lemesos,
Cyprus, September 2007. In: LNCS 4731 Springer Verlag 2007,
450--464 |
The notion
of a timed register and its application to indulgent synchronization San Diego, CA, USA June 2007 Michel Raynal and G. Taubenfeld |
Computing in the presence of timing failures Lisboa, Portugal, July 2006 G. Taubenfeld |
Synchronization algorithms and concurrent
programming G. Taubenfeld |
Tight bounds for
shared memory systems accessed by Byzantine processes N. Alon, M. Merritt, O. Reingold, G. Taubenfeld and R. N. Wright |
The Black-White
Bakery Algorithm Amsterdam, the
Netherlands, October 2004. In: LNCS 3274 Springer Verlag 2004, 56--70 |
Objects shared by
Byzantine processes D. Malkhi, M. Merritt, M. Reiter and G. Taubenfeld |
Resilient Consensus for Infinitely Many
Processes M. Merritt and G. Taubenfeld |
Automatic discovery of mutual exclusion
algorithms Y. Bar-David and G. Taubenfeld |
Public data
structures: counters as a special case H. Brit, S. Moran, and G. Taubenfeld |
The concurrency hierarchy, and algorithms
for unbounded concurrency E. Gafni, M. Merritt and G. Taubenfeld |
Computing with infinitely many processes M. Merritt and G. Taubenfeld |
The power of multi-objects Y. Afek, M. Merritt, and G. Taubenfeld |
Constructing a reliable test&set bit F. Stomp, and G. Taubenfeld |
Fairness of shared objects M. Merritt and G. Taubenfeld |
Time-adaptive algorithms for
synchronization R. Alur, H. Attiya, and G. Taubenfeld |
A lower bound on wait-free counting S. Moran, and G. Taubenfeld |
Disentangling Multi-object Operations Y. Afek, M. Merritt, G. Taubenfeld and D. Touitou |
The wakeup problem M.J. Fischer, S. Moran, S. Rudich, and G. Taubenfeld |
Fast timing-based algorithms R. Alur, and G. Taubenfeld |
Concurrent counting S. Moran, G. Taubenfeld, and I. Yadin |
Contention-free complexity of shared
memory algorithms R. Alur, and G. Taubenfeld |
Possibility and impossibility results in a
shared memory environment G. Taubenfeld, and S. Moran |
Computing with faulty shared objects Y. Afek, D.S. Greenberg, M. Merritt, and G. Taubenfeld |
A connection between random variables and
latin k-cubes R. Michel, G. Taubenfeld, and A. Berman |
Impossibility results in the presence of
multiple faulty processes G. Taubenfeld, S. Katz, and S. Moran pdf (from FST-TCS9, Bangalore, India 1989) |
Atomic m-register operations M. Merritt, and G. Taubenfeld |
Speeding Lamport's fast mutual exclusion
algorithm M. Merritt, and G. Taubenfeld |
Knowledge in shared memory systems M. Merritt, and G. Taubenfeld |
Space-efficient asynchronous consensus
without shared memory initialization M.J. Fischer, S. Moran, and G. Taubenfeld |
How to share an object: A fast
timing-based solution R. Alur, and G. Taubenfeld |
Benign failures models for shared memory Y. Afek, M. Merritt, and G. Taubenfeld |
Choice coordination with multiple
alternatives D.S. Greenberg, G. Taubenfeld, and Da-Wei Wang |
Results about fast mutual exclusion R. Alur, and G. Taubenfeld |
On the nonexistence of resilient consensus
protocols G. Taubenfeld |
Initial failures in distributed
computations G. Taubenfeld, S. Katz, and S. Moran pdf (a bit corrupted) |
Leader election in the presence of n-1
initial failures G. Taubenfeld |
Script: A communication abstraction
mechanism and its verification N. Francez, B. Hailpern, and G. Taubenfeld |
What processes know:
definitions and proof methods S. Katz, and G. Taubenfeld |