The following pages link to Hiroki Arimura (Q313768):
Displaying 50 items.
- Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations (Q313770) (← links)
- Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism (Q450558) (← links)
- Counterexamples to the long-standing conjecture on the complexity of BDD binary operations (Q456068) (← links)
- An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence (Q996827) (← links)
- Finding tree patterns consistent with positive and negative examples using queries (Q1273755) (← links)
- Learning unions of tree patterns using queries (Q1390942) (← links)
- Efficient enumeration of subgraphs and induced subgraphs with bounded girth (Q1671003) (← links)
- Learning elementary formal systems with queries. (Q1874227) (← links)
- Efficient enumeration of dominating sets for sparse graphs (Q1983139) (← links)
- A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number (Q2034408) (← links)
- An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs (Q2301754) (← links)
- Fully-online suffix tree and directed acyclic word graph construction for multiple texts (Q2309475) (← links)
- DenseZDD: a compact and fast index for families of sets (Q2331660) (← links)
- (Q2754020) (← links)
- The Complexity of Induced Tree Reconfiguration Problems (Q2798731) (← links)
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing (Q2819506) (← links)
- Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application (Q2914339) (← links)
- Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph (Q2942617) (← links)
- Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism (Q3000495) (← links)
- Sparse and Truncated Suffix Trees on Variable-Length Codes (Q3011859) (← links)
- (Q3044487) (← links)
- (Q3044556) (← links)
- (Q3126927) (← links)
- (Q3143039) (← links)
- (Q4253336) (← links)
- (Q4267804) (← links)
- (Q4370231) (← links)
- (Q4405997) (← links)
- (Q4470562) (← links)
- (Q4473562) (← links)
- (Q4505391) (← links)
- (Q4547746) (← links)
- (Q4547749) (← links)
- (Q4548305) (← links)
- (Q4703452) (← links)
- (Q4703455) (← links)
- (Q4703850) (← links)
- (Q4736059) (← links)
- (Q4737683) (← links)
- (Q4796161) (← links)
- Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data (Q4932736) (← links)
- (Q4942639) (← links)
- (Q5090998) (← links)
- Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Q5150942) (← links)
- Fully-online Construction of Suffix Trees for Multiple Texts. (Q5369557) (← links)
- Inductive Logic Programming (Q5394634) (← links)
- Discovery Science (Q5464540) (← links)
- Algorithms and Computation (Q5897905) (← links)
- Inductive inference of unbounded unions of pattern languages from positive data (Q5900846) (← links)
- Cartesian tree subsequence matching (Q6496842) (← links)
