Hagit Attiya

Hagit Attiya, Eshcar Hillel: Built-in Coloring for Highly-Concurrent Doubly-Linked Lists. Theory Comput. Syst. 52(4): 729-762 (2013)

Hagit Attiya, Sandeep Hans, Petr Kuznetsov, Srivatsan Ravi: Safety of Deferred Update in Transactional Memory. CoRR abs/1301.6297 (2013)

Hagit Attiya: Announcement: best reviewer award 2011. Distributed Computing 25(1): 1 (2012)

James Aspnes, Hagit Attiya, Keren Censor-Hillel: Polylogarithmic concurrent data structures from monotone circuits. J. ACM 59(1): 2 (2012)

Hagit Attiya, Alessia Milani: Transactional scheduling for read-dominated workloads. J. Parallel Distrib. Comput. 72(10): 1386-1396 (2012)

Hagit Attiya, Eshcar Hillel: A Single-Version STM that Is Multi-Versioned Permissive. Theory Comput. Syst. 51(4): 425-446 (2012)

James Aspnes, Hagit Attiya, Keren Censor-Hillel, Faith Ellen: Faster than optimal snapshots (for a while): preliminary version. PODC 2012: 375-384

Dan Alistarh, Hagit Attiya, Rachid Guerraoui, Corentin Travers: Early Deciding Synchronous Renaming in O( logf ) Rounds or Less. SIROCCO 2012: 195-206

James Aspnes, Hagit Attiya, Keren Censor-Hillel, Danny Hendler: Lower bounds for restricted-use objects: extended abstract. SPAA 2012: 172-181

Hagit Attiya, Ami Paz: Counting-Based Impossibility Proofs for Renaming and Set Agreement. DISC 2012: 356-370

Hagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating snapshot objects. J. Parallel Distrib. Comput. 71(12): 1570-1577 (2011)

Hagit Attiya, Eshcar Hillel, Alessia Milani: Inherent Limitations on Disjoint-Access Parallel Implementations of Transactional Memory. Theory Comput. Syst. 49(4): 698-719 (2011)

Hagit Attiya: Sharing memories, robustly. SIGACT News 42(4): 79-82 (2011)

Hagit Attiya, Eshcar Hillel: Highly concurrent multi-word synchronization. Theor. Comput. Sci. 412(12-14): 1243-1262 (2011)

Hagit Attiya: Invited Paper: The Inherent Complexity of Transactional Memory and What to Do about It. ICDCN 2011: 1-11

Hagit Attiya, Eshcar Hillel: Single-Version STMs Can Be Multi-version Permissive (Extended Abstract). ICDCN 2011: 83-94

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

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

Hagit Attiya, Armando Castañeda: A Non-topological Proof for the Impossibility of k-Set Agreement. SSS 2011: 108-119

Hagit Attiya, Fatemeh Borran, Martin Hutle, Zarko Milosevic, André Schiper: Structured Derivation of Semi-Synchronous Algorithms. DISC 2011: 374-388

Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional Contention Management as a Non-Clairvoyant Scheduling Problem. Algorithmica 57(1): 44-61 (2010)

Hagit Attiya: Robust Simulation of Shared Memory: 20 Years After. Bulletin of the EATCS 100: 99-113 (2010)

James Aspnes, Hagit Attiya, Keren Censor: Combining shared-coin algorithms. J. Parallel Distrib. Comput. 70(3): 317-322 (2010)

Hagit Attiya, Keren Censor-Hillel: Lower Bounds for Randomized Consensus under a Weak Adversary. SIAM J. Comput. 39(8): 3885-3904 (2010)

Hagit Attiya, David Hay, Isaac Keslassy: Packet-Mode Emulation of Output-Queued Switches. IEEE Trans. Computers 59(10): 1378-1391 (2010)

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)

Hagit Attiya, Danny Hendler: Time and Space Lower Bounds for Implementations Using k-CAS. IEEE Trans. Parallel Distrib. Syst. 21(2): 162-173 (2010)

Hagit Attiya: The inherent complexity of transactional memory and what to do about it. PODC 2010: 1-5

Hagit Attiya, Eshcar Hillel: Brief announcement: single-version permissive STM. PODC 2010: 67-68

Hagit Attiya, G. Ramalingam, Noam Rinetzky: Sequential verification of serializability. POPL 2010: 31-42

Hagit Attiya, Vincent Gramoli, Alessia Milani: Brief announcement: combine -- an improved directory-based consistency protocol. SPAA 2010: 72-73

Hagit Attiya, Vincent Gramoli, Alessia Milani: A Provably Starvation-Free Distributed Directory Protocol. SSS 2010: 405-419

Hagit Attiya, Eshcar Hillel: The Cost of Privatization. DISC 2010: 35-49

Dan Alistarh, Hagit Attiya, Seth Gilbert, Andrei Giurgiu, Rachid Guerraoui: Fast Randomized Test-and-Set and Renaming. DISC 2010: 94-108

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

Noga Alon, Hagit Attiya, Shlomi Dolev, Swan Dubois, Maria Gradinariu, Sébastien Tixeuil: Practically Stabilizing Atomic Memory. CoRR abs/1007.1802 (2010)

Hagit Attiya: Editorial: It's all about change. Distributed Computing 22(1): 1 (2009)

Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kuznetsov: The complexity of obstruction-free implementations. J. ACM 56(4) (2009)

Hagit Attiya, Alessia Milani: Transactional Scheduling for Read-Dominated Workloads. OPODIS 2009: 3-17

James Aspnes, Hagit Attiya, Keren Censor: Max registers, counters, and monotone circuits. PODC 2009: 36-45

Hagit Attiya, Eshcar Hillel, Alessia Milani: Inherent limitations on disjoint-access parallel implementations of transactional memory. SPAA 2009: 69-78

Hagit Attiya, Alessia Milani: Brief Announcement: Transactional Scheduling for Read-Dominated Workloads. DISC 2009: 108-110

Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. J. ACM 55(5) (2008)

Hagit Attiya, David Hay: Randomization Does Not Reduce the Average Delay in Parallel Packet Switches. SIAM J. Comput. 37(5): 1613-1636 (2008)

Hagit Attiya: Needed: foundations for transactional memory. SIGACT News 39(1): 59-61 (2008)

Hagit Attiya, Eshcar Hillel: Highly-Concurrent Multi-word Synchronization. ICDCN 2008: 112-123

Hagit Attiya, Alex Kogan, Jennifer L. Welch: Efficient and Robust Local Mutual Exclusion in Mobile Ad Hoc Networks. ICDCS 2008: 321-328

Hagit Attiya, Keren Censor: Lower bounds for randomized consensus under a weak adversary. PODC 2008: 315-324

James Aspnes, Hagit Attiya, Keren Censor: Randomized consensus in expected O(n log n) individual work. PODC 2008: 325-334

Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight RMR lower bounds for mutual exclusion and other problems. PODC 2008: 447

Hagit Attiya, Jennifer L. Welch: A world of (Im) possibilities. PODC 2008: 461

Hagit Attiya, Rachid Guerraoui, Eric Ruppert: Partial snapshot objects. SPAA 2008: 336-343

Hagit Attiya, Danny Hendler, Philipp Woelfel: Tight rmr lower bounds for mutual exclusion and other problems. STOC 2008: 217-226

Hagit Attiya: Concurrency and the Principle of Data Locality. IEEE Distributed Systems Online 8(9) (2007)

Hagit Attiya, Faith Ellen, Panagiota Fatourou: The complexity of updating multi-writer snapshot objects. PODC 2007: 318-319

Hagit Attiya, Eshcar Hillel: The power of DCAS: highly-concurrent software transactional memory. PODC 2007: 342-343

Hagit Attiya, Keren Censor: Tight bounds for asynchronous randomized consensus. STOC 2007: 155-164

Hagit Attiya, Fabian Kuhn, C. Greg Plaxton, Mirjam Wattenhofer, Roger Wattenhofer: Efficient adaptive collect using randomization. Distributed Computing 18(3): 179-188 (2006)

Hagit Attiya, Amir Bar-Or: Sharing Memory with Semi-byzantine Clients and Faulty Storage Servers. Parallel Processing Letters 16(4): 419-428 (2006)

Hagit Attiya, David Hay: The Inherent Queuing Delay of Parallel Packet Switches. IEEE Trans. Parallel Distrib. Syst. 17(9): 1048-1056 (2006)

Hagit Attiya, Faith Ellen, Panagiota Fatourou: The Complexity of Updating Multi-writer Snapshot Objects. ICDCN 2006: 319-330

Hagit Attiya, Rachid Guerraoui, Danny Hendler, Petr Kouznetsov: Synchronizing without locks is inherently expensive. PODC 2006: 300-307

Hagit Attiya, Leah Epstein, Hadas Shachnai, Tami Tamir: Transactional contention management as a non-clairvoyant scheduling problem. PODC 2006: 308-315

Hagit Attiya: Adapting to Point Contention with Long-Lived Safe Agreement . SIROCCO 2006: 10-23

Hagit Attiya, David Hay, Isaac Keslassy: Packet-mode emulation of output-queued switches. SPAA 2006: 138-147

Hagit Attiya, Eshcar Hillel: Built-In Coloring for Highly-Concurrent Doubly-Linked Lists. DISC 2006: 31-45

Hagit Attiya, David Hay, Jennifer L. Welch: Optimal Clock Synchronization Under Energy Constraints in Wireless Ad-Hoc Networks. OPODIS 2005: 221-234

Hagit Attiya, David Hay: Randomization does not reduce the average delay in parallel packet switches. SPAA 2005: 11-20

Hagit Attiya, Rachid Guerraoui, Petr Kouznetsov: Computing with Reads and Writes in the Absence of Step Contention. DISC 2005: 122-136

Hagit Attiya, Danny Hendler: Time and Space Lower Bounds for Implementations Using k-CAS. DISC 2005: 169-183

Hagit Attiya, Hadas Shachnai: Tight bounds for FEC-based reliable multicast. Inf. Comput. 190(2): 117-135 (2004)

Ronit Nossenson, Hagit Attiya: The distribution of file transmission duration in the web. Int. J. Communication Systems 17(5): 407-419 (2004)

Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg: Quantifying rollback propagation in distributed checkpointing. J. Parallel Distrib. Comput. 64(3): 370-384 (2004)

Hagit Attiya, David Hay: The Inherent Queuing Delay of Parallel Packet Switches. IFIP TCS 2004: 139-152

Ronit Nossenson, Hagit Attiya: The N-Burst/G/1 Model with Heavy-Tailed Service-Times Distribution. MASCOTS 2004: 131-138

Hagit Attiya, Faith Ellen Fich, Yaniv Kaplan: Lower bounds for adaptive collect and related objects. PODC 2004: 60-69

Hagit Attiya, David Hay: The inherent queuing delay of parallel packet switches. SPAA 2004: 269-270

Hagit Attiya, Fabian Kuhn, Mirjam Wattenhofer, Roger Wattenhofer: Efficient Adaptive Collect Using Randomization. DISC 2004: 159-173

Hagit Attiya, Sergio Rajsbaum: Introduction. Distributed Computing 16(2-3): 69-70 (2003)

Hagit Attiya, Arie Fouren: Algorithms adapting to point contention. J. ACM 50(4): 444-468 (2003)

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)

Hagit Attiya, Amir Bar-Or: Sharing Memory with Semi-Byzantine Clients and Faulty Storage Servers. SRDS 2003: 371-378

Ronit Nossenson, Hagit Attiya: Understanding the Distribution of File Transmission Duration in the Web. WWW (Posters) 2003

Hagit Attiya, Arie Fouren, Eli Gafni: An adaptive collect algorithm with applications. Distributed Computing 15(2): 87-96 (2002)

Hagit Attiya, Vita Bortnikov: Adaptive and efficient mutual exclusion. Distributed Computing 15(3): 177-189 (2002)

Hagit Attiya, Alla Gorbach, Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. Inf. Comput. 173(2): 162-183 (2002)

Hagit Attiya, Sergio Rajsbaum: The Combinatorial Structure of Wait-Free Solvable Tasks. SIAM J. Comput. 31(4): 1286-1313 (2002)

Hagit Attiya, Zvi Avidor: Wait-Free n-Set Consensus When Inputs Are Restricted. DISC 2002: 326-338

Hagit Attiya, Eyal Dagan: Improved implementations of binary universal operations. J. ACM 48(5): 1013-1037 (2001)

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)

Hagit Attiya, Arie Fouren: Adaptive and Efficient Algorithms for Lattice Agreement and Renaming. SIAM J. Comput. 31(2): 642-664 (2001)

Adnan Agbaria, Hagit Attiya, Roy Friedman, Roman Vitenberg: Quantifying Rollback Propagation in Distributed Checkpointing. SRDS 2001: 36-45

Hagit Attiya: Efficient and Robust Sharing of Memory in Message-Passing Systems. J. Algorithms 34(1): 109-127 (2000)

Hagit Attiya, Vita Bortnikov: Adaptive and efficient mutual exclusion (extended abstract). PODC 2000: 91-100

Hagit Attiya, Arie Fouren: Polynominal and Adaptive Long-Lived (2k-1)-Renaming. DISC 2000: 149-163

Hagit Attiya, Hadas Shachnai, Tami Tamir: Local Labeling and Resource Allocation Using Preprocessing. SIAM J. Comput. 28(4): 1397-1414 (1999)

Yehuda Afek, Hagit Attiya, Arie Fouren, Gideon Stupp, Dan Touitou: Long-Lived Renaming Made Adaptive. PODC 1999: 91-103

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)

Hagit Attiya, Ophir Rachman: Atomic Snapshots in O(n log n) Operations. SIAM J. Comput. 27(2): 319-340 (1998)

Hagit Attiya, Roy Friedman: A Correctness Condition for High-Performance Multiprocessors. SIAM J. Comput. 27(6): 1637-1670 (1998)

Hagit Attiya, Arie Fouren: Adaptive Wait-Free Algorithms for Lattice Agreement and Renaming (Extended Abstract). PODC 1998: 277-286

Hagit Attiya: A Direct Lower Bound for k-Set Consensus. PODC 1998: 314

Hagit Attiya, Alla Gorbach, Shlomo Moran: Computing in Totally Anonymous Asynchronous Shared Memory Systems. DISC 1998: 49-61

Hagit Attiya, Rinat Rappoport: The Level of Handshake Required for Managing a Connection. Distributed Computing 11(1): 41-57 (1997)

Rajeev Alur, Hagit Attiya, Gadi Taubenfeld: Time-Adaptive Algorithms for Synchronization. SIAM J. Comput. 26(2): 539-556 (1997)

Hagit Attiya, Hadas Shachnai: IDABased Protocols for Reliable Multicast. OPODIS 1997: 137-152

James E. Burns, Hagit Attiya (Eds.): 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

Hagit Attiya, Roy Friedman: Limitations of Fast Consistency Conditions for Distributed Shared Memories. Inf. Process. Lett. 57(5): 243-248 (1996)

Hagit Attiya, Amir Herzberg, Sergio Rajsbaum: Optimal Clock Synchronization under Different Delay Assumptions. SIAM J. Comput. 25(2): 369-389 (1996)

Hagit Attiya, Eyal Dagan: Universal Operations: Unary versus Binary (Extended Abstract). PODC 1996: 223-232

Hagit Attiya: Efficient and Robust Sharing of Memory in Message-Passing Systems (Extended Abstract). WDAG 1996: 56-70

Hagit Attiya, Sergio Rajsbaum: The Combinatorial Structure of Wait-free Solvable Tasks (Extended Abstract). WDAG 1996: 322-343

Hagit Attiya, Maurice Herlihy, Ophir Rachman: Atomic Snapshots Using Lattice Agreement. Distributed Computing 8(3): 121-132 (1995)

Eran Aharonson, Hagit Attiya: Counting Networks with Arbitrary Fan-Out. Distributed Computing 8(4): 163-169 (1995)

Hagit Attiya, Shlomi Dolev, Jennifer L. Welch: Connection Management Without Retaining Information. Inf. Comput. 123(2): 155-171 (1995)

Hagit Attiya, Amotz Bar-Noy, Danny Dolev: Sharing Memory Robustly in Message-Passing Systems. J. ACM 42(1): 124-142 (1995)

Hagit Attiya, Shlomi Dolev, Jennifer L. Welch: Connection management without retaining information. HICSS (2) 1995: 622-

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

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)

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)

Hagit Attiya, Nancy A. Lynch, Nir Shavit: Are Wait-Free Algorithms Fast? J. ACM 41(4): 725-763 (1994)

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)

Hagit Attiya, Marios Mavronicolas: Efficiency of Semisynchronous Versus. Mathematical Systems Theory 27(6): 547-571 (1994)

Hagit Attiya, Jennifer L. Welch: Sequential Consistency versus Linearizability. ACM Trans. Comput. Syst. 12(2): 91-122 (1994)

Hagit Attiya, Roy Friedman: Programming DEC-Alpha Based Multiprocessors the Easy Way (Extended Abstract). SPAA 1994: 157-166

Rajeev Alur, Hagit Attiya, Gadi Taubenfeld: Time-adaptive algorithms for synchronization. STOC 1994: 800-809

Hagit Attiya, Rinat Rappoport: The Level of Handshake Required for Establishing a Connection. WDAG 1994: 179-193

Hagit Attiya, Hadas Shachnai, Tami Tamir: Local Labeling and Resource Allocation Using Preprocessing. WDAG 1994: 194-208

Yehuda Afek, Hagit Attiya, Danny Dolev, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. J. ACM 40(4): 873-890 (1993)

Hagit Attiya, Ophir Rachman: Atomic Snapshots in O(n log n) Operations (Preliminary Version). PODC 1993: 29-40

Hagit Attiya, Amir Herzberg, Sergio Rajsbaum: Optimal Clock Synchronization under Different Delay Assumptions (Preliminary Version). PODC 1993: 109-120

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

Hagit Attiya, Taly Djerassi-Shintel: Time Bounds for Decision Problems in the Presence of Timing Uncertainty and Failures. WDAG 1993: 204-218

Nancy A. Lynch, Hagit Attiya: Using Mappings to Prove Timing Properties. Distributed Computing 6(2): 121-139 (1992)

Eran Aharonson, Hagit Attiya: Counting Networks with Arbitrary Fan-Out. SODA 1992: 104-113

Hagit Attiya, Roy Friedman: A Correctness Condition for High-Performance Multiprocessors (Extended Abstract). STOC 1992: 679-690

Hagit Attiya, Maurice Herlihy, Ophir Rachman: Efficient Atomic Snapshots Using Lattice Agreement (Extended Abstract). WDAG 1992: 35-53

Hagit Attiya, Marc Snir: Better Computing on the Anonymous Ring. J. Algorithms 12(2): 204-238 (1991)

Hagit Attiya, Jennifer L. Welch: Sequential Consistency Versus Linearizability (Extended Abstract). SPAA 1991: 304-315

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

Hagit Attiya: Implementing FIFO Queus and Stacks (Extended Abstract). WDAG 1991: 80-94

Hagit Attiya, Amotz Bar-Noy, Danny Dolev, David Peleg, Rüdiger Reischuk: Renaming in an Asynchronous Environment. J. ACM 37(3): 524-548 (1990)

Hagit Attiya, Nancy A. Lynch, Nir Shavit: Are Wait-Free Algorithms Fast? (Extended Abstract). FOCS 1990: 55-64

Yehuda Afek, Danny Dolev, Hagit Attiya, Eli Gafni, Michael Merritt, Nir Shavit: Atomic Snapshots of Shared Memory. PODC 1990: 1-13

Nancy A. Lynch, Hagit Attiya: Using Mappings to Prove Timing Properties. PODC 1990: 265-280

Hagit Attiya, Amotz Bar-Noy, Danny Dolev: Sharing Memory Robustly in Message-Passing Systems. PODC 1990: 363-375

Hagit Attiya, Jan van Leeuwen, Nicola Santoro, Shmuel Zaks: Efficient Elections in Chordal Ring Networks. Algorithmica 4(3): 437-446 (1989)

Hagit Attiya, Danny Dolev, Nir Shavit: Bounded Polynomial Randomized Consensus. PODC 1989: 281-293

Hagit Attiya, Nancy A. Lynch: Time Bounds for Real-Time Process Control in the Presence of Timing Uncertainty. RTSS 1989: 268-284

Hagit Attiya, Marc Snir, Manfred K. Warmuth: Computing on an anonymous ring. J. ACM 35(4): 845-875 (1988)

Hagit Attiya, Marc Snir: Better Computing on the Anonymous Ring. AWOC 1988: 329-338

Hagit Attiya, Yishay Mansour: Language Complexity on the Synchronous Anonymous Ring. Theor. Comput. Sci. 53: 169-185 (1987)

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

Hagit Attiya: Constructing Efficient Election Algorithms from Efficient Traversal Algorithms. WDAG 1987: 337-344

Chagit Attiya, Marc Snir, Manfred K. Warmuth: Computing on an Anonymous Ring. PODC 1985: 196-203

Sergei Nirenburg, Chagit Attiya: Towards a Data Model for Artificial Intelligence Applications. ICDE 1984: 446-453

Chagit Attiya, Danny Dolev, Joseph Gil: Asynchronous Byzantine Consensus. PODC 1984: 119-133