D. A. Wolfram

550 total citations
18 papers, 227 citations indexed

About

D. A. Wolfram is a scholar working on Artificial Intelligence, Computational Theory and Mathematics and Computer Networks and Communications. According to data from OpenAlex, D. A. Wolfram has authored 18 papers receiving a total of 227 indexed citations (citations by other indexed papers that have themselves been cited), including 8 papers in Artificial Intelligence, 5 papers in Computational Theory and Mathematics and 4 papers in Computer Networks and Communications. Recurrent topics in D. A. Wolfram's work include Logic, programming, and type systems (5 papers), Logic, Reasoning, and Knowledge (4 papers) and Constraint Satisfaction and Optimization (4 papers). D. A. Wolfram is often cited by papers focused on Logic, programming, and type systems (5 papers), Logic, Reasoning, and Knowledge (4 papers) and Constraint Satisfaction and Optimization (4 papers). D. A. Wolfram collaborates with scholars based in Australia, United Kingdom and United States. D. A. Wolfram's co-authors include Joseph A. Goguen, Michael J. Maher, Jean-Louis Lassez, Qing Guo and Paliath Narendran and has published in prestigious journals such as SHILAP Revista de lepidopterología, American Mathematical Monthly and Theoretical Computer Science.

In The Last Decade

D. A. Wolfram

16 papers receiving 199 citations

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name h Career Trend Papers Cites
D. A. Wolfram Australia 7 116 78 47 31 28 18 227
Asif Ali Pakistan 10 102 0.9× 52 0.7× 26 0.6× 34 1.1× 11 0.4× 40 274
Eugene V. Zima Canada 9 77 0.7× 93 1.2× 14 0.3× 43 1.4× 40 1.4× 32 239
Carlos Rentería-Márquez Mexico 8 203 1.8× 94 1.2× 19 0.4× 75 2.4× 19 0.7× 30 294
Luděk Kučera Czechia 8 102 0.9× 177 2.3× 20 0.4× 13 0.4× 75 2.7× 35 303
David Singmaster United Kingdom 9 68 0.6× 87 1.1× 27 0.6× 54 1.7× 8 0.3× 47 255
Engelbert Hubbers Netherlands 6 49 0.4× 13 0.2× 51 1.1× 19 0.6× 22 0.8× 20 157
Alev Topuzoğlu Türkiye 9 151 1.3× 105 1.3× 13 0.3× 36 1.2× 11 0.4× 26 260
Robert Silverman United States 12 228 2.0× 84 1.1× 13 0.3× 24 0.8× 65 2.3× 28 327
Joseph L. Yucas United States 11 193 1.7× 95 1.2× 3 0.1× 38 1.2× 16 0.6× 33 351
P.R.J. Asveld Netherlands 11 191 1.6× 225 2.9× 12 0.3× 5 0.2× 10 0.4× 58 293

Countries citing papers authored by D. A. Wolfram

Since Specialization
Citations

This map shows the geographic impact of D. A. Wolfram'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 D. A. Wolfram with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. A. Wolfram more than expected).

Fields of papers citing papers by D. A. Wolfram

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. A. Wolfram. 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 D. A. Wolfram. The network helps show where D. A. Wolfram may publish in the future.

Co-authorship network of co-authors of D. A. Wolfram

This figure shows the co-authorship network connecting the top 25 collaborators of D. A. Wolfram. A scholar is included among the top collaborators of D. A. Wolfram based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with D. A. Wolfram. D. A. Wolfram is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

18 of 18 papers shown
1.
Wolfram, D. A.. (2024). INVERSE CONNECTION FORMULAE FOR GENERALISED BESSEL POLYNOMIALS. Bulletin of the Australian Mathematical Society. 110(3). 480–487.
2.
Wolfram, D. A.. (2023). Solving recurrences for Legendre–Bernstein basis transformations. SHILAP Revista de lepidopterología. 4. 100117–100117. 1 indexed citations
3.
Wolfram, D. A.. (2022). Factoring Variants of Chebyshev Polynomials of the First and Second Kinds with Minimal Polynomials of cos(2π/d). American Mathematical Monthly. 129(2). 172–176. 2 indexed citations
4.
Wolfram, D. A.. (2022). FACTORING VARIANTS OF CHEBYSHEV POLYNOMIALS WITH MINIMAL POLYNOMIALS OF. Bulletin of the Australian Mathematical Society. 106(3). 448–457. 1 indexed citations
5.
Wolfram, D. A.. (2021). Reducing thrashing by adaptive backtracking. CL Technical Reports.
6.
Wolfram, D. A.. (2000). A Formula for the General Solution of a Constant-coefficient Difference Equation. Journal of Symbolic Computation. 29(1). 79–82. 3 indexed citations
7.
Guo, Qing, Paliath Narendran, & D. A. Wolfram. (2000). Complexity of Nilpotent Unification and Matching Problems. Information and Computation. 162(1-2). 3–23. 2 indexed citations
8.
Wolfram, D. A.. (2000). Electronic Notes in Theoretical Computer Science. Electronic Notes in Theoretical Computer Science. 31. 1–1. 55 indexed citations
9.
Wolfram, D. A.. (1998). Solving Generalized Fibonacci Recurrences. ˜The œFibonacci quarterly. 36(2). 129–145. 64 indexed citations
10.
Wolfram, D. A.. (1995). An appraisal of INTERNIST-I. Artificial Intelligence in Medicine. 7(2). 93–116. 28 indexed citations
11.
Wolfram, D. A.. (1994). A semantics for λProlog. Theoretical Computer Science. 136(1). 277–289. 5 indexed citations
12.
Wolfram, D. A.. (1993). The Clausal Theory of Types. Cambridge University Press eBooks. 28 indexed citations
13.
Wolfram, D. A.. (1991). Rewriting, and equational unification: the higher-order cases (extended abstract). 25–36. 1 indexed citations
14.
Wolfram, D. A. & Joseph A. Goguen. (1991). A Sheaf Semantics for FOOPS Expressions. 81–98. 7 indexed citations
15.
Goguen, Joseph A. & D. A. Wolfram. (1990). On Types and FOOPS.. 1–22. 10 indexed citations
16.
Wolfram, D. A.. (1989). Forward checking and intelligent backtracking. Information Processing Letters. 32(2). 85–87. 1 indexed citations
17.
Wolfram, D. A.. (1989). Intractable unifiability problems and backtracking. Journal of Automated Reasoning. 5(1). 1 indexed citations
18.
Wolfram, D. A., Michael J. Maher, & Jean-Louis Lassez. (1984). A Unified Treatment of Resolution Strategies for Logic Programs.. International Conference on Lightning Protection. 263–276. 18 indexed citations

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.

Explore authors with similar magnitude of impact

Rankless by CCL
2026