Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRobert W. Floyd
Person information
- award (1978): Turing Award
- award (1991): Computer Pioneer Award
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 1996
[b1]Robert W. Floyd, Richard Beigel:
Die Sprache der Maschinen. Informatik Lehrbuch-Reihe, International Thomson 1996, ISBN 978-3-8266-0216-0, pp. I-XXVII, 1-652
Journal Articles
- 1990
- [j26]Robert W. Floyd, Donald E. Knuth:
Addition Machines. SIAM J. Comput. 19(2): 329-340 (1990) - 1982
- [j25]Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits. J. ACM 29(3): 603-622 (1982) - 1979
- [j24]Robert W. Floyd:
The Paradigms of Programming. Commun. ACM 22(8): 455-460 (1979) - 1975
- [j23]Robert W. Floyd, Ronald L. Rivest:
Expected Time Bounds for Selection. Commun. ACM 18(3): 165-172 (1975) - [j22]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
- [j21]Robert W. Floyd, Alan Jay Smith:
A Linear Time Two Tape Merge. Inf. Process. Lett. 2(5): 123-125 (1973) - [j20]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
- [j19]Donald E. Knuth, Robert W. Floyd:
Errata: Notes on Avoiding "go to" Statements. Inf. Process. Lett. 1(4): 177 (1972) - [j18]James C. King, Robert W. Floyd:
An Interpretation-Oriented Theorem Prover over Integers. J. Comput. Syst. Sci. 6(4): 305-323 (1972) - 1971
- [j17]Donald E. Knuth, Robert W. Floyd:
Notes on Avoiding "go to" Statements. Inf. Process. Lett. 1(1): 23-31 (1971) - 1969
- [j16]Robert W. Floyd:
A machine-oriented recognition algorithm for context-free languages. ACM SIGPLAN Notices 4(5): 28-29 (1969) - 1967
- [j15]Robert W. Floyd:
Nondeterministic Algorithms. J. ACM 14(4): 636-644 (1967) - 1964
- [j14]Robert W. Floyd:
Bounded context syntactic analysis. Commun. ACM 7(2): 62-67 (1964) - [j13]Robert W. Floyd:
Algorithm 245: Treesort. Commun. ACM 7(12): 701 (1964) - [j12]Robert W. Floyd:
The Syntax of Programming Languages-A Survey. IEEE Trans. Electron. Comput. 13(4): 346-353 (1964) - 1963
- [j11]Robert W. Floyd:
Syntactic Analysis and Operator Precedence. J. ACM 10(3): 316-333 (1963) - 1962
- [j10]Robert W. Floyd:
Algorithm 96: Ancestor. Commun. ACM 5(6): 344-345 (1962) - [j9]Robert W. Floyd:
Algorithm 97: Shortest path. Commun. ACM 5(6): 345 (1962) - [j8]Robert W. Floyd:
Algorithm 113: Treesort. Commun. ACM 5(8): 434 (1962) - [j7]Robert W. Floyd:
On the nonexistence of a phrase structure grammar for ALGOL 60. Commun. ACM 5(9): 483-484 (1962) - [j6]Robert W. Floyd:
On ambiguity in phrase structure languages. Commun. ACM 5(10): 526 (1962) - 1961
- [j5]Robert W. Floyd:
An algorithm for coding efficient arithmetic operations. Commun. ACM 4(1): 42-51 (1961) - [j4]Robert W. Floyd:
A Note on Mathematical Induction on Phrase Structure Grammars. Inf. Control. 4(4): 353-358 (1961) - [j3]Robert W. Floyd:
A Descriptive Language for Symbol Manipulation. J. ACM 8(4): 579-584 (1961) - 1960
- [j2]Robert W. Floyd:
An Algorithm Defining ALGOL Assignment Statements. Commun. ACM 3(3): 170-171 (1960) - [j1]Robert W. Floyd:
Note of amplification. Commun. ACM 3(6): 346 (1960)
Conference and Workshop Papers
- 1980
- [c7]Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract). FOCS 1980: 260-269 - 1978
- [c6]Larry Carter, Robert W. Floyd, John Gill, George Markowsky, Mark N. Wegman:
Exact and Approximate Membership Testers. STOC 1978: 59-65 - 1975
- [c5]Robert W. Floyd:
The Exact Time Required to Perform Generalized Addition. FOCS 1975: 3-5 - 1972
- [c4]Robert W. Floyd:
Permuting Information in Idealized Two-Level Storage. Complexity of Computer Computations 1972: 105-109 - [c3]Manuel Blum, Robert W. Floyd, Vaughan R. Pratt, Ronald L. Rivest, Robert Endre Tarjan:
Linear Time Bounds for Median Computations. STOC 1972: 119-124 - 1971
- [c2]Robert W. Floyd:
Toward Interactive Design of Correct Programs. IFIP Congress (1) 1971: 7-10 - 1970
- [c1]James C. King, Robert W. Floyd:
An Interpretation Oriented Theorem Prover over Integers. STOC 1970: 169-179
Editorship
- 1973
- [e1]Alfred V. Aho, Allan Borodin, Robert L. Constable, Robert W. Floyd, Michael A. Harrison, Richard M. Karp, H. Raymond Strong:
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1973, Austin, Texas, USA. ACM 1973 [contents]
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-02 23:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
