Hiroki Arimura

From MaRDI portal
Person:313768

Available identifiers

zbMath Open arimura.hirokiMaRDI QIDQ313768

List of research outcomes

PublicationDate of PublicationType
Learning unions of tree patterns using queries2023-12-08Paper
https://portal.mardi4nfdi.de/entity/Q50909982022-07-21Paper
Efficient enumeration of dominating sets for sparse graphs2021-09-15Paper
A constant amortized time enumeration algorithm for independent sets in graphs with bounded clique number2021-06-22Paper
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression2021-02-16Paper
Fully-online suffix tree and directed acyclic word graph construction for multiple texts2020-04-01Paper
An efficient algorithm for enumerating chordal bipartite induced subgraphs in sparse graphs2020-02-25Paper
DenseZDD: a compact and fast index for families of sets2019-10-30Paper
Efficient enumeration of subgraphs and induced subgraphs with bounded girth2018-09-06Paper
Fully-online Construction of Suffix Trees for Multiple Texts.2017-10-17Paper
Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing2016-09-29Paper
Sequence binary decision diagram: minimization, relationship to acyclic automata, and complexities of Boolean set operations2016-09-12Paper
The Complexity of Induced Tree Reconfiguration Problems2016-04-13Paper
Efficient Enumeration of Induced Subtrees in a K-Degenerate Graph2015-09-11Paper
Counterexamples to the long-standing conjecture on the complexity of BDD binary operations2012-10-23Paper
Constant Time Enumeration of Bounded-Size Subtrees in Trees and Its Application2012-09-25Paper
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism2012-09-13Paper
Sparse and Truncated Suffix Trees on Variable-Length Codes2011-06-29Paper
Faster Bit-Parallel Algorithms for Unordered Pseudo-tree Matching and Tree Homeomorphism2011-05-19Paper
Efficient Algorithms for Discovering Frequent and Maximal Substructures from Large Semistructured Data2010-10-06Paper
Inductive inference of unbounded unions of pattern languages from positive data2010-04-27Paper
An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence2007-07-19Paper
Algorithms and Computation2006-11-14Paper
Inductive Logic Programming2006-11-01Paper
Discovery Science2005-08-18Paper
https://portal.mardi4nfdi.de/entity/Q30444872004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q30445562004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47376832004-08-11Paper
https://portal.mardi4nfdi.de/entity/Q47360592004-08-09Paper
https://portal.mardi4nfdi.de/entity/Q44735622004-08-04Paper
https://portal.mardi4nfdi.de/entity/Q44705622004-07-01Paper
https://portal.mardi4nfdi.de/entity/Q44059972003-06-25Paper
Learning elementary formal systems with queries.2003-05-22Paper
https://portal.mardi4nfdi.de/entity/Q47961612003-03-02Paper
https://portal.mardi4nfdi.de/entity/Q45483052002-08-26Paper
https://portal.mardi4nfdi.de/entity/Q45477462002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q45477492002-08-21Paper
https://portal.mardi4nfdi.de/entity/Q27540202001-11-11Paper
https://portal.mardi4nfdi.de/entity/Q45053912000-09-27Paper
https://portal.mardi4nfdi.de/entity/Q49426392000-03-16Paper
https://portal.mardi4nfdi.de/entity/Q47034521999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47034551999-12-15Paper
https://portal.mardi4nfdi.de/entity/Q47038501999-12-01Paper
https://portal.mardi4nfdi.de/entity/Q42533361999-11-08Paper
https://portal.mardi4nfdi.de/entity/Q42678041999-10-24Paper
Finding tree patterns consistent with positive and negative examples using queries1999-01-06Paper
Learning unions of tree patterns using queries1998-07-22Paper
https://portal.mardi4nfdi.de/entity/Q43702311998-01-14Paper
https://portal.mardi4nfdi.de/entity/Q31269271997-05-04Paper
https://portal.mardi4nfdi.de/entity/Q31430391993-12-20Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Hiroki Arimura