Countries citing papers authored by Hiroki Arimura
Since
Specialization
Citations
This map shows the geographic impact of Hiroki Arimura's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Hiroki Arimura with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Hiroki Arimura more than expected).
This network shows the impact of papers produced by Hiroki Arimura. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Hiroki Arimura. The network helps show where Hiroki Arimura may publish in the future.
Co-authorship network of co-authors of Hiroki Arimura
This figure shows the co-authorship network connecting the top 25 collaborators of Hiroki Arimura.
A scholar is included among the top collaborators of Hiroki Arimura based on the total number of
citations received by their joint publications. Widths of edges
represent the number of papers authors have co-authored together.
Node borders
signify the number of papers an author published with Hiroki Arimura. Hiroki Arimura is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Tsuda, Koji, et al.. (2013). Compact complete inverted files for texts and directed acyclic graphs based on sequence binary decision diagrams. 157–167.1 indexed citations
4.
Yoshizawa, Shingo, et al.. (2011). High-speed string and regular expression matching on FPGA. Asia-Pacific Signal and Information Processing Association Annual Summit and Conference. 457–463.7 indexed citations
5.
Arimura, Hiroki & M. Hikita. (2011). 2Pb4-6 Generation of Rotary Motion by Circular/Elliptic Drive Synthesized with Straight-Move Ultrasonic Motors(Poster Session). 32. 243–244.2 indexed citations
Abe, K., et al.. (2002). Optimized Substructure Discovery for Semi-structured Data. Kyushu University Institutional Repository (QIR) (Kyushu University).1 indexed citations
10.
Arimura, Hiroki, et al.. (2001). Efficient Substring Traversal with Suffix Arrays. Kyushu University Institutional Repository (QIR) (Kyushu University).2 indexed citations
11.
Arimura, Hiroki, et al.. (2001). Efficient Discovery of Proximity Patterns with Suffix Arrays. 152–156.4 indexed citations
Arimura, Hiroki & Akihiro Yamamoto. (2000). Inductive Logic Programming: From Logic of Discovery to Machine Learning. IEICE Transactions on Information and Systems. 83(1). 10–18.2 indexed citations
Arimura, Hiroki, et al.. (1998). A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases. Kyushu University Institutional Repository (QIR) (Kyushu University).
16.
Kasai, Toru, et al.. (1998). Text Data Mining Based on Optimal Pattern Discovery : Towards a Scalable Data Mining System for Large Text Databases. IPSJ SIG Notes. 98(57). 151–156.3 indexed citations
Arimura, Hiroki, et al.. (1992). Polynomial Time Inference of Unions of Two Tree Pattern Languages. IEICE Transactions on Information and Systems. 426–434.1 indexed citations
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive
bibliographic database. While OpenAlex provides broad and valuable coverage of the global
research landscape, it—like all bibliographic datasets—has inherent limitations. These include
incomplete records, variations in author disambiguation, differences in journal indexing, and
delays in data updates. As a result, some metrics and network relationships displayed in
Rankless may not fully capture the entirety of a scholar's output or impact.