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 VLDB 2026 / reviewers in the wild / expert

Akihiro Nozaki

dblp:92/1676 · DBLP profile ↗
← Back
10ranked-venue papers
6as first author
0since 2021 · last 2003
—ORCID · none

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

Theory of computation · 9 · 6 first-authorDatabases, data management, data science and information retrieval · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1

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
2 papers
Automata and formal languages · 70% Logic in computer science · 30%

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

TopicWeightPapersLastEvidence papers
Automata and formal languages › algebraic automata theory
automata decomposition		 0.011978
Practical Decomposition of Automata · Inf. Control. 1978
Automata and formal languages
finite automata		 0.011978
Practical Decomposition of Automata · Inf. Control. 1978
Logic in computer science › algebraic logic
functional completeness		 0.011977
A Completeness Criterion for Spectra · SIAM J. Comput. 1977
YearPublicationVenuePosition
2003 The optimality of a certain purely recursive dissection for a sequentially n-divisible square
Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa, Toshinori Sakai
 Comput. Geom.3
1999 A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains
Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg
 Discret. Appl. Math.2
1979 A Note on the Complexity of Approximative Evaluation of Polynomials
Akihiro Nozaki
 Inf. Process. Lett.1
1979 Equivalence Problem of Non-Deterministic Finite Automata
Akihiro Nozaki
 J. Comput. Syst. Sci.1
1979 Sorting Using Networks of Deques
Akihiro Nozaki
 J. Comput. Syst. Sci.1
1979 Corrigenda: A Completeness Criterion for Spectra
Teruo Hikita, Akihiro Nozaki
 SIAM J. Comput.2
1978 Practical Decomposition of Automata
Akihiro Nozaki
 Inf. Control.1
1977 A Completeness Criterion for Spectra
abstract
A spectrum is an algebraic representation of a set of “switching elements” each of which carries out an operation in a definite time lag. The notion of functional completeness ($\sim $-completeness) in the family of spectra was introduced by V. B. Kudryavcev and A. Nozaki. In this paper we investigate the maximal incomplete spectra and thus give a new effective criterion for a spectrum to be functionally complete.
Teruo Hikita, Akihiro Nozaki
 SIAM J. Comput.2
1976 Hazard Analysis of Asynchronous Circuits in Muller-Bartky's Sense
Akihiro Nozaki
 J. Comput. Syst. Sci.1
1973 Two Entropies of a Generalized Sorting Problem
Akihiro Nozaki
 J. Comput. Syst. Sci.1