Gadi Taubenfeld

According to our database1, Gadi Taubenfeld
  • authored at least 83 papers between 1984 and 2016.
  • has a "Dijkstra number"2 of three.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2016
Concurrent Programming, Mutual Exclusion.
Encyclopedia of Algorithms, 2016

Fair synchronization.
J. Parallel Distrib. Comput., 2016

The computability of relaxed data structures: queues and stacks as examples.
Distributed Computing, 2016

Distributed Universality.
Algorithmica, 2016

Brief Announcement: Computing in the Presence of Weak Crash Failures.
Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing, 2016

Waiting in Concurrent Algorithms.
Proceedings of the Networked Systems - 4th International Conference, 2016

2015
Special issue on PODC 2013.
Distributed Computing, 2015

The Computability of Relaxed Data Structures: Queues and Stacks as Examples.
Proceedings of the Structural Information and Communication Complexity, 2015

2014
Tight space bounds for #8467;-exclusion.
Distributed Computing, 2014

Brief announcement: distributed universality: contention-awareness; wait-freedom; object progress, and other properties.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2014

Distributed Universality.
Proceedings of the Principles of Distributed Systems - 18th International Conference, 2014

2013
Computing with infinitely many processes.
Inf. Comput., 2013

Fair Synchronization.
Proceedings of the Distributed Computing - 27th International Symposium, 2013

Weak Read/Write Registers.
Proceedings of the Distributed Computing and Networking, 14th International Conference, 2013

2012
A closer look at fault tolerance.
Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011
On the performance of distributed lock-based synchronization?
Operating Systems Review, 2011

Tight Space Bounds for ℓ-Exclusion.
Proceedings of the Distributed Computing - 25th International Symposium, 2011

On the Performance of Distributed Lock-Based Synchronization.
Proceedings of the Distributed Computing and Networking - 12th International Conference, 2011

2010
Special issue on DISC 2008.
Distributed Computing, 2010

The Computational Structure of Progress Conditions.
Proceedings of the Distributed Computing, 24th International Symposium, 2010

On asymmetric progress conditions.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

2009
Contention-Sensitive Data Structures and Algorithms.
Proceedings of the Distributed Computing, 23rd International Symposium, 2009

On the Computational Power of Shared Objects.
Proceedings of the Principles of Distributed Systems, 13th International Conference, 2009

2008
Concurrent Programming, Mutual Exclusion.
Proceedings of the Encyclopedia of Algorithms, 2008

Shared Memory Synchronization.
Bulletin of the EATCS, 2008

Sequentially consistent versus linearizable counting networks.
Distributed Computing, 2008

Group Renaming.
Proceedings of the Principles of Distributed Systems, 12th International Conference, 2008

2007
Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

The notion of a timed register and its application to indulgent synchronization.
Proceedings of the SPAA 2007: Proceedings of the 19th Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2007

2006
Computing in the Presence of Timing Failures.
Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (ICDCS 2006), 2006

2005
Tight bounds for shared memory systems accessed by Byzantine processes.
Distributed Computing, 2005

2004
The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms.
Proceedings of the Distributed Computing, 18th International Conference, 2004

2003
Objects shared by Byzantine processes.
Distributed Computing, 2003

Resilient Consensus for Infinitely Many Processes.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Automatic Discovery of Mutual Exclusion Algorithms.
Proceedings of the Distributed Computing, 17th International Conference, 2003

Automatic discovery of mutual exclusion algorithms.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

2002
Public data structures: counters as a special case.
Theor. Comput. Sci., 2002

Tight Bounds for Shared Memory Systems Accessed by Byzantine Processes.
Proceedings of the Distributed Computing, 16th International Conference, 2002

2001
The concurrency hierarchy, and algorithms for unbounded concurrency.
Proceedings of the Twentieth Annual ACM Symposium on Principles of Distributed Computing, 2001

2000
Computing with Infinitely Many Processes.
Proceedings of the Distributed Computing, 14th International Conference, 2000

Objects Shared by Byzantine Processes.
Proceedings of the Distributed Computing, 14th International Conference, 2000

1999
Constructing a Reliable Test&Set Bit.
IEEE Trans. Parallel Distrib. Syst., 1999

The Power of Multiobjects.
Inf. Comput., 1999

Sequentially Consistent versus Linearizable Counting Networks.
Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

1998
Fairness of Shared Objects.
Proceedings of the Distributed Computing, 12th International Symposium, 1998

1997
Time-Adaptive Algorithms for Synchronization.
SIAM J. Comput., 1997

A Lower Bound on Wait-Free Counting.
J. Algorithms, 1997

Disentangling Multi-Object Operations (Extended Abstract).
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

1996
The Wakeup Problem.
SIAM J. Comput., 1996

Concurrent Counting.
J. Comput. Syst. Sci., 1996

Contention-Free Complexity of Shared Memory Algorithms.
Inf. Comput., 1996

Fast Timing-Based Algorithms.
Distributed Computing, 1996

Possibility and Impossibility Results in a Shared Memory Environment.
Acta Inf., 1996

Constructing a Reliable Test&Set Bit (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

The Power of Multi-objects (Extended Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Computing With Faulty Shared Objects.
J. ACM, 1995

A connection between random variables and latin k-cubes.
Discrete Mathematics, 1995

Public Data Structures: Counters as a Special Case (Abridged Version).
Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

1994
Impossibility Results in the Presence of Multiple Faulty Processes
Inf. Comput., September, 1994

Atomic m-Register Operations.
Distributed Computing, 1994

Time-adaptive algorithms for synchronization.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Theory of Computing, 1994

Contention-free Complexity of Shared Memory Algorithms.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1993
Speeding Lamport's Fast Mutual Exclusion Algorithm.
Inf. Process. Lett., 1993

Space-Efficient Asynchronous Consensus Without Shared Memory Initialization.
Inf. Process. Lett., 1993

Knowledge in Shared Memory Systems.
Distributed Computing, 1993

Benign Failure Models for Shared Memory (Preliminary Version).
Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

How to Share an Object: A Fast Timing-Based Solution.
Proceedings of the Fifth IEEE Symposium on Parallel and Distributed Processing, 1993

A Lower Bound on Wait-Free Counting.
Proceedings of the Twelth Annual ACM Symposium on Principles of Distributed Computing, 1993

1992
Choice Coordination with Multiple Alternatives (Preliminary Version).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

Results about Fast Mutual Exclusion.
Proceedings of the Real-Time Systems Symposium, 1992

Concurrent Counting (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

Computing with Faulty Shared Memory (Extended Abstract).
Proceedings of the Eleventh Annual ACM Symposium on Principles of Distributed Computing, 1992

1991
On the Nonexistence of Resilient Consensus Protocols.
Inf. Process. Lett., 1991

Atomic m-Register Operations (Extended Abstract).
Proceedings of the Distributed Algorithms, 5th International Workshop, 1991

Knowledge in Shared Memory Systems (Preliminary Version).
Proceedings of the Tenth Annual ACM Symposium on Principles of Distributed Computing, 1991

1990
The Wakeup Problem (Extended Abstract)
Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989
Leader Election in the Presence of n-1 Initial Failures.
Inf. Process. Lett., 1989

Initial failures in distributed computations.
International Journal of Parallel Programming, 1989

Possibility and Impossibility Results in a Shared Memory Environment.
Proceedings of the Distributed Algorithms, 1989

Impossibility Results in the Presence of Multiple Faulty Processes (Preliminary Version).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1986
Script: A Communication Abstraction Mechanism and Its Verification.
Sci. Comput. Program., 1986

What Processes Know: Definitions and Proof Methods (Preliminary Version).
Proceedings of the Fifth Annual ACM Symposium on Principles of Distributed Computing, 1986

1984
Proof Rules for Communication Abstractions (Abstract).
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1984


  Loading...