2008 |
83 | EE | Yehuda Afek,
Iftah Gamzu,
Irit Levy,
Michael Merritt,
Gadi Taubenfeld:
Group Renaming.
OPODIS 2008: 58-72 |
82 | EE | Yehuda Afek,
Israel Nir:
Failure detectors in loosely named systems.
PODC 2008: 65-74 |
2007 |
81 | EE | Yehuda Afek,
Yaron De Levie:
Efficient adaptive collect algorithms.
Distributed Computing 20(3): 221-238 (2007) |
80 | EE | Yehuda Afek,
Eli Gafni,
Adam Morrison:
Common2 extended to stacks and unbounded concurrency.
Distributed Computing 20(4): 239-252 (2007) |
2006 |
79 | EE | Yehuda Afek,
Eran Shalom:
Less Is More: Consensus Gaps Between Restricted and Unrestricted Objects.
DISC 2006: 209-223 |
78 | EE | Yehuda Afek,
Eli Gafni,
Sergio Rajsbaum,
Michel Raynal,
Corentin Travers:
Simultaneous Consensus Tasks: A Tighter Characterization of Set-Consensus.
ICDCN 2006: 331-341 |
77 | EE | Yehuda Afek,
Eli Gafni,
Adam Morrison:
Common2 extended to stacks and unbounded concurrency.
PODC 2006: 218-227 |
2005 |
76 | EE | Yehuda Afek,
Yaron De Levie:
Space and Step Complexity Efficient Adaptive Collect.
DISC 2005: 384-398 |
2004 |
75 | EE | Yehuda Afek,
Anat Bremler-Barr,
Shemer Schwarz:
Improved BGP convergence via ghost flushing.
IEEE Journal on Selected Areas in Communications 22(10): 1933-1948 (2004) |
2003 |
74 | EE | Anat Bremler-Barr,
Yehuda Afek,
Shemer Schwarz:
Improved BGP Convergence via Ghost Flushing.
INFOCOM 2003 |
2002 |
73 | EE | Yehuda Afek,
Omer Ben-Shalom,
Anat Bremler-Barr:
On the structure and application of BGP policy atoms.
Internet Measurement Workshop 2002: 209-214 |
72 | EE | Yehuda Afek,
Gideon Stupp,
Dan Touitou:
Long lived adaptive splitter and applications.
Distributed Computing 15(2): 67-86 (2002) |
71 | EE | Yehuda Afek,
Anat Bremler-Barr,
Haim Kaplan,
Edith Cohen,
Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths.
Distributed Computing 15(4): 273-283 (2002) |
70 | EE | Yehuda Afek,
Shlomi Dolev:
Local Stabilizer.
J. Parallel Distrib. Comput. 62(5): 745-765 (2002) |
2001 |
69 | EE | Anat Bremler-Barr,
Yehuda Afek,
Haim Kaplan,
Edith Cohen,
Michael Merritt:
Restoration by path concatenation: fast recovery of MPLS paths.
PODC 2001: 43-52 |
68 | EE | Anat Bremler-Barr,
Yehuda Afek,
Haim Kaplan,
Edith Cohen,
Michael Merritt:
Restoration path concatenation: fast recovery of MPLS paths.
SIGMETRICS/Performance 2001: 316-317 |
67 | EE | Yehuda Afek,
Anat Bremler-Barr,
Sariel Har-Peled:
Routing with a clue.
IEEE/ACM Trans. Netw. 9(6): 693-705 (2001) |
2000 |
66 | EE | Yehuda Afek,
Anat Bremler-Barr:
Trainet: A New Label Switching Scheme.
INFOCOM 2000: 874-883 |
65 | EE | Yehuda Afek,
Gideon Stupp,
Dan Touitou:
Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract).
PODC 2000: 71-80 |
64 | EE | Yehuda Afek,
Pazi Boxer,
Dan Touitou:
Bounds on the shared memory requirements for long-lived adaptive objects (extended abstract).
PODC 2000: 81-89 |
63 | EE | Yehuda Afek,
Yishay Mansour,
Zvi Ostfeld:
Phantom: a simple and effective flow control scheme.
Computer Networks 32(3): 277-305 (2000) |
1999 |
62 | EE | Yehuda Afek,
Gideon Stupp,
Dan Touitou:
ong-lived Adaptive Collect with Applications.
FOCS 1999: 262-272 |
61 | EE | Yehuda Afek,
Michael Merritt:
Fast, Wait-Free (2k)-Renaming.
PODC 1999: 105-112 |
60 | EE | Yehuda Afek,
Hagit Attiya,
Arie Fouren,
Gideon Stupp,
Dan Touitou:
Long-Lived Renaming Made Adaptive.
PODC 1999: 91-103 |
59 | EE | Anat Bremler-Barr,
Yehuda Afek,
Sariel Har-Peled:
Routing with a Clue.
SIGCOMM 1999: 203-214 |
58 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld:
The Power of Multiobjects.
Inf. Comput. 153(1): 117-138 (1999) |
57 | | Yehuda Afek,
Yishay Mansour,
Zvi Ostfeld:
Convergence Complexity of Optimistic Rate-Based Flow-Control Algorithms.
J. Algorithms 30(1): 106-143 (1999) |
56 | | Yehuda Afek,
Eytan Weisberger:
The Instancy of Snapshots and Commuting Objects.
J. Algorithms 30(1): 68-105 (1999) |
1998 |
55 | EE | Yehuda Afek,
Anat Bremler-Barr:
Self-Stabilizing Unidirectional Network Algorithms by Power Supply.
Chicago J. Theor. Comput. Sci. 1998: (1998) |
1997 |
54 | EE | Yehuda Afek,
Shlomi Dolev:
Local Stabilizer.
ISTCS 1997: 74-84 |
53 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld,
Dan Touitou:
Disentangling Multi-Object Operations (Extended Abstract).
PODC 1997: 111-120 |
52 | | Yehuda Afek,
Shlomi Dolev:
Local Stabilizer (Brief Announcement).
PODC 1997: 287 |
51 | | Yehuda Afek,
Anat Bremler-Barr:
Self-Stabilizing Unidirectional Network Algorithms by Power-Supply (Extended Abstract).
SODA 1997: 111-120 |
50 | EE | Yehuda Afek,
Menashe Cohen,
Eyal Haalman:
The Bit Complexity of the Predecessor Problem.
Inf. Process. Lett. 63(2): 109-112 (1997) |
49 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni,
Yishay Mansour,
Adi Rosén,
Nir Shavit:
Slide-The Key to Polynomial End-to-End Communication.
J. Algorithms 22(1): 158-186 (1997) |
48 | | Yehuda Afek,
Gideon Stupp:
Optimal Time-Space Tradeoff for Shared Memory Leader Election.
J. Algorithms 25(1): 95-117 (1997) |
47 | EE | Yehuda Afek,
Shay Kutten,
Moti Yung:
The Local Detection Paradigm and Its Application to Self-Stabilization.
Theor. Comput. Sci. 186(1-2): 199-229 (1997) |
1996 |
46 | | Yehuda Afek,
Menashe Cohen,
Eyal Haalman,
Yishay Mansour:
Dynamic Bandwidth Allocation Policies.
INFOCOM 1996: 880-887 |
45 | | Yehuda Afek,
Yishay Mansour,
Zvi Ostfeld:
On the Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Brief Announcement).
PODC 1996: 212 |
44 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld:
The Power of Multi-objects (Extended Abstract).
PODC 1996: 213-222 |
43 | EE | Yehuda Afek,
Yishay Mansour,
Zvi Ostfeld:
Phantom: A Simple and Effective Flow Control Scheme.
SIGCOMM 1996: 169-182 |
42 | EE | Yehuda Afek,
Yishay Mansour,
Zvi Ostfeld:
Convergence Complexity of Optimistic Rate Based Flow Control Algorithms (Extended Abstract).
STOC 1996: 89-98 |
41 | EE | Yehuda Afek,
Baruch Awerbuch,
Serge A. Plotkin,
Michael E. Saks:
Local Management of a Global Resource in a Communication Network.
J. ACM 43(1): 1-19 (1996) |
1995 |
40 | EE | Yehuda Afek,
Dalia Dauber,
Dan Touitou:
Wait-free made fast (Extended Abstract).
STOC 1995: 538-547 |
39 | | Yehuda Afek,
Danny Hendler:
On the Comnplexity of Global Computation in the Presence of Link Failures: The General Case.
Distributed Computing 8(3): 115-120 (1995) |
38 | EE | Yehuda Afek,
David S. Greenberg,
Michael Merritt,
Gadi Taubenfeld:
Computing With Faulty Shared Objects.
J. ACM 42(6): 1231-1274 (1995) |
1994 |
37 | | Elizabeth Borowsky,
Eli Gafni,
Yehuda Afek:
Consensus Power Makes (Some) Sense! (Extended Abstract).
PODC 1994: 363-372 |
36 | | Yehuda Afek,
Gideon Stupp:
Delimiting the Power of Bounded Size Synchronization Objects (Extended Abstract).
PODC 1994: 42-51 |
35 | EE | Yehuda Afek,
Danny Dolev,
Eli Gafni,
Michael Merritt,
Nir Shavit:
A Bounded First-In, First-Enabled Solution to the l-Exclusion Problem.
ACM Trans. Program. Lang. Syst. 16(3): 939-953 (1994) |
34 | | Yehuda Afek,
Yossi Matias:
Elections in Anonymous Networks
Inf. Comput. 113(2): 312-330 (1994) |
33 | EE | 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.
J. ACM 41(6): 1267-1297 (1994) |
32 | | Yehuda Afek,
Eli Gafni:
Distributed Algorithms for Unidirectional Networks.
SIAM J. Comput. 23(6): 1152-1178 (1994) |
1993 |
31 | | Yehuda Afek,
Gideon Stupp:
Synchronization power depends on the register size (Preliminary Version)
FOCS 1993: 196-205 |
30 | | Yehuda Afek,
Danny Hendler:
On the Complexity of Global Computation in the Presence of Link Failures: The General Case.
ISTCS 1993: 160-166 |
29 | | Yehuda Afek,
Eytan Weisberger,
Hanan Weisman:
A Completeness Theorem for a Class of Synchronization Objects (Extended Abstract).
PODC 1993: 159-170 |
28 | | Yehuda Afek,
Michael Merritt,
Gadi Taubenfeld:
Benign Failure Models for Shared Memory (Preliminary Version).
WDAG 1993: 69-83 |
27 | EE | Yehuda Afek,
Geoffrey M. Brown,
Michael Merritt:
Lazy Caching.
ACM Trans. Program. Lang. Syst. 15(1): 182-205 (1993) |
26 | | Yehuda Afek,
Geoffrey M. Brown:
Self-Stabilization Over Unreliable Communication Media.
Distributed Computing 7(1): 27-34 (1993) |
25 | EE | Yehuda Afek,
Hagit Attiya,
Danny Dolev,
Eli Gafni,
Michael Merritt,
Nir Shavit:
Atomic Snapshots of Shared Memory.
J. ACM 40(4): 873-890 (1993) |
24 | | Yehuda Afek,
Moty Ricklin:
Sparser: A Paradigm for Running Distributed Algorithms.
J. Algorithms 14(2): 316-328 (1993) |
1992 |
23 | | Yehuda Afek,
Eli Gafni,
Adi Rosén:
The Slide Mechanism with Applications in Dynamic Networks (Extended Abstract).
PODC 1992: 35-46 |
22 | | Yehuda Afek,
David S. Greenberg,
Michael Merritt,
Gadi Taubenfeld:
Computing with Faulty Shared Memory (Extended Abstract).
PODC 1992: 47-58 |
21 | | Yehuda Afek,
Moty Ricklin:
Sparser: A Paradigm for Running Distributed Algorithms.
WDAG 1992: 1-10 |
20 | | Yehuda Afek,
Eli Gafni,
John Tromp,
Paul M. B. Vitányi:
Wait-free Test-and-Set (Extended Abstract).
WDAG 1992: 85-94 |
1991 |
19 | | Yehuda Afek,
Eli Gafni:
Bootstrap Network Resynchronization (Extended Abstract).
PODC 1991: 295-307 |
18 | | Yehuda Afek,
Eli Gafni:
Time and Message Bounds for Election in Synchronous and Asynchronous Complete Networks.
SIAM J. Comput. 20(2): 376-394 (1991) |
1990 |
17 | EE | Yehuda Afek,
Danny Dolev,
Hagit Attiya,
Eli Gafni,
Michael Merritt,
Nir Shavit:
Atomic Snapshots of Shared Memory.
PODC 1990: 1-13 |
16 | | Yehuda Afek,
Shay Kutten,
Moti Yung:
Memory-Efficient Self Stabilizing Protocols for General Networks.
WDAG 1990: 15-28 |
15 | | Yehuda Afek,
Danny Dolev,
Eli Gafni:
A Bounded First-In, First-Enabled Solution to the 1-Exclusion Problem.
WDAG 1990: 422-431 |
14 | | Yehuda Afek,
Gad M. Landau,
Baruch Schieber,
Moti Yung:
The Power of Multimedia: Combining Point-to-Point and Multiaccess Networks
Inf. Comput. 84(1): 97-118 (1990) |
1989 |
13 | | Yehuda Afek,
Eli Gafni,
Moty Ricklin:
Upper and Lower Bounds for Routing Schemes in Dynamic Networks (Abstract)
FOCS 1989: 370-375 |
12 | EE | Yehuda Afek,
Geoffrey M. Brown,
Michael Merritt:
A Lazy Cache Algorithm.
SPAA 1989: 209-222 |
11 | | Yehuda Afek,
Geoffrey M. Brown:
Self-Stabilization of the Alternating-Bit Protocol.
SRDS 1989: 80-83 |
10 | | Yossi Matias,
Yehuda Afek:
Simple and Efficient Election Algorithms for Anonymous Networks.
WDAG 1989: 183-194 |
1988 |
9 | EE | Eli Gafni,
Yehuda Afek:
End-to-End Communication in Unreliable Networks.
PODC 1988: 131-148 |
8 | EE | Yehuda Afek,
Gad M. Landau,
Baruch Schieber,
Moti Yung:
The Power of Multimedia: Combining Point-to Point and Multi-Access Networks.
PODC 1988: 90-104 |
1987 |
7 | | Yehuda Afek,
Baruch Awerbuch,
Serge A. Plotkin,
Michael E. Saks:
Local Management of a Global Resource in a Communication Network
FOCS 1987: 347-357 |
6 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni:
Applying Static Network Protocols to Dynamic Networks
FOCS 1987: 358-370 |
5 | | Yehuda Afek,
Michael E. Saks:
Detecting Global Termination Conditions in the Face of Uncertainty.
PODC 1987: 109-124 |
4 | | Yehuda Afek,
Baruch Awerbuch,
Eli Gafni:
Local Fail-safe Network Reset Procedure.
WDAG 1987: 197-211 |
1985 |
3 | | 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.
COMPCON 1985: 184-186 |
2 | | Yehuda Afek,
Eli Gafni:
Time and Message Bounds of Election in Synchronous and Asynchronous Complete Networks.
PODC 1985: 186-195 |
1984 |
1 | | Eli Gafni,
Yehuda Afek:
Election and Traversal in Unidirectional Networks.
PODC 1984: 190-198 |