Alfred Aho
Ilmuwan komputer Kanada
Alfred Vaino Aho (lahir 9 Agustus 1941) adalah seorang ilmuwan komputer Kanada yang dikenal atas karyanya tentang bahasa pemprograman, kompilator, dan algoritma terkait, dan buku-buku pelajaran buatannya tentang seni dan sains pemprograman komputer.[2][3][4][5][6][7][8][9][10][11] Ia dan kolaborator jangka panjangnya Jeffrey Ullman adalah penerima Penghargaan Turing 2020, yang umum dianggap sebagai penghargaan tertinggi dalam ilmu komputer.[12]
| Alfred Aho | |
|---|---|
| Lahir | Alfred Vaino Aho 09 Agustus 1941 Timmins, Ontario |
| Kebangsaan | Kanada Amerika Serikat |
| Almamater | |
| Dikenal atas | |
| Penghargaan |
|
| Karier ilmiah | |
| Bidang | Ilmu komputer |
| Institusi | Universitas Columbia |
| Disertasi | Indexed Grammars: An Extension of Context Free Grammars (1968) |
| Pembimbing doktoral | John Hopcroft[1] |
Buku sunting
- A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 1, Parsing. Prentice Hall, 1972. ISBN 0-13-914556-7
- A. V. Aho (ed.) Currents in the Theory of Computing. Prentice Hall, 1973. ISBN 0-13-195651-5[13]
- A. V. Aho and J. D. Ullman, The Theory of Parsing, Translation, and Compiling, Vol. 2, Compiling. Prentice-Hall, 1973. ISBN 978-0-13-914564-3
- A. V. Aho, J. E. Hopcroft, J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1974. ISBN 0-201-00023-7
- A. V. Aho and J. D. Ullman, Principles of Compiler Design. Addison-Wesley, 1977. ISBN 0-201-00022-9
- A. V. Aho, J. E. Hopcroft, J. D. Ullman, Data Structures and Algorithms. Addison-Wesley, 1983. ISBN 0-201-00023-7
- A. V. Aho, R. Sethi, J. D. Ullman, Compilers: Principles, Techniques, and Tools. Addison-Wesley, Reading MA 1986. ISBN 0-201-10088-6
- A. V. Aho, B. W. Kernighan, and P. J. Weinberger, The AWK Programming Language. Addison-Wesley, 1988. ISBN 978-0-201-07981-4
- A. V. Aho and J. D. Ullman, Foundations of Computer Science. W. H. Freeman/Computer Science Press, 1992. ISBN 978-0-7167-8233-9[14][15]
- A. V. Aho and J. D. Ullman, Foundations of Computer Science, C Edition. W. H. Freeman, 1995. ISBN 978-0-7167-8284-1
- A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools, Second Edition. Addison-Wesley, 2007. ISBN 978-0-321-48681-3
Referensi sunting
- ^ Alfred Vaino Aho di Mathematics Genealogy Project
- ^ Aho, A. V. (1968). "Indexed Grammars---An Extension of Context-Free Grammars". Journal of the ACM. 15 (4): 647–671. doi:10.1145/321479.321488.
- ^ Aho, A.; Gottlob, G. (2014). "A front row seat to Communications' editorial transformation". Communications of the ACM. 57 (4): 5. doi:10.1145/2582611.
- ^ Aho, A. V. (1969). "Nested Stack Automata". Journal of the ACM. 16 (3): 383–406. doi:10.1145/321526.321529.
- ^ Aho, Alfred V.; Corasick, Margaret J. (Jun 1975). "Efficient String Matching: An Aid to Bibliographic Search" (PDF). Communications of the ACM. 18 (6): 333–340. doi:10.1145/360825.360855. [pranala nonaktif permanen]
- ^ Aho, A. V.; Johnson, S. C.; Ullman, J. D. (1977). "Code Generation for Expressions with Common Subexpressions". Journal of the ACM. 24: 146–160. doi:10.1145/321992.322001.
- ^ Aho, A. V.; Kernighan, B. W.; Weinberger, P. J. (1979). "Awk — a pattern scanning and processing language". Software: Practice and Experience. 9 (4): 267. CiteSeerX 10.1.1.80.4787
. doi:10.1002/spe.4380090403.
- ^ Aho, A.V. (1990). "Algorithms for Finding Patterns in Strings". Handbook of Theoretical Computer Science. MIT Press. hlm. 255–300.
- ^ Templat:ACMPortal
- ^ Computerworld Interview with Alfred V. Aho Diarsipkan 2008-05-29 di Wayback Machine.
- ^ Creating Reliable Programs from Unreliable Programmers [PDF], Excellentia
- ^ Kesalahan pengutipan: Tag
<ref>tidak sah; tidak ditemukan teks untuk ref bernama:0 - ^ "Currents in the theory of computing, edited by Alfred V. Aho. Contributing authors: Ronald V. Book [and others]". worldcat.org. Diakses tanggal April 1, 2021.
- ^ "Foundations of computer science". worldcat.org. Diakses tanggal April 1, 2021.
- ^ "Foundations of computer science". worldcat.org. Diakses tanggal April 1, 2021.
