Daniel P. Friedman
Impact in
- Hardware and Architecture top 0.5%
- Parallel Computing and Optimization Techniques
- Software top 1%
Papers in
-
- Logic, programming, and type systems 63
- Logic, Reasoning, and Knowledge 23
-
- Formal Methods in Verification 24
- Computability, Logic, AI Algorithms 10
- Co-authors
- Matthias Felleisen (17 shared papers)Christopher T. Haynes (13 shared papers)Robert E. Filman (3 shared papers)David S. Wise (17 shared papers)Mitchell Wand (14 shared papers)Eugene E. Kohlbecker (7 shared papers)Bruce F. Duba (4 shared papers)M. Wand (5 shared papers)
- Journals
- ACM SIGPLAN Notices (9 papers)LISP and Symbolic Computation (5 papers)Theoretical Computer Science (2 papers)Communications of the ACM (2 papers)BIT Numerical Mathematics (2 papers)
- Partner nations
- United StatesNetherlandsMexico
In The Last Decade
Daniel P. Friedman
96 papers receiving 3.4k citations
Peers
Comparison fields: 5 of 82
- Hardware and Architecture 1.1k
- Software 530
- Artificial Intelligence 3.2k
- Computational Theory and Mathematics 1.4k
- Information Systems 1.0k
Countries citing papers authored by Daniel P. Friedman
This map shows the geographic impact of Daniel P. Friedman's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Daniel P. Friedman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Daniel P. Friedman more than expected).
Fields of papers citing papers by Daniel P. Friedman
This network shows the impact of papers produced by Daniel P. Friedman. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Daniel P. Friedman. The network helps show where Daniel P. Friedman may publish in the future.
Co-authors
The 25 scholars most cited alongside Daniel P. Friedman, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 102 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Aspect-Oriented Programming is Quantification and Obliviousness | 2000 | 415 |
| 2 | 1998 | 327 | |
| 3 | 1991 | 293 | |
| 4 | CONS Should Not Evaluate its Arguments. | 1976 | 238 |
| 5 | 1986 | 216 | |
| 6 | 1998 | 212 | |
| 7 | 1987 | 159 | |
| 8 | Control operators, the SECD-machine, and the λ-calculus. | 1987 | 145 |
| 9 | 1984 | 88 | |
| 10 | 2005 | 77 | |
| 11 | 1998 | 72 | |
| 12 | 1986 | 71 | |
| 13 | 1984 | 68 | |
| 14 | 1988 | 61 | |
| 15 | 1988 | 60 | |
| 16 | Reasoning with Continuations | 1986 | 58 |
| 17 | 1987 | 56 | |
| 18 | 1999 | 54 | |
| 19 | 1989 | 53 | |
| 20 | 1986 | 53 |
About Daniel P. Friedman
Daniel P. Friedman is a scholar working on Artificial Intelligence, Computational Theory and Mathematics, Computer Networks and Communications, Hardware and Architecture and Information Systems, having authored 102 papers that have together received 3.8k indexed citations. Recurring topics across this work include Logic, programming, and type systems (63 papers), Parallel Computing and Optimization Techniques (26 papers), Formal Methods in Verification (24 papers), Logic, Reasoning, and Knowledge (23 papers), Software Engineering Research (12 papers), Computability, Logic, AI Algorithms (10 papers), Distributed systems and fault tolerance (10 papers) and Teaching and Learning Programming (7 papers). The work is most often cited by research in Hardware and Architecture (1.1k citations), Software (530 citations), Artificial Intelligence (3.2k citations), Computational Theory and Mathematics (1.4k citations) and Information Systems (1.0k citations). Daniel P. Friedman has collaborated with scholars based in United States, Netherlands and Mexico. Frequent co-authors include Matthias Felleisen, Christopher T. Haynes, Robert E. Filman, David S. Wise, Mitchell Wand, Eugene E. Kohlbecker, Bruce F. Duba, M. Wand, R. Kent Dybvig and Guy L. Steele. Their work appears in journals such as ACM SIGPLAN Notices, LISP and Symbolic Computation, Theoretical Computer Science, Communications of the ACM and BIT Numerical Mathematics.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.