Jeffrey D. Ullman
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
124
Venues
23
Active years
1967–2021
Best venue rank
A*
Where they publish
- A*SIGMOD19 papers
- A*FOCS17 papers
- A*PODS16 papers
- A*STOC16 papers
- A*ICDE10 papers
- A*POPL9 papers
- AICDT6 papers
- CIDEAS5 papers
- BEDBT5 papers
- BXP4 papers
- A*VLDB3 papers
- A*KDD2 papers
- A*SOSP2 papers
- BEDM1 paper
- BCLOUD1 paper
- ACIKM1 paper
- BDASFAA1 paper
- ADIS1 paper
- A*AAAI1 paper
- BSPAA1 paper
- A*PODC1 paper
- BICLP1 paper
- A*ICALP1 paper
Papers
124 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2021 | KDD | On the Nature of Data Science. | Jeffrey D. Ullman |
| 2019 | ICDE | Partitioned Data Security on Outsourced Sensitive and Non-Sensitive Data. | Sharad Mehrotra, Shantanu Sharma, Jeffrey D. Ullman, Anurag Mishra |
| 2017 | ICDE | Data Science Education: We're Missing the Boat, Again. | Bill Howe, Michael J. Franklin, Laura M. Haas, Tim Kraska, Jeffrey D. Ullman |
| 2017 | ICDT | GYM: A Multiround Distributed Join Algorithm. | Foto N. Afrati, Manas R. Joglekar, Christopher R, Semih Salihoglu, Jeffrey D. Ullman |
| 2016 | EDM | Portrait of an Indexer - Computing Pointers Into Instructional Videos. | Andrew Lamb, Jose Hernandez, Jeffrey D. Ullman, Andreas Paepcke |
| 2016 | IDEAS | Computing Marginals Using MapReduce: Keynote talk paper. | Foto N. Afrati, Shantanu Sharma, Jeffrey D. Ullman, Jonathan R. Ullman |
| 2016 | IDEAS | Panel: The State of Data: Invited Paper from panelists. | Maude Bonenfant, Bipin C. Desai, Drew Desai, Benjamin C. M. Fung, M. Tamer zsu, Jeffrey D. Ullman |
| 2016 | SIGMOD | Shasta: Interactive Reporting At Scale. | 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 |
| 2016 | SIGMOD | Some pairs problems. | Jeffrey D. Ullman, Jonathan R. Ullman |
| 2015 | EDBT | Bounds for Overlapping Interval Join on MapReduce. | Foto N. Afrati, Shlomi Dolev, Shantanu Sharma, Jeffrey D. Ullman |
| 2015 | EDBT | Assignment of Different-Sized Inputs in MapReduce. | Foto N. Afrati, Shlomi Dolev, Ephraim Korach, Shantanu Sharma, Jeffrey D. Ullman |
| 2014 | ICDT | Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce. | Foto N. Afrati, Anish Das Sarma, Anand Rajaraman, Pokey Rule, Semih Salihoglu, Jeffrey D. Ullman |
| 2013 | ICDE | Enumerating subgraph instances using map-reduce. | Foto N. Afrati, Dimitris Fotakis, Jeffrey D. Ullman |
| 2013 | IDEAS | Matching bounds for the all-pairs MapReduce problem. | Foto N. Afrati, Jeffrey D. Ullman |
| 2013 | IDEAS | Big data: a research agenda. | Alfredo Cuzzocrea, Domenico Sacc, Jeffrey D. Ullman |
| 2012 | CLOUD | Designing good algorithms for MapReduce and beyond. | Foto N. Afrati, Magdalena Balazinska, Anish Das Sarma, Bill Howe, Semih Salihoglu, Jeffrey D. Ullman |
| 2012 | EDBT | Transitive closure and recursive Datalog implemented on clusters. | Foto N. Afrati, Jeffrey D. Ullman |
| 2012 | ICDE | Fuzzy Joins Using MapReduce. | Foto N. Afrati, Anish Das Sarma, David Menestrina, Aditya G. Parameswaran, Jeffrey D. Ullman |
| 2012 | ICDT | Parallel skyline queries. | Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman |
| 2011 | EDBT | Map-reduce extensions and recursive queries. | Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman |
| 2010 | CIKM | Evaluating, combining and generalizing recommendations with prerequisites. | Aditya G. Parameswaran, Hector Garcia-Molina, Jeffrey D. Ullman |
| 2010 | EDBT | Optimizing joins in a map-reduce environment. | Foto N. Afrati, Jeffrey D. Ullman |
| 2003 | DASFAA | A Survey of New Directions in Database System. | Jeffrey D. Ullman |
| 2003 | SIGMOD | The Lowell Report. | Jim Gray, Hans-Jrg Schek, Michael Stonebraker, Jeffrey D. Ullman |
| 2003 | SIGMOD | Improving the Efficiency of Database-System Teaching. | Jeffrey D. Ullman |
| 2001 | ICDT | Minimizing View Sets without Losing Query-Answering Power. | Chen Li, Mayank Bawa, Jeffrey D. Ullman |
| 2001 | PODS | Querying Websites Using Compact Skeletons. | Anand Rajaraman, Jeffrey D. Ullman |
| 2001 | SIGMOD | Generating Efficient Plans for Queries Using Views. | Foto N. Afrati, Chen Li, Jeffrey D. Ullman |
| 2000 | DIS | A Survey of Association-Rule Mining. | Jeffrey D. Ullman |
| 2000 | ICDE | Finding Interesting Associations without Support Pruning. | Edith Cohen, Mayur Datar, Shinji Fujiwara, Aristides Gionis, Piotr Indyk, Rajeev Motwani, Jeffrey D. Ullman, Cheng Yang |
| 2000 | ICDE | Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning. | Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani |
| 1999 | ICDT | Optimizing Large Join Queries in Mediation Systems. | Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector Garcia-Molina |
| 1999 | IDEAS | The MIDAS Data-Mining Project at Stanford. | Jeffrey D. Ullman |
| 1999 | SIGMOD | Computing Capabilities of Mediators. | Ramana Yerneni, Chen Li, Hector Garcia-Molina, Jeffrey D. Ullman |
| 1998 | SIGMOD | Capability Based Mediation in TSIMMIS. | Chen Li, Ramana Yerneni, Vasilis Vassalos, Hector Garcia-Molina, Yannis Papakonstantinou, Jeffrey D. Ullman, Murty Valiveti |
| 1998 | SIGMOD | Query Flocks: A Generalization of Association-Rule Mining. | Shalom Tsur, Jeffrey D. Ullman, Serge Abiteboul, Chris Clifton, Rajeev Motwani, Svetlozar Nestorov, Arnon Rosenthal |
| 1998 | VLDB | Computing Iceberg Queries Efficiently. | Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, Jeffrey D. Ullman |
| 1998 | VLDB | Scalable Techniques for Mining Causal Structures. | Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman |
| 1997 | ICDE | Index Selection for OLAP. | Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman |
| 1997 | ICDE | Representative Objects: Concise Representations of Semistructured, Hierarchial Data. | Svetlozar Nestorov, Jeffrey D. Ullman, Janet L. Wiener, Sudarshan S. Chawathe |
| 1997 | ICDT | Information Integration Using Logical Views. | Jeffrey D. Ullman |
| 1997 | SIGMOD | Dynamic Itemset Counting and Implication Rules for Market Basket Data. | Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman, Shalom Tsur |
| 1996 | AAAI | The Database Approach to Knowledge Represention. | Jeffrey D. Ullman |
| 1996 | ICDE | MedMaker: A Mediation System Based on Declarative Specifications. | Yannis Papakonstantinou, Hector Garcia-Molina, Jeffrey D. Ullman |
| 1996 | KDD | Efficient Implementation of Data Cubes Via Materialized Views. | Jeffrey D. Ullman |
| 1996 | PODS | Answering Queries Using Limited External Processors. | Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman |
| 1996 | PODS | Integrating Information by Outerjoins and Full Disjunctions. | Anand Rajaraman, Jeffrey D. Ullman |
| 1996 | SIGMOD | Implementing Data Cubes Efficiently. | Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman |
| 1996 | SIGMOD | LORE: A Lightweight Object REpository for Semistructured Data. | 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 |
| 1995 | ICDE | A Version Numbering Scheme with a Useful Lexicographical Order. | Arthur M. Keller, Jeffrey D. Ullman |
| 1995 | PODS | Answering Queries Using Templates with Binding Patterns. | Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1995 | SIGMOD | Information Translation, Mediation, and Mosaic-Based Browsing in the TSIMMIS System. | Joachim Hammer, Hector Garcia-Molina, Kelly Ireland, Yannis Papakonstantinou, Jeffrey D. Ullman, Jennifer Widom |
| 1994 | PODS | Constraint Checking with Partial Information. | Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom |
| 1990 | SIGMOD | The Input/Output Complexity of Transitive Closure. | Jeffrey D. Ullman, Mihalis Yannakakis |
| 1990 | SPAA | High-Probability Parallel Transitive Closure Algorithms. | Jeffrey D. Ullman, Mihalis Yannakakis |
| 1989 | PODS | Proof-Tree Transformation Theorems and Their Applications. | Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi |
| 1989 | PODS | Bottom-Up Beats Top-Down for Datalog. | Jeffrey D. Ullman |
| 1989 | SIGMOD | Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. | Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1989 | VLDB | Argument Reduction by Factoring. | Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1988 | PODS | The Complexity of Ordering Subgoals. | Jeffrey D. Ullman, Moshe Y. Vardi |
| 1987 | PODC | An Optimal Synchronizer for the Hypercube. | David Peleg, Jeffrey D. Ullman |
| 1987 | PODS | Database Theory: Past and Future. | Jeffrey D. Ullman |
| 1986 | FOCS | Parallel Complexity of Logical Query Programs | Jeffrey D. Ullman, Allen Van Gelder |
| 1986 | ICLP | Design Overview of the NAIL! System. | Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder |
| 1986 | PODS | Convergence of Sideways Query Evaluation. | Foto N. Afrati, Christos H. Papadimitriou, George Papageorgiou, Athena Roussou, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1986 | PODS | Magic Sets and Other Strange Ways to Implement Logic Programs. | Franois Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1985 | SIGMOD | Implementation of Logical Query Languages for Databases (Abstract). | Jeffrey D. Ullman |
| 1984 | FOCS | A Communication-Time Tradeoff | Christos H. Papadimitriou, Jeffrey D. Ullman |
| 1984 | PODS | On the Equivalence of Logical Databases. | Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi |
| 1984 | SIGMOD | On Complementary and Independent Mappings on Databases. | Arthur M. Keller, Jeffrey D. Ullman |
| 1984 | STOC | Correcting Faults in Write-Once Memory | Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman |
| 1983 | PODS | On the Semantics of Updates in Databases. | Ronald Fagin, Jeffrey D. Ullman, Moshe Y. Vardi |
| 1983 | PODS | The Revenge of the JD. | David Maier, Jeffrey D. Ullman, Moshe Y. Vardi |
| 1983 | SIGMOD | Fragments of Relations. | David Maier, Jeffrey D. Ullman |
| 1983 | STOC | On Notions of Information Transfer in VLSI Circuits | Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis |
| 1982 | PODS | Connections in Acyclic Hypergraphs. | David Maier, Jeffrey D. Ullman |
| 1982 | PODS | The U. R. Strikes Back. | Jeffrey D. Ullman |
| 1981 | ICALP | A View of Directions in Relational Database Theory. | Jeffrey D. Ullman |
| 1981 | STOC | Properties of Acyclic Database Schemes | Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis |
| 1981 | STOC | Optimal Wiring between Rectangles | Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman |
| 1981 | XP | Connections in Acyclic Hypergraphs. | David Maier, Jeffrey D. Ullman |
| 1981 | XP | Fragments of Relations: First Hack. | David Maier, Jeffrey D. Ullman |
| 1980 | FOCS | The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract) | Robert W. Floyd, Jeffrey D. Ullman |
| 1980 | SIGMOD | The Interaction between Functional Dependencies and Template Dependencies. | Fereidoon Sadri, Jeffrey D. Ullman |
| 1980 | STOC | A Complete Axiomatization for a Large Class of Dependencies in Relational Databases | Fereidoon Sadri, Jeffrey D. Ullman |
| 1980 | XP | System/U: A Database System Based on the Universal Relation Assumption. | Henry F. Korth, Jeffrey D. Ullman |
| 1980 | XP | Universal Instances. | Jeffrey D. Ullman |
| 1979 | FOCS | Modeling Communications Protocols by Automata | Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis |
| 1979 | POPL | The Universality of Data Retrieval Languages. | Alfred V. Aho, Jeffrey D. Ullman |
| 1979 | STOC | Equivalence of Relational Database Schemes | Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1979 | STOC | Deadlock-Free Packet Switching Networks | Sam Toueg, Jeffrey D. Ullman |
| 1978 | POPL | A General Scheme for the Automatic Inference of Variable Types. | Marc A. Kaplan, Jeffrey D. Ullman |
| 1978 | SIGMOD | Efficient Optimization of a Class of Relational Expressions (Abstract). | Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman |
| 1977 | FOCS | The Theory of Joins in Relational Data Bases (Extended Abstract) | Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman |
| 1977 | POPL | Code Generation for Machines with Multiregister Operations. | Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman |
| 1976 | POPL | Code Generation for Expressions with Common Subexpressions. | Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman |
| 1976 | POPL | Induction Variables in Very High Level Languages. | Amelia C. Fong, Jeffrey D. Ullman |
| 1976 | STOC | Finding the Depth of a Flow Graph | Amelia C. Fong, Jeffrey D. Ullman |
| 1975 | FOCS | Economy of Descriptions by Parsers, DPDA's, and PDA's | Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | FOCS | Evaluating Relational Expressions with Dense and Sparse Arguments | Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | POPL | Application of Lattice Algebra to Loop Optimization. | Amelia C. Fong, John B. Kam, Jeffrey D. Ullman |
| 1975 | POPL | On the Complexity of LR(k) Testing. | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1975 | STOC | Node Listings for Reducible Flow Graphs | Alfred V. Aho, Jeffrey D. Ullman |
| 1975 | SOSP | On Protection in Operating System. | Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman |
| 1974 | FOCS | Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract) | Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman |
| 1974 | FOCS | Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract) | Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman |
| 1973 | POPL | Deterministic Parsing of Ambiguous Grammars. | Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman |
| 1973 | POPL | Analysis of a Simple Algorithm for Global Flow Problems. | Matthew S. Hecht, Jeffrey D. Ullman |
| 1973 | STOC | On Finding Lowest Common Ancestors in Trees | Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman |
| 1973 | SOSP | Polynomial Complete Scheduling Problems. | Jeffrey D. Ullman |
| 1972 | FOCS | A Fast Algorithm for the Elimination of Common Subexpressions | Jeffrey D. Ullman |
| 1972 | STOC | A Technique for Speeding Up LR(k) Parsers | Alfred V. Aho, Jeffrey D. Ullman |
| 1972 | STOC | Worst-Case Analysis of Memory Allocation Algorithms | M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman |
| 1972 | STOC | Flow Graph Reducibility | Matthew S. Hecht, Jeffrey D. Ullman |
| 1971 | STOC | The Care and Feeding of LR(k) Grammars | Alfred V. Aho, Jeffrey D. Ullman |
| 1970 | FOCS | Equivalence of Programs with Structured Variables | Alfred V. Aho, Jeffrey D. Ullman |
| 1970 | FOCS | Parsing Algorithms with Backtrack | Alexander Birman, Jeffrey D. Ullman |
| 1970 | STOC | Transformations on Straight Line Programs-Preliminary Version | Alfred V. Aho, Jeffrey D. Ullman |
| 1969 | FOCS | A Characterization of Two-Way Deterministic Classes of Languages | Alfred V. Aho, Jeffrey D. Ullman |
| 1969 | STOC | Translations on a Context Free Grammar | Alfred V. Aho, Jeffrey D. Ullman |
| 1968 | FOCS | Automaton Analogs of Syntax Directed Translation Schemata | Alfred V. Aho, Jeffrey D. Ullman |
| 1968 | FOCS | Universal Two State Machines: Characterization Theorems and Decomposition Schemes | Jeffrey D. Ullman, Peter Weiner |
| 1967 | FOCS | Two Results on One-Way Stack Automata | John E. Hopcroft, Jeffrey D. Ullman |
| 1967 | FOCS | An Approach to a Unified Theory of Automata | John E. Hopcroft, Jeffrey D. Ullman |