| Publication | Date of Publication | Type |
|---|
Optimally computing compressed indexing arrays based on the compact directed acyclic word graph
| 2024-05-29 | Paper |
Cartesian tree subsequence matching
| 2024-05-06 | Paper |
Fast identification of heavy hitters by cached and packed group testing
| 2024-04-19 | Paper |
Learning unions of tree patterns using queries
Lecture Notes in Computer Science | 2023-12-08 | Paper |
Efficient enumeration of dominating sets for sparse graphs
| 2022-07-21 | Paper |
Efficient enumeration of dominating sets for sparse graphs
Discrete Applied Mathematics | 2021-09-15 | Paper |
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number
Theoretical Computer Science | 2021-06-22 | Paper |
Linear-size CDAWG: new repetition-aware indexing and grammar compression
String Processing and Information Retrieval | 2021-02-16 | Paper |
Fully-online suffix tree and directed acyclic word graph construction for multiple texts
Algorithmica | 2020-04-01 | Paper |
An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs
| 2020-02-25 | Paper |
DenseZDD: a compact and fast index for families of sets
Algorithms | 2019-10-30 | Paper |
Efficient enumeration of subgraphs and induced subgraphs with bounded girth
| 2018-09-06 | Paper |
Fully-online Construction of Suffix Trees for Multiple Texts.
| 2017-10-17 | Paper |
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
Lecture Notes in Computer Science | 2016-09-29 | Paper |
Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations
Discrete Applied Mathematics | 2016-09-12 | Paper |
The complexity of induced tree reconfiguration problems
Language and Automata Theory and Applications | 2016-04-13 | Paper |
Efficient enumeration of induced subtrees in a K-degenerate graph
Algorithms and Computation | 2015-09-11 | Paper |
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations
Information Processing Letters | 2012-10-23 | Paper |
Constant time enumeration of bounded-size subtrees in trees and its application
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Journal of Discrete Algorithms | 2012-09-13 | Paper |
Sparse and truncated suffix trees on variable-length codes
Combinatorial Pattern Matching | 2011-06-29 | Paper |
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Efficient algorithms for discovering frequent and maximal substructures from large semistructured data
Lecture Notes in Electrical Engineering | 2010-10-06 | Paper |
Inductive inference of unbounded unions of pattern languages from positive data
Lecture Notes in Computer Science | 2010-04-27 | Paper |
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence
Journal of Combinatorial Optimization | 2007-07-19 | Paper |
Algorithms and Computation
Lecture Notes in Computer Science | 2006-11-14 | Paper |
Inductive Logic Programming
Lecture Notes in Computer Science | 2006-11-01 | Paper |
Discovery Science
Lecture Notes in Computer Science | 2005-08-18 | Paper |
scientific article; zbMATH DE number 2087039 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086363 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2086324 (Why is no real title available?)
| 2004-08-11 | Paper |
scientific article; zbMATH DE number 2084850 (Why is no real title available?)
| 2004-08-09 | Paper |
scientific article; zbMATH DE number 2080666 (Why is no real title available?)
| 2004-08-04 | Paper |
scientific article; zbMATH DE number 2077169 (Why is no real title available?)
| 2004-07-01 | Paper |
scientific article; zbMATH DE number 1934539 (Why is no real title available?)
| 2003-06-25 | Paper |
Learning elementary formal systems with queries.
Theoretical Computer Science | 2003-05-22 | Paper |
scientific article; zbMATH DE number 1875402 (Why is no real title available?)
| 2003-03-02 | Paper |
scientific article; zbMATH DE number 1788711 (Why is no real title available?)
| 2002-08-26 | Paper |
scientific article; zbMATH DE number 1786458 (Why is no real title available?)
| 2002-08-21 | Paper |
scientific article; zbMATH DE number 1786455 (Why is no real title available?)
| 2002-08-21 | Paper |
scientific article; zbMATH DE number 1670727 (Why is no real title available?)
| 2001-11-11 | Paper |
scientific article; zbMATH DE number 1511704 (Why is no real title available?)
| 2000-09-27 | Paper |
scientific article; zbMATH DE number 1414302 (Why is no real title available?)
| 2000-03-16 | Paper |
scientific article; zbMATH DE number 1379116 (Why is no real title available?)
| 1999-12-15 | Paper |
scientific article; zbMATH DE number 1379117 (Why is no real title available?)
| 1999-12-15 | Paper |
scientific article; zbMATH DE number 1372648 (Why is no real title available?)
| 1999-12-01 | Paper |
scientific article; zbMATH DE number 1322321 (Why is no real title available?)
| 1999-11-08 | Paper |
scientific article; zbMATH DE number 1351084 (Why is no real title available?)
| 1999-10-24 | Paper |
Finding tree patterns consistent with positive and negative examples using queries
Annals of Mathematics and Artificial Intelligence | 1999-01-06 | Paper |
Learning unions of tree patterns using queries
Theoretical Computer Science | 1998-07-22 | Paper |
scientific article; zbMATH DE number 1104356 (Why is no real title available?)
| 1998-01-14 | Paper |
scientific article; zbMATH DE number 996383 (Why is no real title available?)
| 1997-05-04 | Paper |
scientific article; zbMATH DE number 458994 (Why is no real title available?)
| 1993-12-20 | Paper |
