default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHagit Attiya
Chagit Attiya
Person information
- affiliation: Technion - Israel Institute of Technology, Haifa, Israel
- award (2011): Dijkstra Prize
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j94]Hagit Attiya:
Special issue on PODC 2021 and DISC 2021. Distributed Comput. 37(1): 65 (2024)- [j93]Hagit Attiya, Arie Fouren, Jeremy Ko:
Lower Bounds on the Amortized Time Complexity of Shared Objects. Theory Comput. Syst. 68(5): 1372-1426 (2024) - [c139]Hagit Attiya
, Michael A. Bender, Martín Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. PODC 2024: 14-24 - [c138]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. PODC 2024: 432-442 - [c137]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
Brief Announcement: Solvability of Three-Process General Tasks. DISC 2024: 42:1-42:7 - [i24]Hagit Attiya, Armando Castañeda, Constantin Enea:
Strong Linearizability using Primitives with Consensus Number 2. CoRR abs/2402.13618 (2024) - [i23]Hagit Attiya, Michael A. Bender, Martin Farach-Colton, Rotem Oshman, Noa Schiller:
History-Independent Concurrent Objects. CoRR abs/2403.14445 (2024) - 2023
- [j92]Hagit Attiya:
Special issue on DISC 2019. Distributed Comput. 36(1): 1 (2023) - [j91]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally solvable tasks and the limitations of valency arguments. J. Parallel Distributed Comput. 176: 28-40 (2023) - [c136]Hagit Attiya, Noa Schiller:
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CIAC 2023: 52-66 - [c135]Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. CONCUR 2023: 27:1-27:17 - [c134]Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. OPODIS 2023: 4:1-4:23 - [c133]Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. OPODIS 2023: 6:1-6:23 - [c132]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. OPODIS 2023: 24:1-24:22 - [c131]Hagit Attiya, Jennifer L. Welch:
Bounds on Worst-Case Responsiveness for Agreement Algorithms. OPODIS 2023: 32:1-32:22 - [c130]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. DISC 2023: 4:1-4:23 - [c129]Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. DISC 2023: 5:1-5:21 - [c128]Hagit Attiya, Jennifer L. Welch:
Brief Announcement: Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. DISC 2023: 36:1-36:7 - [c127]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Brief Announcement: Recoverable and Detectable Self-Implementations of Swap. DISC 2023: 44:1-44:7 - [i22]Hagit Attiya, Armando Castañeda, Thomas Nowak:
Topological Characterization of Task Solvability in General Models of Computation. CoRR abs/2301.13837 (2023) - [i21]Tomer Lev Lehman, Hagit Attiya, Danny Hendler:
Recoverable and Detectable Self-Implementations of Swap. CoRR abs/2308.03485 (2023) - [i20]Hagit Attiya, Pierre Fraigniaud, Ami Paz, Sergio Rajsbaum:
One Step Forward, One Step Back: FLP-Style Proofs and the Round-Reduction Technique for Colorless Tasks. CoRR abs/2308.04213 (2023) - [i19]Hagit Attiya, Jennifer L. Welch:
Multi-Valued Connected Consensus: A New Perspective on Crusader Agreement and Adopt-Commit. CoRR abs/2308.04646 (2023) - [i18]Hagit Attiya, Antonella Del Pozzo, Alessia Milani, Ulysse Pavloff, Alexandre Rapetti:
The Synchronization Power of Auditable Registers. CoRR abs/2308.16600 (2023) - [i17]Hagit Attiya, Constantin Enea, Shafik Nassar:
Faithful Simulation of Randomized BFT Protocols on Block DAGs. IACR Cryptol. ePrint Arch. 2023: 192 (2023) - 2022
- [j90]Hagit Attiya:
Special issue on PODC 2020. Distributed Comput. 35(4): 303 (2022) - [j89]Hagit Attiya:
Special issue on DISC 2020. Distributed Comput. 35(6): 475 (2022) - [j88]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-collect in the presence of continuous churn with application to snapshots and lattice agreement. Inf. Comput. 285(Part): 104869 (2022) - [j87]Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin:
Separating lock-freedom from wait-freedom at every level of the consensus hierarchy. J. Parallel Distributed Comput. 163: 181-197 (2022) - [c126]Yehonatan Fridman, Yaniv Snir, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
Recovery of Distributed Iterative Solvers for Linear Systems Using Non-Volatile RAM. FTXS@SC 2022: 11-23 - [c125]Hagit Attiya, Faith Ellen:
The Step Complexity of Multidimensional Approximate Agreement. OPODIS 2022: 6:1-6:12 - [c124]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Blunting an Adversary Against Randomized Concurrent Programs with Linearizable Implementations. PODC 2022: 209-219 - [c123]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Detectable recovery of lock-free data structures. PPoPP 2022: 262-277 - [d2]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking: PPoPP 22 - Detectable Recovery of Lock-Free Data Structures. Version v.1.0.1. Zenodo, 2022 [all versions]
- [i16]Hagit Attiya, Noa Schiller:
Asynchronous Fully-Decentralized SGD in the Cluster-Based Model. CoRR abs/2202.10862 (2022) - [i15]Yehonatan Fridman, Yaniv Snir, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
NVM-ESR: Using Non-Volatile Memory in Exact State Reconstruction of Preconditioned Conjugate Gradient. CoRR abs/2204.11584 (2022) - [i14]Hagit Attiya, Constantin Enea, Sergio Rajsbaum, Ana Sokolova:
Formal Methods and Distributed Computing: Stronger Together (Dagstuhl Seminar 22492). Dagstuhl Reports 12(12): 27-53 (2022) - 2021
- [j86]Hagit Attiya:
Special issue on PODC 2018 and DISC 2018. Distributed Comput. 34(4): 227 (2021) - [j85]Hagit Attiya:
Special issue on PODC 2019. Distributed Comput. 34(6): 411 (2021) - [j84]Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and space complexity of collaborative text editing. Theor. Comput. Sci. 855: 141-160 (2021) - [c122]Yehonatan Fridman, Yaniv Snir, Matan Rusanovsky, Kfir Zvi, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing. FTXS@SC 2021: 11-20 - [c121]Liad Nahum, Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Recoverable and Detectable Fetch&Add. OPODIS 2021: 29:1-29:17 - [c120]Marcos K. Aguilera, Hagit Attiya, Christian Cachin, Alessandro Panconesi:
2021 Principles of Distributed Computing Doctoral Dissertation Award. PODC 2021: 3 - [c119]Matan Rusanovsky, Hagit Attiya, Ohad Ben-Baruch, Tom Gerby, Danny Hendler, Pedro Ramalhete:
Flat-Combining-Based Persistent Data Structures for Non-volatile Memory. SSS 2021: 505-509 - [c118]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. DISC 2021: 7:1-7:18 - [d1]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
PPoPP 22 - Detectable Recovery of Lock-Free Data Structures. Version v.1.0.0. Zenodo, 2021 [all versions] - [i13]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Impossibility of Strongly-Linearizable Message-Passing Objects via Simulation by Single-Writer Registers. CoRR abs/2105.06614 (2021) - [i12]Hagit Attiya, Constantin Enea, Jennifer L. Welch:
Linearizable Implementations Suffice for Termination of Randomized Concurrent Programs. CoRR abs/2106.15554 (2021) - [i11]Yehonatan Fridman, Yaniv Snir, Matan Rusanovsky, Kfir Zvi, Harel Levin, Danny Hendler, Hagit Attiya, Gal Oren:
Assessing the Use Cases of Persistent Memory in High-Performance Scientific Computing. CoRR abs/2109.02166 (2021) - 2020
- [j83]Hagit Attiya, Sergio Rajsbaum:
Indistinguishability. Commun. ACM 63(5): 90-99 (2020) - [j82]Hagit Attiya:
Editorial: Special issue of PODC 2017 and DISC 2017. Distributed Comput. 33(3-4): 207 (2020) - [c117]Parwat Singh Anjana, Hagit Attiya, Sweta Kumari, Sathya Peri, Archit Somani:
Efficient Concurrent Execution of Smart Contracts in Blockchains Using Object-Based Transactional Memory. NETYS 2020: 77-93 - [c116]Hagit Attiya, Panagiota Fatourou, Sandeep Hans, Eleni Kanellou:
Staleness and Local Progress in Transactional Memory. NETYS 2020: 227-243 - [c115]Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems That Mix Shared Memory and Message Passing. OPODIS 2020: 16:1-16:16 - [c114]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. OPODIS 2020: 18:1-18:16 - [c113]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Brief Announcement: Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. PODC 2020: 51-53 - [c112]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover - Detectable Recovery of Lock-Free Data Structures. SPAA 2020: 503-505 - [c111]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. SSS 2020: 1-15 - [e2]Hagit Attiya:
34th International Symposium on Distributed Computing, DISC 2020, October 12-16, 2020, Virtual Conference. LIPIcs 179, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-168-9 [contents] - [i10]Hagit Attiya, Sweta Kumari, Archit Somani, Jennifer L. Welch:
Store-Collect in the Presence of Continuous Churn with Application to Snapshots and Lattice Agreement. CoRR abs/2003.07787 (2020) - [i9]Hagit Attiya, Armando Castañeda, Sergio Rajsbaum:
Locally Solvable Tasks and the Limitations of Valency Arguments. CoRR abs/2011.10436 (2020) - [i8]Hagit Attiya, Sweta Kumari, Noa Schiller:
Optimal Resilience in Systems that Mix Shared Memory and Message Passing. CoRR abs/2012.10846 (2020)
2010 – 2019
- 2019
- [j81]Hagit Attiya:
Special issue on PODC 2015 and PODC 2016. Distributed Comput. 32(6): 459 (2019) - [j80]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Bounds on the Step and Namespace Complexity of Renaming. SIAM J. Comput. 48(1): 1-32 (2019) - [j79]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Emulating a Shared Register in a System That Never Stops Changing. IEEE Trans. Parallel Distributed Syst. 30(3): 544-559 (2019) - [c110]Hagit Attiya, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programsthat Use Concurrent Objects. DISC 2019: 2:1-2:17 - [c109]Artem Khyzha, Hagit Attiya, Alexey Gotsman:
Privatization-Safe Transactional Memories. DISC 2019: 24:1-24:17 - [p4]Hagit Attiya, Jennifer L. Welch:
Shared memory and the Bakery algorithm. Concurrency: the Works of Leslie Lamport 2019: 27-46 - [i7]Hagit Attiya, Constantin Enea:
Putting Strong Linearizability in Context: Preserving Hyperproperties in Programs that Use Concurrent Objects. CoRR abs/1905.12063 (2019) - [i6]Hagit Attiya, Ohad Ben-Baruch, Panagiota Fatourou, Danny Hendler, Eleftherios Kosmas:
Tracking in Order to Recover: Recoverable Lock-Free Data Structures. CoRR abs/1905.13600 (2019) - [i5]Artem Khyzha, Hagit Attiya, Alexey Gotsman:
Privatization-Safe Transactional Memories (Extended Version). CoRR abs/1908.03179 (2019) - 2018
- [j78]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Characterizing Transactional Memory Consistency Conditions Using Observational Refinement. J. ACM 65(1): 2:1-2:44 (2018) - [j77]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Erratum: Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 65(6): 38:1-38:2 (2018) - [j76]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and universal helping for wait-free queues and stacks. J. Parallel Distributed Comput. 121: 1-14 (2018) - [c108]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Nesting-Safe Recoverable Linearizability: Modular Constructions for Non-Volatile Memory. PODC 2018: 7-16 - [c107]Hagit Attiya, Armando Castañeda, Danny Hendler, Matthieu Perrin:
Separating Lock-Freedom from Wait-Freedom. PODC 2018: 41-50 - [c106]Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky:
Safe privatization in transactional memory. PPoPP 2018: 233-245 - [i4]Artem Khyzha, Hagit Attiya, Alexey Gotsman, Noam Rinetzky:
Safe Privatization in Transactional Memory. CoRR abs/1801.04249 (2018) - 2017
- [j75]Hagit Attiya:
Special issue on DISC 2013, 2014 and PODC 2014. Distributed Comput. 30(5): 307 (2017) - [j74]Hagit Attiya, Arie Fouren:
Poly-logarithmic adaptive algorithms require revealing primitives. J. Parallel Distributed Comput. 109: 102-116 (2017) - [j73]Hagit Attiya, Faith Ellen, Adam Morrison:
Limitations of Highly-Available Eventually-Consistent Data Stores. IEEE Trans. Parallel Distributed Syst. 28(1): 141-155 (2017) - [c105]Hagit Attiya, Arie Fouren:
Lower Bounds on the Amortized Time Complexity of Shared Objects. OPODIS 2017: 16:1-16:18 - [c104]Hagit Attiya, Gili Yavneh:
Remote Memory References at Block Granularity. OPODIS 2017: 18:1-18:17 - [i3]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in a System that Never Stops Changing. CoRR abs/1708.03274 (2017) - 2016
- [j72]Hagit Attiya:
Special issue in memory of Berthold Vöcking. Distributed Comput. 29(2): 75 (2016) - [j71]Hagit Attiya, Ami Paz:
Counting-based impossibility proofs for set agreement and renaming. J. Parallel Distributed Comput. 87: 1-12 (2016) - [j70]James Aspnes, Keren Censor-Hillel, Hagit Attiya, Danny Hendler:
Lower Bounds for Restricted-Use Objects. SIAM J. Comput. 45(3): 734-762 (2016) - [c103]Hagit Attiya, Sebastian Burckhardt, Alexey Gotsman, Adam Morrison, Hongseok Yang, Marek Zawirski:
Specification and Complexity of Collaborative Text Editing. PODC 2016: 259-268 - [c102]Hagit Attiya, Ohad Ben-Baruch, Danny Hendler:
Lower Bound on the Step Complexity of Anonymous Binary Consensus. DISC 2016: 257-268 - 2015
- [j69]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Limited-Use Atomic Snapshots with Polylogarithmic Step Complexity. J. ACM 62(1): 3:1-3:22 (2015) - [j68]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
Practically stabilizing SWMR atomic memory in message-passing systems. J. Comput. Syst. Sci. 81(4): 692-701 (2015) - [c101]Hagit Attiya, Armando Castañeda, Danny Hendler:
Nontrivial and Universal Helping for Wait-Free Queues and Stacks. OPODIS 2015: 31:1-31:16 - [c100]Hagit Attiya, Arie Fouren:
Poly-Logarithmic Adaptive Algorithms Require Unconditional Primitives. OPODIS 2015: 36:1-36:16 - [c99]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Trading Fences with RMRs and Separating Memory Models. PODC 2015: 173-182 - [c98]Hagit Attiya, Faith Ellen, Adam Morrison:
Limitations of Highly-Available Eventually-Consistent Data Stores. PODC 2015: 385-394 - [c97]Hagit Attiya, Hyun Chul Chung, Faith Ellen, Saptaparni Kumar, Jennifer L. Welch:
Simulating a Shared Register in an Asynchronous System that Never Stops Changing - (Extended Abstract). DISC 2015: 75-91 - [p3]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety and Deferred Update in Transactional Memory. Transactional Memory 2015: 50-71 - [p2]Hagit Attiya, Panagiota Fatourou:
Disjoint-Access Parallelism in Software Transactional Memory. Transactional Memory 2015: 72-97 - [p1]Hagit Attiya, Vincent Gramoli, Alessia Milani:
Directory Protocols for Distributed Transactional Memory. Transactional Memory 2015: 367-391 - 2014
- [b3]Hagit Attiya, Faith Ellen:
Impossibility Results for Distributed Computing. Synthesis Lectures on Distributed Computing Theory, Morgan & Claypool Publishers 2014, ISBN 978-3-031-00882-5 - [j67]Hagit Attiya:
Lower Bounds and Impossibility Results for Transactional Memory Computing. Bull. EATCS 112 (2014) - [c96]Maya Arbel, Hagit Attiya:
Concurrent updates with RCU: search tree as an example. PODC 2014: 196-205 - [c95]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
Safety of Live Transactions in Transactional Memory: TMS is Necessary and Sufficient. DISC 2014: 376-390 - 2013
- [j66]Hagit Attiya, Eshcar Hillel:
Built-in Coloring for Highly-Concurrent Doubly-Linked Lists. Theory Comput. Syst. 52(4): 729-762 (2013) - [j65]Hagit Attiya, Eshcar Hillel:
The Cost of Privatization in Software Transactional Memory. IEEE Trans. Computers 62(12): 2531-2543 (2013) - [j64]Hagit Attiya, Armando Castañeda:
A non-topological proof for the impossibility of k-set agreement. Theor. Comput. Sci. 512: 41-48 (2013) - [c94]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety of Deferred Update in Transactional Memory. ICDCS 2013: 601-610 - [c93]Hagit Attiya, Armando Castañeda, Maurice Herlihy, Ami Paz:
Upper bound on the complexity of solving hard renaming. PODC 2013: 190-199 - [c92]Hagit Attiya, Danny Hendler, Smadar Levy:
An O(1)-barriers optimal RMRs mutual exclusion algorithm: extended abstract. PODC 2013: 220-229 - [c91]Hagit Attiya, Alexey Gotsman, Sandeep Hans, Noam Rinetzky:
A programming language perspective on transactional memory consistency. PODC 2013: 309-318 - [i2]Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi:
Safety of Deferred Update in Transactional Memory. CoRR abs/1301.6297 (2013) - 2012
- [j63]Hagit Attiya:
Announcement: best reviewer award 2011. Distributed Comput. 25(1): 1 (2012) - [j62]James Aspnes, Hagit Attiya, Keren Censor-Hillel:
Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1): 2:1-2:24 (2012) - [j61]Hagit Attiya, Alessia Milani:
Transactional scheduling for read-dominated workloads. J. Parallel Distributed Comput. 72(10): 1386-1396 (2012) - [j60]Hagit Attiya, Eshcar Hillel:
A Single-Version STM that Is Multi-Versioned Permissive. Theory Comput. Syst. 51(4): 425-446 (2012) - [c90]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen:
Faster than optimal snapshots (for a while): preliminary version. PODC 2012: 375-384 - [c89]Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers:
Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. SIROCCO 2012: 195-206 - [c88]James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler:
Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181 - [c87]Hagit Attiya, Ami Paz:
Counting-Based Impossibility Proofs for Renaming and Set Agreement. DISC 2012: 356-370 - 2011
- [j59]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating snapshot objects. J. Parallel Distributed Comput. 71(12): 1570-1577 (2011) - [j58]Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory. Theory Comput. Syst. 49(4): 698-719 (2011) - [j57]Hagit Attiya:
Sharing memories, robustly. SIGACT News 42(4): 79-82 (2011) - [j56]Hagit Attiya, Eshcar Hillel:
Highly concurrent multi-word synchronization. Theor. Comput. Sci. 412(12-14): 1243-1262 (2011) - [c86]Hagit Attiya:
Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It. ICDCN 2011: 1-11 - [c85]Hagit Attiya, Eshcar Hillel:
Single-Version STMs Can Be Multi-version Permissive (Extended Abstract). ICDCN 2011: 83-94 - [c84]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov, Maged M. Michael, Martin T. Vechev:
Laws of order: expensive synchronization in concurrent algorithms cannot be eliminated. POPL 2011: 487-498 - [c83]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Potop-Butucaru, Sébastien Tixeuil:
Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems. SSS 2011: 19-31 - [c82]Hagit Attiya, Armando Castañeda:
A Non-topological Proof for the Impossibility of k-Set Agreement. SSS 2011: 108-119 - [c81]Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, André Schiper:
Structured Derivation of Semi-Synchronous Algorithms. DISC 2011: 374-388 - 2010
- [j55]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010) - [j54]Hagit Attiya:
Robust Simulation of Shared Memory: 20 Years After. Bull. EATCS 100: 99-113 (2010) - [j53]James Aspnes, Hagit Attiya, Keren Censor:
Combining shared-coin algorithms. J. Parallel Distributed Comput. 70(3): 317-322 (2010) - [j52]Hagit Attiya, Keren Censor-Hillel:
Lower Bounds for Randomized Consensus under a Weak Adversary. SIAM J. Comput. 39(8): 3885-3904 (2010) - [j51]Hagit Attiya, David Hay, Isaac Keslassy:
Packet-Mode Emulation of Output-Queued Switches. IEEE Trans. Computers 59(10): 1378-1391 (2010) - [j50]Hagit Attiya, Alex Kogan, Jennifer L. Welch:
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. IEEE Trans. Mob. Comput. 9(3): 361-375 (2010) - [j49]Hagit Attiya, Danny Hendler:
Time and Space Lower Bounds for Implementations Using k-CAS. IEEE Trans. Parallel Distributed Syst. 21(2): 162-173 (2010) - [c80]Hagit Attiya:
The inherent complexity of transactional memory and what to do about it. PODC 2010: 1-5 - [c79]Hagit Attiya, Eshcar Hillel:
Brief announcement: single-version permissive STM. PODC 2010: 67-68 - [c78]Hagit Attiya, G. Ramalingam, Noam Rinetzky:
Sequential verification of serializability. POPL 2010: 31-42 - [c77]Hagit Attiya, Vincent Gramoli, Alessia Milani:
Brief announcement: combine -- an improved directory-based consistency protocol. SPAA 2010: 72-73 - [c76]Hagit Attiya, Vincent Gramoli, Alessia Milani:
A Provably Starvation-Free Distributed Directory Protocol. SSS 2010: 405-419 - [c75]Hagit Attiya, Eshcar Hillel:
The Cost of Privatization. DISC 2010: 35-49 - [c74]Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, Rachid Guerraoui:
Fast Randomized Test-and-Set and Renaming. DISC 2010: 94-108 - [c73]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil:
Brief Announcement: Sharing Memory in a Self-stabilizing Manner. DISC 2010: 525-527 - [i1]Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil:
Practically Stabilizing Atomic Memory. CoRR abs/1007.1802 (2010)
2000 – 2009
- 2009
- [j48]Hagit Attiya:
Editorial: It's all about change. Distributed Comput. 22(1): 1 (2009) - [j47]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov:
The complexity of obstruction-free implementations. J. ACM 56(4): 24:1-24:33 (2009) - [c72]Hagit Attiya, Alessia Milani:
Transactional Scheduling for Read-Dominated Workloads. OPODIS 2009: 3-17 - [c71]James Aspnes, Hagit Attiya, Keren Censor:
Max registers, counters, and monotone circuits. PODC 2009: 36-45 - [c70]Hagit Attiya, Eshcar Hillel, Alessia Milani:
Inherent limitations on disjoint-access parallel implementations of transactional memory. SPAA 2009: 69-78 - [c69]Hagit Attiya, Alessia Milani:
Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. DISC 2009: 108-110 - 2008
- [j46]Hagit Attiya, Keren Censor:
Tight bounds for asynchronous randomized consensus. J. ACM 55(5): 20:1-20:26 (2008) - [j45]Hagit Attiya, David Hay:
Randomization Does Not Reduce the Average Delay in Parallel Packet Switches. SIAM J. Comput. 37(5): 1613-1636 (2008) - [j44]Hagit Attiya:
Needed: foundations for transactional memory. SIGACT News 39(1): 59-61 (2008) - [c68]Hagit Attiya, Eshcar Hillel:
Highly-Concurrent Multi-word Synchronization. ICDCN 2008: 112-123 - [c67]Hagit Attiya, Alex Kogan, Jennifer L. Welch:
Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. ICDCS 2008: 321-328 - [c66]Hagit Attiya, Keren Censor:
Lower bounds for randomized consensus under a weak adversary. PODC 2008: 315-324 - [c65]James Aspnes, Hagit Attiya, Keren Censor:
Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334 - [c64]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447 - [c63]Hagit Attiya, Jennifer L. Welch:
A world of (Im) possibilities. PODC 2008: 461 - [c62]Hagit Attiya, Rachid Guerraoui, Eric Ruppert:
Partial snapshot objects. SPAA 2008: 336-343 - [c61]Hagit Attiya, Danny Hendler, Philipp Woelfel:
Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226 - 2007
- [j43]Hagit Attiya:
Concurrency and the Principle of Data Locality. IEEE Distributed Syst. Online 8(9) (2007) - [c60]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319 - [c59]Hagit Attiya, Eshcar Hillel:
The power of DCAS: highly-concurrent software transactional memory. PODC 2007: 342-343 - [c58]Hagit Attiya, Keren Censor:
Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164 - 2006
- [j42]Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient adaptive collect using randomization. Distributed Comput. 18(3): 179-188 (2006) - [j41]Hagit Attiya, Amir Bar-Or:
Sharing Memory with Semi-byzantine Clients and Faulty Storage Servers. Parallel Process. Lett. 16(4): 419-428 (2006) - [j40]Hagit Attiya, David Hay:
The Inherent Queuing Delay of Parallel Packet Switches. IEEE Trans. Parallel Distributed Syst. 17(9): 1048-1056 (2006) - [c57]Hagit Attiya, Faith Ellen, Panagiota Fatourou:
The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330 - [c56]Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov:
Synchronizing without locks is inherently expensive. PODC 2006: 300-307 - [c55]Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir:
Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315 - [c54]Hagit Attiya:
Adapting to Point Contention with Long-Lived Safe Agreement . SIROCCO 2006: 10-23 - [c53]Hagit Attiya, David Hay, Isaac Keslassy:
Packet-mode emulation of output-queued switches. SPAA 2006: 138-147 - [c52]Hagit Attiya, Eshcar Hillel:
Built-In Coloring for Highly-Concurrent Doubly-Linked Lists. DISC 2006: 31-45 - 2005
- [c51]Hagit Attiya, David Hay, Jennifer L. Welch:
Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. OPODIS 2005: 221-234 - [c50]Hagit Attiya, David Hay:
Randomization does not reduce the average delay in parallel packet switches. SPAA 2005: 11-20 - [c49]Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov:
Computing with Reads and Writes in the Absence of Step Contention. DISC 2005: 122-136 - [c48]Hagit Attiya, Danny Hendler:
Time and Space Lower Bounds for Implementations Using k-CAS. DISC 2005: 169-183 - 2004
- [b2]Hagit Attiya, Jennifer L. Welch:
Distributed computing - fundamentals, simulations, and advanced topics (2. ed.). Wiley series on parallel and distributed computing, Wiley 2004, ISBN 978-0-471-45324-6, pp. I-XV, 1-414 - [j39]Hagit Attiya, Hadas Shachnai:
Tight bounds for FEC-based reliable multicast. Inf. Comput. 190(2): 117-135 (2004) - [j38]Ronit Nossenson, Hagit Attiya:
The distribution of file transmission duration in the web. Int. J. Commun. Syst. 17(5): 407-419 (2004) - [j37]Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg:
Quantifying rollback propagation in distributed checkpointing. J. Parallel Distributed Comput. 64(3): 370-384 (2004) - [c47]Hagit Attiya, David Hay:
The Inherent Queuing Delay of Parallel Packet Switches. IFIP TCS 2004: 139-152 - [c46]Ronit Nossenson, Hagit Attiya:
The N-Burst/G/1 Model with Heavy-Tailed Service-Times Distribution. MASCOTS 2004: 131-138 - [c45]Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan:
Lower bounds for adaptive collect and related objects. PODC 2004: 60-69 - [c44]Hagit Attiya, David Hay:
The inherent queuing delay of parallel packet switches. SPAA 2004: 269-270 - [c43]Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer:
Efficient Adaptive Collect Using Randomization. DISC 2004: 159-173 - 2003
- [j36]Hagit Attiya, Sergio Rajsbaum:
Introduction. Distributed Comput. 16(2-3): 69-70 (2003) - [j35]Hagit Attiya, Arie Fouren:
Algorithms adapting to point contention. J. ACM 50(4): 444-468 (2003) - [j34]Allon Adir, Hagit Attiya, Gil Shurek:
Information-Flow Models for Shared Memory with an Application to the PowerPC Architecture. IEEE Trans. Parallel Distributed Syst. 14(5): 502-515 (2003) - [c42]Hagit Attiya, Amir Bar-Or:
Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers. SRDS 2003: 371-378 - [c41]Ronit Nossenson, Hagit Attiya:
Understanding the Distribution of File Transmission Duration in the Web. WWW (Posters) 2003 - 2002
- [j33]Hagit Attiya, Arie Fouren, Eli Gafni:
An adaptive collect algorithm with applications. Distributed Comput. 15(2): 87-96 (2002) - [j32]Hagit Attiya, Vita Bortnikov:
Adaptive and efficient mutual exclusion. Distributed Comput. 15(3): 177-189 (2002) - [j31]Hagit Attiya, Alla Gorbach, Shlomo Moran:
Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. Comput. 173(2): 162-183 (2002) - [j30]Hagit Attiya, Sergio Rajsbaum:
The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM J. Comput. 31(4): 1286-1313 (2002) - [c40]Hagit Attiya, Zvi Avidor:
Wait-Free n-Set Consensus When Inputs Are Restricted. DISC 2002: 326-338 - 2001
- [j29]Hagit Attiya, Eyal Dagan:
Improved implementations of binary universal operations. J. ACM 48(5): 1013-1037 (2001) - [j28]Hagit Attiya, Taly Djerassi-Shintel:
Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. J. Parallel Distributed Comput. 61(8): 1096-1109 (2001) - [j27]Hagit Attiya, Arie Fouren:
Adaptive and Efficient Algorithms for Lattice Agreement and Renaming. SIAM J. Comput. 31(2): 642-664 (2001) - [c39]Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg:
Quantifying Rollback Propagation in Distributed Checkpointing. SRDS 2001: 36-45 - 2000
- [j26]Hagit Attiya:
Efficient and Robust Sharing of Memory in Message-Passing Systems. J. Algorithms 34(1): 109-127 (2000) - [c38]Hagit Attiya, Vita Bortnikov:
Adaptive and efficient mutual exclusion (extended abstract). PODC 2000: 91-100 - [c37]Hagit Attiya, Arie Fouren:
Polynominal and Adaptive Long-Lived (2k-1)-Renaming. DISC 2000: 149-163
1990 – 1999
- 1999
- [j25]Hagit Attiya, Hadas Shachnai, Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. 28(4): 1397-1414 (1999) - [c36]Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou:
Long-Lived Renaming Made Adaptive. PODC 1999: 91-103 - 1998
- [j24]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) - [j23]Hagit Attiya, Ophir Rachman:
Atomic Snapshots in O(n log n) Operations. SIAM J. Comput. 27(2): 319-340 (1998) - [j22]Hagit Attiya, Roy Friedman:
A Correctness Condition for High-Performance Multiprocessors. SIAM J. Comput. 27(6): 1637-1670 (1998) - [c35]Hagit Attiya, Arie Fouren:
Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). PODC 1998: 277-286 - [c34]Hagit Attiya:
A Direct Lower Bound for k-Set Consensus. PODC 1998: 314 - [c33]Hagit Attiya, Alla Gorbach, Shlomo Moran:
Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC 1998: 49-61 - 1997
- [j21]Hagit Attiya, Rinat Rappoport:
The Level of Handshake Required for Managing a Connection. Distributed Comput. 11(1): 41-57 (1997) - [j20]Rajeev Alur, Hagit Attiya, Gadi Taubenfeld:
Time-Adaptive Algorithms for Synchronization. SIAM J. Comput. 26(2): 539-556 (1997) - [c32]Hagit Attiya, Hadas Shachnai:
IDABased Protocols for Reliable Multicast. OPODIS 1997: 137-152 - [e1]James E. Burns, Hagit Attiya:
Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, California, USA, August 21-24, 1997. ACM 1997, ISBN 0-89791-952-1 [contents] - 1996
- [j19]Hagit Attiya, Roy Friedman:
Limitations of Fast Consistency Conditions for Distributed Shared Memories. Inf. Process. Lett. 57(5): 243-248 (1996) - [j18]Hagit Attiya, Amir Herzberg, Sergio Rajsbaum:
Optimal Clock Synchronization under Different Delay Assumptions. SIAM J. Comput. 25(2): 369-389 (1996) - [c31]Hagit Attiya, Eyal Dagan:
Universal Operations: Unary versus Binary (Extended Abstract). PODC 1996: 223-232 - [c30]Hagit Attiya:
Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract). WDAG 1996: 56-70 - [c29]Hagit Attiya, Sergio Rajsbaum:
The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract). WDAG 1996: 322-343 - 1995
- [j17]Hagit Attiya, Maurice Herlihy, Ophir Rachman:
Atomic Snapshots Using Lattice Agreement. Distributed Comput. 8(3): 121-132 (1995) - [j16]Eran Aharonson, Hagit Attiya:
Counting Networks with Arbitrary Fan-Out. Distributed Comput. 8(4): 163-169 (1995) - [j15]Hagit Attiya, Shlomi Dolev, Jennifer L. Welch:
Connection Management Without Retaining Information. Inf. Comput. 123(2): 155-171 (1995) - [j14]Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems. J. ACM 42(1): 124-142 (1995) - [c28]Hagit Attiya, Shlomi Dolev, Jennifer L. Welch:
Connection management without retaining information. HICSS (2) 1995: 622-634 - [c27]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 - 1994
- [j13]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) - [j12]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) - [j11]Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast? J. ACM 41(4): 725-763 (1994) - [j10]Yehuda Afek, Hagit Attiya, Alan D. 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) - [j9]Hagit Attiya, Marios Mavronicolas:
Efficiency of Semisynchronous Versus. Math. Syst. Theory 27(6): 547-571 (1994) - [j8]Hagit Attiya, Jennifer L. Welch:
Sequential Consistency versus Linearizability. ACM Trans. Comput. Syst. 12(2): 91-122 (1994) - [c26]Hagit Attiya, Roy Friedman:
Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). SPAA 1994: 157-166 - [c25]Rajeev Alur, Hagit Attiya, Gadi Taubenfeld:
Time-adaptive algorithms for synchronization. STOC 1994: 800-809 - [c24]Hagit Attiya, Rinat Rappoport:
The Level of Handshake Required for Establishing a Connection. WDAG 1994: 179-193 - [c23]Hagit Attiya, Hadas Shachnai, Tami Tamir:
Local Labeling and Resource Allocation Using Preprocessing. WDAG 1994: 194-208 - 1993
- [j7]Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993) - [c22]Hagit Attiya, Ophir Rachman:
Atomic Snapshots in O(n log n) Operations (Preliminary Version). PODC 1993: 29-40 - [c21]Hagit Attiya, Amir Herzberg, Sergio Rajsbaum:
Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version). PODC 1993: 109-120 - [c20]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 - [c19]Hagit Attiya, Taly Djerassi-Shintel:
Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. WDAG 1993: 204-218 - 1992
- [j6]Nancy A. Lynch, Hagit Attiya:
Using Mappings to Prove Timing Properties. Distributed Comput. 6(2): 121-139 (1992) - [c18]Eran Aharonson, Hagit Attiya:
Counting Networks with Arbitrary Fan-Out. SODA 1992: 104-113 - [c17]Hagit Attiya, Roy Friedman:
A Correctness Condition for High-Performance Multiprocessors (Extended Abstract). STOC 1992: 679-690 - [c16]Hagit Attiya, Maurice Herlihy, Ophir Rachman:
Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract). WDAG 1992: 35-53 - 1991
- [j5]Hagit Attiya, Marc Snir:
Better Computing on the Anonymous Ring. J. Algorithms 12(2): 204-238 (1991) - [c15]Hagit Attiya, Jennifer L. Welch:
Sequential Consistency Versus Linearizability (Extended Abstract). SPAA 1991: 304-315 - [c14]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 - [c13]Hagit Attiya:
Implementing FIFO Queus and Stacks (Extended Abstract). WDAG 1991: 80-94 - 1990
- [j4]Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk:
Renaming in an Asynchronous Environment. J. ACM 37(3): 524-548 (1990) - [c12]Hagit Attiya, Nancy A. Lynch, Nir Shavit:
Are Wait-Free Algorithms Fast? (Extended Abstract). FOCS 1990: 55-64 - [c11]Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit:
Atomic Snapshots of Shared Memory. PODC 1990: 1-13 - [c10]Nancy A. Lynch, Hagit Attiya:
Using Mappings to Prove Timing Properties. PODC 1990: 265-280 - [c9]Hagit Attiya, Amotz Bar-Noy, Danny Dolev:
Sharing Memory Robustly in Message-Passing Systems. PODC 1990: 363-375
1980 – 1989
- 1989
- [j3]Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks:
Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989) - [c8]Hagit Attiya, Danny Dolev, Nir Shavit:
Bounded Polynomial Randomized Consensus. PODC 1989: 281-293 - [c7]Hagit Attiya, Nancy A. Lynch:
Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. RTSS 1989: 268-284 - 1988
- [j2]Hagit Attiya, Marc Snir, Manfred K. Warmuth:
Computing on an anonymous ring. J. ACM 35(4): 845-875 (1988) - [c6]Hagit Attiya, Marc Snir:
Better Computing on the Anonymous Ring. AWOC 1988: 329-338 - 1987
- [b1]Hagit Attiya:
סינכרוניות כנגד אסינכרוניות במערכות מבוזרות (Synchronism vs. asynchronism in distributed systems.). Hebrew University of Jerusalem, Israel, 1987 - [j1]Hagit Attiya, Yishay Mansour:
Language Complexity on the Synchronous Anonymous Ring. Theor. Comput. Sci. 53: 169-185 (1987) - [c5]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 - [c4]Hagit Attiya:
Constructing Efficient Election Algorithms from Efficient Traversal Algorithms. WDAG 1987: 337-344 - 1985
- [c3]Chagit Attiya, Marc Snir, Manfred K. Warmuth:
Computing on an Anonymous Ring. PODC 1985: 196-203 - 1984
- [c2]Sergei Nirenburg, Chagit Attiya:
Towards a Data Model for Artificial Intelligence Applications. ICDE 1984: 446-453 - [c1]Chagit Attiya, Danny Dolev, Joseph Gil:
Asynchronous Byzantine Consensus. PODC 1984: 119-133
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 22:52 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
