Selected publications of Gadi Taubenfeld (The list does not include versions of conference papers that have beed accepted for journal publications.) |
From Bezout’s Identity to space-optimal election in anonymous memory systems
Proceedings of the 39th annual symposium on principles of distributed computing (PODC
2020), |
Fully anonymous consensus and set agreement algorithms Proceedings of the 8th international conference on networked systems (NETYS 2020), Virtual
event, Morocco,
June 2020. |
Leader-based De-anonymization
of an Anonymous Read/Write Memory E. Godard, D. Imbs, M. Raynal and G. Taubenfeld pdf PublisherVersion (download free until October 3, 2020) |
The computational structure of progress conditions
and shared objects Distributed Computing (2020) 33:103--123 (Preliminary versions of the results appeared in OPODIS 2009 and DISC 2010) G. Taubenfeld fullversion.pdf Publisher's version |
Mutual exclusion in fully anonymous shared memory systems
Information Processing Letters, Volume 158, June 2020. |
Genome wide epigenetic modifications as a shared memory consensus problem
arXiv:2005.06502 (May 2020). Also, in
BDA 2018 |
Fully anonymous shared memory algorithms arXiv:1909.05576 (Sept 2019). Also, brief Announcement in SSS 2019 (Pisa,
Italy, October 2019). |
Optimal memory-anonymous
symmetric deadlock-free mutual exclusion Z. Aghazadeh, D. Imbs, M. Raynal, G. Taubenfeld and P. Woelfel |
Set agreement power is not a precise characterization for oblivious deterministic anonymous objects 26th International colloquium on structural information and communication complexity (SIROCCO 2019), L'Aquila,
Italy, July 2019.
In: LNCS 11639,
293--308 (2019) |
Anonymous read/write memory: leader election and de-anonymization 26th International colloquium on structural information and communication complexity (SIROCCO 2019), L'Aquila,
Italy, July 2019.
In: LNCS 11639,
246--261 (2019) |
Mutex-based de-anonymization of an anonymous read/write memory Proceedings of the 7th international conference on networked systems (NETYS 2019), Morocco,
June 2019. |
Waiting in concurrent algorithms Computing (2019) 101:39--57 (Also in:
LNCS 9944, 2016, 345--360, NETYS 2016) |
Set agreement and renaming in the presence of contention-related crash failures 20th International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS 2018), Tokyo,
Japan, November 2018.
In: LNCS 11201
(2018) |
Distributed Computing Pearls G. Taubenfeld |
A closer look at fault
tolerance G. Taubenfeld |
Weak Failures: Definitions, Algorithms and Impossibility Results Proceedings of the 6th international conference on networked systems (NETYS 2018), Essaouira,
Morocco, May 2018. |
Mutual
exclusion algorithms with constant RMR complexity and wait-free exit code Lisboa,
Portugal, December 2017. |
Coordination without prior
agreement G. Taubenfeld |
Contention-sensitive data structures and algorithms Theoretical Computer Science, 677 (May 2017) 41–55 (Also in:
LNCS 5805, 2009,
157--171, DISC 2009) |
Fair synchronization Journal of Parallel and Distributed Computing 97:1--10, November 2016 (Also in: LNCS 8205, 2013, 179--193,
DISC 2013) |
Distributed universality (Also in:
LNCS
8878, 2014, 469--484, OPODIS 2014) |
The computability of relaxed data
structures: queues and stacks as examples |
A closer look at concurrent data structures and
algorithms |
Tight space bounds for l-exclusion (Also in: LNCS 6950 Springer Verlag 2011, 110--124, DISC 2011) G. Taubenfeld |
Computing with infinitely many processes Information and Computation 233 (2013) 12--31 (Also in: LNCS 1914 Springer Verlag 2000, 164--178, DISC 2000) M. Merritt and G. Taubenfeld |
Weak read/write Registers Proc. of the 14th international conf. on distributed computing and networking (ICDCN 2013), Mumbai,
India, January 2013. In: LNCS 7730 Springer Verlag 2013, 423--427 |
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) |
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 |
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 |