| |
 |      |
                                              |
Note: Links lead to the DBLP on the Web. Mark R. Tuttle David B. Lomet , Mark R. Tuttle: A Theory of Redo Recovery. SIGMOD Conference 2003 : 397-406 Rajeev Joshi , Leslie Lamport , John Matthews , Serdar Tasiran , Mark R. Tuttle, Yuan Yu : Checking Cache-Coherence Protocols with TLA + . Formal Methods in System Design 22 (2): 125-131 (2003) Maurice Herlihy , Sergio Rajsbaum , Mark R. Tuttle: A New Synchronous Lower Bound for Set Agreement. DISC 2001 : 136-150 Maurice Herlihy , Sergio Rajsbaum , Mark R. Tuttle: An Overview of Synchronous Message-Passing and Topology. Electr. Notes Theor. Comput. Sci. 39 (2): (2001) Soma Chaudhuri , Maurice Herlihy , Nancy A. Lynch , Mark R. Tuttle: Tight bounds for k -set agreement. J. ACM 47 (5): 912-943 (2000) David B. Lomet , Mark R. Tuttle: Logical Logging to Extend Recovery to New Domains. SIGMOD Conference 1999 : 73-84 Homayoon Akhiani , Damien Doligez , Paul Harter , Leslie Lamport , Joshua Scheid , Mark R. Tuttle, Yuan Yu : Cache Coherence Verification with TLA+. World Congress on Formal Methods 1999 : 1871-1872 Soma Chaudhuri , Maurice Herlihy , Mark R. Tuttle: Wait-Free Implementations in Message-Passing Systems. Theor. Comput. Sci. 220 (1): 211-245 (1999) Maurice Herlihy , Sergio Rajsbaum , Mark R. Tuttle: Unifying Synchronous and Asynchronous Message-Passing Models. PODC 1998 : 133-142 David B. Lomet , Mark R. Tuttle: Redo Recovery after System Crashes. VLDB 1995 : 457-468 Soma Chaudhuri , Mark R. Tuttle: Fast Increment Registers. WDAG 1994 : 74-88 Soma Chaudhuri , Maurice Herlihy , Nancy A. Lynch , Mark R. Tuttle: A Tight Lower Bound for k-Set Agreement FOCS 1993 : 206-215 Gil Neiger , Mark R. Tuttle: Common Knowledge and Consistent Simultaneous Coordination. Distributed Computing 6 (3): 181-192 (1993) Joseph Y. Halpern , Mark R. Tuttle: Knowledge, Probability, and Adversaries. J. ACM 40 (4): 917-962 (1993) Martín Abadi , Mark R. Tuttle: A Semantics for a Logic of Authentication (Extended Abstract). PODC 1991 : 201-216 Maurice Herlihy , Mark R. Tuttle: Lower Bounds for Wait-Free Computation in Message-Passing Systems. PODC 1990 : 347-362 Gil Neiger , Mark R. Tuttle: Common Knowledge and Consistent Simultaneous Coordination. WDAG 1990 : 334-352 Joseph Y. Halpern , Mark R. Tuttle: Knowledge, Probability, and Adversaries. PODC 1989 : 103-118 Joseph Y. Halpern , Yoram Moses , Mark R. Tuttle: A Knowledge-Based Analysis of Zero Knowledge (Preliminary Report) STOC 1988 : 132-147 Yoram Moses , Mark R. Tuttle: Programming Simultaneous Actions Using Common Knowledge. Algorithmica 3 : 121-169 (1988) Nancy A. Lynch , Mark R. Tuttle: Hierarchical Correctness Proofs for Distributed Algorithms. PODC 1987 : 137-151 Yoram Moses , Mark R. Tuttle: Programming Simultaneous Actions Using Common Knowledge: Preliminary Version FOCS 1986 : 208-221 1 [ 8 ] 2 [ 16 ] 3 [ 11 ] [ 12 ] [ 15 ] [ 18 ] 4 [ 16 ] 5 [ 4 ] [ 5 ] [ 9 ] 6 [ 16 ] 7 [ 7 ] [ 11 ] [ 14 ] [ 15 ] [ 18 ] [ 19 ] [ 20 ] 8 [ 21 ] 9 [ 16 ] [ 21 ] 10 [ 13 ] [ 17 ] [ 22 ] 11 [ 2 ] [ 11 ] [ 18 ] 12 [ 21 ] 13 [ 1 ] [ 3 ] [ 4 ] 14 [ 6 ] [ 10 ] 15 [ 14 ] [ 19 ] [ 20 ] 16 [ 16 ] 17 [ 21 ] 18 [ 16 ] [ 21 ]  ©2004 Association for Computing Machinery |
