Jeffrey D. Ullman

According to our database1, Jeffrey D. Ullman
  • authored at least 309 papers between 1965 and 2017.
  • has a "Dijkstra number"2 of three.

Awards

ACM Fellow

ACM Fellow 1995, "For seminal contributions to the foundations of computer science, compiler design, database systems, as well as outstanding contributions to computer science education.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2017
GYM: A Multiround Distributed Join Algorithm.
Proceedings of the 20th International Conference on Database Theory, 2017

2016
Assignment Problems of Different-Sized Inputs in MapReduce.
TKDD, 2016

Some Pairs Problems.
CoRR, 2016

Efficient and Private Approximations of Distributed Databases Calculations.
CoRR, 2016

Some pairs problems.
Proceedings of the 3rd ACM SIGMOD Workshop on Algorithms and Systems for MapReduce and Beyond, 2016


Panel: The State of Data: Invited Paper from panelists.
Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

Computing Marginals Using MapReduce: Keynote talk paper.
Proceedings of the 20th International Database Engineering & Applications Symposium, 2016

Portrait of an Indexer - Computing Pointers Into Instructional Videos.
Proceedings of the 9th International Conference on Educational Data Mining, 2016

Concise essence-preserving big data representation.
Proceedings of the 2016 IEEE International Conference on Big Data, 2016

2015
Parallel Skyline Queries.
Theory Comput. Syst., 2015

Handling Skew in Multiway Joins in Parallel Processing.
CoRR, 2015

SharesSkew: An Algorithm to Handle Skew for Joins in MapReduce.
CoRR, 2015

Assignment Problems of Different-Sized Inputs in MapReduce.
CoRR, 2015

Assignment of Different-Sized Inputs in MapReduce.
CoRR, 2015

Meta-MapReduce: A Technique for Reducing Communication in MapReduce Computations.
CoRR, 2015

Computing Marginals Using MapReduce.
CoRR, 2015

Experiments as research validation: have we gone too far?
Commun. ACM, 2015

Assignment of Different-Sized Inputs in MapReduce.
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), 2015

Bounds for Overlapping Interval Join on MapReduce.
Proceedings of the Workshops of the EDBT/ICDT 2015 Joint Conference (EDBT/ICDT), 2015

MapReduce Algorithms.
Proceedings of the Companion Volume to the Proceedings of the 2nd IKDD Conference on Data Sciences, 2015

2014
Storing and Querying Tree-Structured Records in Dremel.
PVLDB, 2014

GYM: A Multiround Join Algorithm In MapReduce.
CoRR, 2014

Assignment of Different-Sized Inputs in MapReduce.
Proceedings of the Distributed Computing - 28th International Symposium, 2014

Anchor-Points Algorithms for Hamming and Edit Distances Using MapReduce.
Proceedings of the Proc. 17th International Conference on Database Theory (ICDT), 2014

Mining of Massive Datasets, 2nd Ed.
Cambridge University Press, ISBN: 978-1107077232, 2014

2013
Upper and Lower Bounds on the Cost of a Map-Reduce Computation.
PVLDB, 2013

Big data: a research agenda.
Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

Matching bounds for the all-pairs MapReduce problem.
Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

Enumerating subgraph instances using map-reduce.
Proceedings of the 29th IEEE International Conference on Data Engineering, 2013

2012
Designing good MapReduce algorithms.
ACM Crossroads, 2012

Enumerating Subgraph Instances Using Map-Reduce
CoRR, 2012

Upper and Lower Bounds on the Cost of a Map-Reduce Computation
CoRR, 2012

Vision Paper: Towards an Understanding of the Limits of Map-Reduce Computation
CoRR, 2012

Parallel skyline queries.
Proceedings of the 15th International Conference on Database Theory, 2012

Fuzzy Joins Using MapReduce.
Proceedings of the IEEE 28th International Conference on Data Engineering (ICDE 2012), 2012

Transitive closure and recursive Datalog implemented on clusters.
Proceedings of the 15th International Conference on Extending Database Technology, 2012

Designing good algorithms for MapReduce and beyond.
Proceedings of the ACM Symposium on Cloud Computing, SOCC '12, 2012

2011
Optimizing Multiway Joins in a Map-Reduce Environment.
IEEE Trans. Knowl. Data Eng., 2011

Map-reduce extensions and recursive queries.
Proceedings of the EDBT 2011, 2011

2010
Foundations of Uncertain-Data Integration.
PVLDB, 2010

Optimizing joins in a map-reduce environment.
Proceedings of the EDBT 2010, 2010

Cluster Computing, Recursion and Datalog.
Proceedings of the Datalog Reloaded - First International Workshop, 2010

Evaluating, combining and generalizing recommendations with prerequisites.
Proceedings of the 19th ACM Conference on Information and Knowledge Management, 2010

2009
Viewpoint - Advising students for success.
Commun. ACM, 2009

Schema Design for Uncertain Databases.
Proceedings of the 3rd Alberto Mendelzon International Workshop on Foundations of Data Management, 2009

Database systems - the complete book (2. ed.).
Pearson Education, ISBN: 978-0-13-187325-4, 2009

2007
Using views to generate efficient evaluation plans for queries.
J. Comput. Syst. Sci., 2007

2005
In memory of Seymour Ginsburg 1928 - 2004.
SIGMOD Record, 2005

The Lowell database research self-assessment.
Commun. ACM, 2005

Gradiance On-Line Accelerated Learning.
Proceedings of the Computer Science 2005, 2005

2003
Querying websites using compact skeletons.
J. Comput. Syst. Sci., 2003

The Lowell Database Research Self Assessment
CoRR, 2003

Improving the Efficiency of Database-System Teaching.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

The Lowell Report.
Proceedings of the 2003 ACM SIGMOD International Conference on Management of Data, 2003

A Survey of New Directions in Database System.
Proceedings of the Eighth International Conference on Database Systems for Advanced Applications (DASFAA '03), 2003

Introduction to automata theory, languages, and computation - international edition (2. ed).
Addison-Wesley, ISBN: 978-0-321-21029-6, 2003

2002
A first course in database systems (2. ed.).
Prentice Hall, ISBN: 978-0-13-035300-9, 2002

Database systems - the complete book (international edition).
Pearson Education, ISBN: 978-0-13-098043-4, 2002

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.).
Pearson Studium, ISBN: 978-3-8273-7020-4, 2002

2001
Finding Interesting Associations without Support Pruning.
IEEE Trans. Knowl. Data Eng., 2001

Introduction to automata theory, languages, and computation, 2nd edition.
SIGACT News, 2001

Generating Efficient Plans for Queries Using Views.
Proceedings of the 2001 ACM SIGMOD international conference on Management of data, 2001

Querying Websites Using Compact Skeletons.
Proceedings of the Twentieth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 2001

Minimizing View Sets without Losing Query-Answering Power.
Proceedings of the Database Theory, 2001

Introduction to automata theory, languages, and computation - (2. ed.).
Addison-Wesley series in computer science, Addison-Wesley-Longman, ISBN: 978-0-201-44124-6, 2001

2000
Information integration using logical views.
Theor. Comput. Sci., 2000

Scalable Techniques for Mining Causal Structures.
Data Min. Knowl. Discov., 2000

Dynamic Miss-Counting Algorithms: Finding Implication and Similarity Rules with Confidence Pruning.
Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28, 2000

Finding Interesting Associations without Support Pruning.
Proceedings of the 16th International Conference on Data Engineering, San Diego, California, USA, February 28, 2000

A Survey of Association-Rule Mining.
Proceedings of the Discovery Science, 2000

Database System Implementation
Prentice-Hall, ISBN: 0-13-040264-8, 2000

Introduction to Automata Theory, Languages and Computation, Second Edition
Addison-Wesley, 2000

1999
Answering Queries Using Limited External Query Processors.
J. Comput. Syst. Sci., 1999

Computing Capabilities of Mediators.
Proceedings of the SIGMOD 1999, 1999

Some Advances in Data-Mining Techniques (Abstract).
Proceedings of the Next Generation Information Technologies and Systems, 1999

The MIDAS Data-Mining Project at Stanford.
Proceedings of the 1999 International Database Engineering and Applications Symposium, 1999

Optimizing Large Join Queries in Mediation Systems.
Proceedings of the Database Theory, 1999

1998
Reminiscences on Influential Papers.
SIGMOD Record, 1998

The Asilomar Report on Database Research.
SIGMOD Record, 1998

The Asilomar Report on Database Research
CoRR, 1998

Scalable Techniques for Mining Causal Structures.
Proceedings of the VLDB'98, 1998

Computing Iceberg Queries Efficiently.
Proceedings of the VLDB'98, 1998

Query Flocks: A Generalization of Association-Rule Mining.
Proceedings of the SIGMOD 1998, 1998

Capability Based Mediation in TSIMMIS.
Proceedings of the SIGMOD 1998, 1998

Elements of ML programming - ML 97 edition.
Prentice Hall, ISBN: 978-0-13-790387-0, 1998

1997
Mediator Languages - a Proposal for a Standard.
SIGMOD Record, 1997

Querying Semistructured Heterogeneous Information.
Journal of Systems Integration, 1997

The TSIMMIS Approach to Mediation: Data Models and Languages.
J. Intell. Inf. Syst., 1997

Dynamic Itemset Counting and Implication Rules for Market Basket Data.
Proceedings of the SIGMOD 1997, 1997

Information Integration Using Logical Views.
Proceedings of the Database Theory, 1997

Representative Objects: Concise Representations of Semistructured, Hierarchial Data.
Proceedings of the Thirteenth International Conference on Data Engineering, 1997

Index Selection for OLAP.
Proceedings of the Thirteenth International Conference on Data Engineering, 1997

A First Course in Database Systems.
Prentice-Hall, ISBN: 0-13-861337-0, 1997

1996
Database Research: Achievements and Opportunities Into the 21st Century.
SIGMOD Record, 1996

Moving Database Theory into Database Practice.
ACM Comput. Surv., 1996

LORE: A Lightweight Object REpository for Semistructured Data.
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

Implementing Data Cubes Efficiently.
Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data, 1996

The TSIMMIS Database Integration Project.
Proceedings of the Atti del Quarto Convegno Nazionale su Sistemi Evoluti per Basi di Dati (4th National Conference on Advanced Database Systems), 1996

Integrating Information by Outerjoins and Full Disjunctions.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

Answering Queries Using Limited External Processors.
Proceedings of the Fifteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1996

Deductive Databases: Challenges, Opportunities and Future Directions (Panel Discussion).
Proceedings of the Logic in Databases, 1996

Efficient Implementation of Data Cubes Via Materialized Views.
Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96), 1996

MedMaker: A Mediation System Based on Declarative Specifications.
Proceedings of the Twelfth International Conference on Data Engineering, February 26, 1996

The Database Approach to Knowledge Represention.
Proceedings of the Thirteenth National Conference on Artificial Intelligence and Eighth Innovative Applications of Artificial Intelligence Conference, 1996

Informatik - Datenstrukturen und Konzepte der Abstraktion.
Informatik Lehrbuchreihe, International Thomson, ISBN: 978-3-8266-0242-9, 1996

1995
Argument Reduction by Factoring.
Theor. Comput. Sci., 1995

A survey of deductive database systems.
J. Log. Program., 1995

The Role of Theory Today.
ACM Comput. Surv., 1995

Information Translation, Mediation, and Mosaic-Based Browsing in the TSIMMIS System.
Proceedings of the 1995 ACM SIGMOD International Conference on Management of Data, 1995

Answering Queries Using Templates with Binding Patterns.
Proceedings of the Fourteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1995

The TSIMMIS Approach to Mediation: Data Models and Languages.
Proceedings of the Next Generation Information Technologies and Systems (NGITS '95), 1995

A Version Numbering Scheme with a Useful Lexicographical Order.
Proceedings of the Eleventh International Conference on Data Engineering, 1995

Querying Semistructured Heterogeneous Information.
Proceedings of the Deductive and Object-Oriented Databases, 1995

A Query Translation Scheme for Rapid Implementation of Wrappers.
Proceedings of the Deductive and Object-Oriented Databases, 1995

1994
Efficient and Complete Tests for Database Integrity Constraint Checking.
Proceedings of the Principles and Practice of Constraint Programming, 1994

Constraint Checking with Partial Information.
Proceedings of the Thirteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1994

The TSIMMIS Project: Integration of Heterogeneous Information Sources.
IPSJ, 1994

Validating Constraints with Partial Information: Research Overview.
DAISD, 1994

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (3. Aufl.).
Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-89319-744-6, 1994

Elements of ML programming.
Prentice Hall, ISBN: 978-0-13-288788-5, 1994

1993
Logical Query Optimization by Proff-Tree Transformation.
J. Comput. Syst. Sci., 1993

1992
New Frontiers in Database System Research.
Proceedings of the Future Tendencies in Computer Science, 1992

Generalizing Conjunctive Query Containment for View Maintenance and Integrity Constraint Verification (Abstract).
Proceedings of the Workshop on Deductive Databases held in conjunction with the Joint International Conference and Symposium on Logic Programming, 1992

The Interface Between Language Theory and Database Theory.
Proceedings of the Theoretical Studies in Computer Science, 1992

Foundations of Computer Science, C Edition
Computer Science Press / W. H. Freeman, 1992

1991
High-Probability Parallel Transitive-Closure Algorithms.
SIAM J. Comput., 1991

Database Systems: Achievements and Opportunities.
Commun. ACM, 1991

The Input/Output Complexity of Transitive Closure.
Ann. Math. Artif. Intell., 1991

A Comparison between Deductive and Object-Oriented Database Systems.
DOOD, 1991

1990
Deductive Databases: Achievements and Future Directions.
SIGMOD Record, 1990

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, 1990

Selected Database Research at Stanford.
SIGMOD Record, 1990

High-Probability Parallel Transitive Closure Algorithms.
SPAA, 1990

The Input/Output Complexity of Transitive Closure.
Proceedings of the 1990 ACM SIGMOD International Conference on Management of Data, 1990

Einführung in die Automatentheorie, formale Sprachen und Komplexitätstheorie (2. Aufl.).
Internationale Computer-Bibliothek, Addison-Wesley, ISBN: 978-3-89319-181-9, 1990

1989
An Optimal Synchronizer for the Hypercube.
SIAM J. Comput., 1989

On the Convergence of Query Evaluation.
J. Comput. Syst. Sci., 1989

Argument Reduction by Factoring.
Proceedings of the Fifteenth International Conference on Very Large Data Bases, 1989

Efficient Evaluation of Right-, Left-, and Mult-Lineare Rules.
Proceedings of the 1989 ACM SIGMOD International Conference on Management of Data, Portland, Oregon, May 31, 1989

Bottom-Up Beats Top-Down for Datalog.
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

Proof-Tree Transformation Theorems and Their Applications.
Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1989

Principles of Database and Knowledge-Base Systems, Volume II
Computer Science Press, ISBN: 0-7167-8162-X, 1989

1988
Efficient tests for top-down termination of logical rules.
J. ACM, 1988

Parallel Complexity of Logical Query Programs.
Algorithmica, 1988

The Complexity of Ordering Subgoals.
Proceedings of the Seventh ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1988

Principles of Database and Knowledge-Base Systems, Volume I
Principles of computer science series 14, Computer Science Press, ISBN: 0-7167-8158-1, 1988

1987
A Communication-Time Tradeoff.
SIAM J. Comput., 1987

YAWN! (Yet Another Window on NAIL!).
IEEE Data Eng. Bull., 1987

Algorithms for the Compilation of Regular Expressions into PLAs.
Algorithmica, 1987

Database Theory: Past and Future.
Proceedings of the Sixth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, 1987

An Optimal Synchronizer for the Hypercube.
Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, 1987

1986
Updating Logical Databases.
Advances in Computing Research, 1986

Magic Sets and Other Strange Ways to Implement Logic Programs.
Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

Convergence of Sideways Query Evaluation.
Proceedings of the Fifth ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1986

Design Overview of the NAIL! System.
Proceedings of the Third International Conference on Logic Programming, 1986

Parallel Complexity of Logical Query Programs
Proceedings of the 27th Annual Symposium on Foundations of Computer Science, 1986

Compilers: Principles, Techniques, and Tools.
Addison-Wesley series in computer science / World student series edition, Addison-Wesley, ISBN: 0201101947, 1986

1985
Implementation of Logical Query Languages for Databases.
ACM Trans. Database Syst., 1985

Implementation of Logical Query Languages for Databases (Abstract).
Proceedings of the 1985 ACM SIGMOD International Conference on Management of Data, 1985

An Approach To Processing Queries In A Logic-Based Query Language.
On Knowledge Base Management Systems (Islamorada), 1985

Logic and Database Systems.
On Knowledge Base Management Systems (Islamorada), 1985

1984
On the Foundations of the Universal Relation Model.
ACM Trans. Database Syst., 1984

System/U: A Database System Based on the Universal Relation Assumption.
ACM Trans. Database Syst., 1984

Connections in Acyclic Hypergraphs.
Theor. Comput. Sci., 1984

Flux, Sorting, and Supercomputer Organization for AI Applications.
J. Parallel Distrib. Comput., 1984

Correcting Faults in Write-Once Memory
Proceedings of the 16th Annual ACM Symposium on Theory of Computing, April 30, 1984

On Complementary and Independent Mappings on Databases.
Proceedings of the SIGMOD'84, 1984

On the Equivalence of Logical Databases.
Proceedings of the Third ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1984

A Communication-Time Tradeoff
Proceedings of the 25th Annual Symposium on Foundations of Computer Science, 1984

Some Thoughts About Supercomputer Organization.
Proceedings of the COMPCON'84, Digest of Papers, Twenty-Eighth IEEE Computer Society International Conference, San Francisco, California, USA, February 27, 1984

1983
On Kent's "Consequences of Assuming a Universal Relation".
ACM Trans. Database Syst., 1983

Corrigendum: The Theory of Joins in Relational Databases.
ACM Trans. Database Syst., 1983

Maximal Objects and the Semantics of Universal Relation Databases.
ACM Trans. Database Syst., 1983

Tools for Template Dependencies.
SIAM J. Comput., 1983

On Notions of Information Transfer in VLSI Circuits
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, 1983

Fragments of Relations.
Proceedings of the SIGMOD'83, 1983

The Revenge of the JD.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

On the Semantics of Updates in Databases.
Proceedings of the Second ACM SIGACT-SIGMOD Symposium on Principles of Database Systems, 1983

Universal Relation Interfaces for Database Systems.
IFIP Congress, 1983

Data Structures and Algorithms.
Addison-Wesley, ISBN: 0-201-00023-7, 1983

1982
A Simplified Universal Relation Assumption and Its Properties.
ACM Trans. Database Syst., 1982

The Theory of Functional and Template Dependencies.
Theor. Comput. Sci., 1982

Template Dependencies: A Large Class of Dependencies in Relational Databases and Its Complete Axiomatization.
J. ACM, 1982

The Compilation of Regular Expressions into Integrated Circuits.
J. ACM, 1982

Query Processing in Universal Relation Systems.
IEEE Database Eng. Bull., 1982

The U. R. Strikes Back.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

Connections in Acyclic Hypergraphs.
Proceedings of the ACM Symposium on Principles of Database Systems, 1982

A Regular Expression Compiler.
Proceedings of the COMPCON'82, 1982

Principles of Database Systems, 2nd Edition
Computer Science Press, ISBN: 0-914894-36-6, 1982

1981
Deadlock-Free Packet Switching Networks.
SIAM J. Comput., 1981

Equivalence of Relational Database Schemes.
SIAM J. Comput., 1981

Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions.
SIAM J. Comput., 1981

Fragments of Relations: First Hack.
Proceedings of the XP2 Workshop on Relational Database Theory, 1981

Connections in Acyclic Hypergraphs.
Proceedings of the XP2 Workshop on Relational Database Theory, 1981

Optimal Wiring between Rectangles
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

Properties of Acyclic Database Schemes
Proceedings of the 13th Annual ACM Symposium on Theory of Computing, 1981

A View of Directions in Relational Database Theory.
Proceedings of the Automata, 1981

1980
Adequacy of Decompositions of Relational Databases.
J. Comput. Syst. Sci., 1980

A Scheme for the Automatic Inference of Variable Types.
J. ACM, 1980

Universal Instances.
Proceedings of the XP1 Workshop on Relational Database Theory, 30 June, 1980

System/U: A Database System Based on the Universal Relation Assumption.
Proceedings of the XP1 Workshop on Relational Database Theory, 30 June, 1980

A Complete Axiomatization for a Large Class of Dependencies in Relational Databases
Proceedings of the 12th Annual ACM Symposium on Theory of Computing, 1980

The Interaction between Functional Dependencies and Template Dependencies.
Proceedings of the 1980 ACM SIGMOD International Conference on Management of Data, 1980

The Compilation of Regular Expressions into Integrated Circuits (Extended Abstract)
Proceedings of the 21st Annual Symposium on Foundations of Computer Science, 1980

Principles of Database Systems, 1st Edition
Computer Science Press, 1980

1979
Optimal Partial-Match Retrieval When Fields Are Independently Specified.
ACM Trans. Database Syst., 1979

Efficient Optimization of a Class of Relational Expressions.
ACM Trans. Database Syst., 1979

The Theory of Joins in Relational Databases.
ACM Trans. Database Syst., 1979

Equivalences Among Relational Expressions.
SIAM J. Comput., 1979

Deadlock-Free Packet Switching Networks
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

Equivalence of Relational Database Schemes
Proceedings of the 11h Annual ACM Symposium on Theory of Computing, April 30, 1979

The Universality of Data Retrieval Languages.
Proceedings of the Conference Record of the Sixth Annual ACM Symposium on Principles of Programming Languages, 1979

Modeling Communications Protocols by Automata
Proceedings of the 20th Annual Symposium on Foundations of Computer Science, 1979

Adequacy of Decompositions of Relational Databases.
Proceedings of the Advances in Data Base Theory, 1979

Introduction to Automata Theory, Languages and Computation.
Addison-Wesley, ISBN: 0-201-02988-X, 1979

1978
Efficient Optimization of a Class of Relational Expressions (Abstract).
Proceedings of the 1978 ACM SIGMOD International Conference on Management of Data, Austin, Texas, May 31, 1978

A General Scheme for the Automatic Inference of Variable Types.
Proceedings of the Conference Record of the Fifth Annual ACM Symposium on Principles of Programming Languages, 1978

Crossfertilization Of DBMS Research With Other Disciplines Of Computer Science (Panel Discussion).
Proceedings of the Proceedings 1978 ACM Annual Conference, 1978

1977
A Model of Statistical Databases and Their Security.
ACM Trans. Database Syst., 1977

Economy of Description by Parsers, DPDA'S, and PDA'S.
Theor. Comput. Sci., 1977

Evaluating Relational Expressions with Dense and Sparse Arguments.
SIAM J. Comput., 1977

Finding the Depth of a Flow Graph.
J. Comput. Syst. Sci., 1977

Code Generation for Expressions with Common Subexpressions.
J. ACM, 1977

Operations on Sparse Relations.
Commun. ACM, 1977

Monotone Data Flow Analysis Frameworks.
Acta Inf., 1977

Code Generation for Machines with Multiregister Operations.
Proceedings of the Conference Record of the Fourth ACM Symposium on Principles of Programming Languages, 1977

The Theory of Joins in Relational Data Bases (Extended Abstract)
Proceedings of the 18th Annual Symposium on Foundations of Computer Science, Providence, Rhode Island, USA, 31 October, 1977

1976
On Finding Lowest Common Ancestors in Trees.
SIAM J. Comput., 1976

Node Listings for Reducible Flow Graphs.
J. Comput. Syst. Sci., 1976

Global Data Flow Analysis and Iterative Algorithms.
J. ACM, 1976

Bounds on the Complexity of the Longest Common Subsequence Problem.
J. ACM, 1976

Protection in Operating Systems.
Commun. ACM, 1976

Finding the Depth of a Flow Graph
Proceedings of the 8th Annual ACM Symposium on Theory of Computing, 1976

Induction Variables in Very High Level Languages.
Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

Code Generation for Expressions with Common Subexpressions.
Proceedings of the Conference Record of the Third ACM Symposium on Principles of Programming Languages, 1976

1975
A Simple Algorithm for Global Data Flow Analysis Problems.
SIAM J. Comput., 1975

Evaluating Polynomials at Fixed Sets of Points.
SIAM J. Comput., 1975

NP-Complete Scheduling Problems.
J. Comput. Syst. Sci., 1975

On the Complexity of LR(k) Testing.
Commun. ACM, 1975

Deterministic Parsing of Ambiguous Grammars.
Commun. ACM, 1975

Node Listings for Reducible Flow Graphs
Proceedings of the 7th Annual ACM Symposium on Theory of Computing, 1975

On Protection in Operating System.
Proceedings of the Fifth Symposium on Operating System Principles, 1975

On the Complexity of LR(k) Testing.
Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975

Application of Lattice Algebra to Loop Optimization.
Proceedings of the Conference Record of the Second ACM Symposium on Principles of Programming Languages, 1975

Evaluating Relational Expressions with Dense and Sparse Arguments
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

Economy of Descriptions by Parsers, DPDA's, and PDA's
Proceedings of the 16th Annual Symposium on Foundations of Computer Science, 1975

1974
Dynamic Memories with Rapid Random and Sequential Access.
IEEE Trans. Computers, 1974

Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms.
SIAM J. Comput., 1974

Characterizations of Reducible Flow Graphs.
J. ACM, 1974

Operations on Sparse Relations and Efficient Algorithms for Grammar Problems (Extended Abstract)
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

Bounds on the Complexity of the Longest Common Subsequence Problem (Extended Abstract)
Proceedings of the 15th Annual Symposium on Switching and Automata Theory, 1974

The Design and Analysis of Computer Algorithms.
Addison-Wesley, ISBN: 0-201-00029-6, 1974

1973
Parsing Algorithms with Backtrack
Information and Control, August, 1973

Set Merging Algorithms.
SIAM J. Comput., 1973

A Technique for Speeding up LR(k) Parsers.
SIAM J. Comput., 1973

Error Detection in Precedence Parsers.
Mathematical Systems Theory, 1973

Fast Algorithms for the Elimination of Common Subexpressions
Acta Inf., 1973

On Finding Lowest Common Ancestors in Trees
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, April 30, 1973

Polynomial Complete Scheduling Problems.
Proceedings of the Fourth Symposium on Operating System Principles, 1973

Analysis of a Simple Algorithm for Global Flow Problems.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

Deterministic Parsing of Ambiguous Grammars.
Proceedings of the Conference Record of the ACM Symposium on Principles of Programming Languages, 1973

The theory of parsing, translation, and compiling. 2: Compiling.
Prentice-Hall, ISBN: 0139145648, 1973

1972
Flow Graph Reducibility.
SIAM J. Comput., 1972

Optimization of Straight Line Programs.
SIAM J. Comput., 1972

The Transitive Reduction of a Directed Graph.
SIAM J. Comput., 1972

Optimization of LR(k) Parsers.
J. Comput. Syst. Sci., 1972

Equivalence of Programs with Structured Variables.
J. Comput. Syst. Sci., 1972

A Note on the Efficiency of Hashing Functions.
J. ACM, 1972

Weak and Mixed Strategy Precedence Parsing.
J. ACM, 1972

Flow Graph Reducibility
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

Worst-Case Analysis of Memory Allocation Algorithms
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

A Technique for Speeding Up LR(k) Parsers
Proceedings of the 4th Annual ACM Symposium on Theory of Computing, 1972

A Fast Algorithm for the Elimination of Common Subexpressions
Proceedings of the 13th Annual Symposium on Switching and Automata Theory, 1972

Applications of language theory to compiler design.
Proceedings of the American Federation of Information Processing Societies: AFIPS Conference Proceedings: 1972 Spring Joint Computer Conference, 1972

The theory of parsing, translation, and compiling. 1: Parsing
Prentice-Hall, ISBN: 0139145567, 1972

1971
Translations on a Context-Free Grammar
Information and Control, December, 1971

Characterizations and Extensions of Pushdown Translations.
Mathematical Systems Theory, 1971

Principles of Optimal Page Replacement.
J. ACM, 1971

The Care and Feeding of LR(k) Grammars
Proceedings of the 3rd Annual ACM Symposium on Theory of Computing, 1971

1970
On the Computational Power of Pushdown Automata.
J. Comput. Syst. Sci., 1970

A Characterization of Two-Way Deterministic Classes of Languages.
J. Comput. Syst. Sci., 1970

The Generation of Optimal Code for Arithmetic Expressions.
J. ACM, 1970

Transformations on Straight Line Programs-Preliminary Version
Proceedings of the 2nd Annual ACM Symposium on Theory of Computing, 1970

Parsing Algorithms with Backtrack
Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970

Equivalence of Programs with Structured Variables
Proceedings of the 11th Annual Symposium on Switching and Automata Theory, 1970

1969
Universal Single Transition Time Asynchronous State Assignments.
IEEE Trans. Computers, 1969

A General Theory of Translation.
Mathematical Systems Theory, 1969

Properties of Syntax Directed Translations.
J. Comput. Syst. Sci., 1969

Syntax Directed Translations and the Pushdown Assembler.
J. Comput. Syst. Sci., 1969

Halting Stack Automata.
J. ACM, 1969

Some Results on Tape-Bounded Turing Machines.
J. ACM, 1969

Translations on a Context Free Grammar
Proceedings of the 1st Annual ACM Symposium on Theory of Computing, 1969

A Characterization of Two-Way Deterministic Classes of Languages
Proceedings of the 10th Annual Symposium on Switching and Automata Theory, 1969

Formal languages and their relation to automata.
Addison-Wesley series in computer science and information processing, Addison-Wesley, ISBN: 0201029839, 1969

1968
Time and Tape Complexity of Pushdown Automaton Languages
Information and Control, September, 1968

Sets Accepted by One-Way Stack Automata Are Context Sensitive
Information and Control, August, 1968

The Theory of Languages.
Mathematical Systems Theory, 1968

Deterministic Stack Automata and the Quotient Operator.
J. Comput. Syst. Sci., 1968

Relations Between Time and Tape Complexities.
J. ACM, 1968

Decidable and Undecidable Questions About Automata.
J. ACM, 1968

Universal Two State Machines: Characterization Theorems and Decomposition Schemes
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

Automaton Analogs of Syntax Directed Translation Schemata
Proceedings of the 9th Annual Symposium on Switching and Automata Theory, 1968

1967
On the capabilities of codes to correct synchronization errors.
IEEE Trans. Information Theory, 1967

Nonerasing Stack Automata.
J. Comput. Syst. Sci., 1967

An Approach to a Unified Theory of Automata
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

Two Results on One-Way Stack Automata
Proceedings of the 8th Annual Symposium on Switching and Automata Theory, 1967

1966
Near-optimal, single-synchronization-error-correcting code.
IEEE Trans. Information Theory, 1966

1965
Decoding of Cyclic Codes Using Position Invariant Functions.
IBM Journal of Research and Development, 1965


  Loading...