Author of the publication

The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation.

, and . IEEE Trans. Knowl. Data Eng., 8 (4): 617-629 (1996)

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.

 

Other publications of authors with the same name

Improving The Floyd-Warshall All Pairs Shortest Paths Algorithm.. CoRR, (2021)Semantically Enriched Event Based Model for Web Usage Mining., , and . WISE, volume 6488 of Lecture Notes in Computer Science, page 166-174. Springer, (2010)Distance-based indexing of residue contacts for protein structure retrieval and alignment., , and . BIBE, page 1-7. IEEE, (2008)An efficient database transitive closure algorithm., , and . Appl. Intell., 4 (2): 205-218 (1994)LPL++: Object Logic Programming Language with Built-in Inheritance Through Unification.. Data Base, 29 (2): 50-61 (1998)The Efficient Computation of Strong Partial Transitive-Closures., and . ICDE, page 530-537. IEEE Computer Society, (1993)Lattice Structure for an Object-Oriented Data Model., and . IADT, page 296-303. Society for Design and Process Science, 1302 West 25th Street, Suite 300, Austin, TX 78705-4236, USA, (1998)The Strong Partial Transitive-Closure Problem: Algorithms and Performance Evaluation., and . IEEE Trans. Knowl. Data Eng., 8 (4): 617-629 (1996)Method Inheritance with Object Updates in an Object-Oriented Logic Programming Language., , and . Workshop on Deductive Databases, JICSLP, volume CITRI/TR-92-65 of Technical Report, page 106-115. Department of Computer Science, University of Melbourne, (1992)Mining Cyclically Repeated Patterns., and . DaWaK, volume 2114 of Lecture Notes in Computer Science, page 83-92. Springer, (2001)