Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Jeffrey D. Ullman
2010 – today
- 2012
[j110]- [c133]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
- [c132]Foto N. Afrati, Jeffrey D. Ullman: Transitive closure and recursive Datalog implemented on clusters. EDBT 2012: 132-143
- [c131]Foto N. Afrati, Anish Das Sarma, David Menestrina, Aditya G. Parameswaran, Jeffrey D. Ullman: Fuzzy Joins Using MapReduce. ICDE 2012: 498-509
- [c130]Foto N. Afrati, Paraschos Koutris, Dan Suciu, Jeffrey D. Ullman: Parallel skyline queries. ICDT 2012: 274-284
- [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)
- 2011
- [j109]Foto N. Afrati, Jeffrey D. Ullman: Optimizing Multiway Joins in a Map-Reduce Environment. IEEE Trans. Knowl. Data Eng. 23(9): 1282-1298 (2011)
- [c129]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
- [j108]Parag Agrawal, Anish Das Sarma, Jeffrey D. Ullman, Jennifer Widom: Foundations of Uncertain-Data Integration. PVLDB 3(1): 1080-1090 (2010)
- [c128]Aditya G. Parameswaran, Hector Garcia-Molina, Jeffrey D. Ullman: Evaluating, combining and generalizing recommendations with prerequisites. CIKM 2010: 919-928
- [c127]Foto N. Afrati, Vinayak R. Borkar, Michael J. Carey, Neoklis Polyzotis, Jeffrey D. Ullman: Cluster Computing, Recursion and Datalog. Datalog 2010: 120-144
- [c126]
2000 – 2009
- 2009
- [b22]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
- [j107]
- [c125]
- 2007
- [j106]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
- [j105]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)
- [j104]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 Record 34(1): 5-12 (2005)
- [c124]
- 2003
- [b21]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation - international edition (2. ed). Addison-Wesley 2003, ISBN 978-0-321-21029-6, pp. I-XIV, 1-521
- [j103]Anand Rajaraman, Jeffrey D. Ullman: Querying websites using compact skeletons. J. Comput. Syst. Sci. 66(4): 809-851 (2003)
- [c123]
- [c122]Jeffrey D. Ullman: Improving the Efficiency of Database-System Teaching. SIGMOD Conference 2003: 1-3
- [c121]Jim Gray, Hans-Jörg Schek, Michael Stonebraker, Jeffrey D. Ullman: The Lowell Report. SIGMOD Conference 2003: 680
- [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)
- 2002
- [b20]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
- [b19]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
- [b18]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
- [b17]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation - (2. ed.). Addison-Wesley series in computer science, Addison-Wesley-Longman 2001, ISBN 978-0-201-44124-6, pp. I-XIV, 1-521
- [j102]John E. Hopcroft, Rajeev Motwani, Jeffrey D. Ullman: Introduction to automata theory, languages, and computation, 2nd edition. SIGACT News 32(1): 60-65 (2001)
- [j101]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)
- [c120]Chen Li, Mayank Bawa, Jeffrey D. Ullman: Minimizing View Sets without Losing Query-Answering Power. ICDT 2001: 99-113
- [c119]
- [c118]Foto N. Afrati, Chen Li, Jeffrey D. Ullman: Generating Efficient Plans for Queries Using Views. SIGMOD Conference 2001: 319-330
- 2000
- [b16]John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation, Second Edition. Addison-Wesley 2000
- [b15]Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom: Database System Implementation. Prentice-Hall 2000, ISBN 0-13-040264-8
- [j100]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)
- [j99]Jeffrey D. Ullman: Information integration using logical views. Theor. Comput. Sci. 239(2): 189-210 (2000)
- [c117]
- [c116]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
- [c115]Shinji Fujiwara, Jeffrey D. Ullman, Rajeev Motwani: Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning. ICDE 2000: 501-511
1990 – 1999
- 1999
- [j98]Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman: Answering Queries Using Limited External Query Processors. J. Comput. Syst. Sci. 58(1): 69-82 (1999)
- [c114]Ramana Yerneni, Chen Li, Jeffrey D. Ullman, Hector Garcia-Molina: Optimizing Large Join Queries in Mediation Systems. ICDT 1999: 348-364
- [c113]
- [c112]
- [c111]Ramana Yerneni, Chen Li, Hector Garcia-Molina, Jeffrey D. Ullman: Computing Capabilities of Mediators. SIGMOD Conference 1999: 443-454
- 1998
- [b14]Jeffrey D. Ullman: Elements of ML programming - ML 97 edition. Prentice Hall 1998, ISBN 978-0-13-790387-0, pp. I-XIII, 1-383
- [j97]Richard T. Snodgrass, Hector Garcia-Molina, Tomasz Imielinski, David Maier, Patricia G. Selinger, Jeffrey D. Ullman: Reminiscences on Influential Papers. SIGMOD Record 27(3): 33-35 (1998)
- [j96]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 Record 27(4): 74-80 (1998)
- [c110]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
- [c109]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
- [c108]Min Fang, Narayanan Shivakumar, Hector Garcia-Molina, Rajeev Motwani, Jeffrey D. Ullman: Computing Iceberg Queries Efficiently. VLDB 1998: 299-310
- [c107]Craig Silverstein, Sergey Brin, Rajeev Motwani, Jeffrey D. Ullman: Scalable Techniques for Mining Causal Structures. VLDB 1998: 594-605
- [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)
- 1997
- [b13]Jeffrey D. Ullman, Jennifer Widom: A First Course in Database Systems. Prentice-Hall 1997, ISBN 0-13-861337-0
- [j95]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)
- [j94]Dallan Quass, Anand Rajaraman, Jeffrey D. Ullman, Jennifer Widom, Yehoshua Sagiv: Querying Semistructured Heterogeneous Information. Journal of Systems Integration 7(3/4): 381-407 (1997)
- [j93]Peter Buneman, Louiqa Raschid, Jeffrey D. Ullman: Mediator Languages - a Proposal for a Standard. SIGMOD Record 26(1): 39-44 (1997)
- [c106]Svetlozar Nestorov, Jeffrey D. Ullman, Janet L. Wiener, Sudarshan S. Chawathe: Representative Objects: Concise Representations of Semistructured, Hierarchial Data. ICDE 1997: 79-90
- [c105]Himanshu Gupta, Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Index Selection for OLAP. ICDE 1997: 208-219
- [c104]
- [c103]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
- [b12]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
- [j92]Jeffrey D. Ullman: Moving Database Theory into Database Practice. ACM Comput. Surv. 28(4es): 90 (1996)
- [j91]Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman: Database Research: Achievements and Opportunities Into the 21st Century. SIGMOD Record 25(1): 52-63 (1996)
- [c102]Jeffrey D. Ullman: The Database Approach to Knowledge Represention. AAAI/IAAI, Vol. 2 1996: 1346-1348
- [c101]Yannis Papakonstantinou, Hector Garcia-Molina, Jeffrey D. Ullman: MedMaker: A Mediation System Based on Declarative Specifications. ICDE 1996: 132-141
- [c100]
- [c99]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
- [c98]Alon Y. Levy, Anand Rajaraman, Jeffrey D. Ullman: Answering Queries Using Limited External Processors. PODS 1996: 227-237
- [c97]Anand Rajaraman, Jeffrey D. Ullman: Integrating Information by Outerjoins and Full Disjunctions. PODS 1996: 238-248
- [c96]
- [c95]Venky Harinarayan, Anand Rajaraman, Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conference 1996: 205-216
- [c94]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
- [j90]
- [j89]Raghu Ramakrishnan, Jeffrey D. Ullman: A survey of deductive database systems. J. Log. Program. 23(2): 125-149 (1995)
- [j88]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Argument Reduction by Factoring. Theor. Comput. Sci. 146(1&2): 269-310 (1995)
- [c93]Yannis Papakonstantinou, Ashish Gupta, Hector Garcia-Molina, Jeffrey D. Ullman: A Query Translation Scheme for Rapid Implementation of Wrappers. DOOD 1995: 161-186
- [c92]Dallan Quass, Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Querying Semistructured Heterogeneous Information. DOOD 1995: 319-344
- [c91]Arthur M. Keller, Jeffrey D. Ullman: A Version Numbering Scheme with a Useful Lexicographical Order. ICDE 1995: 240-248
- [c90]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: 0-
- [c89]Anand Rajaraman, Yehoshua Sagiv, Jeffrey D. Ullman: Answering Queries Using Templates with Binding Patterns. PODS 1995: 105-112
- [c88]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
- [b11]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
- [b10]Jeffrey D. Ullman: Elements of ML programming. Prentice Hall 1994, ISBN 978-0-13-288788-5, pp. I-XIII, 1-320
- [c87]Jennifer Widom, Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman: Validating Constraints with Partial Information: Research Overview. DAISD 1994: 375-385
- [c86]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
- [c85]Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Constraint Checking with Partial Information. PODS 1994: 45-55
- [c84]Ashish Gupta, Yehoshua Sagiv, Jeffrey D. Ullman, Jennifer Widom: Efficient and Complete Tests for Database Integrity Constraint Checking. PPCP 1994: 173-180
- 1993
- [j87]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)
- 1992
- [c83]Jeffrey D. Ullman: The Interface Between Language Theory and Database Theory. Theoretical Studies in Computer Science 1992: 133-151
- [c82]Ashish Gupta, Jeffrey D. Ullman: Generalizing Conjunctive Query Containment for View Maintenance and Integrity Constraint Verification (Abstract). Workshop on Deductive Databases, JICSLP 1992: 195
- [c81]Jeffrey D. Ullman: New Frontiers in Database System Research. 25th Anniversary of INRIA 1992: 87-101
- 1991
- [j86]Jeffrey D. Ullman, Mihalis Yannakakis: The Input/Output Complexity of Transitive Closure. Ann. Math. Artif. Intell. 3(2-4): 331-360 (1991)
- [j85]Abraham Silberschatz, Michael Stonebraker, Jeffrey D. Ullman: Database Systems: Achievements and Opportunities. Commun. ACM 34(10): 110-120 (1991)
- [j84]Jeffrey D. Ullman, Mihalis Yannakakis: High-Probability Parallel Transitive-Closure Algorithms. SIAM J. Comput. 20(1): 100-125 (1991)
- [c80]Jeffrey D. Ullman: A Comparison between Deductive and Object-Oriented Database Systems. DOOD 1991: 263-277
- 1990
- [b9]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
- [j83]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 Record 19(4): 6-22 (1990)
- [j82]Jeffrey D. Ullman, Carlo Zaniolo: Deductive Databases: Achievements and Future Directions. SIGMOD Record 19(4): 75-82 (1990)
- [j81]Arthur M. Keller, Peter Rathmann, Jeffrey D. Ullman, Gio Wiederhold: Selected Database Research at Stanford. SIGMOD Record 19(4): 119-122 (1990)
- [c79]Jeffrey D. Ullman, Mihalis Yannakakis: The Input/Output Complexity of Transitive Closure. SIGMOD Conference 1990: 44-53
- [c78]Jeffrey D. Ullman, Mihalis Yannakakis: High-Probability Parallel Transitive Closure Algorithms. SPAA 1990: 200-209
1980 – 1989
- 1989
- [b8]Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume II. Computer Science Press 1989, ISBN 0-7167-8162-X
- [j80]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)
- [j79]David Peleg, Jeffrey D. Ullman: An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18(4): 740-747 (1989)
- [c77]
- [c76]Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman, Moshe Y. Vardi: Proof-Tree Transformation Theorems and Their Applications. PODS 1989: 172-181
- [c75]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989: 235-242
- [c74]Jeffrey F. Naughton, Raghu Ramakrishnan, Yehoshua Sagiv, Jeffrey D. Ullman: Argument Reduction by Factoring. VLDB 1989: 173-182
- 1988
- [b7]Jeffrey D. Ullman: Principles of Database and Knowledge-Base Systems, Volume I. Computer Science Press 1988, ISBN 0-7167-8158-1
- [j78]Jeffrey D. Ullman, Allen Van Gelder: Parallel Complexity of Logical Query Programs. Algorithmica 3: 5-42 (1988)
- [j77]Jeffrey D. Ullman, Allen Van Gelder: Efficient tests for top-down termination of logical rules. J. ACM 35(2): 345-373 (1988)
- [c73]
- 1987
- [j76]Anna R. Karlin, Howard Trickey, Jeffrey D. Ullman: Algorithms for the Compilation of Regular Expressions into PLAs. Algorithmica 2: 283-314 (1987)
- [j75]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)
- [j74]Christos H. Papadimitriou, Jeffrey D. Ullman: A Communication-Time Tradeoff. SIAM J. Comput. 16(4): 639-646 (1987)
- [c72]
- [c71]
- 1986
- [b6]Alfred V. Aho, Ravi Sethi, Jeffrey D. Ullman: Compilers: Princiles, Techniques, and Tools. Addison-Wesley 1986, ISBN 0-201-10088-6
- [j73]Ronald Fagin, Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi: Updating Logical Databases. Advances in Computing Research 3: 1-18 (1986)
- [c70]Jeffrey D. Ullman, Allen Van Gelder: Parallel Complexity of Logical Query Programs. FOCS 1986: 438-454
- [c69]Katherine A. Morris, Jeffrey D. Ullman, Allen Van Gelder: Design Overview of the NAIL! System. ICLP 1986: 554-568
- [c68]François Bancilhon, David Maier, Yehoshua Sagiv, Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986: 1-15
- [c67]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
- [j72]Jeffrey D. Ullman: Implementation of Logical Query Languages for Databases. ACM Trans. Database Syst. 10(3): 289-321 (1985)
- [c66]Jeffrey D. Ullman: Logic and Database Systems. On Knowledge Base Management Systems (Islamorada) 1985: 121-123
- [c65]Jeffrey D. Ullman: An Approach To Processing Queries In A Logic-Based Query Language. On Knowledge Base Management Systems (Islamorada) 1985: 147-164
- [c64]Jeffrey D. Ullman: Implementation of Logical Query Languages for Databases (Abstract). SIGMOD Conference 1985: 444
- 1984
- [j71]Jeffrey D. Ullman: Flux, Sorting, and Supercomputer Organization for AI Applications. J. Parallel Distrib. Comput. 1(2): 133-151 (1984)
- [j70]David Maier, Jeffrey D. Ullman: Connections in Acyclic Hypergraphs. Theor. Comput. Sci. 32: 185-199 (1984)
- [j69]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)
- [j68]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)
- [c63]
- [c62]
- [c61]Gabriel M. Kuper, Jeffrey D. Ullman, Moshe Y. Vardi: On the Equivalence of Logical Databases. PODS 1984: 221-228
- [c60]Arthur M. Keller, Jeffrey D. Ullman: On Complementary and Independent Mappings on Databases. SIGMOD Conference 1984: 143-148
- [c59]Danny Dolev, David Maier, Harry G. Mairson, Jeffrey D. Ullman: Correcting Faults in Write-Once Memory. STOC 1984: 225-229
- 1983
- [b5]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: Data Structures and Algorithms. Addison-Wesley 1983, ISBN 0-201-00023-7
- [j67]Ronald Fagin, David Maier, Jeffrey D. Ullman, Mihalis Yannakakis: Tools for Template Dependencies. SIAM J. Comput. 12(1): 36-59 (1983)
- [j66]David Maier, Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. ACM Trans. Database Syst. 8(1): 1-14 (1983)
- [j65]Jeffrey D. Ullman: Corrigendum: The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 8(2): 287 (1983)
- [j64]Jeffrey D. Ullman: On Kent's "Consequences of Assuming a Universal Relation". ACM Trans. Database Syst. 8(4): 637-643 (1983)
- [c58]
- [c57]
- [c56]Ronald Fagin, Jeffrey D. Ullman, Moshe Y. Vardi: On the Semantics of Updates in Databases. PODS 1983: 352-365
- [c55]
- [c54]Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis: On Notions of Information Transfer in VLSI Circuits. STOC 1983: 133-139
- 1982
- [b4]Jeffrey D. Ullman: Principles of Database Systems, 2nd Edition. Computer Science Press 1982, ISBN 0-914894-36-6
- [j63]Jeffrey D. Ullman: Query Processing in Universal Relation Systems. IEEE Database Eng. Bull. 5(3): 6-10 (1982)
- [j62]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)
- [j61]Robert W. Floyd, Jeffrey D. Ullman: The Compilation of Regular Expressions into Integrated Circuits. J. ACM 29(3): 603-622 (1982)
- [j60]Fereidoon Sadri, Jeffrey D. Ullman: The Theory of Functional and Template Dependencies. Theor. Comput. Sci. 17: 317-331 (1982)
- [j59]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)
- [c53]
- [c52]
- [c51]
- [e6]Jeffrey D. Ullman, Alfred V. Aho (Eds.): 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
- 1981
- [j58]Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalence of Relational Database Schemes. SIAM J. Comput. 10(2): 352-370 (1981)
- [j57]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)
- [j56]Sam Toueg, Jeffrey D. Ullman: Deadlock-Free Packet Switching Networks. SIAM J. Comput. 10(3): 594-611 (1981)
- [c50]
- [c49]Danny Dolev, Kevin Karplus, Alan Siegel, Alex Strong, Jeffrey D. Ullman: Optimal Wiring between Rectangles. STOC 1981: 312-317
- [c48]Catriel Beeri, Ronald Fagin, David Maier, Alberto O. Mendelzon, Jeffrey D. Ullman, Mihalis Yannakakis: Properties of Acyclic Database Schemes. STOC 1981: 355-362
- [c47]David Maier, Jeffrey D. Ullman: Connections in Acyclic Hypergraphs. XP2 Workshop on Relational Database Theory 1981
- [c46]David Maier, Jeffrey D. Ullman: Fragments of Relations: First Hack. XP2 Workshop on Relational Database Theory 1981
- 1980
- [b3]Jeffrey D. Ullman: Principles of Database Systems, 1st Edition. Computer Science Press 1980
- [j55]Marc A. Kaplan, Jeffrey D. Ullman: A Scheme for the Automatic Inference of Variable Types. J. ACM 27(1): 128-145 (1980)
- [j54]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)
- [c45]Robert W. Floyd, Jeffrey D. Ullman: The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract). FOCS 1980: 260-269
- [c44]Fereidoon Sadri, Jeffrey D. Ullman: The Interaction between Functional Dependencies and Template Dependencies. SIGMOD Conference 1980: 45-51
- [c43]Fereidoon Sadri, Jeffrey D. Ullman: A Complete Axiomatization for a Large Class of Dependencies in Relational Databases. STOC 1980: 117-122
- [c42]Henry F. Korth, Jeffrey D. Ullman: System/U: A Database System Based on the Universal Relation Assumption. XP1 Workshop on Database Theory 1980
- [c41]
1970 – 1979
- 1979
- [b2]John E. Hopcroft, Jeffrey D. Ullman: Introduction to Automata Theory, Languages and Computation. Addison-Wesley 1979, ISBN 0-201-02988-X
- [j53]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8(2): 218-246 (1979)
- [j52]Alfred V. Aho, Jeffrey D. Ullman: Optimal Partial-Match Retrieval When Fields Are Independently Specified. ACM Trans. Database Syst. 4(2): 168-179 (1979)
- [j51]Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Databases. ACM Trans. Database Syst. 4(3): 297-314 (1979)
- [j50]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)
- [c40]David Maier, Alberto O. Mendelzon, Fereidoon Sadri, Jeffrey D. Ullman: Adequacy of Decompositions of Relational Databases. Advances in Data Base Theory 1979: 101-114
- [c39]Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis: Modeling Communications Protocols by Automata. FOCS 1979: 267-273
- [c38]
- [c37]
- [c36]Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman: Equivalence of Relational Database Schemes. STOC 1979: 319-329
- 1978
- [c35]Bharat K. Bhargava, Stephen R. Kimbleton, Barbara Liskov, Jack Minker, Jeffrey D. Ullman: Crossfertilization Of DBMS Research With Other Disciplines Of Computer Science (Panel Discussion). ACM Annual Conference (1) 1978: 325
- [c34]Marc A. Kaplan, Jeffrey D. Ullman: A General Scheme for the Automatic Inference of Variable Types. POPL 1978: 60-75
- [c33]Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions (Abstract). SIGMOD Conference 1978: 39
- 1977
- [j49]
- [j48]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: Operations on Sparse Relations. Commun. ACM 20(3): 171-176 (1977)
- [j47]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman: Code Generation for Expressions with Common Subexpressions. J. ACM 24(1): 146-160 (1977)
- [j46]Amelia C. Fong, Jeffrey D. Ullman: Finding the Depth of a Flow Graph. J. Comput. Syst. Sci. 15(3): 300-309 (1977)
- [j45]Thomas G. Szymanski, Jeffrey D. Ullman: Evaluating Relational Expressions with Dense and Sparse Arguments. SIAM J. Comput. 6(1): 109-122 (1977)
- [j44]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)
- [j43]John B. Kam, Jeffrey D. Ullman: A Model of Statistical Databases and Their Security. ACM Trans. Database Syst. 2(1): 1-10 (1977)
- [c32]Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman: The Theory of Joins in Relational Data Bases (Extended Abstract). FOCS 1977: 107-113
- [c31]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman: Code Generation for Machines with Multiregister Operations. POPL 1977: 21-28
- 1976
- [j42]Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman: Protection in Operating Systems. Commun. ACM 19(8): 461-471 (1976)
- [j41]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)
- [j40]John B. Kam, Jeffrey D. Ullman: Global Data Flow Analysis and Iterative Algorithms. J. ACM 23(1): 158-171 (1976)
- [j39]Alfred V. Aho, Jeffrey D. Ullman: Node Listings for Reducible Flow Graphs. J. Comput. Syst. Sci. 13(3): 286-299 (1976)
- [j38]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. SIAM J. Comput. 5(1): 115-132 (1976)
- [c30]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman: Code Generation for Expressions with Common Subexpressions. POPL 1976: 19-31
- [c29]Amelia C. Fong, Jeffrey D. Ullman: Induction Variables in Very High Level Languages. POPL 1976: 104-112
- [c28]
- [e5]Susan L. Graham, Robert M. Graham, Michael A. Harrison, William I. Grosky, Jeffrey D. Ullman (Eds.): Conference Record of the Third ACM Symposium on Principles of Programming Languages, Atlanta, Georgia, USA, January 1976. ACM Press 1976
- 1975
- [j37]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman: Deterministic Parsing of Ambiguous Grammars. Commun. ACM 18(8): 441-452 (1975)
- [j36]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: On the Complexity of LR(k) Testing. Commun. ACM 18(12): 707-716 (1975)
- [j35]
- [j34]Matthew S. Hecht, Jeffrey D. Ullman: A Simple Algorithm for Global Data Flow Analysis Problems. SIAM J. Comput. 4(4): 519-532 (1975)
- [j33]Alfred V. Aho, Kenneth Steiglitz, Jeffrey D. Ullman: Evaluating Polynomials at Fixed Sets of Points. SIAM J. Comput. 4(4): 533-539 (1975)
- [c27]Thomas G. Szymanski, Jeffrey D. Ullman: Evaluating Relational Expressions with Dense and Sparse Arguments. FOCS 1975: 90-97
- [c26]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
- [c25]Amelia C. Fong, John B. Kam, Jeffrey D. Ullman: Application of Lattice Algebra to Loop Optimization. POPL 1975: 1-9
- [c24]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: On the Complexity of LR(k) Testing. POPL 1975: 130-136
- [c23]Michael A. Harrison, Walter L. Ruzzo, Jeffrey D. Ullman: On Protection in Operating System. SOSP 1975: 14-24
- [c22]
- 1974
- [b1]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: The Design and Analysis of Computer Algorithms. Addison-Wesley 1974, ISBN 0-201-00029-6
- [j32]Matthew S. Hecht, Jeffrey D. Ullman: Characterizations of Reducible Flow Graphs. J. ACM 21(3): 367-375 (1974)
- [j31]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)
- [c21]Alfred V. Aho, Daniel S. Hirschberg, Jeffrey D. Ullman: Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). SWAT (FOCS) 1974: 104-109
- [c20]Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman: Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract). SWAT (FOCS) 1974: 127-132
- 1973
- [j30]Jeffrey D. Ullman: Fast Algorithms for the Elimination of Common Subexpressions. Acta Inf. 2: 191-213 (1973)
- [j29]Alexander Birman, Jeffrey D. Ullman: Parsing Algorithms with Backtrack. Information and Control 23(1): 1-34 (1973)
- [j28]Alfred V. Aho, Jeffrey D. Ullman: Error Detection in Precedence Parsers. Mathematical Systems Theory 7(2): 97-113 (1973)
- [j27]Alfred V. Aho, Jeffrey D. Ullman: A Technique for Speeding up LR(k) Parsers. SIAM J. Comput. 2(2): 106-127 (1973)
- [j26]
- [c19]Alfred V. Aho, Stephen C. Johnson, Jeffrey D. Ullman: Deterministic Parsing of Ambiguous Grammars. POPL 1973: 1-21
- [c18]Matthew S. Hecht, Jeffrey D. Ullman: Analysis of a Simple Algorithm for Global Flow Problems. POPL 1973: 207-217
- [c17]
- [c16]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. STOC 1973: 253-265
- [e4]Patrick C. Fischer, Jeffrey D. Ullman (Eds.): Conference Record of the ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, USA, October 1973. ACM Press 1973
- 1972
- [j25]Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman: Weak and Mixed Strategy Precedence Parsing. J. ACM 19(2): 225-243 (1972)
- [j24]
- [j23]Alfred V. Aho, Jeffrey D. Ullman: Equivalence of Programs with Structured Variables. J. Comput. Syst. Sci. 6(2): 125-137 (1972)
- [j22]Alfred V. Aho, Jeffrey D. Ullman: Optimization of LR(k) Parsers. J. Comput. Syst. Sci. 6(6): 573-602 (1972)
- [j21]Alfred V. Aho, Jeffrey D. Ullman: Optimization of Straight Line Programs. SIAM J. Comput. 1(1): 1-19 (1972)
- [j20]Alfred V. Aho, M. R. Garey, Jeffrey D. Ullman: The Transitive Reduction of a Directed Graph. SIAM J. Comput. 1(2): 131-137 (1972)
- [j19]
- [c15]Jeffrey D. Ullman: Applications of language theory to compiler design. AFIPS Spring Joint Computing Conference 1972: 235-242
- [c14]Jeffrey D. Ullman: A Fast Algorithm for the Elimination of Common Subexpressions. SWAT (FOCS) 1972: 161-176
- [c13]M. R. Garey, Ronald L. Graham, Jeffrey D. Ullman: Worst-Case Analysis of Memory Allocation Algorithms. STOC 1972: 143-150
- [c12]
- [c11]
- [e3]Patrick C. Fischer, H. Paul Zeiger, Jeffrey D. Ullman, Arnold L. Rosenberg (Eds.): Proceedings of the 4th Annual ACM Symposium on Theory of Computing, May 1-3, 1972, Denver, Colorado, USA. ACM 1972
- 1971
- [j18]Alfred V. Aho, Jeffrey D. Ullman: Translations on a Context-Free Grammar. Information and Control 19(5): 439-475 (1971)
- [j17]Alfred V. Aho, Peter J. Denning, Jeffrey D. Ullman: Principles of Optimal Page Replacement. J. ACM 18(1): 80-93 (1971)
- [j16]Alfred V. Aho, Jeffrey D. Ullman: Characterizations and Extensions of Pushdown Translations. Mathematical Systems Theory 5(2): 172-192 (1971)
- [c10]
- [e2]Michael A. Harrison, Ranan B. Banerji, Jeffrey D. Ullman (Eds.): Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, May 3-5, 1971, Shaker Heights, Ohio, USA. ACM 1971
- 1970
- [j15]Ravi Sethi, Jeffrey D. Ullman: The Generation of Optimal Code for Arithmetic Expressions. J. ACM 17(4): 715-728 (1970)
- [j14]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)
- [j13]Alfred V. Aho, Jeffrey D. Ullman: A Characterization of Two-Way Deterministic Classes of Languages. J. Comput. Syst. Sci. 4(6): 523-538 (1970)
- [c9]Alfred V. Aho, Jeffrey D. Ullman: Equivalence of Programs with Structured Variables. SWAT (FOCS) 1970: 25-31
- [c8]
- [c7]Alfred V. Aho, Jeffrey D. Ullman: Transformations on Straight Line Programs-Preliminary Version. STOC 1970: 136-148
- [e1]Patrick C. Fischer, Robert Fabian, Jeffrey D. Ullman, Richard M. Karp (Eds.): Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, May 4-6, 1970, Northampton, Massachusetts, USA. ACM 1970
1960 – 1969
- 1969
- [j12]John E. Hopcroft, Jeffrey D. Ullman: Some Results on Tape-Bounded Turing Machines. J. ACM 16(1): 168-177 (1969)
- [j11]
- [j10]Alfred V. Aho, Jeffrey D. Ullman: Syntax Directed Translations and the Pushdown Assembler. J. Comput. Syst. Sci. 3(1): 37-56 (1969)
- [j9]Alfred V. Aho, Jeffrey D. Ullman: Properties of Syntax Directed Translations. J. Comput. Syst. Sci. 3(3): 319-334 (1969)
- [j8]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: A General Theory of Translation. Mathematical Systems Theory 3(3): 193-221 (1969)
- [c6]Alfred V. Aho, Jeffrey D. Ullman: A Characterization of Two-Way Deterministic Classes of Languages. SWAT (FOCS) 1969: 231-239
- [c5]
- 1968
- [j7]John E. Hopcroft, Jeffrey D. Ullman: Sets Accepted by One-Way Stack Automata Are Context Sensitive. Information and Control 13(2): 114-133 (1968)
- [j6]Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman: Time and Tape Complexity of Pushdown Automaton Languages. Information and Control 13(3): 186-206 (1968)
- [j5]John E. Hopcroft, Jeffrey D. Ullman: Decidable and Undecidable Questions About Automata. J. ACM 15(2): 317-324 (1968)
- [j4]John E. Hopcroft, Jeffrey D. Ullman: Relations Between Time and Tape Complexities. J. ACM 15(3): 414-427 (1968)
- [j3]John E. Hopcroft, Jeffrey D. Ullman: Deterministic Stack Automata and the Quotient Operator. J. Comput. Syst. Sci. 2(1): 1-12 (1968)
- [j2]Alfred V. Aho, Jeffrey D. Ullman: The Theory of Languages. Mathematical Systems Theory 2(2): 97-125 (1968)
- [c4]Alfred V. Aho, Jeffrey D. Ullman: Automaton Analogs of Syntax Directed Translation Schemata. SWAT (FOCS) 1968: 143-159
- [c3]Jeffrey D. Ullman, Peter Weiner: Universal Two State Machines: Characterization Theorems and Decomposition Schemes. SWAT (FOCS) 1968: 413-426
- 1967
- [j1]John E. Hopcroft, Jeffrey D. Ullman: Nonerasing Stack Automata. J. Comput. Syst. Sci. 1(2): 166-186 (1967)
- [c2]
- [c1]John E. Hopcroft, Jeffrey D. Ullman: An Approach to a Unified Theory of Automata. SWAT (FOCS) 1967: 140-147
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-04-10 22:30 CEST by the dblp team