Author: Robert W. Floyd
Publications
Co-authors
Productive Colleagues
Publications
Floyd, Robert W. (1979): The Paradigms of Programming. In Communications of the ACM, 22 (8) pp. 455-460.
Floyd, Robert W., Rivest, Ronald L. (1975): Expected Time Bounds for Selection. In Communications of the ACM, 18 (3) pp. 165-172.
Floyd, Robert W., Rivest, Ronald L. (1975): The Algorithm SELECT - for Finding the ith Smallest of n Elements [M1] (Algorithm 489). In Communications of the ACM, 18 (3) pp. 173.
Floyd, Robert W. (1964): Bounded context syntactic analysis. In Communications of the ACM, 7 (2) pp. 62-67. https://dl.acm.org/doi/10.1145/363921.363927
Floyd, Robert W. (1964): Algorithm 245: Treesort. In Communications of the ACM, 7 (12) pp. 701. https://dl.acm.org/doi/10.1145/355588.365103
Floyd, Robert W. (1962): Algorithm 113: Treesort. In Communications of the ACM, 5 (8) pp. 434. https://dl.acm.org/doi/10.1145/368637.368654
Floyd, Robert W. (1962): Algorithm 96: Ancestor. In Communications of the ACM, 5 (6) pp. 344-345. https://dl.acm.org/doi/10.1145/367766.368166
Floyd, Robert W. (1962): Algorithm 97: Shortest path. In Communications of the ACM, 5 (6) pp. 345. https://dl.acm.org/doi/10.1145/367766.368168
Floyd, Robert W. (1962): On the nonexistence of a phrase structure grammar for ALGOL 60. In Communications of the ACM, 5 (9) pp. 483-484. https://dl.acm.org/doi/10.1145/368834.368898
Floyd, Robert W. (1962): On ambiguity in phrase structure languages. In Communications of the ACM, 5 (10) pp. 526. https://dl.acm.org/doi/10.1145/368959.368993
Floyd, Robert W. (1961): An algorithm for coding efficient arithmetic operations. In Communications of the ACM, 4 (1) pp. 42-51. https://dl.acm.org/doi/10.1145/366062.366082
Floyd, Robert W. (1960): An Algorithm Defining ALGOL Assignment Statements. In Communications of the ACM, 3 (3) pp. 170-171. https://dl.acm.org/doi/10.1145/367149.367170
Floyd, Robert W. (1960): Note of amplification. In Communications of the ACM, 3 (6) pp. 346. https://dl.acm.org/doi/10.1145/367297.367314