We stand with Ukraine

We stand with Ukraine

Robert W. Floyd

According to our database¹, Robert W. Floyd authored at least 33 papers between 1960 and 1996.

Collaborative distances:

Dijkstra number² of three.
Erdős number³ of three.

Awards

Turing Prize recipient

Turing Prize 1978, "For having a clear influence on methodologies for the creation of efficient and reliable software, and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic programming|automatic program synthesis, and analysis of algorithms".

ACM Fellow

ACM Fellow 1994, "For having a clear influence on methodologies for the creation of efficient and reliable software, and for helping to found the following important subfields of computer science: the theory of parsing, the semantics of programming languages, automatic program verification, automatic program synthesis, and analysis of algorithms.".

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

1996

Die Sprache der Maschinen.

[BibT_eX]

Robert W. Floyd

,

Informatik Lehrbuch-Reihe, International Thomson, ISBN: 978-3-8266-0216-0, 1996

1990

Addition Machines.

[BibT_eX]

[DOI]

Robert W. Floyd

,

Donald E. Knuth

SIAM J. Comput., 1990

1982

The Compilation of Regular Expressions into Integrated Circuits.

[BibT_eX]

[DOI]

Robert W. Floyd

,

Jeffrey D. Ullman

J. ACM, 1982

1980

The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract)

[BibT_eX]

[DOI]

Robert W. Floyd

,

Jeffrey D. Ullman

Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

1979

The Paradigms of Programming.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1979

1978

Exact and Approximate Membership Testers

[BibT_eX]

[DOI]

,

Robert W. Floyd

,

,

George Markowsky

,

Proceedings of the 10th Annual ACM Symposium on Theory of Computing, 1978

1975

The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489).

[BibT_eX]

[DOI]

Robert W. Floyd

,

Ronald L. Rivest

Commun. ACM, 1975

Expected Time Bounds for Selection.

[BibT_eX]

[DOI]

Robert W. Floyd

,

Ronald L. Rivest

Commun. ACM, 1975

The Exact Time Required to Perform Generalized Addition

[BibT_eX]

[DOI]

Robert W. Floyd

Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1973

Time Bounds for Selection.

[BibT_eX]

[DOI]

,

Robert W. Floyd

,

Vaughan R. Pratt

,

Ronald L. Rivest

,

Robert Endre Tarjan

J. Comput. Syst. Sci., 1973

A Linear Time Two Tape Merge.

[BibT_eX]

[DOI]

Robert W. Floyd

,

Inf. Process. Lett., 1973

1972

An Interpretation-Oriented Theorem Prover over Integers.

[BibT_eX]

[DOI]

,

Robert W. Floyd

J. Comput. Syst. Sci., 1972

Errata: Notes on Avoiding "go to" Statements.

[BibT_eX]

[DOI]

Donald E. Knuth

,

Robert W. Floyd

Inf. Process. Lett., 1972

Linear Time Bounds for Median Computations

[BibT_eX]

[DOI]

,

Robert W. Floyd

,

Vaughan R. Pratt

,

Ronald L. Rivest

,

Robert Endre Tarjan

Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Permuting Information in Idealized Two-Level Storage.

[BibT_eX]

[DOI]

Robert W. Floyd

Proceedings of a symposium on the Complexity of Computer Computations, 1972

1971

Notes on Avoiding "go to" Statements.

[BibT_eX]

[DOI]

Donald E. Knuth

,

Robert W. Floyd

Inf. Process. Lett., 1971

Toward Interactive Design of Correct Programs.

[BibT_eX]

Robert W. Floyd

Proceedings of the Information Processing, Proceedings of IFIP Congress 1971, Volume 1, 1971

1969

A machine-oriented recognition algorithm for context-free languages.

[BibT_eX]

[DOI]

Robert W. Floyd

ACM SIGPLAN Notices, 1969

1967

Nondeterministic Algorithms.

[BibT_eX]

[DOI]

Robert W. Floyd

J. ACM, 1967

1964

The Syntax of Programming Languages-A Survey.

[BibT_eX]

[DOI]

Robert W. Floyd

IEEE Trans. Electron. Comput., 1964

Algorithm 245: Treesort.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1964

Bounded context syntactic analysis.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1964

1963

Syntactic Analysis and Operator Precedence.

[BibT_eX]

[DOI]

Robert W. Floyd

J. ACM, 1963

1962

On ambiguity in phrase structure languages.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1962

On the nonexistence of a phrase structure grammar for ALGOL 60.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1962

Algorithm 113: Treesort.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1962

Algorithm 97: Shortest path.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1962

Algorithm 96: Ancestor.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1962

1961

A Note on Mathematical Induction on Phrase Structure Grammars

[BibT_eX]

[DOI]

Robert W. Floyd

Inf. Control., December, 1961

A Descriptive Language for Symbol Manipulation.

[BibT_eX]

[DOI]

Robert W. Floyd

J. ACM, 1961

An algorithm for coding efficient arithmetic operations.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1961

1960

Note of amplification.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1960

An Algorithm Defining ALGOL Assignment Statements.

[BibT_eX]

[DOI]

Robert W. Floyd

Commun. ACM, 1960

Loading...