Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeffrey D. Ullman
Person information
- affiliation: Stanford University, USA
- award (2020): Turing Award
- award (2010): IEEE John von Neumann Medal
- award (2006): SIGMOD Edgar F. Codd Innovations Award
- award (2000): Knuth Prize
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Books and Theses
- 2014
[b28]Jure Leskovec, Anand Rajaraman, Jeffrey D. Ullman:
Mining of Massive Datasets, 2nd Ed. Cambridge University Press 2014, ISBN 978-1107077232- 2009
- [b27]Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom:
Database systems - the complete book (2. ed.). Pearson Education 2009, ISBN 978-0-13-187325-4, pp. I-XXVI, 1-1203 - 2007
- [b26]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman:
Introduction to automata theory, languages, and computation, 3rd Edition. Pearson international edition, Addison-Wesley 2007, ISBN 978-0-321-47617-3, pp. I-XVII, 1-535 - 2003
- [b25]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman:
Introduction to automata theory, languages, and computation - international edition, 2nd Edition. Addison-Wesley 2003, ISBN 978-0-321-21029-6, pp. I-XIV, 1-521 - 2002
- [b24]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman:
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.). Pearson Studium 2002, ISBN 978-3-8273-7020-4, pp. 1-528 - [b23]Jeffrey D. Ullman, Jennifer Widom:
A first course in database systems (2. ed.). Prentice Hall 2002, ISBN 978-0-13-035300-9, pp. I-XVI, 1-511 - [b22]Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom:
Database systems - the complete book (international edition). Pearson Education 2002, ISBN 978-0-13-098043-4, pp. I-XXVII, 1-1119 - 2001
- [b21]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman:
Introduction to automata theory, languages, and computation, 2nd Edition. Addison-Wesley series in computer science, Addison-Wesley-Longman 2001, ISBN 978-0-201-44124-6, pp. I-XIV, 1-521 - 2000
- [b20]John E. Hopcroft, Jeffrey D. Ullman:
Introduction to Automata Theory, Languages and Computation, Second Edition. Addison-Wesley 2000 - [b19]Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom:
Database System Implementation. Prentice-Hall 2000, ISBN 0-13-040264-8 - 1998
- [b18]Jeffrey D. Ullman:
Elements of ML programming - ML 97 edition. Prentice Hall 1998, ISBN 978-0-13-790387-0, pp. I-XIII, 1-383 - 1997
- [b17]Jeffrey D. Ullman, Jennifer Widom:
A First Course in Database Systems. Prentice-Hall 1997, ISBN 0-13-861337-0 - 1996
- [b16]Alfred V. Aho, Jeffrey D. Ullman:
Informatik - Datenstrukturen und Konzepte der Abstraktion. Informatik Lehrbuchreihe, International Thomson 1996, ISBN 978-3-8266-0242-9, pp. 1-1042 - 1994
- [b15]John E. Hopcroft, Jeffrey D. Ullman:
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (3. Aufl.). Internationale Computer-Bibliothek, Addison-Wesley 1994, ISBN 978-3-89319-744-6, pp. I-IX, 1-461 - [b14]Jeffrey D. Ullman:
Elements of ML programming. Prentice Hall 1994, ISBN 978-0-13-288788-5, pp. I-XIII, 1-320 - 1992
- [b13]Alfred V. Aho, Jeffrey D. Ullman:
Foundations of Computer Science, C Edition. Computer Science Press / W. H. Freeman 1992, ISBN 0716782332, pp. I-XIII, 1-765 - 1990
- [b12]John E. Hopcroft, Jeffrey D. Ullman:
Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.). Internationale Computer-Bibliothek, Addison-Wesley 1990, ISBN 978-3-89319-181-9, pp. I-IX, 1-461 - 1989
- [b11]Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X [contents] - 1988
- [b10]Jeffrey D. Ullman:
Principles of Database and Knowledge-Base Systems, Volume I. Principles of computer science series 14, Computer Science Press 1988, ISBN 0-7167-8069-0, pp. I-XI, 1-631 [contents] - 1986
- [b9]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman:
Compilers: Principles, Techniques, and Tools. Addison-Wesley series in computer science / World student series edition, Addison-Wesley 1986, ISBN 0-201-10088-6, pp. I-X, 1-796 - 1983
- [b8]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7 - 1982
- [b7]Jeffrey D. Ullman:
Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6 - 1980
- [b6]Jeffrey D. Ullman:
Principles of Database Systems, 1st Edition. Computer Science Press 1980 - 1979
- [b5]John E. Hopcroft, Jeffrey D. Ullman:
Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, ISBN 0-201-02988-X - 1974
- [b4]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6 - 1973
- [b3]Alfred V. Aho, Jeffrey D. Ullman:
The theory of parsing, translation, and compiling. 2: Compiling. Prentice-Hall 1973, ISBN 0139145648, pp. I-XII, 1-543 - 1972
- [b2]Alfred V. Aho, Jeffrey D. Ullman:
The theory of parsing, translation, and compiling. 1: Parsing. Prentice-Hall 1972, ISBN 0139145567, pp. I-XVIII, 1-542 - 1969
- [b1]John E. Hopcroft, Jeffrey D. Ullman:
Formal languages and their relation to automata. Addison-Wesley series in computer science and information processing, Addison-Wesley 1969, ISBN 0201029839, pp. I-VII, 1-242
Journal Articles
- 2024
- [j130]Grisha Weintraub
, Ehud Gudes, Shlomi Dolev, Jeffrey D. Ullman:
Optimizing Cloud Data Lake Queries With a Balanced Coverage Plan. IEEE Trans. Cloud Comput. 12(1): 84-99 (2024) - 2022
- [j129]Alfred V. Aho, Jeffrey D. Ullman:
Abstractions, their algorithms, and their compilers. Commun. ACM 65(2): 76-91 (2022) - [j128]Jeffrey D. Ullman:
Visits to Research Groups. XRDS 29(2): 10-11 (2022) - [j127]Philip Derbeko, Shlomi Dolev, Ehud Gudes, Jeffrey D. Ullman:
Efficient and Privacy Preserving Approximation of Distributed Statistical Queries. IEEE Trans. Big Data 8(5): 1399-1413 (2022) - 2020
- [j126]Jeffrey D. Ullman:
The Battle for Data Science. IEEE Data Eng. Bull. 43(2): 8-14 (2020) - [j125]Sharad Mehrotra, Shantanu Sharma, Jeffrey D. Ullman, Dhrubajyoti Ghosh, Peeyush Gupta, Anurag Mishra:
PANDA: Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data. ACM Trans. Manag. Inf. Syst. 11(4): 23:1-23:41 (2020) - 2018
- [j124]Foto N. Afrati, Nikos Stasinopoulos, Jeffrey D. Ullman, Angelos Vasilakopoulos:
SharesSkew: An algorithm to handle skew for joins in MapReduce. Inf. Syst. 77: 129-150 (2018) - [j123]Foto N. Afrati, Shantanu Sharma, Jonathan R. Ullman, Jeffrey D. Ullman:
Computing marginals using MapReduce. J. Comput. Syst. Sci. 94: 98-117 (2018) - 2017
- [j122]Foto N. Afrati, Jan Hidders, Christopher Ré, Jacek Sroka, Jeffrey D. Ullman:
Report from the third workshop on Algorithms and Systems for MapReduce and Beyond (BeyondMR'16). SIGMOD Rec. 46(2): 43-48 (2017) - [j121]Foto N. Afrati, Jan Hidders, Paraschos Koutris, Jacek Sroka, Jeffrey D. Ullman:
Report from the Fourth Workshop on Algorithms andSystems for MapReduce and Beyond (BeyondMR '17). SIGMOD Rec. 46(4): 44-48 (2017) - 2016
- [j120]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment Problems of Different-Sized Inputs in MapReduce. ACM Trans. Knowl. Discov. Data 11(2): 18:1-18:35 (2016) - 2015
- [j119]Jeffrey D. Ullman:
Experiments as research validation: have we gone too far? Commun. ACM 58(9): 37-39 (2015) - [j118]Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman:
Parallel Skyline Queries. Theory Comput. Syst. 57(4): 1008-1037 (2015) - 2014
- [j117]Foto N. Afrati, Dan Delorey, Mosha Pasumansky, Jeffrey D. Ullman:
Storing and Querying Tree-Structured Records in Dremel. Proc. VLDB Endow. 7(12): 1131-1142 (2014) - 2013
- [j116]Foto N. Afrati, Anish Das Sarma, Semih Salihoglu, Jeffrey D. Ullman:
Upper and Lower Bounds on the Cost of a Map-Reduce Computation. Proc. VLDB Endow. 6(4): 277-288 (2013) - 2012
- [j115]Jeffrey D. Ullman:
Designing good MapReduce algorithms. XRDS 19(1): 30-34 (2012) - 2011
- [j114]Foto N. Afrati, Jeffrey D. Ullman:
Optimizing Multiway Joins in a Map-Reduce Environment. IEEE Trans. Knowl. Data Eng. 23(9): 1282-1298 (2011) - 2010
- [j113]Parag Agrawal, Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom:
Foundations of Uncertain-Data Integration. Proc. VLDB Endow. 3(1): 1080-1090 (2010) - 2009
- [j112]Jeffrey D. Ullman:
Viewpoint - Advising students for success. Commun. ACM 52(3): 34-37 (2009) - 2007
- [j111]Foto N. Afrati, Chen Li, Jeffrey D. Ullman:
Using views to generate efficient evaluation plans for queries. J. Comput. Syst. Sci. 73(5): 703-724 (2007) - 2005
- [j110]Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik:
The Lowell database research self-assessment. Commun. ACM 48(5): 111-118 (2005) - [j109]Serge Abiteboul, Richard Hull, Victor Vianu, Sheila A. Greibach, Michael A. Harrison, Ellis Horowitz, Daniel J. Rosenkrantz, Jeffrey D. Ullman, Moshe Y. Vardi:
In memory of Seymour Ginsburg 1928 - 2004. SIGMOD Rec. 34(1): 5-12 (2005) - 2003
- [j108]Anand Rajaraman, Jeffrey D. Ullman:
Querying websites using compact skeletons. J. Comput. Syst. Sci. 66(4): 809-851 (2003) - 2001
- [j107]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman:
Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News 32(1): 60-65 (2001) - [j106]Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang:
Finding Interesting Associations without Support Pruning. IEEE Trans. Knowl. Data Eng. 13(1): 64-78 (2001) - 2000
- [j105]Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman:
Scalable Techniques for Mining Causal Structures. Data Min. Knowl. Discov. 4(2/3): 163-192 (2000) - [j104]Jeffrey D. Ullman:
Information integration using logical views. Theor. Comput. Sci. 239(2): 189-210 (2000) - 1999
- [j103]Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman:
Answering Queries Using Limited External Query Processors. J. Comput. Syst. Sci. 58(1): 69-82 (1999) - 1998
- [j102]Richard T. Snodgrass, Hector Garcia-Molina, Tomasz Imielinski, David Maier, Patricia G. Selinger, Jeffrey D. Ullman:
Reminiscences on Influential Papers. SIGMOD Rec. 27(3): 33-35 (1998) - [j101]Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, Jeffrey D. Ullman:
The Asilomar Report on Database Research. SIGMOD Rec. 27(4): 74-80 (1998) - 1997
- [j100]Hector Garcia-Molina, Yannis Papakonstantinou, Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Vasilis Vassalos, Jennifer Widom:
The TSIMMIS Approach to Mediation: Data Models and Languages. J. Intell. Inf. Syst. 8(2): 117-132 (1997) - [j99]Dallan Quass, Anand Rajaraman, Jeffrey D. Ullman, Jennifer Widom, Yehoshua Sagiv:
Querying Semistructured Heterogeneous Information. J. Syst. Integr. 7(3/4): 381-407 (1997) - [j98]Peter Buneman, Louiqa Raschid, Jeffrey D. Ullman:
Mediator Languages - a Proposal for a Standard. SIGMOD Rec. 26(1): 39-44 (1997) - 1996
- [j97]Jeffrey D. Ullman:
Moving Database Theory into Database Practice. ACM Comput. Surv. 28(4es): 90 (1996) - [j96]Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman:
Database Research: Achievements and Opportunities Into the 21st Century. SIGMOD Rec. 25(1): 52-63 (1996) - 1995
- [j95]Jeffrey D. Ullman:
The Role of Theory Today. ACM Comput. Surv. 27(1): 43-44 (1995) - [j94]Raghu Ramakrishnan, Jeffrey D. Ullman:
A survey of deductive database systems. J. Log. Program. 23(2): 125-149 (1995) - [j93]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Argument Reduction by Factoring. Theor. Comput. Sci. 146(1&2): 269-310 (1995) - 1993
- [j92]Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi:
Logical Query Optimization by Proff-Tree Transformation. J. Comput. Syst. Sci. 47(1): 222-248 (1993) - 1991
- [j91]Jeffrey D. Ullman, Mihalis Yannakakis:
The Input/Output Complexity of Transitive Closure. Ann. Math. Artif. Intell. 3(2-4): 331-360 (1991) - [j90]Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman:
Database Systems: Achievements and Opportunities. Commun. ACM 34(10): 110-120 (1991) - [j89]Jeffrey D. Ullman, Mihalis Yannakakis:
High-Probability Parallel Transitive-Closure Algorithms. SIAM J. Comput. 20(1): 100-125 (1991) - 1990
- [j88]Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman:
Database Systems: Achievements and Opportunities - The "Lagunita" Report of the NSF Invitational Workshop on the Future of Database System Research held in Palo Alto, California, February 22-23, 1990. SIGMOD Rec. 19(4): 6-22 (1990) - [j87]Jeffrey D. Ullman, Carlo Zaniolo:
Deductive Databases: Achievements and Future Directions. SIGMOD Rec. 19(4): 75-82 (1990) - [j86]Arthur M. Keller, Peter Rathmann, Jeffrey D. Ullman, Gio Wiederhold:
Selected Database Research at Stanford. SIGMOD Rec. 19(4): 119-122 (1990) - 1989
- [j85]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
On the Convergence of Query Evaluation. J. Comput. Syst. Sci. 38(2): 341-359 (1989) - [j84]David Peleg, Jeffrey D. Ullman:
An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18(4): 740-747 (1989) - 1988
- [j83]Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs. Algorithmica 3: 5-42 (1988) - [j82]Jeffrey D. Ullman, Allen Van Gelder:
Efficient tests for top-down termination of logical rules. J. ACM 35(2): 345-373 (1988) - 1987
- [j81]Anna R. Karlin, Howard Trickey, Jeffrey D. Ullman:
Algorithms for the Compilation of Regular Expressions into PLAs. Algorithmica 2: 283-314 (1987) - [j80]Katherine A. Morris, Jeffrey F. Naughton, Yatin P. Saraiya, Jeffrey D. Ullman, Allen Van Gelder:
YAWN! (Yet Another Window on NAIL!). IEEE Data Eng. Bull. 10(4): 28-43 (1987) - [j79]Christos H. Papadimitriou, Jeffrey D. Ullman:
A Communication-Time Tradeoff. SIAM J. Comput. 16(4): 639-646 (1987) - 1986
- [j78]Ronald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi:
Updating Logical Databases. Adv. Comput. Res. 3: 1-18 (1986) - 1985
- [j77]Jeffrey D. Ullman:
Implementation of Logical Query Languages for Databases. ACM Trans. Database Syst. 10(3): 289-321 (1985) - 1984
- [j76]Jeffrey D. Ullman:
Flux, Sorting, and Supercomputer Organization for AI Applications. J. Parallel Distributed Comput. 1(2): 133-151 (1984) - [j75]David Maier, Jeffrey D. Ullman:
Connections in Acyclic Hypergraphs. Theor. Comput. Sci. 32: 185-199 (1984) - [j74]David Maier, Jeffrey D. Ullman, Moshe Y. Vardi:
On the Foundations of the Universal Relation Model. ACM Trans. Database Syst. 9(2): 283-308 (1984) - [j73]Henry F. Korth, Gabriel M. Kuper, Joan Feigenbaum, Allen Van Gelder, Jeffrey D. Ullman:
System/U: A Database System Based on the Universal Relation Assumption. ACM Trans. Database Syst. 9(3): 331-347 (1984) - 1983
- [j72]Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis:
Tools for Template Dependencies. SIAM J. Comput. 12(1): 36-59 (1983) - [j71]David Maier, Jeffrey D. Ullman:
Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14 (1983) - [j70]Jeffrey D. Ullman:
Corrigendum: The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 8(2): 287 (1983) - [j69]Jeffrey D. Ullman:
On Kent's "Consequences of Assuming a Universal Relation". ACM Trans. Database Syst. 8(4): 637-643 (1983) - 1982
- [j68]Jeffrey D. Ullman:
Query Processing in Universal Relation Systems. IEEE Database Eng. Bull. 5(3): 6-10 (1982) - [j67]Fereidoon Sadri, Jeffrey D. Ullman:
Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization. J. ACM 29(2): 363-372 (1982) - [j66]Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits. J. ACM 29(3): 603-622 (1982) - [j65]Fereidoon Sadri, Jeffrey D. Ullman:
The Theory of Functional and Template Dependencies. Theor. Comput. Sci. 17: 317-331 (1982) - [j64]Ronald Fagin, Alberto O. Mendelzon, Jeffrey D. Ullman:
A Simplified Universal Relation Assumption and Its Properties. ACM Trans. Database Syst. 7(3): 343-360 (1982) - 1981
- [j63]Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalence of Relational Database Schemes. SIAM J. Comput. 10(2): 352-370 (1981) - [j62]Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman:
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. SIAM J. Comput. 10(3): 405-421 (1981) - [j61]Sam Toueg, Jeffrey D. Ullman:
Deadlock-Free Packet Switching Networks. SIAM J. Comput. 10(3): 594-611 (1981) - 1980
- [j60]Marc A. Kaplan, Jeffrey D. Ullman:
A Scheme for the Automatic Inference of Variable Types. J. ACM 27(1): 128-145 (1980) - [j59]David Maier, Alberto O. Mendelzon, Fereidoon Sadri, Jeffrey D. Ullman:
Adequacy of Decompositions of Relational Databases. J. Comput. Syst. Sci. 21(3): 368-379 (1980) - 1979
- [j58]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246 (1979) - [j57]Alfred V. Aho, Jeffrey D. Ullman:
Optimal Partial-Match Retrieval When Fields Are Independently Specified. ACM Trans. Database Syst. 4(2): 168-179 (1979) - [j56]Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman:
The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3): 297-314 (1979) - [j55]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions. ACM Trans. Database Syst. 4(4): 435-454 (1979) - 1977
- [j54]John B. Kam, Jeffrey D. Ullman:
Monotone Data Flow Analysis Frameworks. Acta Informatica 7: 305-317 (1977) - [j53]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations. Commun. ACM 20(3): 171-176 (1977) - [j52]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions. J. ACM 24(1): 146-160 (1977) - [j51]Amelia C. Fong, Jeffrey D. Ullman:
Finding the Depth of a Flow Graph. J. Comput. Syst. Sci. 15(3): 300-309 (1977) - [j50]Thomas G. Szymanski, Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments. SIAM J. Comput. 6(1): 109-122 (1977) - [j49]Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Economy of Description by Parsers, DPDA'S, and PDA'S. Theor. Comput. Sci. 4(2): 143-153 (1977) - [j48]John B. Kam, Jeffrey D. Ullman:
A Model of Statistical Databases and Their Security. ACM Trans. Database Syst. 2(1): 1-10 (1977) - 1976
- [j47]Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman:
Protection in Operating Systems. Commun. ACM 19(8): 461-471 (1976) - [j46]Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem. J. ACM 23(1): 1-12 (1976) - [j45]John B. Kam, Jeffrey D. Ullman:
Global Data Flow Analysis and Iterative Algorithms. J. ACM 23(1): 158-171 (1976) - [j44]Alfred V. Aho, Jeffrey D. Ullman:
Node Listings for Reducible Flow Graphs. J. Comput. Syst. Sci. 13(3): 286-299 (1976) - [j43]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees. SIAM J. Comput. 5(1): 115-132 (1976) - 1975
- [j42]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars. Commun. ACM 18(8): 441-452 (1975) - [j41]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
On the Complexity of LR(k) Testing. Commun. ACM 18(12): 707-716 (1975) - [j40]Jeffrey D. Ullman:
NP-Complete Scheduling Problems. J. Comput. Syst. Sci. 10(3): 384-393 (1975) - [j39]Matthew S. Hecht, Jeffrey D. Ullman:
A Simple Algorithm for Global Data Flow Analysis Problems. SIAM J. Comput. 4(4): 519-532 (1975) - [j38]Alfred V. Aho, Kenneth Steiglitz, Jeffrey D. Ullman:
Evaluating Polynomials at Fixed Sets of Points. SIAM J. Comput. 4(4): 533-539 (1975) - 1974
- [j37]Matthew S. Hecht, Jeffrey D. Ullman:
Characterizations of Reducible Flow Graphs. J. ACM 21(3): 367-375 (1974) - [j36]David S. Johnson, Alan J. Demers, Jeffrey D. Ullman, M. R. Garey, Ronald L. Graham:
Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM J. Comput. 3(4): 299-325 (1974) - [j35]Alfred V. Aho, Jeffrey D. Ullman:
Dynamic Memories with Rapid Random and Sequential Access. IEEE Trans. Computers 23(3): 272-276 (1974) - 1973
- [j34]Jeffrey D. Ullman:
Fast Algorithms for the Elimination of Common Subexpressions. Acta Informatica 2: 191-213 (1973) - [j33]Alexander Birman, Jeffrey D. Ullman:
Parsing Algorithms with Backtrack. Inf. Control. 23(1): 1-34 (1973) - [j32]Alfred V. Aho, Jeffrey D. Ullman:
Error Detection in Precedence Parsers. Math. Syst. Theory 7(2): 97-113 (1973) - [j31]Alfred V. Aho, Jeffrey D. Ullman:
A Technique for Speeding up LR(k) Parsers. SIAM J. Comput. 2(2): 106-127 (1973) - [j30]John E. Hopcroft, Jeffrey D. Ullman:
Set Merging Algorithms. SIAM J. Comput. 2(4): 294-303 (1973) - 1972
- [j29]Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
Weak and Mixed Strategy Precedence Parsing. J. ACM 19(2): 225-243 (1972) - [j28]Jeffrey D. Ullman:
A Note on the Efficiency of Hashing Functions. J. ACM 19(3): 569-575 (1972) - [j27]Alfred V. Aho, Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables. J. Comput. Syst. Sci. 6(2): 125-137 (1972) - [j26]Alfred V. Aho, Jeffrey D. Ullman:
Optimization of LR(k) Parsers. J. Comput. Syst. Sci. 6(6): 573-602 (1972) - [j25]Alfred V. Aho, Jeffrey D. Ullman:
Optimization of Straight Line Programs. SIAM J. Comput. 1(1): 1-19 (1972) - [j24]Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman:
The Transitive Reduction of a Directed Graph. SIAM J. Comput. 1(2): 131-137 (1972) - [j23]Matthew S. Hecht, Jeffrey D. Ullman:
Flow Graph Reducibility. SIAM J. Comput. 1(2): 188-202 (1972) - 1971
- [j22]Alfred V. Aho, Jeffrey D. Ullman:
Translations on a Context-Free Grammar. Inf. Control. 19(5): 439-475 (1971) - [j21]Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman:
Principles of Optimal Page Replacement. J. ACM 18(1): 80-93 (1971) - [j20]Alfred V. Aho, Jeffrey D. Ullman:
Characterizations and Extensions of Pushdown Translations. Math. Syst. Theory 5(2): 172-192 (1971) - 1970
- [j19]Ravi Sethi, Jeffrey D. Ullman:
The Generation of Optimal Code for Arithmetic Expressions. J. ACM 17(4): 715-728 (1970) - [j18]Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft:
On the Computational Power of Pushdown Automata. J. Comput. Syst. Sci. 4(2): 129-136 (1970) - [j17]Alfred V. Aho, Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages. J. Comput. Syst. Sci. 4(6): 523-538 (1970) - 1969
- [j16]John E. Hopcroft, Jeffrey D. Ullman:
Some Results on Tape-Bounded Turing Machines. J. ACM 16(1): 168-177 (1969) - [j15]Jeffrey D. Ullman:
Halting Stack Automata. J. ACM 16(1): 550-563 (1969) - [j14]Alfred V. Aho, Jeffrey D. Ullman:
Syntax Directed Translations and the Pushdown Assembler. J. Comput. Syst. Sci. 3(1): 37-56 (1969) - [j13]Alfred V. Aho, Jeffrey D. Ullman:
Properties of Syntax Directed Translations. J. Comput. Syst. Sci. 3(3): 319-334 (1969) - [j12]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
A General Theory of Translation. Math. Syst. Theory 3(3): 193-221 (1969) - [j11]Arthur D. Friedman, Ronald L. Graham, Jeffrey D. Ullman:
Universal Single Transition Time Asynchronous State Assignments. IEEE Trans. Computers 18(6): 541-547 (1969) - 1968
- [j10]John E. Hopcroft, Jeffrey D. Ullman:
Sets Accepted by One-Way Stack Automata Are Context Sensitive. Inf. Control. 13(2): 114-133 (1968) - [j9]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
Time and Tape Complexity of Pushdown Automaton Languages. Inf. Control. 13(3): 186-206 (1968) - [j8]John E. Hopcroft, Jeffrey D. Ullman:
Decidable and Undecidable Questions About Automata. J. ACM 15(2): 317-324 (1968) - [j7]John E. Hopcroft, Jeffrey D. Ullman:
Relations Between Time and Tape Complexities. J. ACM 15(3): 414-427 (1968) - [j6]John E. Hopcroft, Jeffrey D. Ullman:
Deterministic Stack Automata and the Quotient Operator. J. Comput. Syst. Sci. 2(1): 1-12 (1968) - [j5]Alfred V. Aho, Jeffrey D. Ullman:
The Theory of Languages. Math. Syst. Theory 2(2): 97-125 (1968) - 1967
- [j4]John E. Hopcroft, Jeffrey D. Ullman:
Nonerasing Stack Automata. J. Comput. Syst. Sci. 1(2): 166-186 (1967) - [j3]Jeffrey D. Ullman:
On the capabilities of codes to correct synchronization errors. IEEE Trans. Inf. Theory 13(1): 95-105 (1967) - 1966
- [j2]Jeffrey D. Ullman:
Near-optimal, single-synchronization-error-correcting code. IEEE Trans. Inf. Theory 12(4): 418-424 (1966) - 1965
- [j1]Jeffrey D. Ullman:
Decoding of Cyclic Codes Using Position Invariant Functions. IBM J. Res. Dev. 9(4): 233-240 (1965)
Conference and Workshop Papers
- 2022
- [c159]Shlomi Dolev, Ehud Gudes, Erez Segev, Jeffrey D. Ullman, Grisha Weintraub:
BFLUT Bloom Filter for Private Look Up Tables. CSCML 2022: 499-505 - 2021
- [c158]Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman:
Meta-X: A Technique for Reducing Communication in Geographically Distributed Computations. CSCML 2021: 467-486 - [c157]Jeffrey D. Ullman:
On the Nature of Data Science. KDD 2021: 4 - 2019
- [c156]Sharad Mehrotra, Shantanu Sharma, Jeffrey D. Ullman:
Scaling Cryptographic Techniques by Exploiting Data Sensitivity at a Public Cloud. CODASPY 2019: 165-167 - [c155]Sharad Mehrotra, Shantanu Sharma, Jeffrey D. Ullman, Anurag Mishra:
Partitioned Data Security on Outsourced Sensitive and Non-Sensitive Data. ICDE 2019: 650-661 - [c154]Rekha Singhal, Yaqi Zhang, Jeffrey D. Ullman, Raghu Prabhakar, Kunle Olukotun:
Efficient Multiway Hash Join on Reconfigurable Hardware. TPCTC 2019: 19-38 - 2017
- [c153]Philip Derbeko, Shlomi Dolev, Ehud Gudes, Jeffrey D. Ullman:
Efficient and private approximations of distributed databases calculations. IEEE BigData 2017: 4487-4496 - [c152]Bill Howe, Michael J. Franklin, Laura M. Haas, Tim Kraska, Jeffrey D. Ullman:
Data Science Education: We're Missing the Boat, Again. ICDE 2017: 1473-1474 - [c151]Foto N. Afrati, Manas R. Joglekar, Christopher Ré, Semih Salihoglu, Jeffrey D. Ullman:
GYM: A Multiround Distributed Join Algorithm. ICDT 2017: 4:1-4:18 - 2016
- [c150]Philip Derbeko, Shlomi Dolev, Ehud Gudes, Jeffrey D. Ullman:
Concise essence-preserving big data representation. IEEE BigData 2016: 3662-3665 - [c149]Andrew Lamb, Jose Hernandez, Jeffrey D. Ullman, Andreas Paepcke:
Portrait of an Indexer - Computing Pointers Into Instructional Videos. EDM 2016: 601-602 - [c148]Maude Bonenfant, Bipin C. Desai, Drew Desai, Benjamin C. M. Fung, M. Tamer Özsu, Jeffrey D. Ullman:
Panel: The State of Data: Invited Paper from panelists. IDEAS 2016: 2-11 - [c147]Foto N. Afrati, Shantanu Sharma, Jeffrey D. Ullman, Jonathan R. Ullman:
Computing Marginals Using MapReduce: Keynote talk paper. IDEAS 2016: 12-23 - [c146]Jeffrey D. Ullman, Jonathan R. Ullman:
Some pairs problems. BeyondMR@SIGMOD 2016: 8 - [c145]Gokul Nath Babu Manoharan, Stephan Ellner, Karl Schnaitter, Sridatta Chegu, Alejandro Estrella-Balderrama, Stephan Gudmundson, Apurv Gupta, Ben Handy, Bart Samwel, Chad Whipkey, Larysa Aharkava, Himani Apte, Nitin Gangahar, Jun Xu, Shivakumar Venkataraman, Divyakant Agrawal, Jeffrey D. Ullman:
Shasta: Interactive Reporting At Scale. SIGMOD Conference 2016: 1393-1404 - 2015
- [c144]Jeffrey D. Ullman:
MapReduce Algorithms. CODS Companion Volume 2015: 1:1 - [c143]Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman:
Bounds for Overlapping Interval Join on MapReduce. EDBT/ICDT Workshops 2015: 3-6 - [c142]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. EDBT/ICDT Workshops 2015: 28-37 - 2014
- [c141]Foto N. Afrati, Anish Das Sarma, Anand Rajaraman, Pokey Rule, Semih Salihoglu, Jeffrey D. Ullman:
Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce. ICDT 2014: 4-14 - [c140]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. DISC 2014: 536-537 - 2013
- [c139]Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman:
Enumerating subgraph instances using map-reduce. ICDE 2013: 62-73 - [c138]Foto N. Afrati, Jeffrey D. Ullman:
Matching bounds for the all-pairs MapReduce problem. IDEAS 2013: 3-4 - [c137]Alfredo Cuzzocrea, Domenico Saccà, Jeffrey D. Ullman:
Big data: a research agenda. IDEAS 2013: 198-203 - 2012
- [c136]Foto N. Afrati, Magdalena Balazinska, Anish Das Sarma, Bill Howe, Semih Salihoglu, Jeffrey D. Ullman:
Designing good algorithms for MapReduce and beyond. SoCC 2012: 26 - [c135]Foto N. Afrati, Jeffrey D. Ullman:
Transitive closure and recursive Datalog implemented on clusters. EDBT 2012: 132-143 - [c134]Foto N. Afrati, Anish Das Sarma, David Menestrina, Aditya G. Parameswaran, Jeffrey D. Ullman:
Fuzzy Joins Using MapReduce. ICDE 2012: 498-509 - [c133]Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman:
Parallel skyline queries. ICDT 2012: 274-284 - 2011
- [c132]Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman:
Map-reduce extensions and recursive queries. EDBT 2011: 1-8 - 2010
- [c131]Aditya G. Parameswaran, Hector Garcia-Molina, Jeffrey D. Ullman:
Evaluating, combining and generalizing recommendations with prerequisites. CIKM 2010: 919-928 - [c130]Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman:
Cluster Computing, Recursion and Datalog. Datalog 2010: 120-144 - [c129]Foto N. Afrati, Jeffrey D. Ullman:
Optimizing joins in a map-reduce environment. EDBT 2010: 99-110 - 2009
- [c128]Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom:
Schema Design for Uncertain Databases. AMW 2009 - 2005
- [c127]Jeffrey D. Ullman:
Gradiance On-Line Accelerated Learning. ACSC 2005: 3-6 - 2003
- [c126]Jeffrey D. Ullman:
A Survey of New Directions in Database System. DASFAA 2003: 3- - [c125]Jeffrey D. Ullman:
Improving the Efficiency of Database-System Teaching. SIGMOD Conference 2003: 1-3 - [c124]Jim Gray, Hans-Jörg Schek, Michael Stonebraker, Jeffrey D. Ullman:
The Lowell Report. SIGMOD Conference 2003: 680 - 2001
- [c123]Chen Li, Mayank Bawa, Jeffrey D. Ullman:
Minimizing View Sets without Losing Query-Answering Power. ICDT 2001: 99-113 - [c122]Anand Rajaraman, Jeffrey D. Ullman:
Querying Websites Using Compact Skeletons. PODS 2001 - [c121]Foto N. Afrati, Chen Li, Jeffrey D. Ullman:
Generating Efficient Plans for Queries Using Views. SIGMOD Conference 2001: 319-330 - 2000
- [c120]Jeffrey D. Ullman:
A Survey of Association-Rule Mining. Discovery Science 2000: 1-14 - [c119]Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang:
Finding Interesting Associations without Support Pruning. ICDE 2000: 489-500 - [c118]Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani:
Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning. ICDE 2000: 501-511 - 1999
- [c117]Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector Garcia-Molina:
Optimizing Large Join Queries in Mediation Systems. ICDT 1999: 348-364 - [c116]Jeffrey D. Ullman:
The MIDAS Data-Mining Project at Stanford. IDEAS 1999: 460-464 - [c115]Jeffrey D. Ullman:
Some Advances in Data-Mining Techniques (Abstract). NGITS 1999: 1 - [c114]Ramana Yerneni, Chen Li, Hector Garcia-Molina, Jeffrey D. Ullman:
Computing Capabilities of Mediators. SIGMOD Conference 1999: 443-454 - 1998
- [c113]Shalom Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Svetlozar Nestorov, Arnon Rosenthal:
Query Flocks: A Generalization of Association-Rule Mining. SIGMOD Conference 1998: 1-12 - [c112]Chen Li, Ramana Yerneni, Vasilis Vassalos, Hector Garcia-Molina, Yannis Papakonstantinou, Jeffrey D. Ullman, Murty Valiveti:
Capability Based Mediation in TSIMMIS. SIGMOD Conference 1998: 564-566 - [c111]Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, Jeffrey D. Ullman:
Computing Iceberg Queries Efficiently. VLDB 1998: 299-310 - [c110]Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman:
Scalable Techniques for Mining Causal Structures. VLDB 1998: 594-605 - 1997
- [c109]Svetlozar Nestorov, Jeffrey D. Ullman, Janet L. Wiener, Sudarshan S. Chawathe:
Representative Objects: Concise Representations of Semistructured, Hierarchial Data. ICDE 1997: 79-90 - [c108]Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman:
Index Selection for OLAP. ICDE 1997: 208-219 - [c107]Jeffrey D. Ullman:
Information Integration Using Logical Views. ICDT 1997: 19-40 - [c106]Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur:
Dynamic Itemset Counting and Implication Rules for Market Basket Data. SIGMOD Conference 1997: 255-264 - 1996
- [c105]Jeffrey D. Ullman:
The Database Approach to Knowledge Represention. AAAI/IAAI, Vol. 2 1996: 1346-1348 - [c104]Yannis Papakonstantinou, Hector Garcia-Molina, Jeffrey D. Ullman:
MedMaker: A Mediation System Based on Declarative Specifications. ICDE 1996: 132-141 - [c103]Jeffrey D. Ullman:
Efficient Implementation of Data Cubes Via Materialized Views. KDD 1996: 386-388 - [c102]Arno Siebes, Shalom Tsur, Jeffrey D. Ullman, Laurent Vieille, Carlo Zaniolo:
Deductive Databases: Challenges, Opportunities and Future Directions (Panel Discussion). Logic in Databases 1996: 225-229 - [c101]Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman:
Answering Queries Using Limited External Processors. PODS 1996: 227-237 - [c100]Anand Rajaraman, Jeffrey D. Ullman:
Integrating Information by Outerjoins and Full Disjunctions. PODS 1996: 238-248 - [c99]Jeffrey D. Ullman:
The TSIMMIS Database Integration Project. SEBD 1996: 7-14 - [c98]Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman:
Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216 - [c97]Dallan Quass, Jennifer Widom, Roy Goldman, Kevin Haas, Qingshan Luo, Jason McHugh, Svetlozar Nestorov, Anand Rajaraman, Hugo Rivero, Serge Abiteboul, Jeffrey D. Ullman, Janet L. Wiener:
LORE: A Lightweight Object REpository for Semistructured Data. SIGMOD Conference 1996: 549 - 1995
- [c96]Yannis Papakonstantinou, Ashish Gupta, Hector Garcia-Molina, Jeffrey D. Ullman:
A Query Translation Scheme for Rapid Implementation of Wrappers. DOOD 1995: 161-186 - [c95]Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
Querying Semistructured Heterogeneous Information. DOOD 1995: 319-344 - [c94]Arthur M. Keller, Jeffrey D. Ullman:
A Version Numbering Scheme with a Useful Lexicographical Order. ICDE 1995: 240-248 - [c93]Hector Garcia-Molina, Dallan Quass, Yannis Papakonstantinou, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
The TSIMMIS Approach to Mediation: Data Models and Languages. NGITS 1995 - [c92]Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman:
Answering Queries Using Templates with Binding Patterns. PODS 1995: 105-112 - [c91]Joachim Hammer, Hector Garcia-Molina, Kelly Ireland, Yannis Papakonstantinou, Jeffrey D. Ullman, Jennifer Widom:
Information Translation, Mediation, and Mosaic-Based Browsing in the TSIMMIS System. SIGMOD Conference 1995: 483 - 1994
- [c90]Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman:
Validating Constraints with Partial Information: Research Overview. DAISD 1994: 375-385 - [c89]Sudarshan S. Chawathe, Hector Garcia-Molina, Joachim Hammer, Kelly Ireland, Yannis Papakonstantinou, Jeffrey D. Ullman, Jennifer Widom:
The TSIMMIS Project: Integration of Heterogeneous Information Sources. IPSJ 1994: 7-18 - [c88]Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
Constraint Checking with Partial Information. PODS 1994: 45-55 - [c87]Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom:
Efficient and Complete Tests for Database Integrity Constraint Checking. PPCP 1994: 173-180 - 1992
- [c86]Jeffrey D. Ullman:
The Interface Between Language Theory and Database Theory. Theoretical Studies in Computer Science 1992: 133-151 - [c85]Ashish Gupta, Jeffrey D. Ullman:
Generalizing Conjunctive Query Containment for View Maintenance and Integrity Constraint Verification (Abstract). Workshop on Deductive Databases, JICSLP 1992: 195 - [c84]Jeffrey D. Ullman:
New Frontiers in Database System Research. 25th Anniversary of INRIA 1992: 87-101 - 1991
- [c83]Jeffrey D. Ullman:
A Comparison between Deductive and Object-Oriented Database Systems. DOOD 1991: 263-277 - 1990
- [c82]Jeffrey D. Ullman:
The theory of deductive database systems. Compcon 1990: 496-502 - [c81]Jeffrey D. Ullman, Mihalis Yannakakis:
The Input/Output Complexity of Transitive Closure. SIGMOD Conference 1990: 44-53 - [c80]Jeffrey D. Ullman, Mihalis Yannakakis:
High-Probability Parallel Transitive Closure Algorithms. SPAA 1990: 200-209 - 1989
- [c79]Jeffrey D. Ullman:
Bottom-Up Beats Top-Down for Datalog. PODS 1989: 140-149 - [c78]Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi:
Proof-Tree Transformation Theorems and Their Applications. PODS 1989: 172-181 - [c77]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242 - [c76]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman:
Argument Reduction by Factoring. VLDB 1989: 173-182 - 1988
- [c75]Jeffrey D. Ullman, Moshe Y. Vardi:
The Complexity of Ordering Subgoals. PODS 1988: 74-81 - 1987
- [c74]David Peleg, Jeffrey D. Ullman:
An Optimal Synchronizer for the Hypercube. PODC 1987: 77-85 - [c73]Jeffrey D. Ullman:
Database Theory: Past and Future. PODS 1987: 1-10 - 1986
- [c72]Jeffrey D. Ullman, Allen Van Gelder:
Parallel Complexity of Logical Query Programs. FOCS 1986: 438-454 - [c71]Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder:
Design Overview of the NAIL! System. ICLP 1986: 554-568 - [c70]François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman:
Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15 - [c69]Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman:
Convergence of Sideways Query Evaluation. PODS 1986: 24-30 - 1985
- [c68]Jeffrey D. Ullman:
Logic and Database Systems. On Knowledge Base Management Systems (Islamorada) 1985: 121-123 - [c67]Jeffrey D. Ullman:
An Approach To Processing Queries In A Logic-Based Query Language. On Knowledge Base Management Systems (Islamorada) 1985: 147-164 - [c66]Jeffrey D. Ullman:
Implementation of Logical Query Languages for Databases (Abstract). SIGMOD Conference 1985: 444 - 1984
- [c65]Jeffrey D. Ullman:
Some Thoughts About Supercomputer Organization. COMPCON 1984: 424-432 - [c64]Christos H. Papadimitriou, Jeffrey D. Ullman:
A Communication-Time Tradeoff. FOCS 1984: 84-88 - [c63]Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi:
On the Equivalence of Logical Databases. PODS 1984: 221-228 - [c62]Arthur M. Keller, Jeffrey D. Ullman:
On Complementary and Independent Mappings on Databases. SIGMOD Conference 1984: 143-148 - [c61]Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman:
Correcting Faults in Write-Once Memory. STOC 1984: 225-229 - 1983
- [c60]Jeffrey D. Ullman:
Universal Relation Interfaces for Database Systems. IFIP Congress 1983: 243-252 - [c59]David Maier, Jeffrey D. Ullman, Moshe Y. Vardi:
The Revenge of the JD. PODS 1983: 279-287 - [c58]Ronald Fagin, Jeffrey D. Ullman, Moshe Y. Vardi:
On the Semantics of Updates in Databases. PODS 1983: 352-365 - [c57]David Maier, Jeffrey D. Ullman:
Fragments of Relations. SIGMOD Conference 1983: 15-22 - [c56]Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis:
On Notions of Information Transfer in VLSI Circuits. STOC 1983: 133-139 - 1982
- [c55]Howard Trickey, Jeffrey D. Ullman:
A Regular Expression Compiler. COMPCON 1982: 345-348 - [c54]Jeffrey D. Ullman:
The U. R. Strikes Back. PODS 1982: 10-22 - [c53]David Maier, Jeffrey D. Ullman:
Connections in Acyclic Hypergraphs. PODS 1982: 34-39 - 1981
- [c52]Jeffrey D. Ullman:
A View of Directions in Relational Database Theory. ICALP 1981: 165-176 - [c51]Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman:
Optimal Wiring between Rectangles. STOC 1981: 312-317 - [c50]Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis:
Properties of Acyclic Database Schemes. STOC 1981: 355-362 - [c49]David Maier, Jeffrey D. Ullman:
Connections in Acyclic Hypergraphs. XP2 Workshop on Relational Database Theory 1981 - [c48]David Maier, Jeffrey D. Ullman:
Fragments of Relations: First Hack. XP2 Workshop on Relational Database Theory 1981 - 1980
- [c47]Robert W. Floyd, Jeffrey D. Ullman:
The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract). FOCS 1980: 260-269 - [c46]Fereidoon Sadri, Jeffrey D. Ullman:
The Interaction between Functional Dependencies and Template Dependencies. SIGMOD Conference 1980: 45-51 - [c45]Fereidoon Sadri, Jeffrey D. Ullman:
A Complete Axiomatization for a Large Class of Dependencies in Relational Databases. STOC 1980: 117-122 - [c44]Henry F. Korth, Jeffrey D. Ullman:
System/U: A Database System Based on the Universal Relation Assumption. XP1 Workshop on Database Theory 1980 - [c43]Jeffrey D. Ullman:
Universal Instances. XP1 Workshop on Database Theory 1980 - 1979
- [c42]David Maier, Alberto O. Mendelzon, Fereidoon Sadri, Jeffrey D. Ullman:
Adequacy of Decompositions of Relational Databases. Advances in Data Base Theory 1979: 101-114 - [c41]Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis:
Modeling Communications Protocols by Automata. FOCS 1979: 267-273 - [c40]Alfred V. Aho, Jeffrey D. Ullman:
The Universality of Data Retrieval Languages. POPL 1979: 110-120 - [c39]Sam Toueg, Jeffrey D. Ullman:
Deadlock-Free Packet Switching Networks. STOC 1979: 89-98 - [c38]Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalence of Relational Database Schemes. STOC 1979: 319-329 - 1978
- [c37]Bharat K. Bhargava, Stephen R. Kimbleton, Barbara H. Liskov, Jack Minker, Jeffrey D. Ullman:
Crossfertilization Of DBMS Research With Other Disciplines Of Computer Science (Panel Discussion). ACM Annual Conference (1) 1978: 325 - [c36]Marc A. Kaplan, Jeffrey D. Ullman:
A General Scheme for the Automatic Inference of Variable Types. POPL 1978: 60-75 - [c35]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Efficient Optimization of a Class of Relational Expressions (Abstract). SIGMOD Conference 1978: 39 - 1977
- [c34]Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman:
The Theory of Joins in Relational Data Bases (Extended Abstract). FOCS 1977: 107-113 - [c33]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Machines with Multiregister Operations. POPL 1977: 21-28 - 1976
- [c32]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Code Generation for Expressions with Common Subexpressions. POPL 1976: 19-31 - [c31]Amelia C. Fong, Jeffrey D. Ullman:
Induction Variables in Very High Level Languages. POPL 1976: 104-112 - [c30]Amelia C. Fong, Jeffrey D. Ullman:
Finding the Depth of a Flow Graph. STOC 1976: 121-125 - 1975
- [c29]Thomas G. Szymanski, Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments. FOCS 1975: 90-97 - [c28]Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Economy of Descriptions by Parsers, DPDA's, and PDA's. FOCS 1975: 122-127 - [c27]Amelia C. Fong, John B. Kam, Jeffrey D. Ullman:
Application of Lattice Algebra to Loop Optimization. POPL 1975: 1-9 - [c26]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
On the Complexity of LR(k) Testing. POPL 1975: 130-136 - [c25]Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman:
On Protection in Operating System. SOSP 1975: 14-24 - [c24]Alfred V. Aho, Jeffrey D. Ullman:
Node Listings for Reducible Flow Graphs. STOC 1975: 177-185 - 1974
- [c23]Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman:
Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). SWAT 1974: 104-109 - [c22]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman:
Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract). SWAT 1974: 127-132 - 1973
- [c21]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman:
Deterministic Parsing of Ambiguous Grammars. POPL 1973: 1-21 - [c20]Matthew S. Hecht, Jeffrey D. Ullman:
Analysis of a Simple Algorithm for Global Flow Problems. POPL 1973: 207-217 - [c19]Jeffrey D. Ullman:
Polynomial Complete Scheduling Problems. SOSP 1973: 96-101 - [c18]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees. STOC 1973: 253-265 - 1972
- [c17]Jeffrey D. Ullman:
Applications of language theory to compiler design. AFIPS Spring Joint Computing Conference 1972: 235-242 - [c16]Jeffrey D. Ullman:
A Fast Algorithm for the Elimination of Common Subexpressions. SWAT 1972: 161-176 - [c15]M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman:
Worst-Case Analysis of Memory Allocation Algorithms. STOC 1972: 143-150 - [c14]Matthew S. Hecht, Jeffrey D. Ullman:
Flow Graph Reducibility. STOC 1972: 238-250 - [c13]Alfred V. Aho, Jeffrey D. Ullman:
A Technique for Speeding Up LR(k) Parsers. STOC 1972: 251-263 - 1971
- [c12]Alfred V. Aho, Jeffrey D. Ullman:
The Care and Feeding of LR(k) Grammars. STOC 1971: 159-170 - 1970
- [c11]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman:
A formal approach to code optimization. Symposium on Compiler Optimization 1970: 86-100 - [c10]Alfred V. Aho, Jeffrey D. Ullman:
Equivalence of Programs with Structured Variables. SWAT 1970: 25-31 - [c9]Alexander Birman, Jeffrey D. Ullman:
Parsing Algorithms with Backtrack. SWAT 1970: 153-174 - [c8]Alfred V. Aho, Jeffrey D. Ullman:
Transformations on Straight Line Programs-Preliminary Version. STOC 1970: 136-148 - 1969
- [c7]Alfred V. Aho, Jeffrey D. Ullman:
A Characterization of Two-Way Deterministic Classes of Languages. SWAT 1969: 231-239 - [c6]Alfred V. Aho, Jeffrey D. Ullman:
Translations on a Context Free Grammar. STOC 1969: 93-112 - 1968
- [c5]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
A recognition algorithm for pushdown store systems. ACM National Conference 1968: 597-604 - [c4]Alfred V. Aho, Jeffrey D. Ullman:
Automaton Analogs of Syntax Directed Translation Schemata. SWAT 1968: 143-159 - [c3]Jeffrey D. Ullman, Peter Weiner:
Universal Two State Machines: Characterization Theorems and Decomposition Schemes. SWAT 1968: 413-426 - 1967
- [c2]John E. Hopcroft, Jeffrey D. Ullman:
Two Results on One-Way Stack Automata. SWAT 1967: 37-44 - [c1]John E. Hopcroft, Jeffrey D. Ullman:
An Approach to a Unified Theory of Automata. SWAT 1967: 140-147
Editorship
- 1992
- [e7]Jeffrey D. Ullman:
Theoretical Studies in Computer Science, to Seymour Ginsburg on the occasion of his 26. birthday. Academic Press 1992, ISBN 0-12-708240-9 [contents] - 1982
- [e6]Jeffrey D. Ullman, Alfred V. Aho:
Proceedings of the ACM Symposium on Principles of Database Systems, March 29-31, 1982, Los Angeles, California, USA. ACM 1982, ISBN 0-89791-070-2 [contents] - 1976
- [e5]Susan L. Graham, Robert M. Graham, Michael A. Harrison, William I. Grosky, Jeffrey D. Ullman:
Conference Record of the Third ACM Symposium on Principles of Programming Languages, Atlanta, Georgia, USA, January 1976. ACM Press 1976 [contents] - 1973
- [e4]Patrick C. Fischer, Jeffrey D. Ullman:
Conference Record of the ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, October 1973. ACM Press 1973 [contents] - 1972
- [e3]Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg:
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA. ACM 1972 [contents] - 1971
- [e2]Michael A. Harrison, Ranan B. Banerji, Jeffrey D. Ullman:
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA. ACM 1971 [contents] - 1970
- [e1]Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp:
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM 1970 [contents]
Informal and Other Publications
- 2023
- [i18]Daniel Cussen, Jeffrey D. Ullman:
Matrix Multiplication Using Only Addition. CoRR abs/2307.01415 (2023) - 2020
- [i17]Sharad Mehrotra, Shantanu Sharma, Jeffrey D. Ullman, Dhrubajyoti Ghosh, Peeyush Gupta:
Panda: Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data. CoRR abs/2005.06154 (2020) - 2019
- [i16]Kunle Olukotun, Raghu Prabhakar, Rekha Singhal, Jeffrey D. Ullman, Yaqi Zhang:
Efficient Multiway Hash Join on Reconfigurable Hardware. CoRR abs/1905.13376 (2019) - 2018
- [i15]Sharad Mehrotra, Shantanu Sharma, Jeffrey D. Ullman, Anurag Mishra:
Partitioned Data Security on Outsourced Sensitive and Non-sensitive Data. CoRR abs/1812.09233 (2018) - 2016
- [i14]Jeffrey D. Ullman, Jonathan R. Ullman:
Some Pairs Problems. CoRR abs/1602.01443 (2016) - [i13]Philip Derbeko, Shlomi Dolev, Ehud Gudes, Jeffrey D. Ullman:
Efficient and Private Approximations of Distributed Databases Calculations. CoRR abs/1605.06143 (2016) - 2015
- [i12]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment of Different-Sized Inputs in MapReduce. CoRR abs/1501.06758 (2015) - [i11]Foto N. Afrati, Jeffrey D. Ullman, Angelos Vasilakopoulos:
Handling Skew in Multiway Joins in Parallel Processing. CoRR abs/1504.03247 (2015) - [i10]Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman:
Assignment Problems of Different-Sized Inputs in MapReduce. CoRR abs/1507.04461 (2015) - [i9]Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman:
Meta-MapReduce: A Technique for Reducing Communication in MapReduce Computations. CoRR abs/1508.01171 (2015) - [i8]Foto N. Afrati, Shantanu Sharma, Jeffrey D. Ullman, Jonathan R. Ullman:
Computing Marginals Using MapReduce. CoRR abs/1509.08855 (2015) - [i7]Foto N. Afrati, Nikos Stasinopoulos, Jeffrey D. Ullman, Angelos Vasilakopoulos:
SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce. CoRR abs/1512.03921 (2015) - 2014
- [i6]Foto N. Afrati, Manas Joglekar, Christopher Ré, Semih Salihoglu, Jeffrey D. Ullman:
GYM: A Multiround Join Algorithm In MapReduce. CoRR abs/1410.4156 (2014) - 2012
- [i5]Foto N. Afrati, Anish Das Sarma, Semih Salihoglu, Jeffrey D. Ullman:
Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation. CoRR abs/1204.1754 (2012) - [i4]Foto N. Afrati, Anish Das Sarma, Semih Salihoglu, Jeffrey D. Ullman:
Upper and Lower Bounds on the Cost of a Map-Reduce Computation. CoRR abs/1206.4377 (2012) - [i3]Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman:
Enumerating Subgraph Instances Using Map-Reduce. CoRR abs/1208.0615 (2012) - 2003
- [i2]Serge Abiteboul, Rakesh Agrawal, Philip A. Bernstein, Michael J. Carey, Stefano Ceri, W. Bruce Croft, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Dieter Gawlick, Jim Gray, Laura M. Haas, Alon Y. Halevy, Joseph M. Hellerstein, Yannis E. Ioannidis, Martin L. Kersten, Michael J. Pazzani, Michael Lesk, David Maier, Jeffrey F. Naughton, Hans-Jörg Schek, Timos K. Sellis, Avi Silberschatz, Michael Stonebraker, Richard T. Snodgrass, Jeffrey D. Ullman, Gerhard Weikum, Jennifer Widom, Stanley B. Zdonik:
The Lowell Database Research Self Assessment. CoRR cs.DB/0310006 (2003) - 1998
- [i1]Philip A. Bernstein, Michael L. Brodie, Stefano Ceri, David J. DeWitt, Michael J. Franklin, Hector Garcia-Molina, Jim Gray, Gerald Held, Joseph M. Hellerstein, H. V. Jagadish, Michael Lesk, David Maier, Jeffrey F. Naughton, Hamid Pirahesh, Michael Stonebraker, Jeffrey D. Ullman:
The Asilomar Report on Database Research. CoRR cs.DB/9811013 (1998)
Coauthor Index
[b16] [b13] [b9] [b8] [b4] [b3] [b2] [j129] [j62] [j58] [j57] [j56] [j55] [j52] [j46] [j44] [j43] [j42] [j38] [j35] [j32] [j31] [j29] [j27] [j26] [j25] [j24] [j22] [j21] [j20] [j18] [j17] [j14] [j13] [j12] [j9] [j5] [c56] [c41] [c40] [c35] [c34] [c33] [c32] [c24] [c23] [c21] [c18] [c13] [c12] [c11] [c10] [c8] [c7] [c6] [c5] [c4] [e6]
a service of 
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-03-19 02:12 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
