The following pages link to Jeffrey D. Ullman (Q269331):
Displayed 50 items.
- Parallel skyline queries (Q269332) (← links)
- Item:Q269331 (redirect page) (← links)
- Argument reduction by factoring (Q673140) (← links)
- Logical query optimization by proof-tree transformation (Q686647) (← links)
- Connections in acyclic hypergraphs (Q762180) (← links)
- On the convergence of query evaluation (Q919818) (← links)
- Algorithms for the compilation of regular expressions into PLAs (Q1098299) (← links)
- Parallel complexity of logical query programs (Q1104095) (← links)
- Adequacy of decompositions of relational databases (Q1154819) (← links)
- The theory of functional and template dependencies (Q1162368) (← links)
- Bounds on the size and transmission rate of communications protocols (Q1163522) (← links)
- NP-complete scheduling problems (Q1220386) (← links)
- Node listings for reducible flow graphs (Q1236887) (← links)
- Economy of description by parsers, DPDA's, and PDA's (Q1239011) (← links)
- Finding the depth of a flow graph (Q1243127) (← links)
- Monotone data flow analysis frameworks (Q1245693) (← links)
- Answering queries using limited external query processors (Q1305923) (← links)
- The input/output complexity of transitive closure (Q1360681) (← links)
- Querying websites using compact skeletons. (Q1401973) (← links)
- Information integration using logical views (Q1575131) (← links)
- Computing marginals using MapReduce (Q1745720) (← links)
- Fast algorithms for the elimination of common subexpressions (Q1846330) (← links)
- Nonerasing stack automata (Q2530209) (← links)
- Deterministic stack automata and the quotient operator (Q2531282) (← links)
- Properties of syntax directed translations (Q2532395) (← links)
- Syntax directed translations and the pushdown assembler (Q2535241) (← links)
- On the computational power of pushdown automata (Q2542990) (← links)
- A characterization of two-way deterministic classes of languages (Q2547802) (← links)
- Equivalence of programs with structured variables (Q2554227) (← links)
- Optimization of LR(k) parsers (Q2561843) (← links)
- (Q3174892) (← links)
- High-Probability Parallel Transitive-Closure Algorithms (Q3204039) (← links)
- (Q3206351) (← links)
- A Technique for Speeding up ${\text{LR}}(k)$ Parsers (Q3214369) (← links)
- Maximal objects and the semantics of universal relation databases (Q3321499) (← links)
- (Q3326832) (← links)
- (Q3347338) (← links)
- (Q3525697) (← links)
- (Q3664434) (← links)
- On the foundations of the universal relation model (Q3677202) (← links)
- Implementation of logical query languages for databases (Q3691103) (← links)
- A Communication-Time Tradeoff (Q3795227) (← links)
- (Q3862379) (← links)
- A Scheme for the Automatic Inference of Variable Types (Q3867157) (← links)
- Deadlock-Free Packet Switching Networks (Q3911385) (← links)
- Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions (Q3912082) (← links)
- (Q3912083) (← links)
- Equivalence of Relational Database Schemes (Q3925900) (← links)
- The Compilation of Regular Expressions into Integrated Circuits (Q3945588) (← links)
- Template Dependencies (Q3945626) (← links)