 | 1995 |
|---|
| 10 |       | Joachim Biskup,
Pratul Dublish,
Yehoshua Sagiv:
Optimization of a Subclass of Conjunctive Queries
Acta Inf. 32(1): 1-26 (1995) |
| 1993 |
|---|
| 9 | | Joachim Biskup,
Pratul Dublish:
Objects in Relational Database Schemes with Functional Inclusion, and Exclusion Dependencies.
ITA 27(3): 183-219 (1993) |
| 1991 |
|---|
| 8 |  | Joachim Biskup,
Pratul Dublish:
Objects in Relational Database Schemes with Functional, Inclusion and Exclusion Dependencies.
MFDBS 1991: 276-290 |
| 1990 |
|---|
| 7 | | Pratul Dublish,
Joachim Biskup,
Yehoshua Sagiv:
Optimizatioin of a Subclass of Conjunctive Queries.
ICDT 1990: 455-469 |
| 6 | | Pratul Dublish,
S. N. Maheshwari:
Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs.
MFCS 1990: 246-253 |
| 5 | | Pratul Dublish:
Some Comments on the Subtree Isomorphism Problem for Ordered Trees.
Inf. Process. Lett. 36(5): 273-275 (1990) |
| 1989 |
|---|
| 4 | | Pratul Dublish,
S. N. Maheshwari:
Expressibility of Bounded-Arity Fixed-Point Query Hierarchies.
PODS 1989: 324-335 |
| 1988 |
|---|
| 3 | | Pratul Dublish,
S. N. Maheshwari:
On O(N²) Equivalence Algorithm for Fan-Out Free Queries.
ICDT 1988: 176-190 |
| 2 | | Pratul Dublish:
An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon.
Inf. Process. Lett. 29(5): 275-276 (1988) |
| 1987 |
|---|
| 1 | | Pratul Dublish,
S. N. Maheshwari:
An O(n²) Algorithm for Fan-Out Free Query Optimization.
FSTTCS 1987: 242-264 |
