This map shows the geographic impact of Tetsuo Ida'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 Tetsuo Ida with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Tetsuo Ida more than expected).
This network shows the impact of papers produced by Tetsuo Ida. 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 Tetsuo Ida. The network helps show where Tetsuo Ida may publish in the future.
Co-authorship network of co-authors of Tetsuo Ida
This figure shows the co-authorship network connecting the top 25 collaborators of Tetsuo Ida.
A scholar is included among the top collaborators of Tetsuo Ida 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 Tetsuo Ida. Tetsuo Ida is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Petcu, Dana, et al.. (2005). Survey of Symbolic Computations on the Grid.
7.
Ida, Tetsuo & Bruno Buchberger. (2004). Proving and Solving in Computational Origami.1 indexed citations
8.
Kobayashi, Norio, et al.. (2003). Collaborative constraint functional logic programming system in an open environment. IEICE Transactions on Information and Systems. 86(1). 63–70.4 indexed citations
Li, Qiang, Yike Guo, & Tetsuo Ida. (2000). Modelling Integer Programming with Logic: Language and Implementation. IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences. 83(8). 1673–1680.4 indexed citations
12.
Calmet, Jacques, Tetsuo Ida, & Dongming Wang. (1998). Proceedings of the 8th international conference on Artificial Intelligence and Symbolic Computation.3 indexed citations
Li, Qiang, Yike Guo, Tetsuo Ida, & John Darlington. (1997). The minimised geometric Buchberger algorithm. Rare & Special e-Zone (The Hong Kong University of Science and Technology). 331–338.3 indexed citations
Ida, Tetsuo & Eiichi Goto. (1978). Overflow Free and Variable Precision Computing in FLATS. Journal of information processing. 1(3). 140–142.1 indexed citations
19.
Ida, Tetsuo & Eiichi Goto. (1978). Analysis of Parallel Hashing Algorithms with Key Deletion. Journal of information processing. 1(1). 25–32.
20.
Ida, Tetsuo & Eiichi Goto. (1977). Performance of Parallel Hash Hardware with Key Deletion.. IFIP Congress. 643–647.4 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.