Search the dblp DataBase
Yehuda Afek :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Yehuda Afek , Ronald F. Ayres , David Booth , Danny Cohen , Kathie Fry , Rick Gillespie , Joel Goldberg , Joe Green , David Hollenberg , George Lewicki , Terri Lewis , Lee Richardson , Barden Smith , Victoria Svoboda , Vance Tyree , Jasmin Witthoft Chips and Boards Through MOSIS. [Citation Graph (0, 0)][DBLP ] COMPCON, 1985, pp:184-186 [Conf ] Yehuda Afek , Baruch Awerbuch , Eli Gafni Applying Static Network Protocols to Dynamic Networks [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:358-370 [Conf ] Yehuda Afek , Baruch Awerbuch , Serge A. Plotkin , Michael E. Saks Local Management of a Global Resource in a Communication Network [Citation Graph (0, 0)][DBLP ] FOCS, 1987, pp:347-357 [Conf ] Yehuda Afek , Eli Gafni , Moty Ricklin Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1989, pp:370-375 [Conf ] Yehuda Afek , Gideon Stupp Synchronization power depends on the register size (Preliminary Version) [Citation Graph (0, 0)][DBLP ] FOCS, 1993, pp:196-205 [Conf ] Yehuda Afek , Gideon Stupp , Dan Touitou ong-lived Adaptive Collect with Applications. [Citation Graph (0, 0)][DBLP ] FOCS, 1999, pp:262-272 [Conf ] Yehuda Afek , Omer Ben-Shalom , Anat Bremler-Barr On the structure and application of BGP policy atoms. [Citation Graph (0, 0)][DBLP ] Internet Measurement Workshop, 2002, pp:209-214 [Conf ] Yehuda Afek , Anat Bremler-Barr Trainet: A New Label Switching Scheme. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2000, pp:874-883 [Conf ] Yehuda Afek , Menashe Cohen , Eyal Haalman , Yishay Mansour Dynamic Bandwidth Allocation Policies. [Citation Graph (0, 0)][DBLP ] INFOCOM, 1996, pp:880-887 [Conf ] Anat Bremler-Barr , Yehuda Afek , Shemer Schwarz Improved BGP Convergence via Ghost Flushing. [Citation Graph (0, 0)][DBLP ] INFOCOM, 2003, pp:- [Conf ] Yehuda Afek , Shlomi Dolev Local Stabilizer. [Citation Graph (0, 0)][DBLP ] ISTCS, 1997, pp:74-84 [Conf ] Yehuda Afek , Danny Hendler On the Complexity of Global Computation in the Presence of Link Failures: The General Case. [Citation Graph (0, 0)][DBLP ] ISTCS, 1993, pp:160-166 [Conf ] Yehuda Afek , Hagit Attiya , Arie Fouren , Gideon Stupp , Dan Touitou Long-Lived Renaming Made Adaptive. [Citation Graph (0, 0)][DBLP ] PODC, 1999, pp:91-103 [Conf ] Yehuda Afek , Pazi Boxer , Dan Touitou Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract). [Citation Graph (0, 0)][DBLP ] PODC, 2000, pp:81-89 [Conf ] Yehuda Afek , Shlomi Dolev Local Stabilizer (Brief Announcement). [Citation Graph (0, 0)][DBLP ] PODC, 1997, pp:287- [Conf ] Yehuda Afek , Danny Dolev , Hagit Attiya , Eli Gafni , Michael Merritt , Nir Shavit Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP ] PODC, 1990, pp:1-13 [Conf ] Yehuda Afek , Eli Gafni Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1985, pp:186-195 [Conf ] Yehuda Afek , Eli Gafni Bootstrap Network Resynchronization (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1991, pp:295-307 [Conf ] Yehuda Afek , Eli Gafni , Adam Morrison Common2 extended to stacks and unbounded concurrency. [Citation Graph (0, 0)][DBLP ] PODC, 2006, pp:218-227 [Conf ] 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 ] Yehuda Afek , Eli Gafni , Adi Rosén The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1992, pp:35-46 [Conf ] Yehuda Afek , Gad M. Landau , Baruch Schieber , Moti Yung The Power of Multimedia: Combining Point-to Point and Multi-Access Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1988, pp:90-104 [Conf ] Yehuda Afek , Michael Merritt Fast, Wait-Free (2k )-Renaming. [Citation Graph (0, 0)][DBLP ] PODC, 1999, pp:105-112 [Conf ] Yehuda Afek , Yishay Mansour , Zvi Ostfeld On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement). [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:212- [Conf ] Yehuda Afek , Michael Merritt , Gadi Taubenfeld The Power of Multi-objects (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1996, pp:213-222 [Conf ] 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 ] Yehuda Afek , Michael E. Saks Detecting Global Termination Conditions in the Face of Uncertainty. [Citation Graph (0, 0)][DBLP ] PODC, 1987, pp:109-124 [Conf ] Yehuda Afek , Gideon Stupp Delimiting the Power of Bounded Size Synchronization Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1994, pp:42-51 [Conf ] Yehuda Afek , Gideon Stupp , Dan Touitou Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract). [Citation Graph (0, 0)][DBLP ] PODC, 2000, pp:71-80 [Conf ] Yehuda Afek , Eytan Weisberger , Hanan Weisman A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1993, pp:159-170 [Conf ] Elizabeth Borowsky , Eli Gafni , Yehuda Afek Consensus Power Makes (Some) Sense! (Extended Abstract). [Citation Graph (0, 0)][DBLP ] PODC, 1994, pp:363-372 [Conf ] Anat Bremler-Barr , Yehuda Afek , Haim Kaplan , Edith Cohen , Michael Merritt Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP ] PODC, 2001, pp:43-52 [Conf ] Eli Gafni , Yehuda Afek Election and Traversal in Unidirectional Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1984, pp:190-198 [Conf ] Eli Gafni , Yehuda Afek End-to-End Communication in Unreliable Networks. [Citation Graph (0, 0)][DBLP ] PODC, 1988, pp:131-148 [Conf ] Anat Bremler-Barr , Yehuda Afek , Sariel Har-Peled Routing with a Clue. [Citation Graph (0, 0)][DBLP ] SIGCOMM, 1999, pp:203-214 [Conf ] Yehuda Afek , Yishay Mansour , Zvi Ostfeld Phantom: A Simple and Effective Flow Control Scheme. [Citation Graph (0, 0)][DBLP ] SIGCOMM, 1996, pp:169-182 [Conf ] Anat Bremler-Barr , Yehuda Afek , Haim Kaplan , Edith Cohen , Michael Merritt Restoration path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP ] SIGMETRICS/Performance, 2001, pp:316-317 [Conf ] Yehuda Afek , Anat Bremler-Barr Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract). [Citation Graph (0, 0)][DBLP ] SODA, 1997, pp:111-120 [Conf ] Yehuda Afek , Geoffrey M. Brown , Michael Merritt A Lazy Cache Algorithm. [Citation Graph (0, 0)][DBLP ] SPAA, 1989, pp:209-222 [Conf ] Yehuda Afek , Geoffrey M. Brown Self-Stabilization of the Alternating-Bit Protocol. [Citation Graph (0, 0)][DBLP ] Symposium on Reliable Distributed Systems, 1989, pp:80-83 [Conf ] Yehuda Afek , Dalia Dauber , Dan Touitou Wait-free made fast (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1995, pp:538-547 [Conf ] Yehuda Afek , Yishay Mansour , Zvi Ostfeld Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract). [Citation Graph (0, 0)][DBLP ] STOC, 1996, pp:89-98 [Conf ] Yehuda Afek , Baruch Awerbuch , Eli Gafni Local Fail-safe Network Reset Procedure. [Citation Graph (0, 0)][DBLP ] WDAG, 1987, pp:197-211 [Conf ] Yehuda Afek , Danny Dolev , Eli Gafni A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem. [Citation Graph (0, 0)][DBLP ] WDAG, 1990, pp:422-431 [Conf ] Yehuda Afek , Eli Gafni , John Tromp , Paul M. B. Vitányi Wait-free Test-and-Set (Extended Abstract). [Citation Graph (0, 0)][DBLP ] WDAG, 1992, pp:85-94 [Conf ] Yehuda Afek , Shay Kutten , Moti Yung Memory-Efficient Self Stabilizing Protocols for General Networks. [Citation Graph (0, 0)][DBLP ] WDAG, 1990, pp:15-28 [Conf ] Yehuda Afek , Yaron De Levie Space and Step Complexity Efficient Adaptive Collect. [Citation Graph (0, 0)][DBLP ] DISC, 2005, pp:384-398 [Conf ] 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 ] Yehuda Afek , Moty Ricklin Sparser: A Paradigm for Running Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] WDAG, 1992, pp:1-10 [Conf ] Yossi Matias , Yehuda Afek Simple and Efficient Election Algorithms for Anonymous Networks. [Citation Graph (0, 0)][DBLP ] WDAG, 1989, pp:183-194 [Conf ] Yehuda Afek , Eran Shalom Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects. [Citation Graph (0, 0)][DBLP ] DISC, 2006, pp:209-223 [Conf ] Yehuda Afek , Eli Gafni , Sergio Rajsbaum , Michel Raynal , Corentin Travers Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus. [Citation Graph (0, 0)][DBLP ] ICDCN, 2006, pp:331-341 [Conf ] Yehuda Afek , Anat Bremler-Barr Self-Stabilizing Unidirectional Network Algorithms by Power Supply. [Citation Graph (0, 0)][DBLP ] Chicago J. Theor. Comput. Sci., 1998, v:1998, n:, pp:- [Journal ] Yehuda Afek , Yishay Mansour , Zvi Ostfeld Phantom: a simple and effective flow control scheme. [Citation Graph (0, 0)][DBLP ] Computer Networks, 2000, v:32, n:3, pp:277-305 [Journal ] Yehuda Afek , Geoffrey M. Brown Self-Stabilization Over Unreliable Communication Media. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 1993, v:7, n:1, pp:27-34 [Journal ] Yehuda Afek , Anat Bremler-Barr , Haim Kaplan , Edith Cohen , Michael Merritt Restoration by path concatenation: fast recovery of MPLS paths. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2002, v:15, n:4, pp:273-283 [Journal ] Yehuda Afek , Danny Hendler On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 1995, v:8, n:3, pp:115-120 [Journal ] Yehuda Afek , Gideon Stupp , Dan Touitou Long lived adaptive splitter and applications. [Citation Graph (0, 0)][DBLP ] Distributed Computing, 2002, v:15, n:2, pp:67-86 [Journal ] Yehuda Afek , Yossi Matias Elections in Anonymous Networks [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1994, v:113, n:2, pp:312-330 [Journal ] 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 ] Yehuda Afek , Gad M. Landau , Baruch Schieber , Moti Yung The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks [Citation Graph (0, 0)][DBLP ] Inf. Comput., 1990, v:84, n:1, pp:97-118 [Journal ] Yehuda Afek , Menashe Cohen , Eyal Haalman The Bit Complexity of the Predecessor Problem. [Citation Graph (0, 0)][DBLP ] Inf. Process. Lett., 1997, v:63, n:2, pp:109-112 [Journal ] Yehuda Afek , Hagit Attiya , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit Atomic Snapshots of Shared Memory. [Citation Graph (0, 0)][DBLP ] J. ACM, 1993, v:40, n:4, pp:873-890 [Journal ] Yehuda Afek , Hagit Attiya , Alan Fekete , Michael J. Fischer , Nancy A. Lynch , Yishay Mansour , Da-Wei Wang , Lenore D. Zuck Reliable Communication Over Unreliable Channels. [Citation Graph (0, 0)][DBLP ] J. ACM, 1994, v:41, n:6, pp:1267-1297 [Journal ] Yehuda Afek , Baruch Awerbuch , Serge A. Plotkin , Michael E. Saks Local Management of a Global Resource in a Communication Network. [Citation Graph (0, 0)][DBLP ] J. ACM, 1996, v:43, n:1, pp:1-19 [Journal ] 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 ] Yehuda Afek , Baruch Awerbuch , Eli Gafni , Yishay Mansour , Adi Rosén , Nir Shavit Slide-The Key to Polynomial End-to-End Communication. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:22, n:1, pp:158-186 [Journal ] Yehuda Afek , Yishay Mansour , Zvi Ostfeld Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1999, v:30, n:1, pp:106-143 [Journal ] Yehuda Afek , Moty Ricklin Sparser: A Paradigm for Running Distributed Algorithms. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1993, v:14, n:2, pp:316-328 [Journal ] Yehuda Afek , Gideon Stupp Optimal Time-Space Tradeoff for Shared Memory Leader Election. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1997, v:25, n:1, pp:95-117 [Journal ] Yehuda Afek , Eytan Weisberger The Instancy of Snapshots and Commuting Objects. [Citation Graph (0, 0)][DBLP ] J. Algorithms, 1999, v:30, n:1, pp:68-105 [Journal ] Yehuda Afek , Shlomi Dolev Local Stabilizer. [Citation Graph (0, 0)][DBLP ] J. Parallel Distrib. Comput., 2002, v:62, n:5, pp:745-765 [Journal ] Yehuda Afek , Eli Gafni Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1991, v:20, n:2, pp:376-394 [Journal ] Yehuda Afek , Eli Gafni Distributed Algorithms for Unidirectional Networks. [Citation Graph (0, 0)][DBLP ] SIAM J. Comput., 1994, v:23, n:6, pp:1152-1178 [Journal ] Yehuda Afek , Shay Kutten , Moti Yung The Local Detection Paradigm and Its Application to Self-Stabilization. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1997, v:186, n:1-2, pp:199-229 [Journal ] Yehuda Afek , Anat Bremler-Barr , Sariel Har-Peled Routing with a clue. [Citation Graph (0, 0)][DBLP ] IEEE/ACM Trans. Netw., 2001, v:9, n:6, pp:693-705 [Journal ] Yehuda Afek , Geoffrey M. Brown , Michael Merritt Lazy Caching. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1993, v:15, n:1, pp:182-205 [Journal ] Yehuda Afek , Danny Dolev , Eli Gafni , Michael Merritt , Nir Shavit A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem. [Citation Graph (0, 0)][DBLP ] ACM Trans. Program. Lang. Syst., 1994, v:16, n:3, pp:939-953 [Journal ] Scalable Producer-Consumer Pools Based on Elimination-Diffraction Trees. [Citation Graph (, )][DBLP ] Group Renaming. [Citation Graph (, )][DBLP ] Failure detectors in loosely named systems. [Citation Graph (, )][DBLP ] Brief announcement: view transactions: transactional model with relaxed consistency checks. [Citation Graph (, )][DBLP ] Interrupting Snapshots and the JavaTM ^{\mbox{\tiny TM}} Size() Method. [Citation Graph (, )][DBLP ] Tight Group Renaming on Groups of Size g Is Equivalent to g-Consensus. [Citation Graph (, )][DBLP ] Brief Announcement: Quasi-Linearizability: Relaxed Consistency for Improved Concurrency. [Citation Graph (, )][DBLP ] Common2 extended to stacks and unbounded concurrency. [Citation Graph (, )][DBLP ] Efficient adaptive collect algorithms. [Citation Graph (, )][DBLP ] Search in 0.097secs, Finished in 0.103secs