| Publication | Date of Publication | Type |
|---|
| GYM: A Multiround Distributed Join Algorithm | 2018-07-18 | Paper |
| Computing marginals using MapReduce | 2018-04-18 | Paper |
| Parallel skyline queries | 2016-04-18 | Paper |
| Translations on a context free grammar | 2014-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3525697 | 2008-09-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5452362 | 2008-03-26 | Paper |
| Querying websites using compact skeletons. | 2003-08-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4506483 | 2000-10-17 | Paper |
| Information integration using logical views | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4763621 | 2000-07-06 | Paper |
| Answering queries using limited external query processors | 1999-09-22 | Paper |
| The input/output complexity of transitive closure | 1997-10-26 | Paper |
| The deevolution of concurrent logic programming languages | 1997-03-17 | Paper |
| Argument reduction by factoring | 1997-02-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4851834 | 1995-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4317191 | 1994-12-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4293532 | 1994-05-29 | Paper |
| Logical query optimization by proof-tree transformation | 1993-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035345 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995058 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3995059 | 1993-01-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4023826 | 1993-01-23 | Paper |
| High-Probability Parallel Transitive-Closure Algorithms | 1991-01-01 | Paper |
| On the convergence of query evaluation | 1989-01-01 | Paper |
| An Optimal Synchronizer for the Hypercube | 1989-01-01 | Paper |
| Parallel complexity of logical query programs | 1988-01-01 | Paper |
| Algorithms for the compilation of regular expressions into PLAs | 1987-01-01 | Paper |
| A Communication-Time Tradeoff | 1987-01-01 | Paper |
| Implementation of logical query languages for databases | 1985-01-01 | Paper |
| Connections in acyclic hypergraphs | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326832 | 1984-01-01 | Paper |
| On the foundations of the universal relation model | 1984-01-01 | Paper |
| Maximal objects and the semantics of universal relation databases | 1983-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3948568 | 1983-01-01 | Paper |
| Tools for Template Dependencies | 1983-01-01 | Paper |
| The theory of functional and template dependencies | 1982-01-01 | Paper |
| Bounds on the size and transmission rate of communications protocols | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3347338 | 1982-01-01 | Paper |
| The Compilation of Regular Expressions into Integrated Circuits | 1982-01-01 | Paper |
| Template Dependencies | 1982-01-01 | Paper |
| A simplied universal relation assumption and its properties | 1982-01-01 | Paper |
| Deadlock-Free Packet Switching Networks | 1981-01-01 | Paper |
| Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3912083 | 1981-01-01 | Paper |
| Equivalence of Relational Database Schemes | 1981-01-01 | Paper |
| Adequacy of decompositions of relational databases | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3206351 | 1980-01-01 | Paper |
| A Scheme for the Automatic Inference of Variable Types | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3664434 | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3862379 | 1979-01-01 | Paper |
| Equivalences among Relational Expressions | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162623 | 1978-01-01 | Paper |
| Economy of description by parsers, DPDA's, and PDA's | 1977-01-01 | Paper |
| Finding the depth of a flow graph | 1977-01-01 | Paper |
| Monotone data flow analysis frameworks | 1977-01-01 | Paper |
| Operations on sparse relations | 1977-01-01 | Paper |
| Evaluating Relational Expressions with Dense and Sparse Arguments | 1977-01-01 | Paper |
| Node listings for reducible flow graphs | 1976-01-01 | Paper |
| Global Data Flow Analysis and Iterative Algorithms | 1976-01-01 | Paper |
| Bounds on the Complexity of the Longest Common Subsequence Problem | 1976-01-01 | Paper |
| On Finding Lowest Common Ancestors in Trees | 1976-01-01 | Paper |
| Protection in operating systems | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125701 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4140365 | 1976-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4144766 | 1976-01-01 | Paper |
| NP-complete scheduling problems | 1975-01-01 | Paper |
| Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4065051 | 1975-01-01 | Paper |
| On the complexity of LR(k) testing | 1975-01-01 | Paper |
| Evaluating Polynomials at Fixed Sets of Points | 1975-01-01 | Paper |
| A Simple Algorithm for Global Data Flow Analysis Problems | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133129 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162641 | 1975-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4162673 | 1975-01-01 | Paper |
| Characterizations of Reducible Flow Graphs | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4091421 | 1974-01-01 | Paper |
| Dynamic Memories with Rapid Random and Sequential Access | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4778267 | 1974-01-01 | Paper |
| Set Merging Algorithms | 1973-01-01 | Paper |
| Error detection in precedence parsers | 1973-01-01 | Paper |
| Fast algorithms for the elimination of common subexpressions | 1973-01-01 | Paper |
| A Technique for Speeding up ${\text{LR}}(k)$ Parsers | 1973-01-01 | Paper |
| Parsing algorithms with backtrack | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4061956 | 1973-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4068080 | 1973-01-01 | Paper |
| Translations on a context free grammar | 1972-01-01 | Paper |
| Modular Networks and Nondeterministic Sequential Machines | 1972-01-01 | Paper |
| The Transitive Reduction of a Directed Graph | 1972-01-01 | Paper |
| Optimization of Straight Line Programs | 1972-01-01 | Paper |
| Weak and Mixed Strategy Precedence Parsing | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672156 | 1972-01-01 | Paper |
| A Note on the Efficiency of Hashing Functions | 1972-01-01 | Paper |
| Linear precedence functions for weak precedence grammars | 1972-01-01 | Paper |
| Flow Graph Reducibility | 1972-01-01 | Paper |
| Equivalence of programs with structured variables | 1972-01-01 | Paper |
| Optimization of LR(k) parsers | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125730 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4125810 | 1972-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4133108 | 1972-01-01 | Paper |
| Principles of Optimal Page Replacement | 1971-01-01 | Paper |
| Characterizations and extensions of pushdown translations | 1971-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5672148 | 1971-01-01 | Paper |
| The Generation of Optimal Code for Arithmetic Expressions | 1970-01-01 | Paper |
| On the computational power of pushdown automata | 1970-01-01 | Paper |
| A characterization of two-way deterministic classes of languages | 1970-01-01 | Paper |
| A general theory of translation | 1969-01-01 | Paper |
| Some Results on Tape-Bounded Turing Machines | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5592246 | 1969-01-01 | Paper |
| Halting Stack Automata | 1969-01-01 | Paper |
| Properties of syntax directed translations | 1969-01-01 | Paper |
| Syntax directed translations and the pushdown assembler | 1969-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4773298 | 1969-01-01 | Paper |
| Uniform Synthesis of Sequential Circuits† | 1969-01-01 | Paper |
| Sets accepted by one-way stack automata are context sensitive | 1968-01-01 | Paper |
| The theory of languages | 1968-01-01 | Paper |
| Time and tape complexity of pushdown automaton languages | 1968-01-01 | Paper |
| Deterministic stack automata and the quotient operator | 1968-01-01 | Paper |
| Decidable and Undecidable Questions About Automata | 1968-01-01 | Paper |
| The theory of languages | 1968-01-01 | Paper |
| Relations Between Time and Tape Complexities | 1968-01-01 | Paper |
| On the capabilities of codes to correct synchronization errors | 1967-01-01 | Paper |
| Nonerasing stack automata | 1967-01-01 | Paper |
| An Approach to a Unified Theory of Automata | 1967-01-01 | Paper |
| Near-optimal, single-synchronization-error-correcting code | 1966-01-01 | Paper |
| Decoding of Cyclic Codes Using Position Invariant Functions | 1965-01-01 | Paper |
