Jeffrey Ullman
Stanford Warren Ascherman Professor of Engineering , Emeritus
Computer Science
Bio
Jeff Ullman is the Stanford W. Ascherman Professor of Engineering
(Emeritus) in the Department of Computer Science at Stanford and CEO
of Gradiance Corp. He received the B.S. degree from Columbia
University in 1963 and the PhD from Princeton in 1966. Prior to his
appointment at Stanford in 1979, he was a member of the technical
staff of Bell Laboratories from
1966-1969, and on the faculty of Princeton University between
1969 and 1979. From 1990-1994, he was chair of the Stanford Computer
Science Department. Ullman was elected to the National Academy of
Engineering in 1989, the American Academy of Arts and Sciences in
2012, and has held Guggenheim and Einstein Fellowships. He has
received the Sigmod Contributions Award (1996), the ACM Karl V. Karlstrom
Outstanding Educator Award (1998), the Knuth Prize (2000),
the Sigmod E. F. Codd Innovations award (2006), the IEEE von
Neumann medal (2010), and the NEC C&C Foundation Prize (2017).
He is the author of 16 books, including books
on database systems, compilers, automata theory, and algorithms.
2023-24 Courses
-
Independent Studies (13)
- Advanced Reading and Research
CS 499 (Aut, Win, Spr, Sum) - Advanced Reading and Research
CS 499P (Aut, Win, Spr, Sum) - Curricular Practical Training
CS 390A (Aut, Win, Spr, Sum) - Curricular Practical Training
CS 390B (Aut, Win, Spr, Sum) - Curricular Practical Training
CS 390C (Aut, Win, Spr, Sum) - Independent Project
CS 399 (Aut, Win, Spr, Sum) - Independent Project
CS 399P (Aut, Win, Spr, Sum) - Independent Work
CS 199 (Aut, Win, Spr, Sum) - Independent Work
CS 199P (Aut, Win, Spr, Sum) - Part-time Curricular Practical Training
CS 390D (Aut, Win) - Programming Service Project
CS 192 (Aut, Win, Spr, Sum) - Senior Project
CS 191 (Aut, Win, Spr, Sum) - Writing Intensive Senior Research Project
CS 191W (Aut, Win, Spr)
- Advanced Reading and Research
-
Prior Year Courses
2021-22 Courses
- Program Analysis and Optimizations
CS 243 (Spr)
- Program Analysis and Optimizations
All Publications
-
Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data
IEEE. 2019: 650–61
View details for DOI 10.1109/ICDE.2019.00064
View details for Web of Science ID 000477731600057
-
Scaling Cryptographic Techniques by Exploiting Data Sensitivity at a Public Cloud
ASSOC COMPUTING MACHINERY. 2019: 165–67
View details for DOI 10.1145/3292006.3302384
View details for Web of Science ID 000470891000018
-
SharesSkew: An algorithm to handle skew for joins in MapReduce
INFORMATION SYSTEMS
2018; 77: 129–50
View details for DOI 10.1016/j.is.2018.06.005
View details for Web of Science ID 000441855200009
-
Computing marginals using MapReduce
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
2018; 94: 98–117
View details for DOI 10.1016/j.jcss.2017.02.007
View details for Web of Science ID 000429186200006
-
Report from the Fourth Workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'17)
SIGMOD RECORD
2017; 46 (4): 44–48
View details for DOI 10.1145/3186549.3186561
View details for Web of Science ID 000426874200006
-
Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR' 16)
SIGMOD RECORD
2017; 46 (2): 43–48
View details for Web of Science ID 000409320200005
-
Efficient and Private Approximations of Distributed Databases Calculations
IEEE. 2017: 4487–96
View details for Web of Science ID 000428073704071
-
Assignment Problems of Different-Sized Inputs in MapReduce
ACM TRANSACTIONS ON KNOWLEDGE DISCOVERY FROM DATA
2016; 11 (2)
View details for DOI 10.1145/2987376
View details for Web of Science ID 000393184000007
-
Parallel Skyline Queries
THEORY OF COMPUTING SYSTEMS
2015; 57 (4): 1008-1037
View details for DOI 10.1007/s00224-015-9627-3
View details for Web of Science ID 000365792200007
-
Experiments as Research Validation: Have We Gone Too Far?
COMMUNICATIONS OF THE ACM
2015; 58 (9): 37-39
View details for DOI 10.1145/2699405
View details for Web of Science ID 000360214000015
-
Brief Announcement: Assignment of Different-Sized Inputs in MapReduce
28th International Symposium on Distributed Computing
SPRINGER-VERLAG BERLIN. 2014: 536–537
View details for Web of Science ID 000354534900038
-
Fuzzy Joins Using MapReduce
28th IEEE International Conference on Data Engineering (ICDE)
IEEE. 2012: 498–509
View details for DOI 10.1109/ICDE.2012.66
View details for Web of Science ID 000309122100046
-
Optimizing Multiway Joins in a Map-Reduce Environment
IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING
2011; 23 (9): 1282-1298
View details for DOI 10.1109/TKDE.2011.47
View details for Web of Science ID 000292888400002
-
Cluster Computing, Recursion and Datalog
1st International Workshop on Datalog Reloaded (Datalog)
SPRINGER. 2011: 120–144
View details for Web of Science ID 000306319700008
-
Using views to generate efficient evaluation plans for queries
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
2007; 73 (5): 703-724
View details for DOI 10.1016/j.jcss.2006.10.019
View details for Web of Science ID 000246703900002
-
The Lowell database - Research self assessment
COMMUNICATIONS OF THE ACM
2005; 48 (5): 111-118
View details for Web of Science ID 000229359800026
-
Querying websites using compact skeletons
20th Symposium on Principles of Database Systems
ACADEMIC PRESS INC ELSEVIER SCIENCE. 2003: 809–51
View details for DOI 10.1016/S0022-0000(03)00029-1
View details for Web of Science ID 000183896800009
-
A survey of new directions in database systems
8th International Conference on Database Systems for Advanced Applications
IEEE COMPUTER SOC. 2003: 3–3
View details for Web of Science ID 000182316900001
-
Generating efficient plans for queries using views
ACM SIGMOD International Conference on Management of Data
ASSOC COMPUTING MACHINERY. 2001: 319–30
View details for Web of Science ID 000168887300029
-
Minimizing view sets without losing query-answering power
8th International Conference on Database Theory (ICDT 2001)
SPRINGER-VERLAG BERLIN. 2001: 99–113
View details for Web of Science ID 000171312300007
-
Finding interesting associations without support pruning
16th International Conference on Data Engineering (ICDE 2000)
IEEE COMPUTER SOC. 2001: 64–78
View details for Web of Science ID 000166886100007
-
Scalable techniques for mining causal structures
DATA MINING AND KNOWLEDGE DISCOVERY
2000; 4 (2-3): 163-192
View details for Web of Science ID 000087706100004
-
Information integration using logical views
6th International Conference on Database Theory (ICDT 97)
ELSEVIER SCIENCE BV. 2000: 189–210
View details for Web of Science ID 000087531800002
-
Answering queries using limited external query processors
15th ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems
ACADEMIC PRESS INC ELSEVIER SCIENCE. 1999: 69–82
View details for Web of Science ID 000078783100006
-
Computing capabilities of mediators
1999 ACM SIGMOD International Conference on Management of Data
ASSOC COMPUTING MACHINERY. 1999: 443–454
View details for Web of Science ID 000080980400038
-
Optimizing large join queries in mediation systems
7th International Conference on Database Theory (ICDT 99)
SPRINGER-VERLAG BERLIN. 1999: 348–364
View details for Web of Science ID 000082775200022
-
Information integration using logical views
6th International Conference on Database Theory
SPRINGER-VERLAG BERLIN. 1997: 19–40
View details for Web of Science ID 000073946300002
-
Index selection for OLAP
13th International Conference on Data Engineering
IEEE COMPUTER SOC. 1997: 208–219
View details for Web of Science ID A1997BH55Z00023
-
Representative objects: Concise representations of semistructured, hierarchical data
13th International Conference on Data Engineering
IEEE COMPUTER SOC. 1997: 79–90
View details for Web of Science ID A1997BH55Z00009
-
Medmaker: A mediation system based on declarative specifications
12th IEEE International Conference on Data Engineering
I E E E, COMPUTER SOC PRESS. 1996: 132–141
View details for Web of Science ID A1996BF21F00015
-
The database approach to knowledge representation
13th National Conference on Artificial Intelligence (AAAI 96) / 8th Conference on Innovative Applications of Artificial Intelligence (IAAI 96)
ASSOC ADVANCEMENT ARTIFICIAL INTELLIGENCE. 1996: 1346–1348
View details for Web of Science ID 000082323300202
-
ARGUMENT REDUCTION BY FACTORING
THEORETICAL COMPUTER SCIENCE
1995; 146 (1-2): 269-310
View details for Web of Science ID A1995RL40500010
-
A SURVEY OF DEDUCTIVE DATABASE-SYSTEMS
JOURNAL OF LOGIC PROGRAMMING
1995; 23 (2): 125-149
View details for Web of Science ID A1995QW24300003
-
THE ROLE OF THEORY TODAY
ACM COMPUTING SURVEYS
1995; 27 (1): 43-44
View details for Web of Science ID A1995RL75300011
-
A VERSION NUMBERING SCHEME WITH A USEFUL LEXICOGRAPHICAL ORDER
11th International Conference on Data Engineering
I E E E, COMPUTER SOC PRESS. 1995: 240–248
View details for Web of Science ID A1995BC60N00029
-
LOGICAL QUERY OPTIMIZATION BY PROOF-TREE TRANSFORMATION
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
1993; 47 (1): 222-248
View details for Web of Science ID A1993LP84000008
-
NEW FRONTIERS IN DATABASE SYSTEM RESEARCH
LECTURE NOTES IN COMPUTER SCIENCE
1992; 653: 87-101
View details for Web of Science ID A1992LG00700006
-
DATABASE-SYSTEMS - ACHIEVEMENTS AND OPPORTUNITIES
COMMUNICATIONS OF THE ACM
1991; 34 (10): 110-120
View details for Web of Science ID A1991GH93800016
-
HIGH-PROBABILITY PARALLEL TRANSITIVE-CLOSURE ALGORITHMS
SIAM JOURNAL ON COMPUTING
1991; 20 (1): 100-125
View details for Web of Science ID A1991EX41600006
-
A COMPARISON BETWEEN DEDUCTIVE AND OBJECT-ORIENTED DATABASE-SYSTEMS
2ND INTERNATIONAL CONF ON DEDUCTIVE AND OBJECT-ORIENTED DATABASES ( DOOD 91 )
SPRINGER VERLAG. 1991: 263–277
View details for Web of Science ID A1991LE80400015
-
HIGH-PROBABILITY PARALLEL TRANSITIVE CLOSURE ALGORITHMS
2ND ANNUAL SYMP OF THE ASSOC FOR COMPUTING MACHINERY : PARALLEL ALGORITHMS AND ARCHITECTURES ( SPAA 90 ) / AEGEAN WORKSHOP ON COMPUTING
ASSOC COMPUTING MACHINERY. 1990: 200–209
View details for Web of Science ID A1990BS70W00023
-
THE INPUT OUTPUT COMPLEXITY OF TRANSITIVE CLOSURE
1990 INTERNATIONAL CONF ON MANAGEMENT DATA
ASSOC COMPUTING MACHINERY. 1990: 44–53
View details for Web of Science ID A1990BR67N00005
-
AN OPTIMAL SYNCHRONIZER FOR THE HYPERCUBE
SIAM JOURNAL ON COMPUTING
1989; 18 (4): 740-747
View details for Web of Science ID A1989AH27600007
-
ON THE CONVERGENCE OF QUERY EVALUATION
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
1989; 38 (2): 341-359
View details for Web of Science ID A1989U434900005
-
EFFICIENT EVALUATION OF RIGHT-LINEAR, LEFT-LINEAR, AND MULTILINEAR RULES
INTERNATIONAL CONF ON THE MANAGEMENT OF DATA
ASSOC COMPUTING MACHINERY. 1989: 235–242
View details for Web of Science ID A1989BQ37T00022
-
ARGUMENT REDUCTION BY FACTORING
15TH INTERNATIONAL CONF ON VERY LARGE DATA BASES
MORGAN KAUFMANN PUB INC. 1989: 173–182
View details for Web of Science ID A1989BQ76P00018
-
EFFICIENT TESTS FOR TOP-DOWN TERMINATION OF LOGICAL RULES
JOURNAL OF THE ACM
1988; 35 (2): 345-373
View details for Web of Science ID A1988N071600004
-
PARALLEL COMPLEXITY OF LOGICAL QUERY PROGRAMS
ALGORITHMICA
1988; 3 (1): 5-42
View details for Web of Science ID A1988L632600002
-
A COMMUNICATION-TIME TRADEOFF
SIAM JOURNAL ON COMPUTING
1987; 16 (4): 639-646
View details for Web of Science ID A1987J549400004
-
ALGORITHMS FOR THE COMPILATION OF REGULAR EXPRESSIONS INTO PLAS
ALGORITHMICA
1987; 2 (3): 283-314
View details for Web of Science ID A1987K596300002
-
DESIGN OVERVIEW OF THE NAIL - SYSTEM
LECTURE NOTES IN COMPUTER SCIENCE
1986; 225: 554-568
View details for Web of Science ID A1986E223900044
-
IMPLEMENTATION OF LOGICAL QUERY LANGUAGES FOR DATABASES
ACM TRANSACTIONS ON DATABASE SYSTEMS
1985; 10 (3): 289-321
View details for Web of Science ID A1985AQL4500001
-
CONNECTIONS IN ACYCLIC HYPERGRAPHS
THEORETICAL COMPUTER SCIENCE
1984; 32 (1-2): 185-199
View details for Web of Science ID A1984TL59300010
-
SYSTEM/U - A DATABASE SYSTEM BASED ON THE UNIVERSAL RELATION ASSUMPTION
ACM TRANSACTIONS ON DATABASE SYSTEMS
1984; 9 (3): 331-347
View details for Web of Science ID A1984TT36900001
-
ON THE FOUNDATIONS OF THE UNIVERSAL RELATION MODEL
ACM TRANSACTIONS ON DATABASE SYSTEMS
1984; 9 (2): 283-308
View details for Web of Science ID A1984TT36800006
-
FLUX, SORTING, AND SUPERCOMPUTER ORGANIZATION FOR AL APPLICATIONS
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
1984; 1 (2): 133-151
View details for Web of Science ID A1984TY25300002
-
TOOLS FOR TEMPLATE DEPENDENCIES
SIAM JOURNAL ON COMPUTING
1983; 12 (1): 36-59
View details for Web of Science ID A1983QE59000003
-
MAXIMAL OBJECTS AND THE SEMANTICS OF UNIVERSAL RELATION DATABASES
ACM TRANSACTIONS ON DATABASE SYSTEMS
1983; 8 (1): 1-14
View details for Web of Science ID A1983QD38100001
-
TEMPLATE DEPENDENCIES - A LARGE CLASS OF DEPENDENCIES IN RELATIONAL DATABASES AND ITS COMPLETE AXIOMATIZATION
JOURNAL OF THE ACM
1982; 29 (2): 363-372
View details for Web of Science ID A1982NL69200005
-
BOUNDS ON THE SIZE AND TRANSMISSION RATE OF COMMUNICATIONS PROTOCOLS
COMPUTERS & MATHEMATICS WITH APPLICATIONS
1982; 8 (3): 205-214
View details for Web of Science ID A1982NR36600004
-
THE COMPILATION OF REGULAR EXPRESSIONS INTO INTEGRATED-CIRCUITS
JOURNAL OF THE ACM
1982; 29 (3): 603-622
View details for Web of Science ID A1982NZ24200001
-
A SIMPLIFIED UNIVERSAL RELATION ASSUMPTION AND ITS PROPERTIES
ACM TRANSACTIONS ON DATABASE SYSTEMS
1982; 7 (3): 343-360
View details for Web of Science ID A1982PC92300002
-
THE THEORY OF FUNCTIONAL AND TEMPLATE DEPENDENCIES
THEORETICAL COMPUTER SCIENCE
1982; 17 (3): 317-331
View details for Web of Science ID A1982NH82400005
-
DEADLOCK-FREE PACKET SWITCHING-NETWORKS
SIAM JOURNAL ON COMPUTING
1981; 10 (3): 594-611
View details for Web of Science ID A1981MB80500015
-
EQUIVALENCE OF RELATIONAL DATABASE SCHEMES
SIAM JOURNAL ON COMPUTING
1981; 10 (2): 352-370
View details for Web of Science ID A1981LS55500010
-
INFERRING A TREE FROM LOWEST COMMON ANCESTORS WITH AN APPLICATION TO THE OPTIMIZATION OF RELATIONAL EXPRESSIONS
SIAM JOURNAL ON COMPUTING
1981; 10 (3): 405-421
View details for Web of Science ID A1981MB80500001
-
ADEQUACY OF DECOMPOSITIONS OF RELATIONAL DATABASES
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
1980; 21 (3): 368-379
View details for Web of Science ID A1980LF20100006
-
EQUIVALENCES AMONG RELATIONAL EXPRESSIONS
SIAM JOURNAL ON COMPUTING
1979; 8 (2): 218-246
View details for Web of Science ID A1979GU63300009
-
CODE GENERATION FOR EXPRESSIONS WITH COMMON SUB-EXPRESSIONS
JOURNAL OF THE ACM
1977; 24 (1): 146-160
View details for Web of Science ID A1977CT70000009
-
OPERATIONS ON SPARSE RELATIONS
COMMUNICATIONS OF THE ACM
1977; 20 (3): 171-176
View details for Web of Science ID A1977CY78800006
-
NODE LISTINGS FOR REDUCIBLE FLOW GRAPHS
JOURNAL OF COMPUTER AND SYSTEM SCIENCES
1976; 13 (3): 286-299
View details for Web of Science ID A1976CU44000003
-
BOUNDS ON COMPLEXITY OF LONGEST COMMON SUBSEQUENCE PROBLEM
JOURNAL OF THE ACM
1976; 23 (1): 1-12
View details for Web of Science ID A1976BE23300001
-
COMPLEXITY OF LR(K) TESTING
COMMUNICATIONS OF THE ACM
1975; 18 (12): 707-716
View details for Web of Science ID A1975AZ21000005
-
DETERMINISTIC PARSING OF AMBIGUOUS GRAMMARS
COMMUNICATIONS OF THE ACM
1975; 18 (8): 441-452
View details for Web of Science ID A1975AR81600007
-
DYNAMIC MEMORIES WITH RAPID RANDOM AND SEQUENTIAL ACCESS
IEEE TRANSACTIONS ON COMPUTERS
1974; C 23 (3): 272-276
View details for Web of Science ID A1974S840200007
-
LINEAR PRECEDENCE FUNCTIONS FOR WEAK PRECEDENCE GRAMMARS
INTERNATIONAL JOURNAL OF COMPUTER MATHEMATICS
1972; 3 (2-3): 149-155
View details for Web of Science ID A1972O446000005
-
TRANSLATIONS ON A CONTEXT FREE GRAMMAR
INFORMATION AND CONTROL
1971; 19 (5): 439-?
View details for Web of Science ID A1971L229500006