| 1990 |
|---|
| 30 | | Robert W. Floyd,
Donald E. Knuth:
Addition Machines.
SIAM J. Comput. 19(2): 329-340 (1990) |
| 1982 |
|---|
| 29 | EE | Robert W. Floyd,
Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits.
J. ACM 29(3): 603-622 (1982) |
| 1980 |
|---|
| 28 | | Robert W. Floyd,
Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract)
FOCS 1980: 260-269 |
| 1979 |
|---|
| 27 | | Robert W. Floyd:
The Paradigms of Programming.
Commun. ACM 22(8): 455-460 (1979) |
| 1978 |
|---|
| 26 | | Larry Carter,
Robert W. Floyd,
John Gill,
George Markowsky,
Mark N. Wegman:
Exact and Approximate Membership Testers
STOC 1978: 59-65 |
| 1975 |
|---|
| 25 | | Robert W. Floyd:
The Exact Time Required to Perform Generalized Addition
FOCS 1975: 3-5 |
| 24 | | Robert W. Floyd,
Ronald L. Rivest:
Expected Time Bounds for Selection.
Commun. ACM 18(3): 165-172 (1975) |
| 23 | | Robert W. Floyd,
Ronald L. Rivest:
The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489).
Commun. ACM 18(3): 173 (1975) |
| 1973 |
|---|
| 22 | | Robert W. Floyd,
Alan Jay Smith:
A Linear Time Two Tape Merge.
Inf. Process. Lett. 2(5): 123-125 (1973) |
| 21 | | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest,
Robert Endre Tarjan:
Time Bounds for Selection.
J. Comput. Syst. Sci. 7(4): 448-461 (1973) |
| 1972 |
|---|
| 20 | | Manuel Blum,
Robert W. Floyd,
Vaughan R. Pratt,
Ronald L. Rivest,
Robert Endre Tarjan:
Linear Time Bounds for Median Computations
STOC 1972: 119-124 |
| 19 | | Donald E. Knuth,
Robert W. Floyd:
Errata: Notes on Avoiding "go to" Statements.
Inf. Process. Lett. 1(4): 177 (1972) |
| 18 | | James C. King,
Robert W. Floyd:
An Interpretation-Oriented Theorem Prover over Integers.
J. Comput. Syst. Sci. 6(4): 305-323 (1972) |
| 1971 |
|---|
| 17 | | Robert W. Floyd:
Toward Interactive Design of Correct Programs.
IFIP Congress (1) 1971: 7-10 |
| 16 | | Donald E. Knuth,
Robert W. Floyd:
Notes on Avoiding "go to" Statements.
Inf. Process. Lett. 1(1): 23-31 (1971) |
| 1970 |
|---|
| 15 | | James C. King,
Robert W. Floyd:
An Interpretation Oriented Theorem Prover over Integers
STOC 1970: 169-179 |
| 1967 |
|---|
| 14 | EE | Robert W. Floyd:
Nondeterministic Algorithms.
J. ACM 14(4): 636-644 (1967) |
| 1964 |
|---|
| 13 | EE | Robert W. Floyd:
Algorithm 245: Treesort.
Commun. ACM 7(12): 701 (1964) |
| 12 | EE | Robert W. Floyd:
Bounded context syntactic analysis.
Commun. ACM 7(2): 62-67 (1964) |
| 1963 |
|---|
| 11 | EE | Robert W. Floyd:
Syntactic Analysis and Operator Precedence.
J. ACM 10(3): 316-333 (1963) |
| 1962 |
|---|
| 10 | EE | Robert W. Floyd:
On ambiguity in phrase structure languages.
Commun. ACM 5(10): 526 (1962) |
| 9 | EE | Robert W. Floyd:
Algorithm 96: Ancestor.
Commun. ACM 5(6): 344-345 (1962) |
| 8 | EE | Robert W. Floyd:
Algorithm 97: Shortest path.
Commun. ACM 5(6): 345 (1962) |
| 7 | EE | Robert W. Floyd:
Algorithm 113: Treesort.
Commun. ACM 5(8): 434 (1962) |
| 6 | EE | Robert W. Floyd:
On the nonexistence of a phrase structure grammar for ALGOL 60.
Commun. ACM 5(9): 483-484 (1962) |
| 1961 |
|---|
| 5 | EE | Robert W. Floyd:
An algorithm for coding efficient arithmetic operations.
Commun. ACM 4(1): 42-51 (1961) |
| 4 | | Robert W. Floyd:
A Note on Mathematical Induction on Phrase Structure Grammars
Information and Control 4(4): 353-358 (1961) |
| 3 | EE | Robert W. Floyd:
A Descriptive Language for Symbol Manipulation.
J. ACM 8(4): 579-584 (1961) |
| 1960 |
|---|
| 2 | EE | Robert W. Floyd:
An Algorithm Defining ALGOL Assignment Statements.
Commun. ACM 3(3): 170-171 (1960) |
| 1 | EE | Robert W. Floyd:
Note of amplification.
Commun. ACM 3(6): 346 (1960) |
