Demo Data from SIGIR 2026 / reviewers in the wild / expert
Shigeki Akiyama
dblp:68/5603
· DBLP profile ↗
9ranked-venue papers
9as first author
2since 2021 · last 2025
0000-0001-7549-6686ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 5 · 5 first-author · 2 since 2021Theory of computation · 3 · 3 first-authorSystems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Parallel and multicore computing · 70% Interconnection networks and networks-on-chip · 30% | |
| Theoretical computer science
1 paper |
Automata and formal languages · 77% Computational geometry · 23% |
Topics — the 6 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Interconnection networks and networks-on-chip
remote direct memory access |
0.2 | 1 | 2015 | Uni-Address Threads: Scalable Thread Management for RDMA-Based Work Stealing · HPDC 2015 |
Parallel and multicore computing › parallel programming runtimes
task-based runtime |
0.2 | 1 | 2015 | Uni-Address Threads: Scalable Thread Management for RDMA-Based Work Stealing · HPDC 2015 |
Parallel and multicore computing › load balancing › dynamic load balancing
work stealing |
0.2 | 1 | 2015 | Uni-Address Threads: Scalable Thread Management for RDMA-Based Work Stealing · HPDC 2015 |
Parallel and multicore computing › parallel programming runtimes
thread management |
0.1 | 1 | 2015 | Uni-Address Threads: Scalable Thread Management for RDMA-Based Work Stealing · HPDC 2015 |
Automata and formal languages
finite automata |
0.1 | 1 | 2005 | Arithmetic Meyer sets and finite automata · Inf. Comput. 2005 |
Computational geometry
discrete geometry |
0.0 | 1 | 2005 | Arithmetic Meyer sets and finite automata · Inf. Comput. 2005 |
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | An Alternative Proof for an Aperiodic MonotileabstractAbstract We give a simple alternative proof that the monotile introduced by [14] is aperiodic. Shigeki Akiyama, Yoshiaki Araki |
Discret. Comput. Geom. | 1 |
| 2024 | Width Deviation of Convex Polygons
Shigeki Akiyama, Teturo Kamae |
Discret. Comput. Geom. | 1 |
| 2019 | Corona Limits of Tilings: Periodic Case
Shigeki Akiyama, Jonathan Caalim, Katsunobu Imai, Hajime Kaneko |
Discret. Comput. Geom. | 1 |
| 2017 | Invariant Measure of Rotational Beta Expansion and Tarski's Plank Problem
Shigeki Akiyama, Jonathan Caalim |
Discret. Comput. Geom. | 1 |
| 2015 | Uni-Address Threads: Scalable Thread Management for RDMA-Based Work StealingabstractTask-parallel systems have been widely used to parallelize programs. They provide automatic load balancing and programmers can easily parallelize sequential programs, including irregular ones, without considering task placement to physical processors. Shigeki Akiyama, Kenjiro Taura |
HPDC | 1 |
| 2012 | A Note on Aperiodic Ammann Tiles
Shigeki Akiyama |
Discret. Comput. Geom. | 1 |
| 2005 | Arithmetic Meyer sets and finite automata
Shigeki Akiyama, Frédérique Bassino, Christiane Frougny |
Inf. Comput. | 1 |
| 2004 | Automata for Arithmetic Meyer Sets
Shigeki Akiyama, Frédérique Bassino, Christiane Frougny |
LATIN | 1 |
| 2002 | On canonical number systems
Shigeki Akiyama, Attila Pethö |
Theor. Comput. Sci. | 1 |