default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlfred V. Aho
Person information
- affiliation: Columbia University, New York City, USA
- award (2020): Turing Award
- award (2003): IEEE John von Neumann Medal
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2022
[j55]Alfred V. Aho, Jeffrey D. Ullman:
Abstractions, their algorithms, and their compilers. Commun. ACM 65(2): 76-91 (2022)- 2021
- [c38]Alfred V. Aho:
Computational thinking in programming language and compiler design (keynote). STOC 2021: 1
2010 – 2019
- 2017
- [c37]Suzanna Schmeelk, Fred Fontaine, Larisa Ackerman, Alfred V. Aho:
Learning Java in a New York City immigrant engineer retraining program. FIE 2017: 1-7 - 2015
- [c36]Suzanna Schmeelk, Junfeng Yang, Alfred V. Aho:
Android Malware Static Analysis Techniques. CISR 2015: 5:1-5:8 - 2014
- [j54]Alfred V. Aho, Georg Gottlob
:
A front row seat to Communications' editorial transformation. Commun. ACM 57(4): 5 (2014) - 2012
- [j53]Alfred V. Aho:
Computation and Computational Thinking. Comput. J. 55(7): 832-835 (2012) - 2011
- [j52]Alfred V. Aho:
Ubiquity symposium: Computation and Computational Thinking. Ubiquity 2011(January): 1 (2011) - [p3]Alfred V. Aho:
Complexity Theory. Computer Science, The Hardware, Software and Heart of It 2011: 241-267 - [e8]Edward K. Blum, Alfred V. Aho:
Computer Science, The Hardware, Software and Heart of It. Springer 2011, ISBN 978-1-4614-1167-3 [contents]
2000 – 2009
- 2008
- [j51]Alfred V. Aho:
Teaching the compilers course. ACM SIGCSE Bull. 40(4): 6-8 (2008) - [j50]Marc Eaddy, Thomas Zimmermann, Kaitin D. Sherwood, Vibhav Garg, Gail C. Murphy, Nachiappan Nagappan, Alfred V. Aho:
Do Crosscutting Concerns Cause Defects? IEEE Trans. Software Eng. 34(4): 497-515 (2008) - [c35]Marc Eaddy, Alfred V. Aho, Giuliano Antoniol, Yann-Gaël Guéhéneuc:
CERBERUS: Tracing Requirements to Source Code Using Information Retrieval, Dynamic Analysis, and Program Analysis. ICPC 2008: 53-62 - 2007
- [c34]Marc Eaddy, Alfred V. Aho, Weiping Hu, Paddy McDonald, Julian Burger:
Debugging Aspect-Enabled Programs. SC@ETAPS 2007: 200-215 - 2006
- [j49]Krysta M. Svore, Alfred V. Aho, Andrew W. Cross, Isaac L. Chuang, Igor L. Markov:
A Layered Software Architecture for Quantum Computing Design Tools. Computer 39(1): 74-83 (2006) - [j48]Krysta M. Svore, Andrew W. Cross, Isaac L. Chuang, Alfred V. Aho:
A flow-map model for analyzing pseudothresholds in fault-tolerant quantum computing. Quantum Inf. Comput. 6(3): 193-212 (2006) - [c33]Marc Eaddy, Alfred V. Aho:
Statement Annotations for Fine-Grained Advising. RAM-SE 2006: 89-99 - 2003
- [p2]Alfred V. Aho, Mark Goldberg, Josef Lauri, Richard B. Borie, R. Gary Parker, Craig A. Tovey:
Graph Representation. Handbook of Graph Theory 2003: 56-125 - 2002
- [j47]Kenneth A. Ross, Alfred V. Aho, Anastassia Ailamaki:
Reminiscences on Influential Papers. SIGMOD Rec. 31(4): 97 (2002) - 2000
- [c32]Alfred V. Aho, David Lee:
Hierarchical networks and the LSA N-squared problem in OSPF routing. GLOBECOM 2000: 397-404
1990 – 1999
- 1998
- [c31]Alfred V. Aho, Sean Gallagher, Nancy D. Griffeth, Cynthia Schell, Deborah Swayne:
SCF3/Sculptor with Chisel: Requirements Engineering for Communications Services. FIW 1998: 45-63 - 1997
- [j46]Alfred V. Aho, Shih-Fu Chang, Kathleen R. McKeown, Dragomir R. Radev, John R. Smith, Kazi A. Zaman:
Columbia Digital News Project: An Environment for Briefing and Search over Multimedia Information. Int. J. Digit. Libr. 1(4): 377-385 (1997) - [j45]Alfred V. Aho, David S. Johnson, Richard M. Karp, S. Rao Kosaraju, Catherine C. McGeoch, Christos H. Papadimitriou, Pavel A. Pevzner:
Emerging opportunities for theoretical computer science. SIGACT News 28(3): 65-74 (1997) - [c30]Alfred V. Aho, Shih-Fu Chang, Kathleen R. McKeown, Dragomir R. Radev, John R. Smith, Kazi A. Zaman:
Columbia Digital News System An Environment for Briefing and Search over Multimedia Information. ADL 1997: 82-94 - 1996
- [b8]Alfred V. Aho, Jeffrey D. Ullman:
Informatik - Datenstrukturen und Konzepte der Abstraktion. Informatik Lehrbuchreihe, International Thomson 1996, ISBN 978-3-8266-0242-9, pp. 1-1042 - [c29]Alfred V. Aho:
Accessing Information from Globally Distributed Knowledge Repositories. PODS 1996: 1-4 - 1995
- [c28]Alfred V. Aho, Nancy D. Griffeth:
Feature Interactions in the Global Information Infrastructure (Panel). SIGSOFT FSE 1995: 2-4 - 1992
- [b7]Alfred V. Aho, Jeffrey D. Ullman:
Foundations of Computer Science, C Edition. Computer Science Press / W. H. Freeman 1992, ISBN 0716782332, pp. I-XIII, 1-765 - 1991
- [j44]Alfred V. Aho, Anton T. Dahbura, David Lee, M. Ümit Uyar:
An optimization technique for protocol conformance test generation based on UIO sequences and rural Chinese postman tours. IEEE Trans. Commun. 39(11): 1604-1615 (1991) - 1990
- [p1]Alfred V. Aho:
Algorithms for Finding Patterns in Strings. Handbook of Theoretical Computer Science, Volume A: Algorithms and Complexity (A) 1990: 255-300
1980 – 1989
- 1989
- [j43]Alfred V. Aho, Mahadevan Ganapathi, Steven W. K. Tjiang:
Code Generation Using Tree Matching and Dynamic Programming. ACM Trans. Program. Lang. Syst. 11(4): 491-516 (1989) - 1988
- [b6]Alfred V. Aho, Brian W. Kernighan, Peter J. Weinberger:
The AWK Programming Language. Addison-Wesley 1988 - [j42]Alfred V. Aho, Ravi Sethi:
Maintaining Cross References in Manuscripts. Softw. Pract. Exp. 18(1): 1-13 (1988) - 1987
- [e7]Alfred V. Aho:
Proceedings of the 19th Annual ACM Symposium on Theory of Computing, 1987, New York, New York, USA. ACM 1987, ISBN 0-89791-221-7 [contents] - 1986
- [b5]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman:
Compilers: Principles, Techniques, and Tools. Addison-Wesley series in computer science / World student series edition, Addison-Wesley 1986, ISBN 0-201-10088-6, pp. I-X, 1-796 - [c27]Alfred V. Aho, David Lee:
Storing a Dynamic Sparse Table. FOCS 1986: 55-60 - 1985
- [c26]Alfred V. Aho, Mahadevan Ganapathi:
Efficient Tree Pattern Matching: An Aid to Code Generation. POPL 1985: 334-340 - 1984
- [j41]Alfred V. Aho:
The UNIX system: Foreword. AT&T Bell Lab. Tech. J. 63(8): 1573-1576 (1984) - 1983
- [b4]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7 - [c25]Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis:
On Notions of Information Transfer in VLSI Circuits. STOC 1983: 133-139 - 1982
- [e6]Jeffrey D. Ullman, Alfred V. Aho:
Proceedings of the ACM Symposium on Principles of Database Systems, March 29-31, 1982, Los Angeles, California, USA. ACM 1982, ISBN 0-89791-070-2 [contents] - 1981
- [j40]Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman:
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. SIAM J. Comput. 10(3): 405-421 (1981) - [j39]Marvin V. Zelkowitz, W. Richards Adrion, Alfred V. Aho, Daniel G. Bobrow, Thomas Cheatham, John C. Cherniavsky, Susan L. Gerhart, Gordon Lyon, John Nestor, Terry A. Straeter:
High level language programming environments. ACM SIGSOFT Softw. Eng. Notes 6(4): 36-51 (1981) - 1980
- [j38]Alfred V. Aho:
Translator Writing Systems: Where Do they Now Stand? Computer 13(8): 9-14 (1980)
1970 – 1979
- 1979
- [j37]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246 (1979) - [j36]Alfred V. Aho, Brian W. Kernighan, Peter J. Weinberger:
Awk-A Pattern Scanning and Processing Language. Softw. Pract. Exp. 9(4): 267-279 (1979) - [j35]Alfred V. Aho, Jeffrey D. Ullman:
Optimal Partial-Match Retrieval When Fields Are Independently Specified. ACM Trans. Database Syst. 4(2): 168-179 (1979) - [j34]Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman:
The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3): 297-314 (1979) - [j33]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions. ACM Trans. Database Syst. 4(4): 435-454 (1979) - [c24]Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis:
Modeling Communications Protocols by Automata. FOCS 1979: 267-273 - [c23]Alfred V. Aho, Jeffrey D. Ullman:
The Universality of Data Retrieval Languages. POPL 1979: 110-120 - [e5]Alfred V. Aho, Stephen N. Zilles, Barry K. Rosen:
Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, Texas, USA, January 1979. ACM Press 1979 [contents] - [e4]Michael J. Fischer, Richard A. DeMillo, Nancy A. Lynch, Walter A. Burkhard, Alfred V. Aho:
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30 - May 2, 1979, Atlanta, Georgia, USA. ACM 1979 [contents] - 1978
- [c22]Alfred V. Aho, Susan L. Graham:
Tools For Automatic Compiler Generation (Panel Discussion). ACM Annual Conference (1) 1978: 476-477 - [c21]Alfred V. Aho, Stephen C. Johnson:
Tools For Automatic Compiler Generation (Panel Discussion). ACM Annual Conference (1) 1978: 476 - [c20]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions (Abstract). SIGMOD Conference 1978: 39 - [e3]Alfred V. Aho, Stephen N. Zilles, Thomas G. Szymanski:
Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, Tucson, Arizona, USA, January 1978. ACM Press 1978 [contents] - [e2]Richard J. Lipton, Walter A. Burkhard, Walter J. Savitch, Emily P. Friedman, Alfred V. Aho:
Proceedings of the 10th Annual ACM Symposium on Theory of Computing, May 1-3, 1978, San Diego, California, USA. ACM 1978 [contents] - 1977
- [j32]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions. J. ACM 24(1): 146-160 (1977) - [j31]Alfred V. Aho, Michael R. Garey, Frank K. Hwang:
Rectilinear steiner trees: Efficient special-case algorithms. Networks 7(1): 37-58 (1977) - [c19]Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman:
The Theory of Joins in Relational Data Bases (Extended Abstract). FOCS 1977: 107-113 - [c18]Alfred V. Aho, Ravi Sethi:
How Hard is Compiler Code Generation? ICALP 1977: 1-15 - [c17]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Machines with Multiregister Operations. POPL 1977: 21-28 - 1976
- [j30]Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem. J. ACM 23(1): 1-12 (1976) - [j29]Alfred V. Aho, Stephen C. Johnson:
Optimal Code Generation for Expression Trees. J. ACM 23(3): 488-501 (1976) - [j28]Alfred V. Aho, Jeffrey D. Ullman:
Node Listings for Reducible Flow Graphs. J. Comput. Syst. Sci. 13(3): 286-299 (1976) - [j27]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees. SIAM J. Comput. 5(1): 115-132 (1976) - [c16]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions. POPL 1976: 19-31 - 1975
- [j26]Alfred V. Aho, Margaret J. Corasick:
Efficient String Matching: An Aid to Bibliographic Search. Commun. ACM 18(6): 333-340 (1975) - [j25]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars. Commun. ACM 18(8): 441-452 (1975) - [j24]Alfred V. Aho, Kenneth Steiglitz, Jeffrey D. Ullman:
Evaluating Polynomials at Fixed Sets of Points. SIAM J. Comput. 4(4): 533-539 (1975) - [c15]Alfred V. Aho, Jeffrey D. Ullman:
Node Listings for Reducible Flow Graphs. STOC 1975: 177-185 - [c14]Alfred V. Aho, Stephen C. Johnson:
Optimal Code Generation for Expression Trees. STOC 1975: 207-217 - 1974
- [b3]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6 - [j23]Alfred V. Aho, Stephen C. Johnson:
LR Parsing. ACM Comput. Surv. 6(2): 99-124 (1974) - [j22]Alfred V. Aho, Jeffrey D. Ullman:
Dynamic Memories with Rapid Random and Sequential Access. IEEE Trans. Computers 23(3): 272-276 (1974) - [c13]Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). SWAT 1974: 104-109 - 1973
- [b2]Alfred V. Aho, Jeffrey D. Ullman:
The theory of parsing, translation, and compiling. 2: Compiling. Prentice-Hall 1973, ISBN 0139145648, pp. I-XII, 1-543 - [j21]Alfred V. Aho, Jeffrey D. Ullman:
Error Detection in Precedence Parsers. Math. Syst. Theory 7(2): 97-113 (1973) - [j20]Alfred V. Aho, Jeffrey D. Ullman:
A Technique for Speeding up LR(k) Parsers. SIAM J. Comput. 2(2): 106-127 (1973) - [c12]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars. POPL 1973: 1-21 - [c11]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees. STOC 1973: 253-265 - [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] - 1972
- [b1]Alfred V. Aho, Jeffrey D. Ullman:
The theory of parsing, translation, and compiling. 1: Parsing. Prentice-Hall 1972, ISBN 0139145567, pp. I-XVIII, 1-542 - [j19]Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
Weak and Mixed Strategy Precedence Parsing. J. ACM 19(2): 225-243 (1972) - [j18]Alfred V. Aho, Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables. J. Comput. Syst. Sci. 6(2): 125-137 (1972) - [j17]Alfred V. Aho, Jeffrey D. Ullman:
Optimization of LR(k) Parsers. J. Comput. Syst. Sci. 6(6): 573-602 (1972) - [j16]Alfred V. Aho, Jeffrey D. Ullman:
Optimization of Straight Line Programs. SIAM J. Comput. 1(1): 1-19 (1972) - [j15]Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman:
The Transitive Reduction of a Directed Graph. SIAM J. Comput. 1(2): 131-137 (1972) - [j14]Alfred V. Aho, Thomas G. Peterson:
A Minimum Distance Error-Correcting Parser for Context-Free Languages. SIAM J. Comput. 1(4): 305-312 (1972) - [c10]Alfred V. Aho, Jeffrey D. Ullman:
A Technique for Speeding Up LR(k) Parsers. STOC 1972: 251-263 - 1971
- [j13]Alfred V. Aho, Jeffrey D. Ullman:
Translations on a Context-Free Grammar. Inf. Control. 19(5): 439-475 (1971) - [j12]Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
Principles of Optimal Page Replacement. J. ACM 18(1): 80-93 (1971) - [j11]Alfred V. Aho, Jeffrey D. Ullman:
Characterizations and Extensions of Pushdown Translations. Math. Syst. Theory 5(2): 172-192 (1971) - [c9]Alfred V. Aho, Jeffrey D. Ullman:
The Care and Feeding of LR(k) Grammars. STOC 1971: 159-170 - 1970
- [j10]Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft:
On the Computational Power of Pushdown Automata. J. Comput. Syst. Sci. 4(2): 129-136 (1970) - [j9]Alfred V. Aho, Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages. J. Comput. Syst. Sci. 4(6): 523-538 (1970) - [c8]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman:
A formal approach to code optimization. Symposium on Compiler Optimization 1970: 86-100 - [c7]Alfred V. Aho, Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables. SWAT 1970: 25-31 - [c6]Alfred V. Aho, Jeffrey D. Ullman:
Transformations on Straight Line Programs-Preliminary Version. STOC 1970: 136-148
1960 – 1969
- 1969
- [j8]Alfred V. Aho:
Nested Stack Automata. J. ACM 16(3): 383-406 (1969) - [j7]Alfred V. Aho, Jeffrey D. Ullman:
Syntax Directed Translations and the Pushdown Assembler. J. Comput. Syst. Sci. 3(1): 37-56 (1969) - [j6]Alfred V. Aho, Jeffrey D. Ullman:
Properties of Syntax Directed Translations. J. Comput. Syst. Sci. 3(3): 319-334 (1969) - [j5]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
A General Theory of Translation. Math. Syst. Theory 3(3): 193-221 (1969) - [c5]Alfred V. Aho, Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages. SWAT 1969: 231-239 - [c4]Alfred V. Aho, Jeffrey D. Ullman:
Translations on a Context Free Grammar. STOC 1969: 93-112 - 1968
- [j4]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Time and Tape Complexity of Pushdown Automaton Languages. Inf. Control. 13(3): 186-206 (1968) - [j3]Alfred V. Aho:
Indexed Grammars - An Extension of Context-Free Grammars. J. ACM 15(4): 647-671 (1968) - [j2]Alfred V. Aho, Jeffrey D. Ullman:
The Theory of Languages. Math. Syst. Theory 2(2): 97-125 (1968) - [j1]Alfred V. Aho:
R68-27 Programming Languages for Automata. IEEE Trans. Computers 17(6): 606 (1968) - [c3]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
A recognition algorithm for pushdown store systems. ACM National Conference 1968: 597-604 - [c2]Alfred V. Aho, Jeffrey D. Ullman:
Automaton Analogs of Syntax Directed Translation Schemata. SWAT 1968: 143-159 - 1967
- [c1]Alfred V. Aho:
Indexed Grammars-An Extension of Context Free Grammars. SWAT 1967: 21-31
Coauthor Index
[j55] [b8] [b7] [b5] [b4] [c25] [e6] [j40] [j37] [j35] [j34] [j33] [c24] [c23] [c20] [j32] [c19] [c17] [j30] [j28] [j27] [c16] [j25] [j24] [c15] [b3] [j22] [c13] [b2] [j21] [j20] [c12] [c11] [b1] [j19] [j18] [j17] [j16] [j15] [c10] [j13] [j12] [j11] [c9] [j10] [j9] [c8] [c7] [c6] [j7] [j6] [j5] [c5] [c4] [j4] [j2] [c3] [c2]
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 21:46 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:
