Daniel P. Friedman
Impact in
- Hardware and Architecture top 0.5%
- Parallel Computing and Optimization Techniques
- Software top 1%
Papers in
-
- Parallel Computing and Optimization Techniques 25
-
- Formal Methods in Verification 20
- Computability, Logic, AI Algorithms 9
- Co-authors
- Matthias FelleisenChristopher T. HaynesRobert E. FilmanDavid S. WiseMitchell WandEugene E. KohlbeckerBruce F. DubaM. Wand
- Journals
- ACM SIGPLAN Notices (8 papers)LISP and Symbolic Computation (5 papers)Theoretical Computer Science (2 papers)BIT Numerical Mathematics (2 papers)Communications of the ACM (2 papers)
- Partner nations
- United StatesMexicoIsrael
In The Last Decade
Daniel P. Friedman
83 papers receiving 2.5k citations
Peers
Comparison fields: 5 of 72
- Hardware and Architecture 878
- Software 410
- Artificial Intelligence 2.4k
- Computational Theory and Mathematics 1.1k
- Information Systems 775
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-authorship network
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
| # | Work | ||
|---|---|---|---|
| 1 | 2016 | 3 | |
| 2 | Essentials of Programming Languages, 3rd Edition | 2008 | 7 |
| 3 | 2005 | 12 | |
| 4 | Essentials of programming languages (2nd ed.) | 2001 | 16 |
| 5 | Aspect-Oriented Programming is Quantification and Obliviousness | 2000 | 328 |
| 6 | The little Schemer (4th ed.) | 1996 | 1 |
| 7 | 1993 | 17 | |
| 8 | 1989 | 35 | |
| 9 | 1987 | 116 | |
| 10 | Control operators, the SECD-machine, and the λ-calculus. | 1987 | 107 |
| 11 | A scheme for a higher-level semantic algebra | 1986 | 38 |
| 12 | Reasoning with Continuations | 1986 | 44 |
| 13 | 1985 | 37 | |
| 14 | 1984 | 58 | |
| 15 | 1980 | 3 | |
| 16 | 1979 | 19 | |
| 17 | 1978 | 9 | |
| 18 | 1977 | 6 | |
| 19 | CONS Should Not Evaluate its Arguments. | 1976 | 184 |
| 20 | 1976 | 16 |
About Daniel P. Friedman
Daniel P. Friedman is a scholar working on Hardware and Architecture, Computational Theory and Mathematics, Artificial Intelligence, Computer Science Applications and Software, having authored 88 papers that have together received 2.9k indexed citations. Recurring topics across this work include Logic, programming, and type systems (53 papers), Parallel Computing and Optimization Techniques (25 papers), Formal Methods in Verification (20 papers), Logic, Reasoning, and Knowledge (19 papers), Software Engineering Research (9 papers), Distributed systems and fault tolerance (9 papers), Computability, Logic, AI Algorithms (9 papers) and Distributed and Parallel Computing Systems (7 papers). The work is most often cited by research in Hardware and Architecture (878 citations), Software (410 citations), Artificial Intelligence (2.4k citations), Computational Theory and Mathematics (1.1k citations) and Information Systems (775 citations). Daniel P. Friedman has collaborated with scholars based in United States, Mexico and Israel. 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, BIT Numerical Mathematics and Communications of the ACM.
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.