Jun Tarui
Impact in
-
- Complexity and Algorithms in Graphs
- Advanced Graph Theory Research
- semigroups and automata theory
Papers in
-
- Complexity and Algorithms in Graphs 9
- semigroups and automata theory 6
- Advanced Graph Theory Research 5
- Computability, Logic, AI Algorithms 3
-
- Machine Learning and Algorithms 5
- Algorithms and Data Compression 3
- Co-authors
- Richard Beigel (2 shared papers)Toshiya Itoh (2 shared papers)Yoshinori Takei (2 shared papers)Kazuyuki Amano (2 shared papers)Peter Bro Miltersen (2 shared papers)Mike Paterson (2 shared papers)Tsutomu Kawabata (1 shared paper)Akira Maruoka (1 shared paper)
- Journals
- Theoretical Computer Science (6 papers)Journal of the ACM (1 paper)Computational Complexity (1 paper)Discrete Mathematics (1 paper)Discrete Applied Mathematics (1 paper)
- Partner nations
- JapanUnited StatesUnited Kingdom
In The Last Decade
Jun Tarui
18 papers receiving 203 citations
Peers
Comparison fields: 5 of 37
- Computational Theory and Mathematics 181
- Discrete Mathematics and Combinatorics 28
- Artificial Intelligence 138
- Algebra and Number Theory 8
- Computer Graphics and Computer-Aided Design 6
Countries citing papers authored by Jun Tarui
This map shows the geographic impact of Jun Tarui'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 Jun Tarui with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jun Tarui more than expected).
Fields of papers citing papers by Jun Tarui
This network shows the impact of papers produced by Jun Tarui. 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 Jun Tarui. The network helps show where Jun Tarui may publish in the future.
Co-authors
The 10 scholars most cited alongside Jun Tarui, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
| # | Work | ||
|---|---|---|---|
| 1 | 1994 | 95 | |
| 2 | 1993 | 29 | |
| 3 | 2013 | 14 | |
| 4 | 2003 | 13 | |
| 5 | 2000 | 9 | |
| 6 | 2007 | 8 | |
| 7 | 2002 | 8 | |
| 8 | 2003 | 8 | |
| 9 | 2002 | 7 | |
| 10 | 2002 | 7 | |
| 11 | 1996 | 6 | |
| 12 | 2010 | 6 | |
| 13 | On Complexity of Computing the Permanent of a Rectangular Matrix | 1999 | 3 |
| 14 | 1992 | 3 | |
| 15 | 2011 | 2 | |
| 16 | Proceedings of the 8th annual conference on Theory and applications of models of computation | 2011 | 1 |
| 17 | 2008 | 1 | |
| 18 | 2010 | 1 | |
| 19 | 2008 | 1 |
About Jun Tarui
Jun Tarui is a scholar working on Computational Theory and Mathematics, Artificial Intelligence, Electrical and Electronic Engineering, Discrete Mathematics and Combinatorics and Computer Networks and Communications, having authored 19 papers that have together received 222 indexed citations. Recurring topics across this work include Complexity and Algorithms in Graphs (9 papers), semigroups and automata theory (6 papers), Advanced Graph Theory Research (5 papers), Machine Learning and Algorithms (5 papers), Limits and Structures in Graph Theory (4 papers), graph theory and CDMA systems (4 papers), Algorithms and Data Compression (3 papers) and Computability, Logic, AI Algorithms (3 papers). The work is most often cited by research in Computational Theory and Mathematics (181 citations), Discrete Mathematics and Combinatorics (28 citations), Artificial Intelligence (138 citations), Algebra and Number Theory (8 citations) and Computer Graphics and Computer-Aided Design (6 citations). Jun Tarui has collaborated with scholars based in Japan, United States and United Kingdom. Frequent co-authors include Richard Beigel, Toshiya Itoh, Yoshinori Takei, Kazuyuki Amano, Peter Bro Miltersen, Mike Paterson, Tsutomu Kawabata, Akira Maruoka, Mitsunori Ogihara and Kazuo Iwama. Their work appears in journals such as Theoretical Computer Science, Journal of the ACM, Computational Complexity, Discrete Mathematics and Discrete Applied Mathematics.
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.