Skip to content

H. Raymond Strong

Publication record assembled from the DBLP archive of ranked conferences.

Papers indexed

22

Venues

9

Active years

1971–1996

Best venue rank

A*

Where they publish

Papers

22 indexed papers, newest first.

YearVenueTitleAuthors
1996PODCA Framework for Partitionable Membership Service (Abstract).Danny Dolev, Dalia Malki, H. Raymond Strong
1996PODCCollective Consistency (Work in Progress, Abstract).Cynthia Dwork, Ching-Tien Ho, H. Raymond Strong
1995SPAAEfficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Marcel-Catalin Rosu, H. Raymond Strong
1994PODCPCODE: Efficient Parallel Computing over Distributed Environments.Jehoshua Bruck, Danny Dolev, Ching-Tien Ho, Rimon Orni, H. Raymond Strong
1994PODCObservable Clock Synchronization (Extended Abstract).Danny Dolev, Rdiger Reischuk, H. Raymond Strong
1990PODCEarly-Delivery Atomic Broadcast.Ajei S. Gopal, H. Raymond Strong, Sam Toueg, Flaviu Cristian
1990RTSSNew Latency Bounds for Atomic Broadcast.H. Raymond Strong, Danny Dolev, Flaviu Cristian
1988CONCUROn Safety and Timeliness in Distributed Data Management.Danny Dolev, H. Raymond Strong
1988PODCFault Tolerant Distributed Services.Allan D. Griefer, H. Raymond Strong
1987ICDCSHandshake Protocols.H. Raymond Strong, Dale Skeen, Flaviu Cristian, Houtan Aghili
1987PODCShifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement.Amotz Bar-Noy, Danny Dolev, Cynthia Dwork, H. Raymond Strong
1986SRDSProblems in Maintaining Agreement.H. Raymond Strong
1984PODCFault-Tolerant Clock Synchronization.Joseph Y. Halpern, Barbara Simons, H. Raymond Strong, Danny Dolev
1984STOCOn the Possibility and Impossibility of Achieving Clock SynchronizationDanny Dolev, Joseph Y. Halpern, H. Raymond Strong
1984STOCA New Look at Fault Tolerant Network RoutingDanny Dolev, Joseph Y. Halpern, Barbara Simons, H. Raymond Strong
1983PODCMethod for Distributed Transaction Commit and recovery Using Byzantine Agreement Within Clusters of Processors.C. Mohan, H. Raymond Strong, Sheldon J. Finkelstein
1982FOCS'Eventual' Is Earlier than 'Immediate'Danny Dolev, Rdiger Reischuk, H. Raymond Strong
1982STOCPolynomial Algorithms for Multiple Processor AgreementDanny Dolev, H. Raymond Strong
1980STOCVector Execution of Flow Graphs (Extended Abstract)H. Raymond Strong
1973POPLProcedure Linkage Optimization.Andrea Maggiolo-Schettini, Barry K. Rosen, H. Raymond Strong
1972STOCCharacterization of Flowchartable Recursions (Short Version)S. A. Walker, H. Raymond Strong
1971FOCSHigh Level Languages of Maximum PowerH. Raymond Strong