Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
H. Raymond Strong
1990 – 1999
- 1999
[j21]Mike W. Blasgen, Morton M. Astrahan, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Irving L. Traiger, Bradford W. Wade, Robert A. Yost: System R: An Architectural Overview. IBM Systems Journal 38(2/3): 375-396 (1999)- 1997
- [j20]Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Marcel-Catalin Rosu, H. Raymond Strong: Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations. J. Parallel Distrib. Comput. 40(1): 19-34 (1997)
- [j19]Danny Dolev, Rüdiger Reischuk, Fred B. Schneider, H. Raymond Strong: Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996. Real-Time Systems 12(3): 329-345 (1997)
- 1996
- [c30]Cynthia Dwork, Ching-Tien Ho, H. Raymond Strong: Collective Consistency (Work in Progress, Abstract). PODC 1996: 341
- [c29]Danny Dolev, Dalia Malki, H. Raymond Strong: A Framework for Partitionable Membership Service (Abstract). PODC 1996: 343
- [c28]
- 1995
- [j18]Flaviu Cristian, Houtan Aghili, H. Raymond Strong, Danny Dolev: Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement. Inf. Comput. 118(1): 158-179 (1995)
- [j17]Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong: Dynamic Fault-Tolerant Clock Synchronization. J. ACM 42(1): 143-185 (1995)
- [c27]Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Rimon Orni, H. Raymond Strong: PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain. IPPS 1995: 130-139
- [c26]M. Abayan, H. Raymond Strong, Edward L. Wimmers: The RAPID C++ Environment (Abstract). PODC 1995: 258
- [c25]Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Marcel-Catalin Rosu, H. Raymond Strong: Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations. SPAA 1995: 64-73
- 1994
- [c24]Danny Dolev, Rüdiger Reischuk, H. Raymond Strong: Observable Clock Synchronization (Extended Abstract). PODC 1994: 284-293
- [c23]Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Rimon Orni, H. Raymond Strong: PCODE: Efficient Parallel Computing over Distributed Environments. PODC 1994: 400
- 1992
- [j16]Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong: Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement. Inf. Comput. 97(2): 205-233 (1992)
- [c22]Stephen Ponzio, H. Raymond Strong: Semisynchrony and Real-Time (Extended Abstract). WDAG 1992: 120-135
- 1990
- [j15]Danny Dolev, Rüdiger Reischuk, H. Raymond Strong: Early Stopping in Byzantine Agreement. J. ACM 37(4): 720-741 (1990)
- [c21]Ajei S. Gopal, H. Raymond Strong, Sam Toueg, Flaviu Cristian: Early-Delivery Atomic Broadcast. PODC 1990: 297-309
- [c20]H. Raymond Strong, Danny Dolev, Flaviu Cristian: New Latency Bounds for Atomic Broadcast. RTSS 1990: 156-165
1980 – 1989
- 1988
- [c19]Danny Dolev, H. Raymond Strong: On Safety and Timeliness in Distributed Data Management. Concurrency 1988: 64-72
- [c18]
- 1987
- [j14]Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong: A New Look at Fault-Tolerant Network Routing. Inf. Comput. 72(3): 180-196 (1987)
- [c17]H. Raymond Strong, Dale Skeen, Flaviu Cristian, Houtan Aghili: Handshake Protocols. ICDCS 1987: 521-529
- [c16]Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong: Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement. PODC 1987: 42-51
- 1986
- [j13]Danny Dolev, Joseph Y. Halpern, H. Raymond Strong: On the Possibility and Impossibility of Achieving Clock Synchronization. J. Comput. Syst. Sci. 32(2): 230-250 (1986)
- [c15]Danny Dolev, H. Raymond Strong: A Simple Model for Agreement in Distributed Systems. Fault-Tolerant Distributed Computing 1986: 42-50
- [c14]Flaviu Cristian, Danny Dolev, H. Raymond Strong, Houtan Aghili: Atomic Broadcast in a Real-Time Environment. Fault-Tolerant Distributed Computing 1986: 51-71
- [c13]Allan D. Griefer, Houtan Aghili, Ruth Kistler, H. Raymond Strong: Highly Available Communication. ICC 1986: 1439-1443
- [c12]H. Raymond Strong: Problems in Maintaining Agreement. Symposium on Reliability in Distributed Software and Database Systems 1986: 20-27
- 1985
- [j12]C. Mohan, H. Raymond Strong, Sheldon J. Finkelstein: Method for Distributed Transaction Commit and Recovery Using Byzantine Agreement Within Clusters of Processors. Operating Systems Review 19(3): 29-43 (1985)
- [e2]Michael A. Malcolm, H. Raymond Strong (Eds.): Proceedings of the Fourth Annual ACM Symposium on Principles of Distributed Computing, Minaki, Ontario, Canada, August 5-7, 1985. ACM 1985, ISBN 0-89791-167-9
- 1984
- [c11]Joseph Y. Halpern, Barbara Simons, H. Raymond Strong, Danny Dolev: Fault-Tolerant Clock Synchronization. PODC 1984: 89-102
- [c10]Danny Dolev, Joseph Y. Halpern, H. Raymond Strong: On the Possibility and Impossibility of Achieving Clock Synchronization. STOC 1984: 504-511
- [c9]Danny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong: A New Look at Fault Tolerant Network Routing. STOC 1984: 526-535
- 1983
- [j11]
- [j10]Danny Dolev, H. Raymond Strong: Authenticated Algorithms for Byzantine Agreement. SIAM J. Comput. 12(4): 656-666 (1983)
- [c8]C. Mohan, H. Raymond Strong, Sheldon J. Finkelstein: Method for Distributed Transaction Commit and recovery Using Byzantine Agreement Within Clusters of Processors. PODC 1983: 89-103
- 1982
- [j9]Danny Dolev, Michael J. Fischer, Robert J. Fowler, Nancy A. Lynch, H. Raymond Strong: An Efficient Algorithm for Byzantine Agreement without Authentication. Information and Control 52(3): 257-274 (1982)
- [c7]Danny Dolev, H. Raymond Strong: Requirements for Agreement in a Distributed System. DDB 1982: 115-129
- [c6]Danny Dolev, Rüdiger Reischuk, H. Raymond Strong: `Eventual' Is Earlier than `Immediate'. FOCS 1982: 196-203
- [c5]Danny Dolev, H. Raymond Strong: Polynomial Algorithms for Multiple Processor Agreement. STOC 1982: 401-407
- 1981
- [j8]Mike W. Blasgen, Morton M. Astrahan, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Irving L. Traiger, Bradford W. Wade, Robert A. Yost: System R: An Architectural Overview. IBM Systems Journal 20(1): 41-62 (1981)
- 1980
- [c4]
- [i2]Sai Choi Kwan, H. Raymond Strong: Index Path Length Evaluation for the Research Storage System of System R. IBM Research Report RJ2736 (1980)
1970 – 1979
- 1979
- [j7]Morton M. Astrahan, Mike W. Blasgen, Donald D. Chamberlin, Jim Gray, W. Frank King III, Bruce G. Lindsay, Raymond A. Lorie, James W. Mehl, Thomas G. Price, Gianfranco R. Putzolu, Mario Schkolnick, Patricia G. Selinger, Donald R. Slutz, H. Raymond Strong, Paolo Tiberio, Irving L. Traiger, Bradford W. Wade, Robert A. Yost: System R: A Relational Data Base Management System. IEEE Computer 12(5): 42-48 (1979)
- [j6]H. Raymond Strong, George Markowsky, Ashok K. Chandra: Search within a Page. J. ACM 26(3): 457-482 (1979)
- [j5]Ronald Fagin, Jürg Nievergelt, Nicholas Pippenger, H. Raymond Strong: Extendible Hashing - A Fast Access Method for Dynamic Files. ACM Trans. Database Syst. 4(3): 315-344 (1979)
- 1978
- [j4]Marc A. Auslander, H. Raymond Strong: Systematic Recursion Removal. Commun. ACM 21(2): 127-134 (1978)
- [i1]H. Raymond Strong, Irving L. Traiger, George Markowsky: Slide Search. IBM Research Report RJ2274 (1978)
- 1973
- [j3]S. A. Walker, H. Raymond Strong: Characterizations of Flowchartable Recursions. J. Comput. Syst. Sci. 7(4): 404-447 (1973)
- [c3]Andrea Maggiolo-Schettini, Barry K. Rosen, H. Raymond Strong: Procedure Linkage Optimization. POPL 1973: 183-193
- [e1]Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong (Eds.): Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA. ACM 1973
- 1972
- [c2]S. A. Walker, H. Raymond Strong: Characterization of Flowchartable Recursions (Short Version). STOC 1972: 18-34
- 1971
- [c1]
- 1970
- [j2]
- [j1]H. Raymond Strong: Construction of Models for Algebraically Generalized Recursive Function Theory. J. Symb. Log. 35(3): 401-409 (1970)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-02-04 21:56 CET by the dblp team