The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Gadi Taubenfeld: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

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

  56. Group Renaming. [Citation Graph (, )][DBLP]


  57. On the Computational Power of Shared Objects. [Citation Graph (, )][DBLP]


  58. On asymmetric progress conditions. [Citation Graph (, )][DBLP]


  59. Contention-Sensitive Data Structures and Algorithms. [Citation Graph (, )][DBLP]


  60. The Computational Structure of Progress Conditions. [Citation Graph (, )][DBLP]


  61. Sequentially consistent versus linearizable counting networks. [Citation Graph (, )][DBLP]


Search in 0.020secs, Finished in 0.021secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002