Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies
if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the
same subfield and year (this is the minimum needed to enter the top 1%, not the average
within it), or reaches the top citation threshold in at least one of its specific research
topics.
Countries citing papers authored by Jeffrey D. Ullman
Since
Specialization
Citations
This map shows the geographic impact of Jeffrey D. Ullman'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 Jeffrey D. Ullman with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jeffrey D. Ullman more than expected).
Fields of papers citing papers by Jeffrey D. Ullman
This network shows the impact of papers produced by Jeffrey D. Ullman. 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 Jeffrey D. Ullman. The network helps show where Jeffrey D. Ullman may publish in the future.
Co-authorship network of co-authors of Jeffrey D. Ullman
This figure shows the co-authorship network connecting the top 25 collaborators of Jeffrey D. Ullman.
A scholar is included among the top collaborators of Jeffrey D. Ullman 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 Jeffrey D. Ullman. Jeffrey D. Ullman is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
All Works
20 of 20 papers shown
1.
Sarma, Anish Das, Jeffrey D. Ullman, & Jennifer Widom. (2007). Schema Design for Uncertain Databases.6 indexed citations
2.
Aho, Alfred V., Monica S. Lam, Ravi Sethi, & Jeffrey D. Ullman. (2006). Compilers: Principles, Techniques, and Tools (2nd Edition). Addison-Wesley Longman Publishing Co., Inc. eBooks.237 indexed citations
3.
Aho, Alfred V., Ravi Sethi, Jeffrey D. Ullman, & Monica S. Lam. (2004). 21st Century Compilers.1 indexed citations
4.
Silverstein, Craig, Sergey Brin, Rajeev Motwani, & Jeffrey D. Ullman. (1998). Scalable Techniques for Mining Causal Structures. Very Large Data Bases. 594–605.72 indexed citations
5.
Shivakumar, Narayanan, et al.. (1998). Computing Iceberg Queries Efficiently. Very Large Data Bases. 299–310.225 indexed citations
6.
Ullman, Jeffrey D.. (1998). Elements of ML programming (ML97 ed.). Prentice-Hall, Inc eBooks.7 indexed citations
7.
Levy, Alon Y., Anand Rajaraman, & Jeffrey D. Ullman. (1996). Answering Queries Using Limited External Processors.. 227–237.39 indexed citations
8.
Ullman, Jeffrey D.. (1996). Efficient implementation of data cubes via materialized views. Knowledge Discovery and Data Mining. 386–387.10 indexed citations
9.
Rajaraman, Anand, Yehoshua Sagiv, & Jeffrey D. Ullman. (1995). Answering Queries using Templates with Binding Patterns. 105–112.147 indexed citations
10.
Howard, H. Craig, Arthur M. Keller, Ashish Gupta, et al.. (1994). Versions, Configurations, and Constraints in CEDB.2 indexed citations
Bancilhon, François, David Maier, Yehoshua Sagiv, & Jeffrey D. Ullman. (1986). Magic Sets and Other Strange Ways to Implement Logic Programs.. 1–15.351 indexed citations
13.
Ullman, Jeffrey D.. (1984). Some Thoughts About Supercomputer Organization.. 424–432.5 indexed citations
Floyd, Robert W. & Jeffrey D. Ullman. (1980). THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED CIRCUITS Extended Abstract. 260–269.1 indexed citations
16.
Aho, Alfred V. & Jeffrey D. Ullman. (1977). Principles of compiler design. CERN Document Server (European Organization for Nuclear Research).666 indexed citations breakdown →
17.
Aho, Alfred V., Catriel Beeri, & Jeffrey D. Ullman. (1977). The Theory of Joins in Relational Data Bases (Extended Abstract). 107–113.10 indexed citations
Aho, Alfred V., Ravi Sethi, & Jeffrey D. Ullman. (1971). Code optimization and finite church-rosser systems.16 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.