Author of the publication

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Dublish, Pratul
add a person with the name Dublish, Pratul
 

Other publications of authors with the same name

Objects in Relational Database Schemes with Functional Inclusion, and Exclusion Dependencies., and . RAIRO Theor. Informatics Appl., 27 (3): 183-219 (1993)An O(n²) Algorithm for Fan-Out Free Query Optimization., and . FSTTCS, volume 287 of Lecture Notes in Computer Science, page 242-264. Springer, (1987)Optimizatioin of a Subclass of Conjunctive Queries., , and . ICDT, volume 470 of Lecture Notes in Computer Science, page 455-469. Springer, (1990)Objects in Relational Database Schemes with Functional, Inclusion and Exclusion Dependencies., and . MFDBS, volume 495 of Lecture Notes in Computer Science, page 276-290. Springer, (1991)Optimization of a Subclass of Conjunctive Queries., , and . Acta Inf., 32 (1): 1-26 (1995)Some Comments on the Subtree Isomorphism Problem for Ordered Trees.. Inf. Process. Lett., 36 (5): 273-275 (1990)On O(N²) Equivalence Algorithm for Fan-Out Free Queries., and . ICDT, volume 326 of Lecture Notes in Computer Science, page 176-190. Springer, (1988)Query Languages which Express all PTIME Queries for Trees and Unicyclic Graphs., and . MFCS, volume 452 of Lecture Notes in Computer Science, page 246-253. Springer, (1990)Expressibility of Bounded-Arity Fixed-Point Query Hierarchies., and . PODS, page 324-335. ACM Press, (1989)An O(n³) Algorithm for Finding the Minimal Opaque Forest of a Convex Polygon.. Inf. Process. Lett., 29 (5): 275-276 (1988)