Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page
Demo Data from EDBT 2026 / reviewers in the wild / expert

Seiichi Tani

dblp:32/1558 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2014
0000-0001-7773-3585ORCID · corroborated

Domains — the database's venue-derived domains; a paper can count in several

Theory of computation · 3

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.

Theoretical computer science
1 paper
Combinatorics and discrete mathematics · 33% Computational geometry · 33% Computational complexity · 33%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational complexity
complexity classes		 0.112005
Unknotting is in AM cup co-AM · SODA 2005
Combinatorics and discrete mathematics › topology
knot theory		 0.112005
Unknotting is in AM cup co-AM · SODA 2005
Computational geometry › computational topology
unknotting problem		 0.112005
Unknotting is in AM cup co-AM · SODA 2005
YearPublicationVenuePosition
2014 Computing HOMFLY polynomials of 2-bridge links from 4-plat representation
Masahiko Murakami, Fumio Takeshita, Seiichi Tani
 Discret. Appl. Math.3
2007 Fast algorithms for computing Jones polynomials of certain links
Masahiko Murakami, Masao Hara, Makoto Yamamoto, Seiichi Tani
 Theor. Comput. Sci.4
2005 Unknotting is in AM cup co-AM
Masao Hara, Seiichi Tani, Makoto Yamamoto
 SODA2