| Publication | Date of Publication | Type |
|---|
On the hardness of approximating the minimum consistent OBDD problem
Algorithm Theory — SWAT'96 | 2022-12-09 | Paper |
| Caterpillar alignment distance for rooted labeled caterpillars: distance based on alignments required to be caterpillars | 2022-10-25 | Paper |
| Introducing fluctuation into increasing order of symmetric uncertainty for consistency-based feature selection | 2019-10-15 | Paper |
Tai mapping hierarchy for rooted labeled trees through common subforest
Theory of Computing Systems | 2017-08-15 | Paper |
Constructing simply recursive programs from a finite set of good examples
Information Processing Letters | 2016-06-09 | Paper |
Segmental mapping and distance for rooted labeled ordered trees
Fundamenta Informaticae | 2014-12-22 | Paper |
Tractable and intractable variations of unordered tree edit distance
International Journal of Foundations of Computer Science | 2014-11-14 | Paper |
Segmental mapping and distance for rooted labeled ordered trees
Algorithms and Computation | 2013-03-21 | Paper |
Improved MAX SNP-hard results for finding an edit distance between unordered trees
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Approximating tree edit distance through string edit distance for binary tree codes
Fundamenta Informaticae | 2011-06-14 | Paper |
Constructive learning of translations based on dictionaries
Lecture Notes in Computer Science | 2010-04-27 | Paper |
On condensation of a clause.
Lecture Notes in Computer Science | 2010-02-23 | Paper |
Prediction of Recursive Real-Valued Functions from Finite Examples
New Frontiers in Artificial Intelligence | 2009-03-26 | Paper |
On Generalization and Subsumption for Ordered Clauses
New Frontiers in Artificial Intelligence | 2009-03-26 | Paper |
Mining Frequent Diamond Episodes from Event Sequences
Modeling Decisions for Artificial Intelligence | 2009-02-17 | Paper |
Approximating Tree Edit Distance through String Edit Distance for Binary Tree Codes
Lecture Notes in Computer Science | 2009-02-03 | Paper |
On Generating All Maximal Acyclic Subhypergraphs with Polynomial Delay
Lecture Notes in Computer Science | 2009-02-03 | Paper |
Tractable and intractable second-order matching problems
Journal of Symbolic Computation | 2007-08-24 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Inductive Logic Programming
Lecture Notes in Computer Science | 2006-10-19 | Paper |
On the hardness of approximating the minimum consistent acyclic DFA and decision diagram.
Information Processing Letters | 2006-01-17 | Paper |
Prediction-hardness of acyclic conjunctive queries
Theoretical Computer Science | 2006-01-10 | Paper |
Discovery Science
Lecture Notes in Computer Science | 2005-08-18 | Paper |
| scientific article; zbMATH DE number 2080453 (Why is no real title available?) | 2004-08-04 | Paper |
| scientific article; zbMATH DE number 2077154 (Why is no real title available?) | 2004-07-01 | Paper |
Learning elementary formal systems with queries.
Theoretical Computer Science | 2003-05-22 | Paper |
| scientific article; zbMATH DE number 1839442 (Why is no real title available?) | 2002-12-02 | Paper |
| scientific article; zbMATH DE number 1788711 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1788730 (Why is no real title available?) | 2002-08-26 | Paper |
| scientific article; zbMATH DE number 1670729 (Why is no real title available?) | 2001-11-11 | Paper |
| scientific article; zbMATH DE number 1511694 (Why is no real title available?) | 2000-09-27 | Paper |
| scientific article; zbMATH DE number 1453036 (Why is no real title available?) | 2000-05-25 | Paper |
| scientific article; zbMATH DE number 1405696 (Why is no real title available?) | 2000-02-23 | Paper |
| scientific article; zbMATH DE number 898328 (Why is no real title available?) | 1996-08-21 | Paper |
| scientific article; zbMATH DE number 640290 (Why is no real title available?) | 1995-03-05 | Paper |
| scientific article; zbMATH DE number 124284 (Why is no real title available?) | 1993-02-18 | Paper |
