Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch, Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. In SSS 2020. Video link for brief announcement in PODC 2020. arxivnew
Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas, Tracking in Order to Recover – Detectable Recovery of Lock-Free Data Structures. Video link for brief announcement in SPAA 2020. arxivnew
Parwat Singh Anjana, Hagit Attiya, Sweta Kumari, Sathya Peri and Archit Somani. Efficient Concurrent Execution of Smart Contracts in Blockchains using Object-based Transactional Memory, Netys 2020. (Video Link)
Eleni Kanellou, Hagit Attiya, Panagiota Fatourou and Sandeep Hans. Staleness and Local Progress in Transactional Memory, Netys 2020(Video Link)
Hagit Attiya, Constantin Enea: Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects.DISC 2019
Hagit Attiya, Arie Fouren. Lower Bounds on the Amortized Time Complexity of Shared Objects.OPODIS 2017
Hagit Attiya, Ohad Ben-Baruch, Danny Hendler.
Lower Bound on the Step Complexity of Anonymous Binary Consensus. DISC 2016: 257-268
Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski. Specification and Complexity of Collaborative Text Editing.PODC 2016: 259-268
Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch: Simulating a Shared Register in an Asynchronous System that Never Stops Changing.DISC 2015: 75-91
Hagit Attiya, Danny Hendler and Philipp Woelfel.
Trading Fences with RMRs and Separating Memory Models. PODC 2015.
Hagit Attiya, Faith Ellen and Adam Morrison
Limitations of Highly-Available Eventually-Consistent Data Stores. PODC 2015.
Hagit Attiya, Alexey Gotsman, Sandeep Hans and Noam Rinetzky.
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. DISC 2014.
Hagit Attiya, Armando Castaneda, Maurice Herlihy and Ami Paz.
Upper Bound on the Complexity of Solving Hard Renaming. PODC 2013. (Best student paper award)
Hagit Attiya, Danny Hendler and Smadar Levy.
An O(1)-Barriers Optimal RMRs Mutual Exclusion Algorithm. PODC 2013.
Hagit Attiya, Alexey Gotsman, Sandeep Hans and Noam Rinetzky.
A Programming Language Perspective on Transactional Memory Consistency.
to appear in PODC 2013. Extended version (TR)
Hagit Attiya, Sandeep Hans, Petr Kuznetsov and Srivatsan Ravi.
Safety of Deferred Update in Transactional Memory.
to appear in ICDCS 2013. arxiv
Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic and Andre Schiper
“Structured Derivation of Semi-Synchronous Algorithm”, extended abstract in DISC 2011.
Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael and Martin Vechev,
“Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot be Eliminated”, extended abstract to appear in POPL 2011. Coverage by Paul McKenney in Linux Weekly News.
H. Attiya,
“A Direct Proof of the Asynchronous Lower Bound for k-Set Consensus” Brief announcement in PODC98 (slides). Full version available as Technical Report 0930, Department of Computer Science, The Technion.
J. Kleinberg, H. Attiya and N. A. Lynch,
“Trade-Offs Between Message Delivery and Quiesce Times in Connection Management Protocols,”
ISTCS 1995. ps
H. Attiya and R. Friedman,
“Programming DEC-Alpha Based Multiprocessors the Easy Way,”
SPAA 1994. Full version available as Technical Report LPCR 9411, Department of Computer Science, Technion, October 1994.
Papers that appeared in journals (NOT UP TO DATE, REFER TO DBLP)
James Aspnes, Hagit Attiya, Keren Censor-Hillel and Faith Ellen.
“Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity”,
Journal of the ACM, Volume 62, Issue 1, Article 3, February 2015. link to ACM DL
Previously, an extended abstract in PODC 2012. new
Hagit Attiya and Alessia Milani,
“Transactional Scheduling for Read-Dominated Workloads”,
Journal of Parallel and Distributed Computing, Volume 72, Issue 10, October 2012, Pages 1386–1396. link to Science Directlocal copy
Previously, an extended abstract in OPODIS 2009. (Best paper award)
James Aspnes, Hagit Attiya and Keren Censor,
“Polylogarithmic concurrent data structures from monotone circuits”,
Journal of the ACM, Volume 59, Issue 1, Article 2, February 2012. link to ACM DL
Previously, an extended abstract in PODC 2009. new(Best student paper award)
Hagit Attiya, Alex Kogan and Jennifer Welch,
“Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks”,
accepted for publication in IEEE transactions on Mobile Computing, Volume 9, Number. 3, pp.361-375 (2010). link to IEEE DL
Previously, an extended abstract in ICDCS 2008.
Hagit Attiya, Rachid Guerraoui, Danny Hendler and Petr Kouznetsov,
“The Complexity of Obstruction-Free Implementations”,
Journal of the ACM, Volume 56, Issue 4, Article 24, June 2009. link to ACM DL
(This is the full version of our DISC05 and PODC06 papers.)
H. Attiya and David Hay,
“The Inherent Queuing Delay of Parallel Packet Switches”, IEEE Transactions on Parallel and Distributed Systems, Vol. 17, No. 9 (2006) pp.1048-1056. link to IEEE Xplore
Previously, an extended abstract in IFIP TCS 2004.
H. Attiya and Hadas Shachnai,
“IDA-Based Protocols for Reliable Multicast,” Information and Computation, Vol. 190, No. 2 (May 2004), Pages 117-135.
Previous version in OPODIS 1997.
H. Attiya and A. Fouren,
“Algorithms Adapting to Point Contention”, Journal of the ACM, Vol. 50, No. 4 (July 2003), pp. 444-468. link to ACM DL
Allon Adir, Hagit Attiya, Gil Shurek,
“Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture,” IEEE Transactions on Parallel and Distributed Systems, Vol. 14, No. 5 (2003), pp. 502-515.
H. Attiya, A. Fouren and E. Gafni,
“An Adaptive Collect Algorithm with Applications,” Distributed Computing, Vol. 15, No. 2 (2002), pp. 87-96. ps Previous version
H. Attiya and E. Dagan,
“Universal Operations: Unary versus Binary,” Journal of the ACM, Vol. 48, No. 5 (September 2001), pp. 1013-1037. ps extended abstract in PODC 96.
H. Attiya and A. Fouren,
“Adaptive and Efficient Wait-Free Algorithms for Lattice Agreement and Renaming,” Regular presentation in PODC98 (slides). SIAM Journal on Computing, Vol. 31, No. 2 (2001), pp. 642-664. ps
H. Attiya and T. Djerassi-Shintel,
“Time Bounds for Decision Problems in the Presence of Timing Uncertainties and Failures,”
Journal on Parallel and Distributed Computing, Vol. 61, No. 8, (August 2001), pp. 1096-1109. ps
H. Attiya, H. Shachnai and T. Tamir,
“Local Labeling and Resource Allocation Using Preprocessing,” SIAM Journal on Computing, Vol. 28, No. 4 (1999), pp. 1397-1414. ps
H. Attiya,
“Efficient and Robust Sharing of Memory in Message-Passing Systems,” Journal of Algorithms, Vol. 34, No. 1 (January 2000), pp. 109-127.
H. Attiya and O. Rachman,
“Atomic Snapshots in O(nlogn) Operations,” SIAM Journal on Computing, Vol. 27, No. 2 (April 1998), pp. 319-340.
H. Attiya, S. Chaudhuri, R. Friedman and J. L. Welch,
“Shared Memory Consistency Conditions for Non-Sequential Execution:
Definitions and Programming Strategies,” SIAM Journal on Computing, Vol. 27, No. 1 (February 1998), pp. 65-89.
H. Attiya and R. Rappoport,
“The Level of Handshake Required for Establishing a Connection,” Distributed Computing, Vol. 11, No. 1 (November 1997), pp. 41-57.
R. Alur, H. Attiya and G. Taubenfeld,
“Time-Adaptive Algorithms for Synchronization,” SIAM Journal on Computing, Vol. 26, No. 2 (April 1997), pp. 539–556.
H. Attiya, A. Herzberg and S. Rajsbaum,
“Clock Synchronization Under Different Delay Assumptions,” SIAM Journal on Computing, Vol. 25, No. 2 (April 1996), pp. 369-389.
H. Attiya and R. Friedman,
“Limitations of Local Consistency Conditions for Distributed Shared Memories,” Information Processing Letters, Vol. 57, No. 5, pp. 243–248.
H. Attiya, S. Dolev and J. L. Welch,
“Connection Management without Retaining Information,” Information and Control, Vol. 123, No. 2 (December 1995), pp. 155–171.
E. Aharonson and H. Attiya,
“Counting Networks with Arbitrary Fan-Out,” Distributed Computing, Vol. 8, No. 4, pp. 163–169.
H. Attiya, M. Herlihy and O. Rachman,
“Atomic Snapshots Using Lattice Agreement,” Distributed Computing, Vol. 8, No. 3, pp. 121–132.
H. Attiya, A. Bar-Noy and D. Dolev,
“Sharing Memory Robustly in Message-Passing Systems,” Journal of the ACM, Vol. 42, No. 1 (January 1995), pp. 124–142.
Y. Afek, H. Attiya, A. Fekete, M. J. Fischer, N. Lynch, Y. Mansour, D. Wang and L. D. Zuck,
“Reliable Communication Over Unreliable Channels,” Journal of the ACM, Vol. 41, No. 6 (November 1994), pp. 1267–1297.
H. Attiya and M. Mavronicolas,
“Efficiency of Semi-Synchronous versus Asynchronous Networks,”
Mathematical Systems Theory, Vol. 27 (1994), pp. 547–571.
H. Attiya, N. Lynch and N. Shavit,
“Are Wait-Free Algorithms Fast?” Journal of the ACM, Vol. 41, No. 4 (July 1994), pp. 725-763.
H. Attiya and J. L. Welch,
“Sequential Consistency versus Linearizability,” ACM Trans. on Computer Systems, Vol. 12, No. 2, pp. 99–122.
H. Attiya and N. A. Lynch,
“Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty,” Information and Computation, Vol. 110, No. 1 (April 1994), pp. 183–232.
H. Attiya, C. Dwork, N. A. Lynch and L. J. Stockmeyer,
“Bounds on the Time to Reach Agreement in the Presence of Timing Uncertainty,” Journal of the ACM, Vol. 41, No. 1 (January 1994), pp. 122–152.