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.

 

Other publications of authors with the same name

A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees., and . FoSSaCS, volume 1578 of Lecture Notes in Computer Science, page 180-196. Springer, (1999)A Robust Dna Computation Model That Captures Pspace., and . Int. J. Found. Comput. Sci., 14 (5): 933- (2003)Probabilistic Logic Programs and their Semantics.. RCLP, volume 592 of Lecture Notes in Computer Science, page 152-164. Springer, (1991)Clause Shortening Combined with Pruning Yields a New Upper Bound for Deterministic SAT Algorithms, , and . Electron. Colloquium Comput. Complex., (2005)Complexity and Expressive Power of Logic Programming., , , and . CCC, page 82-101. IEEE Computer Society, (1997)Derandomization of Schuler's Algorithm for SAT., and . SAT (Selected Papers, volume 3542 of Lecture Notes in Computer Science, page 80-88. Springer, (2004)Solving Constraint Satisfaction Problems with DNA Computing., and . COCOON, volume 2387 of Lecture Notes in Computer Science, page 171-180. Springer, (2002)Reconstruction of Boolean Formulas in Conjunctive Normal Form., and . COCOON, volume 10976 of Lecture Notes in Computer Science, page 592-601. Springer, (2018)Expressive Power and Data Complexity of Query Languages for Trees and Lists., and . PODS, page 157-165. ACM, (2000)Similarity Between Points in Metric Measure Spaces., and . SISAP, volume 12440 of Lecture Notes in Computer Science, page 177-184. Springer, (2020)