Jeffrey Ullman

Q: What Schools Are Affiliated With Jeffrey Ullman

Jeffrey Ullman is affiliated with the following schools: Princeton University, Stanford University, Columbia University

Jeffrey Ullman's AcademicInfluence.com Rankings

Jeffrey Ullman

Computer Science

#24

World Rank

#24

Historical Rank

#13

USA Rank

Theoretical Computer Science

World Rank

Historical Rank

USA Rank

Data Mining

World Rank

Historical Rank

USA Rank

Database

#11

World Rank

#11

Historical Rank

USA Rank

computer-science Degrees

Download Badge

Computer Science

Jeffrey Ullman's Degrees

PhD Computer Science Princeton University
Bachelors Engineering Columbia University

Similar Degrees You Can Earn

Best Online PhD of Computer Science (Doctorates) 2025

Why Is Jeffrey Ullman Influential?

(Suggest an Edit or Addition)

According to Wikipedia, Jeffrey David Ullman is an American computer scientist and the Stanford W. Ascherman Professor of Engineering, Emeritus, at Stanford University. His textbooks on compilers , theory of computation , data structures, and databases are regarded as standards in their fields. He and his long-time collaborator Alfred Aho are the recipients of the 2020 Turing Award, generally recognized as the highest distinction in computer science.

(See a Problem?)

Jeffrey Ullman's Published Works

Number of citations in a given year to any of this author's works

Total number of citations to an author for the works they published in a given year. This highlights publication of the most important work(s) by the author

Published Works

Introduction to Automata Theory, Languages and Computation (1979) (14194)
The Design and Analysis of Computer Algorithms (1974) (9467)
Compilers: Principles, Techniques, and Tools (1986) (9200)
Dynamic itemset counting and implication rules for market basket data (1997) (2245)
Data Structures and Algorithms (1983) (1948)
The Theory of Parsing, Translation, and Compiling (1972) (1895)
Principles Of Database And Knowledge-Base Systems (1979) (1759)
Formal languages and their relation to automata (1969) (1627)
Principles of Database and Knowledge-Base Systems, Volume II (1988) (1597)
Principles of Database Systems (1980) (1587)
Implementing data cubes efficiently (1996) (1544)
Database Systems: The Complete Book (2001) (1479)
NP-Complete Scheduling Problems (1975) (1382)
Introduction to automata theory, languages, and computation, 2nd edition (2001) (1355)
The TSIMMIS Project: Integration of Heterogeneous Information Sources (1994) (1278)
Protection in operating systems (1976) (1255)
Information integration using logical views (1997) (1049)
Principles of Compiler Design (1977) (1044)
Principles of database and knowledge-base systems, Vol. I (1988) (969)
Compilers: Principles, Techniques, and Tools (2nd Edition) (2006) (965)
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms (1974) (913)
Mining of Massive Datasets (2011) (816)
The TSIMMIS Approach to Mediation: Data Models and Languages (1997) (750)
The Transitive Reduction of a Directed Graph (1972) (705)
Magic sets and other strange ways to implement logic programs (extended abstract) (1985) (699)
Universality of data retrieval languages (1979) (660)
Index selection for OLAP (1997) (517)
Finding interesting associations without support pruning (2000) (481)
Database System Implementation (2000) (464)
Computing Iceberg Queries Efficiently (1998) (434)
The theory of joins in relational data bases (1977) (432)
An optimal synchronizer for the hypercube (1987) (428)
A First Course in Database Systems (1997) (420)
On the semantics of updates in databases (1983) (408)
Implementation of logical query languages for databases (1985) (402)
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (1981) (399)
Principles of Compiler Design (Addison-Wesley series in computer science and information processing) (1977) (398)
Being Fluent with Information Technology (1999) (397)
Optimizing joins in a map-reduce environment (2010) (391)
Equivalences Among Relational Expressions (1979) (348)
Global Data Flow Analysis and Iterative Algorithms (1976) (328)
Answering Queries using Templates with Binding Patterns (1995) (316)
Updating Logical Databases (1986) (313)
On the foundations of the universal relation model (1984) (310)
The Generation of Optimal Code for Arithmetic Expressions (1970) (308)
Scalable Techniques for Mining Causal Structures (1998) (307)
Principles of Optimal Page Replacement (1971) (296)
A simplied universal relation assumption and its properties (1982) (275)
The Asilomar report on database research (1998) (272)
Bounds on the Complexity of the Longest Common Subsequence Problem (1974) (271)
Monotone data flow analysis frameworks (1977) (259)
Integrating and Accessing Heterogeneous Information Sources in TSIMMIS (1994) (251)
MedMaker: a mediation system based on declarative specifications (1996) (250)
Database systems: achievements and opportunities (1990) (249)
A survey of deductive database systems (1995) (242)
A Query Translation Scheme for Rapid Implementation of Wrappers (1995) (236)
The Lowell database research self-assessment (2003) (234)
Elements of ML programming (1994) (232)
Optimizing Multiway Joins in a Map-Reduce Environment (2011) (226)
Querying Semistructured Heterogeneous Information (1995) (223)
On notions of information transfer in VLSI circuits (1983) (220)
Query flocks: a generalization of association-rule mining (1998) (214)
Syntax Directed Translations and the Pushdown Assembler (1969) (194)
Representative objects: concise representations of semistructured, hierarchical data (1997) (193)
Flow graph reducibility (1972) (187)
Worst-case analysis of memory allocation algorithms (1972) (185)
On finding lowest common ancestors in trees (1973) (181)
Code Generation for Expressions with Common Subexpressions (1977) (176)
Maximal objects and the semantics of universal relation databases (1983) (174)
Set Merging Algorithms (1973) (174)
The performance of a memory allocation algorithm (1971) (169)
Constraint checking with partial information (1994) (168)
A Survey of Research in Deductive Database Systems (1995) (166)
Characterizations of Reducible Flow Graphs (1974) (163)
Parallel complexity of logical query programs (1986) (161)
The compilation of regular expressions into integrated circuits (1980) (157)
Database research: achievements and opportunities into the 1st century (1996) (152)
Bottom-up beats top-down for datalog (1989) (144)
Upper and Lower Bounds on the Cost of a Map-Reduce Computation (2012) (144)
Efficient tests for top-down termination of logical rules (1988) (140)
Capability based mediation in TSIMMIS (1998) (140)
Answering queries using templates with binding patterns (extended abstract) (1995) (139)
Properties of acyclic database schemes (1981) (138)
Design Overview of the NAIL! System (1986) (138)
Efficient optimization of a class of relational expressions (1979) (137)
A Simple Algorithm for Global Data Flow Analysis Problems (1975) (135)
Efficient optimization of a class of relational expressions (1978) (134)
Enumerating subgraph instances using map-reduce (2012) (134)
Database systems - the complete book (2. ed.) (2009) (133)
Optimal partial-match retrieval when fields are independently specified (1979) (129)
High-probability parallel transitive closure algorithms (1990) (129)
SYSTEM/U: a database system based on the universal relation assumption (1984) (124)
Big data: a research agenda (2013) (122)
Principles of Database Systems, 2nd Edition (1982) (119)
Translations on a context free grammar (1969) (110)
Equivalence of relational database schemes (1979) (107)
Mining of Massive Datasets: Data Mining (2011) (106)
Fuzzy Joins Using MapReduce (2012) (105)
Database systems: achievements and opportunities (1991) (104)
Translations on a Context-Free Grammar (1971) (104)
Polynomial complete scheduling problems (1973) (103)
High-Probability Parallel Transitive-Closure Algorithms (1991) (102)
Efficient evaluation of right-, left-, and multi-linear rules (1989) (99)
Information translation, mediation, and mosaic-based browsing in the TSIMMIS system (1995) (99)
The input/output complexity of transitive closure (1990) (98)
A Communication-Time Tradeoff (1984) (97)
Deterministic parsing of ambiguous grammars (1975) (97)
Map-reduce extensions and recursive queries (2011) (96)
Some Results on Tape-Bounded Turing Machines (1969) (95)
Time and Tape Complexity of Pushdown Automaton Languages (1968) (94)
Computing capabilities of mediators (1999) (91)
Database theory—past and future (1987) (91)
Universal Single Transition Time Asynchronous State Assignments (1967) (87)
The design and analysis of algorithms (1974) (83)
Parallel Skyline Queries (2012) (83)
Properties of Syntax Directed Translations (1969) (80)
An Approach to a Unified Theory of Automata (1967) (80)
A Comparison between Deductive and Object-Oriented Database Systems (1991) (79)
The U. R. strikes back (1982) (78)
Introduction to automata theory, languages, and computation - international edition, 2nd Edition (2003) (78)
A model of statistical database their security (1977) (77)
On the capabilities of codes to correct synchronization errors (1967) (76)
Answering Queries Using Limited External Processors. (1996) (75)
Compilers: Principles, Techniques, & Tools with Gradiance (2007) (72)
Generating efficient plans for queries using views (2001) (71)
Analysis of a simple algorithm for global data flow problems (1973) (70)
Optimal wiring between rectangles (1981) (69)
Deadlock-free packet switching networks (1979) (69)
Optimizing Large Join Queries in Mediation Systems (1999) (68)
Proof-tree transformation theorems and their applications (1989) (66)
The theory of parsing, translation, and compiling. 1: Parsing (1972) (65)
Connections in Acyclic Hypergraphs (1984) (65)
LORE: a Lightweight Object REpository for semistructured data (1996) (63)
Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization (1982) (62)
Evaluating Polynomials at Fixed Sets of Points (1975) (61)
Parallel and Distributed SystemS (2013) (58)
Parsing Algorithms with Backtrack (1970) (57)
Argument Reduction by Factoring (1989) (56)
A Scheme for the Automatic Inference of Variable Types (1980) (56)
Answering queries using limited external query processors (extended abstract) (1996) (55)
Foundations of uncertain-data integration (2010) (54)
Integrating Information by Outerjoins and Full Disjunctions (1996) (53)
Principles of Data Base Systems (1980) (53)
Induction variables in very high level languages (1976) (52)
A general theory of translation (1969) (51)
Universal Relation Interfaces for Database Systems (1983) (50)
Nonerasing Stack Automata (1967) (50)
Foundations of Computer Science, C Edition (1992) (50)
Answering Queries Using Limited External Query Processors (1999) (46)
Optimization of Straight Line Programs (1972) (45)
Transitive closure and recursive Datalog implemented on clusters (2012) (44)
Adequacy of Decompositions of Relational Databases (1980) (42)
A programming and problem solving seminar. (1991) (41)
Deductive databases: achievements and future directions (1990) (40)
A complete axiomatization for a large class of dependencies in relational datatbases (1980) (39)
Designing good MapReduce algorithms (2012) (39)
Integrating information by outerjoins and full disjunctions (extended abstract) (1996) (39)
Node listings for reducible flow graphs (1975) (39)
, “Introduction to Automata Theory, Languages and Computations”, second Edition, Pearson Education, 2007 (2015) (38)
Code optimization and finite church-rosser systems (1971) (38)
Near-optimal, single-synchronization-error-correcting code (1966) (38)
On protection in operating systems (1975) (38)
Minimizing View Sets without Losing Query-Answering Power (2001) (38)
Proceedings of the third annual ACM symposium on Theory of computing (1971) (37)
Reasoning about Xml Schema Languages Using Formal Language Theory (2000) (37)
A technique for speeding up LR(k) parsers (1972) (36)
Evaluating, combining and generalizing recommendations with prerequisites (2010) (35)
L worst-case performance bounds for rumple one-dimensional packing algorithms siam j (1974) (35)
A general scheme for the automatic inference of variable types (1978) (35)
A Note on the Efficiency of Hashing Functions (1972) (34)
GYM: A Multiround Join Algorithm In MapReduce (2014) (34)
Mediator languages—a proposal for a standard: report of an I3/POB working group held at the University of Maryland, April 12 and 13, 1996 (1997) (34)
On the complexity of LR(k) testing (1975) (34)
Bounds on the size and transmission rate of communications protocols (1982) (34)
Relations Between Time and Tape Complexities (1968) (34)
Foundations of Computer Science (1992) (33)
Deterministic parsing of ambiguous grammars (1973) (32)
Best Conditioned Parametric Identification of Transfer Function Models in the Frequency Domain (1995) (32)
Schema Design for Uncertain Databases (2007) (31)
A Characterization of Two-Way Deterministic Classes of Languages (1969) (30)
Optimization of LR(k) Parsers (1972) (30)
Implementation of logiclal query languages for databases (abstract only) (1985) (30)
Weak and Mixed Strategy Precedence Parsing (1972) (29)
Data Mining Research: Opportunities and Challenges (2008) (29)
Mediator Languages - a Proposal for a Standard (1997) (29)
Using views to generate efficient evaluation plans for queries (2007) (28)
Modeling communications protocols by automata (1979) (28)
Application of lattice algebra to loop optimization (1975) (28)
GYM: A Multiround Distributed Join Algorithm (2017) (27)
Fragments of relations (1983) (27)
Efficient Implementation of Data Cubes Via Materialized Views (1996) (27)
On Kent's “Consequences of assuming a universal relation” (Technical correspondance) (1983) (27)
Code-generation for machines with multiregister operations (1977) (27)
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation (2012) (26)
The theory of languages (1968) (25)
SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce (2015) (25)
Tools for Template Dependencies (1983) (24)
On the equivalence of logical databases (1984) (24)
On complementary and independent mappings on databases (1984) (24)
Logical Query Optimization by Proff-Tree Transformation (1993) (22)
Assigning an Appropriate Meaning to Database Logic With Negation (1994) (22)
Economy of description by parsers, DPDA's, and PDA's (1975) (22)
Worst case bounds for simple one-dimensional packing algorithms (1974) (22)
Fast algorithms for the elimination of common subexpressions (1972) (21)
A formal approach to code optimization (1970) (21)
The complexity of ordering subgoals (1988) (20)
Robust Iterators in ET++ (1992) (20)
The interaction between functional dependencies and template dependencies (1980) (20)
Elements of ML programming (ML97 ed.) (1998) (20)
Storing and Querying Tree-Structured Records in Dremel (2014) (19)
Sets Accepted by One-Way Stack Automata Are Context Sensitive (1968) (18)
A first course in database systems (2. ed.) (2002) (18)
Complexity of a top-down capture rule (1984) (17)
Dynamic Memories with Rapid Random and Sequential Access (1974) (17)
Deterministic Stack Automata and the Quotient Operator (1968) (17)
Connections in acyclic hypergraphs: extended abstract (1982) (17)
A version numbering scheme with a useful lexicographical order (1995) (16)
Fundamental concepts of programming systems (1976) (16)
Database systems - the complete book (international edition) (2002) (16)
Operations on sparse relations (1977) (16)
Experience with a regular expression compiler (1983) (16)
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) (1974) (15)
Querying websites using compact skeletons (2001) (15)
Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce (2014) (15)
Theoretical studies in computer science: thr (1991) (14)
The new technologies (1989) (13)
Improving the efficiency of database-system teaching (2003) (13)
On the Convergence of Query Evaluation (1989) (13)
Convergence of sideways query evaluation (1985) (13)
Generalizing Conjunctive Query Containment for View Maintenance and Integrity Constraint Verification (Abstract) (1992) (13)
Assignment Problems of Different-Sized Inputs in MapReduce (2015) (13)
Elements of ML programming - ML 97 edition (1998) (12)
The Interface Between Language Theory and Database Theory (1991) (12)
Decidable and Undecidable Questions About Automata (1968) (12)
The revenge of the JD (1983) (11)
Dynamic miss-counting algorithms: finding implication and similarity rules with confidence pruning (2000) (11)
Cluster Computing, Recursion and Datalog (2010) (11)
Universal Two State Machines: Characterization Theorems and Decomposition Schemes (1968) (11)
The Database Approach to Knowledge Represention (1996) (11)
Partitioned Data Security on Outsourced Sensitive and Non-Sensitive Data (2018) (10)
Matching bounds for the all-pairs MapReduce problem (2013) (10)
A Survey of Association-Rule Mining (2000) (10)
Parallel Question Parsing and Memory Retrieval (1993) (10)
Gradiance On-Line Accelerated Learning (2005) (10)
Error correction for formal languages (1966) (9)
The theory of parsing, translation, and compiling. 2: Compiling (1973) (9)
Designing good algorithms for MapReduce and beyond (2012) (9)
The Theory of Functional and Template Dependencies (1982) (9)
Uniform synthesis of sequential circuits (1969) (9)
Finite-state Modulation Codes for Data Storage, Ieee Sliding-block Coding for Input-restricted Channels, Ieee (9)
Flux, Sorting, and Supercomputer Organization for AI Applications (1984) (9)
Data Science Education: We're Missing the Boat, Again (2017) (9)
Efficient and Complete Tests for Database Integrity Constraint Checking (1994) (8)
Meta-MapReduce: A Technique for Reducing Communication in MapReduce Computations (2015) (8)
The Lowell report (2003) (8)
On the Computational Power of Pushdown Automata (1970) (8)
A New Computation Model for Cluster Computing (2009) (8)
Bounds for Overlapping Interval Join on MapReduce (2015) (8)
Proceedings of the 1st ACM SIGACT-SIGMOD symposium on Principles of database systems (1982) (8)
Transformations on straight line programs - (Preliminary Version) (1970) (8)
MapReduce Algorithms (2015) (7)
Combining state machines and regular expressions for automatic synthesis of VLSI circuits (1982) (7)
ViewpointAdvising students for success (2009) (7)
The Battle for Data Science (2020) (7)
Computing marginals using MapReduce (2015) (7)
Analysis of programs (1973) (7)
Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages (1973) (7)
Equivalence of Programs with Structured Variables (1970) (7)
Automaton Analogs of Syntax Directed Translation Schemata (1968) (7)
The role of theory today (1995) (7)
The care and feeding of LR(k) grammars (1971) (6)
Two Results on One-Way Stack Automata (1967) (6)
Halting Stack Automata (1969) (6)
New Frontiers in Database System Research (1992) (6)
Versions, Configurations, and Constraints in CEDB (1994) (6)
Abstractions, their algorithms, and their compilers (2022) (6)
Finding the depth of a flow graph (1976) (6)
Code generation for expressions with common subexpressions (Extended Abstract) (1976) (6)
Efficient and private approximations of distributed databases calculations (2016) (6)
Evaluating relational expressions with dense and sparse arguments (1975) (6)
Assignment of Different-Sized Inputs in MapReduce (2015) (6)
Introduction to Compilers (2000) (5)
A Linear List Merging Algorithm (2008) (5)
Principles of compiler construction (1977) (5)
Correcting faults in write-once memory (1984) (5)
Shasta: Interactive Reporting At Scale (2016) (5)
Content-based music retrieval on acoustic data (2003) (5)
Panda: Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data (2020) (5)
The Equivalence of Universal Relation Definitions. (1982) (4)
Mining of Massive Datasets: Advertising on the Web (2011) (4)
The MIDAS data-mining project at Stanford (1999) (4)
Classical database systems (1988) (4)
The theory of deductive database systems (1990) (4)
Generating E cient Plans for Queries Using Views (2001) (3)
Mining of Massive Datasets: Mining Data Streams (2011) (3)
An Approach To Processing Queries In A Logic-Based Query Language (1986) (3)
Fragments of Relations: First Hack (1981) (3)
RESEARCH SELF-ASSESSMENT (2005) (3)
GYM : A Multiround Join Algorithm In MapReduce And Its Analysis (2015) (3)
In memory of Seymour Ginsburg 1928 - 2004 (2005) (3)
Efficient Multiway Hash Join on Reconfigurable Hardware (2019) (3)
Panel: The State of Data: Invited Paper from panelists (2016) (3)
Error detection in precedence parsers (1973) (3)
The design of hashing functions (1970) (3)
Principles of Database Systems, 1st Edition (1980) (3)
Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules (1989) (3)
Design and Implementation of Parallel Algorithms (1992) (2)
Query Processing in Universal Relation Systems. (1982) (2)
Validating Constraints with Partial Information: Research Overview (1994) (2)
Experiments as research validation (2015) (2)
A Regular Expression Compiler (1982) (2)
A View of Directions in Relational Database Theory (1981) (2)
Concise essence-preserving big data representation (2016) (2)
The Tree Data Model (2016) (2)
Linear precedence functions for weak precedence grammars (1972) (2)
Integrating Information by Outerjoins and Full Disjunctions I. Motivation Fig. 1.1. an Oem Object Structure. Hypergraph Representation of Oem Structures (2002) (1)
Algorithms for the compilation of regular expressions into PLAs (1987) (1)
21st Century Compilers (2004) (1)
PUSHDOWN AUTOMATA WITH BOUNDED BACKTRACK (1965) (1)
Selected database research at Stanford (1990) (1)
Mining of Massive Datasets: Clustering (2011) (1)
Crossfertilization Of DBMS Research With Other Disciplines Of Computer Science (Panel Discussion) (1978) (1)
Handling Skew in Multiway Joins in Parallel Processing (2015) (1)
Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16) (2017) (1)
Decoding of Cyclic Codes Using Position Invariant Functions (1965) (1)
Proceedings of the second annual ACM symposium on Theory of computing (1970) (1)
A Survey of New Directions in Database System (2003) (1)
Logic and Database Systems (1986) (1)
Some pairs problems (2016) (1)
Report from the Fourth Workshop on Algorithms andSystems for MapReduce and Beyond (BeyondMR '17) (2017) (0)
Elementary complexity theory November 17 , 2018 1 Languages , automata (2018) (0)
Integrating Information by Outerjoinsand Full Disjunctions (1996) (0)
PANDA (2020) (0)
Programming Languages and Translators Coms W4115 Objectives Overall Structure of a Compiler Required Text Assignments and Grading Prerequisite: Coms W3157 Advanced Programming Coms W3261 Computability and Models of Computation Class Website Collaboration Teams Project Proposal Language Reference Man (1998) (0)
On the Nature of Data Science (2021) (0)
Design of a Universal Relation Database System. (1982) (0)
A Novel Progressive Sampling based Approach for Effective Mining of Association Rules (2016) (0)
Boosting the Value of Online Class Forum Facilities (2017) (0)
Universal Relation Database Systems. (1983) (0)
Textual and Visual for Content-based Image Re- 5.2 Data Preparation 5.3 Query Processing 5.3.2 Subquery Processing 4.1 Webssql Syntax Query := Select Targetattr from Tablelist Where Conditions] With-size Size] (2000) (0)
6.2 Other Synchronization Methods 2 Memory Overhead of Distributed Snapshots (2011) (0)
Meta-X: A Technique for Reducing Communication in Geographically Distributed Computations (2021) (0)
The Proof That N (1992) (0)
Moving database theory into database practice (1996) (0)
Generating Efficient Plans for Queries Using Views (Full Version) (2001) (0)
0.1. Minimizing Finite State Machines 1 0.1 Minimizing Finite State Machines (0)
Design and Implementation of Logical Database Languages. (1994) (0)
Parallel Skyline Queries (2015) (0)
Computing Marginals Using MapReduce: Keynote talk paper (2015) (0)
Mathematics of Information Processing (Michael Anshel and William Gewirtz, eds.) (1988) (0)
Analysis of Netflix Data (Independent Study) (2009) (0)
PMU PCU PMU PCU PMU PCU PMU PCU PMU DRAM Interface DRAM Interface DRAM Interface DRAM Interface PMU Pattern Memory Unit PCU Pattern Compute Unit PMU PCU PMU PCU PMU PCU (2019) (0)
UNICATION-TIME TRADEOFFt (1984) (0)
Scaling Cryptographic Techniques by Exploiting Data Sensitivity at a Public Cloud (2019) (0)
TRANSACTIONS ON COMPUTERS , JANUARY 1969 Abstracts of Current Computer Literature (2006) (0)
Theorem 3.3 the Optimal Ooset for River Routing Can Be Found with O(n Lglg N) (0)
Brief Announcement: Assignment of Different-Sized Inputs in MapReduce (2014) (0)
Problem 1 Is It True That for for K 2 Ldtc(k; 1) (1992) (0)
A First Course in data Base systems 3ed (2008) (0)
Patent Application of Vitit Kantabutra for TITLE : INTENTIONALLY-LINKED ENTITIES : A GENERAL-PURPOSE DATABASE SYSTEM CROSS-REFERENCE TO RELATED APPLICATIONS (2009) (0)
BOTTOM-UP BEATS TOP-DOWN (2019) (0)
The TSIMMIS Database Integration Project (1996) (0)
A recognition algorithm for pushdown store systems (1968) (0)
Some Advances in Data-Mining Techniques (Abstract) (1999) (0)
Mining of Massive Datasets: Frequent Itemsets (2011) (0)
7 Conclusions, Open Questions and Further Research (1995) (0)
Reducer capacity and communication cost in MapReduce algorithms design (2015) (0)
BFLUT Bloom Filter for Private Look Up Tables (2022) (0)
Integrated Data Exchange and Concurrent Design for Engineered Facilities 1 Professor (1993) (0)
A tribute to referees (2004) (0)
Efficient and Privacy Preserving Approximation of Distributed Statistical Queries (2022) (0)
24 GYM : A Multiround Join Algorithm In MapReduce And Its Analysis (2015) (0)
Characterizations and extensions of pushdown translations (1971) (0)
Assessment of a Peer Mentoring Program to Build Capacity for Course Development and Delivery (2018) (0)
Root Questions for Large Classes (2005) (0)
Efficient Management of Active Databases (1998) (0)
Elementary complexity theory (2019) (0)
Towards Automated Study Guides for MOOCs (2015) (0)
No . STAN-CS-81-853 II l 11 lll 11111 ll l IlI PB 96-150669 Connections in Acyclic Hypergraphs (0)
A Comment on "Improving a Nonenumerative Method to Estimate Path Delay Fault Coverage" (1999) (0)
Proceedings 37th International Conference on Logic Programming (Technical Communications) (2021) (0)
Bibliometric Landscape of the ACM Digital Library (2005) (0)
Portrait of an Indexer - Computing Pointers Into Instructional Videos (2016) (0)
PODS 30th Anniversary Colloquium (2011) (0)
Corrigendum: The Theory of Joins in Relational Databases (1983) (0)
Research into the Design and Implementation of Knowledge Base Systems (1990) (0)
Mining of Massive Datasets: Large-Scale File Systems and Map-Reduce (2011) (0)
R69-19 On the Elimination of Endmarkers (1969) (0)
Equal Opportunity Support for All (2009) (0)

This paper list is powered by the following services:

Other Resources About Jeffrey Ullman

What Schools Are Affiliated With Jeffrey Ullman?

Jeffrey Ullman is affiliated with the following schools:

Jeffrey Ullman's Academic­Influence.com Rankings

Jeffrey Ullman's Degrees

Similar Degrees You Can Earn

Why Is Jeffrey Ullman Influential?

Jeffrey Ullman's Published Works

Published Works

Other Resources About Jeffrey Ullman

What Schools Are Affiliated With Jeffrey Ullman?

Jeffrey Ullman's AcademicInfluence.com Rankings