Chagit Attiya
List of publications from the DBLP Bibliography Server - FAQ
2008 | ||
---|---|---|
112 | EE | Hagit Attiya, Eshcar Hillel: Highly-Concurrent Multi-word Synchronization. ICDCN 2008: 112-123 |
111 | EE | Hagit Attiya, Alex Kogan, Jennifer L. Welch: Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. ICDCS 2008: 321-328 |
110 | EE | Hagit Attiya, Keren Censor: Lower bounds for randomized consensus under a weak adversary. PODC 2008: 315-324 |
109 | EE | James Aspnes, Hagit Attiya, Keren Censor: Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334 |
108 | EE | Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447 |
107 | EE | Hagit Attiya, Jennifer L. Welch: A world of (Im) possibilities. PODC 2008: 461 |
106 | EE | Hagit Attiya, Rachid Guerraoui, Eric Ruppert: Partial snapshot objects. SPAA 2008: 336-343 |
105 | EE | Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226 |
104 | EE | Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. J. ACM 55(5): (2008) |
103 | EE | Hagit Attiya, David Hay: Randomization Does Not Reduce the Average Delay in Parallel Packet Switches. SIAM J. Comput. 37(5): 1613-1636 (2008) |
102 | EE | Hagit Attiya: Needed: foundations for transactional memory. SIGACT News 39(1): 59-61 (2008) |
2007 | ||
101 | EE | Hagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319 |
100 | EE | Hagit Attiya, Eshcar Hillel: The power of DCAS: highly-concurrent software transactional memory. PODC 2007: 342-343 |
99 | EE | Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164 |
2006 | ||
98 | EE | Hagit Attiya, Eshcar Hillel: Built-In Coloring for Highly-Concurrent Doubly-Linked Lists. DISC 2006: 31-45 |
97 | EE | Hagit Attiya, Faith Ellen, Panagiota Fatourou: The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330 |
96 | EE | Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov: Synchronizing without locks is inherently expensive. PODC 2006: 300-307 |
95 | EE | Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315 |
94 | EE | Hagit Attiya: Adapting to Point Contention with Long-Lived Safe Agreement . SIROCCO 2006: 10-23 |
93 | EE | Hagit Attiya, David Hay, Isaac Keslassy: Packet-mode emulation of output-queued switches. SPAA 2006: 138-147 |
92 | EE | Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer: Efficient adaptive collect using randomization. Distributed Computing 18(3): 179-188 (2006) |
91 | EE | Hagit Attiya, David Hay: The Inherent Queuing Delay of Parallel Packet Switches. IEEE Trans. Parallel Distrib. Syst. 17(9): 1048-1056 (2006) |
90 | EE | Hagit Attiya, Amir Bar-Or: Sharing Memory with Semi-byzantine Clients and Faulty Storage Servers. Parallel Processing Letters 16(4): 419-428 (2006) |
2005 | ||
89 | EE | Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov: Computing with Reads and Writes in the Absence of Step Contention. DISC 2005: 122-136 |
88 | EE | Hagit Attiya, Danny Hendler: Time and Space Lower Bounds for Implementations Using k-CAS. DISC 2005: 169-183 |
87 | EE | Hagit Attiya, David Hay, Jennifer L. Welch: Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. OPODIS 2005: 221-234 |
86 | EE | Hagit Attiya, David Hay: Randomization does not reduce the average delay in parallel packet switches. SPAA 2005: 11-20 |
2004 | ||
85 | EE | Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer: Efficient Adaptive Collect Using Randomization. DISC 2004: 159-173 |
84 | Hagit Attiya, David Hay: The Inherent Queuing Delay of Parallel Packet Switches. IFIP TCS 2004: 139-152 | |
83 | EE | Ronit Nossenson, Hagit Attiya: The N-Burst/G/1 Model with Heavy-Tailed Service-Times Distribution. MASCOTS 2004: 131-138 |
82 | EE | Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan: Lower bounds for adaptive collect and related objects. PODC 2004: 60-69 |
81 | EE | Hagit Attiya, David Hay: The inherent queuing delay of parallel packet switches. SPAA 2004: 269-270 |
80 | EE | Hagit Attiya, Hadas Shachnai: Tight bounds for FEC-based reliable multicast. Inf. Comput. 190(2): 117-135 (2004) |
79 | EE | Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg: Quantifying rollback propagation in distributed checkpointing. J. Parallel Distrib. Comput. 64(3): 370-384 (2004) |
2003 | ||
78 | EE | Hagit Attiya, Amir Bar-Or: Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers. SRDS 2003: 371-378 |
77 | EE | Ronit Nossenson, Hagit Attiya: Understanding the Distribution of File Transmission Duration in the Web. WWW (Posters) 2003 |
76 | EE | Hagit Attiya, Sergio Rajsbaum: Introduction. Distributed Computing 16(2-3): 69-70 (2003) |
75 | EE | Allon Adir, Hagit Attiya, Gil Shurek: Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture. IEEE Trans. Parallel Distrib. Syst. 14(5): 502-515 (2003) |
74 | EE | Hagit Attiya, Arie Fouren: Algorithms adapting to point contention. J. ACM 50(4): 444-468 (2003) |
2002 | ||
73 | EE | Hagit Attiya, Zvi Avidor: Wait-Free n-Set Consensus When Inputs Are Restricted. DISC 2002: 326-338 |
72 | EE | Hagit Attiya, Arie Fouren, Eli Gafni: An adaptive collect algorithm with applications. Distributed Computing 15(2): 87-96 (2002) |
71 | EE | Hagit Attiya, Vita Bortnikov: Adaptive and efficient mutual exclusion. Distributed Computing 15(3): 177-189 (2002) |
70 | EE | Hagit Attiya, Alla Gorbach, Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. Comput. 173(2): 162-183 (2002) |
69 | EE | Hagit Attiya, Sergio Rajsbaum: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM J. Comput. 31(4): 1286-1313 (2002) |
2001 | ||
68 | EE | Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg: Quantifying Rollback Propagation in Distributed Checkpointing. SRDS 2001: 36-45 |
67 | EE | Hagit Attiya, Eyal Dagan: Improved implementations of binary universal operations. J. ACM 48(5): 1013-1037 (2001) |
66 | EE | Hagit Attiya, Taly Djerassi-Shintel: Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. J. Parallel Distrib. Comput. 61(8): 1096-1109 (2001) |
65 | EE | Hagit Attiya, Arie Fouren: Adaptive and Efficient Algorithms for Lattice Agreement and Renaming. SIAM J. Comput. 31(2): 642-664 (2001) |
2000 | ||
64 | EE | Hagit Attiya, Arie Fouren: Polynominal and Adaptive Long-Lived (2k-1)-Renaming. DISC 2000: 149-163 |
63 | EE | Hagit Attiya, Vita Bortnikov: Adaptive and efficient mutual exclusion (extended abstract). PODC 2000: 91-100 |
62 | Hagit Attiya: Efficient and Robust Sharing of Memory in Message-Passing Systems. J. Algorithms 34(1): 109-127 (2000) | |
1999 | ||
61 | EE | Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou: Long-Lived Renaming Made Adaptive. PODC 1999: 91-103 |
60 | Hagit Attiya, Hadas Shachnai, Tami Tamir: Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. 28(4): 1397-1414 (1999) | |
1998 | ||
59 | EE | Hagit Attiya, Alla Gorbach, Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC 1998: 49-61 |
58 | EE | Hagit Attiya, Arie Fouren: Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). PODC 1998: 277-286 |
57 | EE | Hagit Attiya: A Direct Lower Bound for k-Set Consensus. PODC 1998: 314 |
56 | Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch: Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies. SIAM J. Comput. 27(1): 65-89 (1998) | |
55 | Hagit Attiya, Ophir Rachman: Atomic Snapshots in O(n log n) Operations. SIAM J. Comput. 27(2): 319-340 (1998) | |
54 | EE | Hagit Attiya, Roy Friedman: A Correctness Condition for High-Performance Multiprocessors. SIAM J. Comput. 27(6): 1637-1670 (1998) |
1997 | ||
53 | Hagit Attiya, Hadas Shachnai: IDABased Protocols for Reliable Multicast. OPODIS 1997: 137-152 | |
52 | EE | Hagit Attiya, Rinat Rappoport: The Level of Handshake Required for Managing a Connection. Distributed Computing 11(1): 41-57 (1997) |
51 | Rajeev Alur, Hagit Attiya, Gadi Taubenfeld: Time-Adaptive Algorithms for Synchronization. SIAM J. Comput. 26(2): 539-556 (1997) | |
1996 | ||
50 | Hagit Attiya, Eyal Dagan: Universal Operations: Unary versus Binary (Extended Abstract). PODC 1996: 223-232 | |
49 | Hagit Attiya, Sergio Rajsbaum: The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract). WDAG 1996: 322-343 | |
48 | Hagit Attiya: Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract). WDAG 1996: 56-70 | |
47 | EE | Hagit Attiya, Roy Friedman: Limitations of Fast Consistency Conditions for Distributed Shared Memories. Inf. Process. Lett. 57(5): 243-248 (1996) |
46 | Hagit Attiya, Amir Herzberg, Sergio Rajsbaum: Optimal Clock Synchronization under Different Delay Assumptions. SIAM J. Comput. 25(2): 369-389 (1996) | |
1995 | ||
45 | EE | Hagit Attiya, Shlomi Dolev, Jennifer L. Welch: Connection management without retaining information. HICSS (2) 1995: 622- |
44 | Jon M. Kleinberg, Hagit Attiya, Nancy A. Lynch: Trade-offs between Message Delivery and Quiesce Times in Conection Management Protocols (Preliminary Report). ISTCS 1995: 258-267 | |
43 | Hagit Attiya, Maurice Herlihy, Ophir Rachman: Atomic Snapshots Using Lattice Agreement. Distributed Computing 8(3): 121-132 (1995) | |
42 | Eran Aharonson, Hagit Attiya: Counting Networks with Arbitrary Fan-Out. Distributed Computing 8(4): 163-169 (1995) | |
41 | Hagit Attiya, Shlomi Dolev, Jennifer L. Welch: Connection Management Without Retaining Information. Inf. Comput. 123(2): 155-171 (1995) | |
40 | EE | Hagit Attiya, Amotz Bar-Noy, Danny Dolev: Sharing Memory Robustly in Message-Passing Systems. J. ACM 42(1): 124-142 (1995) |
1994 | ||
39 | EE | Hagit Attiya, Roy Friedman: Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). SPAA 1994: 157-166 |
38 | EE | Rajeev Alur, Hagit Attiya, Gadi Taubenfeld: Time-adaptive algorithms for synchronization. STOC 1994: 800-809 |
37 | Hagit Attiya, Rinat Rappoport: The Level of Handshake Required for Establishing a Connection. WDAG 1994: 179-193 | |
36 | Hagit Attiya, Hadas Shachnai, Tami Tamir: Local Labeling and Resource Allocation Using Preprocessing. WDAG 1994: 194-208 | |
35 | EE | Hagit Attiya, Jennifer L. Welch: Sequential Consistency versus Linearizability. ACM Trans. Comput. Syst. 12(2): 91-122 (1994) |
34 | Hagit Attiya, Nancy A. Lynch: Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty Inf. Comput. 110(1): 183-232 (1994) | |
33 | EE | Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer: Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty. J. ACM 41(1): 122-152 (1994) |
32 | EE | Hagit Attiya, Nancy A. Lynch, Nir Shavit: Are Wait-Free Algorithms Fast? J. ACM 41(4): 725-763 (1994) |
31 | 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) |
30 | Hagit Attiya, Marios Mavronicolas: Efficiency of Semisynchronous Versus. Mathematical Systems Theory 27(6): 547-571 (1994) | |
1993 | ||
29 | Hagit Attiya, Amir Herzberg, Sergio Rajsbaum: Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version). PODC 1993: 109-120 | |
28 | Hagit Attiya, Ophir Rachman: Atomic Snapshots in O(n log n) Operations (Preliminary Version). PODC 1993: 29-40 | |
27 | EE | Hagit Attiya, Soma Chaudhuri, Roy Friedman, Jennifer L. Welch: Shared Memory Consistency Conditions for Non-Sequential Execution: Definitions and Programming Strategies. SPAA 1993: 241-250 |
26 | Hagit Attiya, Taly Djerassi-Shintel: Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. WDAG 1993: 204-218 | |
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) |
1992 | ||
24 | EE | Eran Aharonson, Hagit Attiya: Counting Networks with Arbitrary Fan-Out. SODA 1992: 104-113 |
23 | Hagit Attiya, Roy Friedman: A Correctness Condition for High-Performance Multiprocessors (Extended Abstract) STOC 1992: 679-690 | |
22 | Hagit Attiya, Maurice Herlihy, Ophir Rachman: Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract). WDAG 1992: 35-53 | |
21 | Nancy A. Lynch, Hagit Attiya: Using Mappings to Prove Timing Properties. Distributed Computing 6(2): 121-139 (1992) | |
1991 | ||
20 | EE | Hagit Attiya, Jennifer L. Welch: Sequential Consistency Versus Linearizability (Extended Abstract). SPAA 1991: 304-315 |
19 | Hagit Attiya, Cynthia Dwork, Nancy A. Lynch, Larry J. Stockmeyer: Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty STOC 1991: 359-369 | |
18 | Hagit Attiya: Implementing FIFO Queus and Stacks (Extended Abstract). WDAG 1991: 80-94 | |
17 | Hagit Attiya, Marc Snir: Better Computing on the Anonymous Ring. J. Algorithms 12(2): 204-238 (1991) | |
1990 | ||
16 | Hagit Attiya, Nancy A. Lynch, Nir Shavit: Are Wait-Free Algorithms Fast? (Extended Abstract) FOCS 1990: 55-64 | |
15 | EE | Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. PODC 1990: 1-13 |
14 | EE | Nancy A. Lynch, Hagit Attiya: Using Mappings to Prove Timing Properties. PODC 1990: 265-280 |
13 | EE | Hagit Attiya, Amotz Bar-Noy, Danny Dolev: Sharing Memory Robustly in Message-Passing Systems. PODC 1990: 363-375 |
12 | EE | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk: Renaming in an Asynchronous Environment J. ACM 37(3): 524-548 (1990) |
1989 | ||
11 | Hagit Attiya, Nancy A. Lynch: Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. IEEE Real-Time Systems Symposium 1989: 268-284 | |
10 | Hagit Attiya, Danny Dolev, Nir Shavit: Bounded Polynomial Randomized Consensus. PODC 1989: 281-293 | |
9 | Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989) | |
1988 | ||
8 | Hagit Attiya, Marc Snir: Better Computing on the Anonymous Ring. AWOC 1988: 329-338 | |
7 | EE | Hagit Attiya, Marc Snir, Manfred K. Warmuth: Computing on an anonymous ring. J. ACM 35(4): 845-875 (1988) |
1987 | ||
6 | Hagit Attiya, Amotz Bar-Noy, Danny Dolev, Daphne Koller, David Peleg, Rüdiger Reischuk: Achievable Cases in an Asynchronous Environment (Extended Abstract) FOCS 1987: 337-346 | |
5 | Hagit Attiya: Constructing Efficient Election Algorithms from Efficient Traversal Algorithms. WDAG 1987: 337-344 | |
4 | Hagit Attiya, Yishay Mansour: Language Complexity on the Synchronous Anonymous Ring. Theor. Comput. Sci. 53: 169-185 (1987) | |
1985 | ||
3 | Chagit Attiya, Marc Snir, Manfred K. Warmuth: Computing on an Anonymous Ring. PODC 1985: 196-203 | |
1984 | ||
2 | EE | Sergei Nirenburg, Chagit Attiya: Towards a Data Model for Artificial Intelligence Applications. ICDE 1984: 446-453 |
1 | Chagit Attiya, Danny Dolev, Joseph Gil: Asynchronous Byzantine Consensus. PODC 1984: 119-133 |