DiSC - Author Index

Jeffrey D. Ullman

Online DBLP entries are available for Jeffrey D. Ullman and the following references. (The DiSC DBLP references below have been taken from the Novemember 1998 DBLP.)

Ramana Yerneni , Chen Li , Jeffrey D. Ullman, Hector Garcia-Molina : Optimizing Large Join Queries in Mediation Systems. ICDT 1999 : 348-364

Dick 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

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

Min Fang , Narayanan Shivakumar , Hector Garcia-Molina , Rajeev Motwani , Jeffrey D. Ullman: Computing Iceberg Queries Efficiently. VLDB 1998 : 299-310

Craig Silverstein , Sergey Brin , Rajeev Motwani , Jeffrey D. Ullman: Scalable Techniques for Mining Causal Structures. VLDB 1998 : 594-605

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)

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)

Himanshu Gupta , Venky Harinarayan , Anand Rajaraman , Jeffrey D. Ullman: Index Selection for OLAP. ICDE 1997 : 208-219

Svetlozar Nestorov , Jeffrey D. Ullman, Janet L. Wiener , Sudarshan S. Chawathe : Representative Objects: Concise Representations of Semistructured, Hierarchial Data. ICDE 1997 : 79-90

Jeffrey D. Ullman: Information Integration Using Logical Views. ICDT 1997 : 19-40

Sergey Brin , Rajeev Motwani , Jeffrey D. Ullman, Shalom Tsur : Dynamic Itemset Counting and Implication Rules for Market Basket Data. SIGMOD Conference 1997 : 255-264

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. JIIS 8 (2): 117-132 (1997)

Peter Buneman , Louiqa Raschid , Jeffrey D. Ullman: Mediator Languages - a Proposal for a Standard. SIGMOD Record 26 (1): 39-44 (1997)

Jeffrey D. Ullman: The Database Approach to Knowledge Represention. AAAI/IAAI, Vol. 2 1996 : 1346-1348

Yannis Papakonstantinou , Hector Garcia-Molina , Jeffrey D. Ullman: MedMaker: A Mediation System Based on Declarative Specifications. ICDE 1996 : 132-141

Jeffrey D. Ullman: Efficient Implementation of Data Cubes Via Materialized Views. KDD 1996 : 386-388

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

Alon Y. Levy , Anand Rajaraman , Jeffrey D. Ullman: Answering Queries Using Limited External Processors. PODS 1996 : 227-237

Anand Rajaraman , Jeffrey D. Ullman: Integrating Information by Outerjoins and Full Disjunctions. PODS 1996 : 238-248

Venky Harinarayan , Anand Rajaraman , Jeffrey D. Ullman: Implementing Data Cubes Efficiently. SIGMOD Conf. 1996 : 205-216

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 Conf. 1996 : 549

Jeffrey D. Ullman: Moving Database Theory into Database Practice. Computing Surveys 28 (4es): 90 (1996)

Abraham Silberschatz , Michael Stonebraker , Jeffrey D. Ullman: Database Research: Achievements and Opportunities Into the 21st Century. SIGMOD Record 25 (1): 52-63 (1996)

Yannis Papakonstantinou , Ashish Gupta , Hector Garcia-Molina , Jeffrey D. Ullman: A Query Translation Scheme for Rapid Implementation of Wrappers. DOOD 1995 : 161-186

Dallan Quass , Anand Rajaraman , Yehoshua Sagiv , Jeffrey D. Ullman, Jennifer Widom : Querying Semistructured Heterogeneous Information. DOOD 1995 : 319-344

Arthur M. Keller , Jeffrey D. Ullman: A Version Numbering Scheme with a Useful Lexicographical Order. ICDE 1995 : 240-248

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-

Anand Rajaraman , Yehoshua Sagiv , Jeffrey D. Ullman: Answering Queries Using Templates with Binding Patterns. PODS 1995 : 105-112

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

Jeffrey D. Ullman: The Role of Theory Today. Computing Surveys 27 (1): 43-44 (1995)

Raghu Ramakrishnan , Jeffrey D. Ullman: A survey of deductive database systems. JLP 23 (2): 125-149 (1995)

Jeffrey F. Naughton , Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman: Argument Reduction by Factoring. TCS 146 (1&2): 269-310 (1995)

Jennifer Widom , Ashish Gupta , Yehoshua Sagiv , Jeffrey D. Ullman: Validating Constraints with Partial Information: Research Overview. DAISD 1994 : 375-385

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

Ashid Gupta , Yehoshua Sagiv , Jeffrey D. Ullman, Jennifer Widom : Constraint Checking with Partial Information. PODS 1994 : 45-55

Ashish Gupta , Yehoshua Sagiv , Jeffrey D. Ullman, Jennifer Widom : Efficient and Complete Tests for Database Integrity Constraint Checking. PPCP 1994 : 173-180

Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman, Moshe Y. Vardi : Logical Query Optimization by Proff-Tree Transformation. JCSS 47 (1): 222-248 (1993)

Jeffrey D. Ullman: The Interface Between Language Theory and Database Theory. Theoretical Studies in Computer Science 1992 : 133-151

Ashish Gupta , Jeffrey D. Ullman: Generalizing Conjunctive Query Containment for View Maintenance and Integrity Constraint Verification (Abstract). Workshop on Deductive Databases, JICSLP 1992 : 195

Jeffrey D. Ullman: A Comparison between Deductive and Object-Oriented Database Systems. DOOD 1991 : 263-277

Abraham Silberschatz , Michael Stonebraker , Jeffrey D. Ullman: Database Systems: Achievements and Opportunities. CACM 34 (10): 110-120 (1991)

Jeffrey D. Ullman, Mihalis Yannakakis : High-Probability Parallel Transitive-Closure Algorithms. SIAM J. Comput. 20 (1): 100-125 (1991)

Jeffrey D. Ullman, Mihalis Yannakakis : The Input/Output Complexity of Transitive Closure. SIGMOD Conference 1990 : 44-53

Arthur M. Keller , Peter Rathmann , Jeffrey D. Ullman, Gio Wiederhold : Selected Database Research at Stanford. SIGMOD Record 19 (4): 119-122 (1990)

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)

Jeffrey D. Ullman, Carlo Zaniolo : Deductive Databases: Achievements and Future Directions. SIGMOD Record 19 (4): 75-82 (1990)

Jeffrey D. Ullman: Bottom-Up Beats Top-Down for Datalog. PODS 1989 : 140-149

Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman, Moshe Y. Vardi : Proof-Tree Transformation Theorems and Their Applications. PODS 1989 : 172-181

Jeffrey F. Naughton , Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman: Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules. SIGMOD Conference 1989 : 235-242

Jeffrey F. Naughton , Raghu Ramakrishnan , Yehoshua Sagiv , Jeffrey D. Ullman: Argument Reduction by Factoring. VLDB 1989 : 173-182

Foto N. Afrati , Christos H. Papadimitriou , George Papageorgiou , Athena Roussou , Yehoshua Sagiv , Jeffrey D. Ullman: On the Convergence of Query Evaluation. JCSS 38 (2): 341-359 (1989)

David Peleg , Jeffrey D. Ullman: An Optimal Synchronizer for the Hypercube. SIAM J. Comput. 18 (4): 740-747 (1989)

Jeffrey D. Ullman, Moshe Y. Vardi : The Complexity of Ordering Subgoals. PODS 1988 : 74-81

Jeffrey D. Ullman, Allen Van Gelder : Parallel Complexity of Logical Query Programs. Algorithmica 3 : 5-42 (1988)

Jeffrey D. Ullman, Allen Van Gelder : Efficient Tests for Top-Down Termination of Logical Rules. JACM 35 (2): 345-373 (1988)

David Peleg , Jeffrey D. Ullman: An Optimal Synchronizer for the Hypercube. PODC 1987 : 77-85

Jeffrey D. Ullman: Database Theory: Past and Future. PODS 1987 : 1-10

Anna R. Karlin , Howard Trickey , Jeffrey D. Ullman: Algorithms for the Compilation of Regular Expressions into PLAs. Algorithmica 2 : 283-314 (1987)

Katherine A. Morris , Jeffrey F. Naughton , Yatin P. Saraiya , Jeffrey D. Ullman, Allen Van Gelder : YAWN! (Yet Another Window on NAIL!). Data Engineering Bulletin 10 (4): 28-43 (1987)

Christos H. Papadimitriou , Jeffrey D. Ullman: A Communication-Time Tradeoff. SIAM J. Comput. 16 (4): 639-646 (1987)

Jeffrey D. Ullman, Allen Van Gelder : Parallel Complexity of Logical Query Programs. FOCS 1986 : 438-454

Katherine A. Morris , Jeffrey D. Ullman, Allen Van Gelder : Design Overview of the NAIL! System. ICLP 1986 : 554-568

François Bancilhon , David Maier , Yehoshua Sagiv , Jeffrey D. Ullman: Magic Sets and Other Strange Ways to Implement Logic Programs. PODS 1986 : 1-16

Foto N. Afrati , Christos H. Papadimitriou , George Papageorgiou , Athena Roussou , Yehoshua Sagiv , Jeffrey D. Ullman: Convergence of Sideways Query Evaluation. PODS 1986 : 24-30

Ronald Fagin , Gabriel M. Kuper , Jeffrey D. Ullman, Moshe Y. Vardi : Updating Logical Databases. Advances in Computing Research 3 : 1-18 (1986)

Jeffrey D. Ullman: Implementation of Logical Query Languages for Databases (Abstract). SIGMOD Conference 1985 : 444

Jeffrey D. Ullman: Implementation of Logical Query Languages for Databases. TODS 10 (3): 289-321 (1985)

Christos H. Papadimitriou , Jeffrey D. Ullman: A Communication-Time Tradeoff. FOCS 1984 : 84-88

Gabriel M. Kuper , Jeffrey D. Ullman, Moshe Y. Vardi : On the Equivalence of Logical Databases. PODS 1984 : 221-228

Arthur M. Keller , Jeffrey D. Ullman: On Complementary and Independent Mappings on Databases. SIGMOD Conference 1984 : 143-148

Danny Dolev , David Maier , Harry G. Mairson , Jeffrey D. Ullman: Correcting Faults in Write-Once Memory. STOC 1984 : 225-229

David Maier , Jeffrey D. Ullman: Connections in Acyclic Hypergraphs. TCS 32 : 185-199 (1984)

David Maier , Jeffrey D. Ullman, Moshe Y. Vardi : On the Foundations of the Universal Relation Model. TODS 9 (2): 283-308 (1984)

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. TODS 9 (3): 331-347 (1984)

David Maier , Jeffrey D. Ullman, Moshe Y. Vardi : The Revenge of the JD. PODS 1983 : 279-287

Ronald Fagin , Jeffrey D. Ullman, Moshe Y. Vardi : On the Semantics of Updates in Databases. PODS 1983 : 352-365

David Maier , Jeffrey D. Ullman: Fragments of Relations. SIGMOD Conference 1983 : 15-22

Alfred V. Aho , Jeffrey D. Ullman, Mihalis Yannakakis : On Notions of Information Transfer in VLSI Circuits. STOC 1983 : 133-139

Ronald Fagin , David Maier , Jeffrey D. Ullman, Mihalis Yannakakis : Tools for Template Dependencies. SIAM J. Comput. 12 (1): 36-59 (1983)

David Maier , Jeffrey D. Ullman: Maximal Objects and the Semantics of Universal Relation Databases. TODS 8 (1): 1-14 (1983)

Jeffrey D. Ullman: Corrigendum: The Theory of Joins in Relational Databases. TODS 8 (2): 287 (1983)

Jeffrey D. Ullman: On Kent's "Consequences of Assuming a Universal Relation". TODS 8 (4): 637-643 (1983)

Jeffrey D. Ullman: The U. R. Strikes Back. PODS 1982 : 10-22

David Maier , Jeffrey D. Ullman: Connections in Acyclic Hypergraphs. PODS 1982 : 34-39

Jeffrey D. Ullman: Query Processing in Universal Relation Systems. Database Engineering Bulletin 5 (3): 6-10 (1982)

Fereidoon Sadri , Jeffrey D. Ullman: Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization. JACM 29 (2): 363-372 (1982)

Robert W. Floyd , Jeffrey D. Ullman: The Compilation of Regular Expressions into Integrated Circuits. JACM 29 (3): 603-622 (1982)

Fereidoon Sadri , Jeffrey D. Ullman: The Theory of Functional and Template Dependencies. TCS 17 : 317-331 (1982)

Ronald Fagin , Alberto O. Mendelzon , Jeffrey D. Ullman: A Simplified Universal Relation Assumption and Its Properties. TODS 7 (3): 343-360 (1982)

Jeffrey D. Ullman: A View of Directions in Relational Database Theory. ICALP 1981 : 165-176

Danny Dolev , Kevin Karplus , Alan Siegel , Alex Strong , Jeffrey D. Ullman: Optimal Wiring between Rectangles. STOC 1981 : 312-317

Catriel Beeri , Ronald Fagin , David Maier , Alberto O. Mendelzon , Jeffrey D. Ullman, Mihalis Yannakakis : Properties of Acyclic Database Schemes. STOC 1981 : 355-362

Catriel Beeri , Alberto O. Mendelzon , Yehoshua Sagiv , Jeffrey D. Ullman: Equivalence of Relational Database Schemes. SIAM J. Comput. 10 (2): 352-370 (1981)

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)

Sam Toueg , Jeffrey D. Ullman: Deadlock-Free Packet Switching Networks. SIAM J. Comput. 10 (3): 594-611 (1981)

Robert W. Floyd , Jeffrey D. Ullman: The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract). FOCS 1980 : 260-269

Fereidoon Sadri , Jeffrey D. Ullman: The Interaction between Functional Dependencies and Template Dependencies. SIGMOD Conference 1980 : 45-51

Fereidoon Sadri , Jeffrey D. Ullman: A Complete Axiomatization for a Large Class of Dependencies in Relational Databases. STOC 1980 : 117-122

Marc A. Kaplan , Jeffrey D. Ullman: A Scheme for the Automatic Inference of Variable Types. JACM 27 (1): 128-145 (1980)

David Maier , Alberto O. Mendelzon , Fereidoon Sadri , Jeffrey D. Ullman: Adequacy of Decompositions of Relational Databases. JCSS 21 (3): 368-379 (1980)

David Maier , Alberto O. Mendelzon , Fereidoon Sadri , Jeffrey D. Ullman: Adequacy of Decompositions of Relational Databases. Advances in Data Base Theory 1979 : 101-114

Alfred V. Aho , Jeffrey D. Ullman, Mihalis Yannakakis : Modeling Communications Protocols by Automata. FOCS 1979 : 267-273

Alfred V. Aho , Jeffrey D. Ullman: The Universality of Data Retrieval Languages. POPL 1979 : 110-120

Catriel Beeri , Alberto O. Mendelzon , Yehoshua Sagiv , Jeffrey D. Ullman: Equivalence of Relational Database Schemes. STOC 1979 : 319-329

Sam Toueg , Jeffrey D. Ullman: Deadlock-Free Packet Switching Networks. STOC 1979 : 89-98

Alfred V. Aho , Yehoshua Sagiv , Jeffrey D. Ullman: Equivalences Among Relational Expressions. SIAM J. Comput. 8 (2): 218-246 (1979)

Alfred V. Aho , Jeffrey D. Ullman: Optimal Partial-Match Retrieval When Fields Are Independently Specified. TODS 4 (2): 168-179 (1979)

Alfred V. Aho , Catriel Beeri , Jeffrey D. Ullman: The Theory of Joins in Relational Databases. TODS 4 (3): 297-314 (1979)

Alfred V. Aho , Yehoshua Sagiv , Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions. TODS 4 (4): 435-454 (1979)

Marc A. Kaplan , Jeffrey D. Ullman: A General Scheme for the Automatic Inference of Variable Types. POPL 1978 : 60-75

Alfred V. Aho , Yehoshua Sagiv , Jeffrey D. Ullman: Efficient Optimization of a Class of Relational Expressions (Abstract). SIGMOD Conference 1978 : 39

Alfred V. Aho , Catriel Beeri , Jeffrey D. Ullman: The Theory of Joins in Relational Data Bases (Extended Abstract). FOCS 1977 : 107-113

Alfred V. Aho , Stephen C. Johnson , Jeffrey D. Ullman: Code Generation for Machines with Multiregister Operations. POPL 1977 : 21-28

John B. Kam , Jeffrey D. Ullman: Monotone Data Flow Analysis Frameworks. Acta Informatica 7 : 305-317 (1977)

Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman: Operations on Sparse Relations. CACM 20 (3): 171-176 (1977)

Alfred V. Aho , Stephen C. Johnson , Jeffrey D. Ullman: Code Generation for Expressions with Common Subexpressions. JACM 24 (1): 146-160 (1977)

Amelia C. Fong , Jeffrey D. Ullman: Finding the Depth of a Flow Graph. JCSS 15 (3): 300-309 (1977)

Thomas G. Szymanski , Jeffrey D. Ullman: Evaluating Relational Expressions with Dense and Sparse Arguments. SIAM J. Comput. 6 (1): 109-122 (1977)

Matthew M. Geller , Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman: Economy of Description by Parsers, DPDA'S, and PDA'S. TCS 4 (2): 143-153 (1977)

John B. Kam , Jeffrey D. Ullman: A Model of Statistical Databases and Their Security. TODS 2 (1): 1-10 (1977)

Amelia C. Fong , Jeffrey D. Ullman: Induction Variables in Very High Level Languages. POPL 1976 : 104-112

Alfred V. Aho , Stephen C. Johnson , Jeffrey D. Ullman: Code Generation for Expressions with Common Subexpressions. POPL 1976 : 19-31

Amelia C. Fong , Jeffrey D. Ullman: Finding the Depth of a Flow Graph. STOC 1976 : 121-125

Michael A. Harrison , Walter L. Ruzzo , Jeffrey D. Ullman: Protection in Operating Systems. CACM 19 (8): 461-471 (1976)

Alfred V. Aho , Daniel S. Hirschberg , Jeffrey D. Ullman: Bounds on the Complexity of the Longest Common Subsequence Problem. JACM 23 (1): 1-12 (1976)

John B. Kam , Jeffrey D. Ullman: Global Data Flow Analysis and Iterative Algorithms. JACM 23 (1): 158-171 (1976)

Alfred V. Aho , Jeffrey D. Ullman: Node Listings for Reducible Flow Graphs. JCSS 13 (3): 286-299 (1976)

Alfred V. Aho , John E. Hopcroft , Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. SIAM J. Comput. 5 (1): 115-132 (1976)

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

Thomas G. Szymanski , Jeffrey D. Ullman: Evaluating Relational Expressions with Dense and Sparse Arguments. FOCS 1975 : 90-97

Amelia C. Fong , John B. Kam , Jeffrey D. Ullman: Application of Lattice Algebra to Loop Optimization. POPL 1975 : 1-9

Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman: On the Complexity of LR(k) Testing. POPL 1975 : 130-136

Alfred V. Aho , Jeffrey D. Ullman: Node Listings for Reducible Flow Graphs. STOC 1975 : 177-185

Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman: On the Complexity of LR(k) Testing. CACM 18 (12): 707-716 (1975)

Alfred V. Aho , Stephen C. Johnson , Jeffrey D. Ullman: Deterministic Parsing of Ambiguous Grammars. CACM 18 (8): 441-452 (1975)

Jeffrey D. Ullman: NP-Complete Scheduling Problems. JCSS 10 (3): 384-393 (1975)

Matthew S. Hecht , Jeffrey D. Ullman: A Simple Algorithm for Global Data Flow Analysis Problems. SIAM J. Comput. 4 (4): 519-532 (1975)

Alfred V. Aho , Kenneth Steiglitz , Jeffrey D. Ullman: Evaluating Polynomials at Fixed Sets of Points. SIAM J. Comput. 4 (4): 533-539 (1975)

Alfred V. Aho , Daniel S. Hirschberg , Jeffrey D. Ullman: Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract). FOCS 1974 : 104-109

Harry B. Hunt III , Thomas G. Szymanski , Jeffrey D. Ullman: Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract). FOCS 1974 : 127-132

Matthew S. Hecht , Jeffrey D. Ullman: Characterizations of Reducible Flow Graphs. JACM 21 (3): 367-375 (1974)

David S. Johnson , A. Demers , Jeffrey D. Ullman, M. R. Garey , R. L. Graham : Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms. SIAM J. Comput. 3 (4): 299-325 (1974)

Alfred V. Aho , Steven C. Johnson , Jeffrey D. Ullman: Deterministic Parsing of Ambiguous Grammars. POPL 1973 : 1-21

Matthew S. Hecht , Jeffrey D. Ullman: Analysis of a Simple Algorithm for Global Flow Problems. POPL 1973 : 207-217

Alfred V. Aho , John E. Hopcroft , Jeffrey D. Ullman: On Finding Lowest Common Ancestors in Trees. STOC 1973 : 253-265

Jeffrey D. Ullman: Fast Algorithms for the Elimination of Common Subexpressions. Acta Informatica 2 : 191-213 (1973)

Alexander Birman , Jeffrey D. Ullman: Parsing Algorithms with Backtrack. Information and Control 23 (1): 1-34 (1973)

Alfred V. Aho , Jeffrey D. Ullman: Error Detection in Precedence Parsers. Mathematical Systems Theory 7 (2): 97-113 (1973)

Alfred V. Aho , Jeffrey D. Ullman: A Technique for Speeding up LR(k) Parsers. SIAM J. Comput. 2 (2): 106-127 (1973)

John E. Hopcroft , Jeffrey D. Ullman: Set Merging Algorithms. SIAM J. Comput. 2 (4): 294-303 (1973)

Jeffrey D. Ullman: A Fast Algorithm for the Elimination of Common Subexpressions. FOCS 1972 : 161-176

M. R. Garey , R. L. Graham , Jeffrey D. Ullman: Worst-Case Analysis of Memory Allocation Algorithms. STOC 1972 : 143-150

Matthew S. Hecht , Jeffrey D. Ullman: Flow Graph Reducibility. STOC 1972 : 238-250

Alfred V. Aho , Jeffrey D. Ullman: A Technique for Speeding Up LR(k) Parsers. STOC 1972 : 251-263

Alfred V. Aho , Peter J. Denning , Jeffrey D. Ullman: Weak and Mixed Strategy Precedence Parsing. JACM 19 (2): 225-243 (1972)

Jeffrey D. Ullman: A Note on the Efficiency of Hashing Functions. JACM 19 (3): 569-575 (1972)

Alfred V. Aho , Jeffrey D. Ullman: Equivalence of Programs with Structured Variables. JCSS 6 (2): 125-137 (1972)

Alfred V. Aho , Jeffrey D. Ullman: Optimization of LR(k) Parsers. JCSS 6 (6): 573-602 (1972)

Alfred V. Aho , Jeffrey D. Ullman: Optimization of Straight Line Programs. SIAM J. Comput. 1 (1): 1-19 (1972)

Alfred V. Aho , M. R. Garey , Jeffrey D. Ullman: The Transitive Reduction of a Directed Graph. SIAM J. Comput. 1 (2): 131-137 (1972)

Matthew S. Hecht , Jeffrey D. Ullman: Flow Graph Reducibility. SIAM J. Comput. 1 (2): 188-202 (1972)

Alfred V. Aho , Jeffrey D. Ullman: The Care and Feeding of LR(k) Grammars. STOC 1971 : 159-170

Alfred V. Aho , Jeffrey D. Ullman: Translations on a Context-Free Grammar. Information and Control 19 (5): 439-475 (1971)

Alfred V. Aho , Peter J. Denning , Jeffrey D. Ullman: Principles of Optimal Page Replacement. JACM 18 (1): 80-93 (1971)

Alfred V. Aho , Jeffrey D. Ullman: Characterizations and Wxtensions of Pushdown Translations. Mathematical Systems Theory 5 (2): 172-192 (1971)

Alexander Birman , Jeffrey D. Ullman: Parsing Algorithms with Backtrack. FOCS 1970 : 153-174

Alfred V. Aho , Jeffrey D. Ullman: Equivalence of Programs with Structured Variables. FOCS 1970 : 25-31

Alfred V. Aho , Jeffrey D. Ullman: Transformations on Straight Line Programs-Preliminary Version. STOC 1970 : 136-148

Ravi Sethi , Jeffrey D. Ullman: The Generation of Optimal Code for Arithmetic Expressions. JACM 17 (4): 715-728 (1970)

Alfred V. Aho , Jeffrey D. Ullman, John E. Hopcroft : On the Computational Power of Pushdown Automata. JCSS 4 (2): 129-136 (1970)

Alfred V. Aho , Jeffrey D. Ullman: A Characterization of Two-Way Deterministic Classes of Languages. JCSS 4 (6): 523-538 (1970)

Alfred V. Aho , Jeffrey D. Ullman: A Characterization of Two-Way Deterministic Classes of Languages. FOCS 1969 : 231-239

Alfred V. Aho , Jeffrey D. Ullman: Translations on a Context Free Grammar. STOC 1969 : 93-112

John E. Hopcroft , Jeffrey D. Ullman: Some Results on Tape-Bounded Turing Machines. JACM 16 (1): 168-177 (1969)

Jeffrey D. Ullman: Halting Stack Automata. JACM 16 (4): 550-563 (1969)

Alfred V. Aho , Jeffrey D. Ullman: Syntax Directed Translations and the Pushdown Assembler. JCSS 3 (1): 37-56 (1969)

Alfred V. Aho , Jeffrey D. Ullman: Properties of Syntax Directed Translations. JCSS 3 (3): 319-334 (1969)

Alfred V. Aho , John E. Hopcroft , Jeffrey D. Ullman: A General Theory of Translation. Mathematical Systems Theory 3 (3): 193-221 (1969)

Alfred V. Aho , Jeffrey D. Ullman: Automaton Analogs of Syntax Directed Translation Schemata. FOCS 1968 : 143-159

Jeffrey D. Ullman, Peter Weiner : Universal Two State Machines: Characterization Theorems and Decomposition Schemes. FOCS 1968 : 413-426

John E. Hopcroft , Jeffrey D. Ullman: Sets Accepted by One-Way Stack Automata Are Context Sensitive. Information and Control 13 (2): 114-133 (1968)

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)

John E. Hopcroft , Jeffrey D. Ullman: Decidable and Undecidable Questions About Automata. JACM 15 (2): 317-324 (1968)

John E. Hopcroft , Jeffrey D. Ullman: Relations Between Time and Tape Complexities. JACM 15 (3): 414-427 (1968)

John E. Hopcroft , Jeffrey D. Ullman: Deterministic Stack Automata and the Quotient Operator. JCSS 2 (1): 1-12 (1968)

Alfred V. Aho , Jeffrey D. Ullman: The Theory of Languages. Mathematical Systems Theory 2 (2): 97-125 (1968)

John E. Hopcroft , Jeffrey D. Ullman: An Approach to a Unified Theory of Automata. FOCS 1967 : 140-147

John E. Hopcroft , Jeffrey D. Ullman: Two Results on One-Way Stack Automata. FOCS 1967 : 37-44

John E. Hopcroft , Jeffrey D. Ullman: Nonerasing Stack Automata. JCSS 1 (2): 166-186 (1967)

DBLP: Copyright ©1999 by Michael Ley (ley@uni-trier.de).