H. Raymond Strong

According to our database1, H. Raymond Strong authored at least 50 papers between 1970 and 1999.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

1999
System R: An Architectural Overview.
IBM Systems Journal, 1999

1997
Report Dagstuhl Seminar on Time Services, Schloß Dagstuhl, March 11-15, 1996.
Real-Time Systems, 1997

1996
Collective Consistency.
Proceedings of the Distributed Algorithms, 10th International Workshop, 1996

Collective Consistency (Work in Progress, Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

A Framework for Partitionable Membership Service (Abstract).
Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995
Atomic Broadcast: From Simple Message Diffusion to Byzantine Agreement
Inf. Comput., April, 1995

Dynamic Fault-Tolerant Clock Synchronization.
J. ACM, 1995

Efficient Message Passing Interface (MPI) for Parallel Computing on Clusters of Workstations.
Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures, 1995

The RAPID C++ Environment (Abstract).
Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

PCODE: an efficient and reliable collective communication protocol for unreliable broadcast domain.
Proceedings of IPPS '95, 1995

1994
Observable Clock Synchronization (Extended Abstract).
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

PCODE: Efficient Parallel Computing over Distributed Environments.
Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

1992
Shifting Gears: Changing Algorithms on the Fly to Expedite Byzantine Agreement
Inf. Comput., April, 1992

Semisynchrony and Real-Time (Extended Abstract).
Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

1990
Early Stopping in Byzantine Agreement
J. ACM, October, 1990

New Latency Bounds for Atomic Broadcast.
Proceedings of the Real-Time Systems Symposium, 1990

Early-Delivery Atomic Broadcast.
Proceedings of the Ninth Annual ACM Symposium on Principles of Distributed Computing, 1990

1988
Fault Tolerant Distributed Services.
Proceedings of the Seventh Annual ACM Symposium on Principles of Distributed Computing, 1988

On Safety and Timeliness in Distributed Data Management.
Proceedings of the Concurrency 88: International Conference on Concurrency, 1988

1987
Shifting Gears: Changing Algorithms on the Fly To Expedite Byzantine Agreement.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

Handshake Protocols.
Proceedings of the 7th International Conference on Distributed Computing Systems, 1987

1986
On the Possibility and Impossibility of Achieving Clock Synchronization.
J. Comput. Syst. Sci., 1986

Problems in Maintaining Agreement.
Proceedings of the Fifth Symposium on Reliability in Distributed Software and Database Systems, 1986

Highly Available Communication.
Proceedings of the IEEE International Conference on Communications: Integrating the World Through Communications, 1986

A Simple Model for Agreement in Distributed Systems.
Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

Atomic Broadcast in a Real-Time Environment.
Proceedings of the Fault-Tolerant Distributed Computing [Asilomar Workshop 1986], 1986

1984
A New Look at Fault Tolerant Network Routing
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

On the Possibility and Impossibility of Achieving Clock Synchronization
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

Fault-Tolerant Clock Synchronization.
Proceedings of the Third Annual ACM Symposium on Principles of Distributed Computing, 1984

1983
Vector Execution of Flow Graphs
J. ACM, January, 1983

Authenticated Algorithms for Byzantine Agreement.
SIAM J. Comput., 1983

Method for Distributed Transaction Commit and recovery Using Byzantine Agreement Within Clusters of Processors.
Proceedings of the Second Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing, 1983

1982
An Efficient Algorithm for Byzantine Agreement without Authentication
Information and Control, March, 1982

Polynomial Algorithms for Multiple Processor Agreement
Proceedings of the 14th Annual ACM Symposium on Theory of Computing, 1982

'Eventual' Is Earlier than 'Immediate'
Proceedings of the 23rd Annual Symposium on Foundations of Computer Science, 1982

Requirements for Agreement in a Distributed System.
DDB, 1982

1981
System R: An Architectural Overview.
IBM Systems Journal, 1981

1980
Index Path Length Evaluation for the Research Storage System of System R.
IBM Research Report, January, 1980

Vector Execution of Flow Graphs (Extended Abstract)
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

1979
Extendible Hashing - A Fast Access Method for Dynamic Files.
ACM Trans. Database Syst., 1979

Search within a Page.
J. ACM, 1979

System R: A Relational Data Base Management System.
IEEE Computer, 1979

1978
Slide Search.
IBM Research Report, June, 1978

Systematic Recursion Removal.
Commun. ACM, 1978

1973
Characterizations of Flowchartable Recursions.
J. Comput. Syst. Sci., 1973

Procedure Linkage Optimization.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

1972
Characterization of Flowchartable Recursions (Short Version)
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

1971
High Level Languages of Maximum Power
Proceedings of the 12th Annual Symposium on Switching and Automata Theory, 1971

1970
Construction of Models for Algebraically Generalized Recursive Function Theory.
J. Symb. Log., 1970

Depth-Bounded Computation.
J. Comput. Syst. Sci., 1970


  Loading...