Search the dblp DataBase

Publications of Author

1. Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg
   Semigrid Sets of Central Relations Over a Finite Domain. [Citation Graph (0, 0)][DBLP]
   ISMVL, 1992, pp:300-307 [Conf]
   
2. Akihiro Nozaki, Vaktang Lashkia
   A Finite Basis of the Set of All Monotone Partial Functions Defined over a Finite Poset. [Citation Graph (0, 0)][DBLP]
   ISMVL, 1998, pp:380-382 [Conf]
   
3. Akihiro Nozaki, Grant Pogosyan, Masahiro Miyakawa, Ivo G. Rosenberg
   Semirigid Sets of Quasilinear Clones. [Citation Graph (0, 0)][DBLP]
   ISMVL, 1993, pp:105-110 [Conf]
   
4. Grant Pogosyan, Akihiro Nozaki
   Join-Irreducible Clones of Multiple-Valued Logic Algebra. [Citation Graph (0, 0)][DBLP]
   ISMVL, 1995, pp:194-199 [Conf]
   
5. Grant Pogosyan, Akihiro Nozaki, Masahiro Miyakawa, Ivo G. Rosenberg
   Hereditary Clones of Mulitple Valued Logic Algebra. [Citation Graph (0, 0)][DBLP]
   ISMVL, 1994, pp:306-313 [Conf]
   
6. Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa
   A Note on the Purely Recursive Dissection for a Sequentially n-Divisible Square. [Citation Graph (0, 0)][DBLP]
   JCDCG, 2000, pp:41-52 [Conf]
   
7. Akihiro Nozaki
   More on integer conversion. [Citation Graph (0, 0)][DBLP]
   Commun. ACM, 1964, v:7, n:10, pp:571- [Journal]
   
8. Jin Akiyama, Gisaku Nakamura, Akihiro Nozaki, Ken'ichi Ozawa, Toshinori Sakai
   The optimality of a certain purely recursive dissection for a sequentially n-divisible square. [Citation Graph (0, 0)][DBLP]
   Comput. Geom., 2003, v:24, n:1, pp:27-39 [Journal]
   
9. Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg
   A Map From the Lower-half of the n-cube Onto the (n-1)-cube Which Preserves Intersecting Antichains. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1999, v:92, n:2-3, pp:223-228 [Journal]
   
10. Akihiro Nozaki
    Practical Decomposition of Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1978, v:36, n:3, pp:275-291 [Journal]
    
11. Akihiro Nozaki
    A Note on the Complexity of Approximative Evaluation of Polynomials. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1979, v:9, n:2, pp:73-75 [Journal]
    
12. Akihiro Nozaki
    Two Entropies of a Generalized Sorting Problem. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1973, v:7, n:6, pp:615-621 [Journal]
    
13. Akihiro Nozaki
    Hazard Analysis of Asynchronous Circuits in Muller-Bartky's Sense. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1976, v:13, n:2, pp:161-171 [Journal]
    
14. Akihiro Nozaki
    Equivalence Problem of Non-Deterministic Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:18, n:1, pp:8-17 [Journal]
    
15. Akihiro Nozaki
    Sorting Using Networks of Deques. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1979, v:19, n:3, pp:309-315 [Journal]
    
16. Teruo Hikita, Akihiro Nozaki
    A Completeness Criterion for Spectra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1977, v:6, n:2, pp:285-297 [Journal]
    
17. Teruo Hikita, Akihiro Nozaki
    Corrigenda: A Completeness Criterion for Spectra. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:4, pp:656- [Journal]
    
18. Vaktang Lashkia, Masahiro Miyakawa, Akihiro Nozaki, Grant Pogosyan, Ivo G. Rosenberg
    Semirigid sets of diamond orders. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:156, n:1-3, pp:277-283 [Journal]