The SCEAS System
| |||||||

## Search the dblp DataBase
Hajime Machida:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Lucien Haddad, Hajime Machida, Ivo G. Rosenberg
**On the Intersection of Maximal Partial Clones and the Join of Minimal Partial Clones.**[Citation Graph (0, 0)][DBLP] ISMVL, 2000, pp:396-401 [Conf] - Lucien Haddad, Hajime Machida, Ivo G. Rosenberg
**Theoretical Basis of Commutation Theory for Partial Clones.**[Citation Graph (0, 0)][DBLP] ISMVL, 2006, pp:22- [Conf] - Hajime Machida
**Finitary Approximations and Metric Structure of the Space of Clones.**[Citation Graph (0, 0)][DBLP] ISMVL, 1995, pp:200-205 [Conf] - Hajime Machida
**Some Continuous Maps on the Space of Clones in Multiple-Valued Logic.**[Citation Graph (0, 0)][DBLP] ISMVL, 1998, pp:374-379 [Conf] - Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg
**Relations between Clones and Full Monoids.**[Citation Graph (0, 0)][DBLP] ISMVL, 2001, pp:279-0 [Conf] - Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg
**Some Results on the Centralizers of Monoids in Clone Theory.**[Citation Graph (0, 0)][DBLP] ISMVL, 2002, pp:10-16 [Conf] - Hajime Machida, Michael Pinsker
**Some Observations on Minimal Clones.**[Citation Graph (0, 0)][DBLP] ISMVL, 2006, pp:24- [Conf] - Hajime Machida, Ivo G. Rosenberg
**On the Centralizers of Monoids in Clone Theory.**[Citation Graph (0, 0)][DBLP] ISMVL, 2003, pp:303-308 [Conf] - Hajime Machida, Ivo G. Rosenberg
**Monoids whose Centralizer is the Least Clone.**[Citation Graph (0, 0)][DBLP] ISMVL, 2004, pp:102-108 [Conf] - Hajime Machida, Ivo G. Rosenberg
**Centralizers of Monoids Containing the Symmetric Group.**[Citation Graph (0, 0)][DBLP] ISMVL, 2005, pp:227-233 [Conf] - Ivo G. Rosenberg, Hajime Machida
**Gigantic Pairs of Minimal Clones.**[Citation Graph (0, 0)][DBLP] ISMVL, 1999, pp:74-79 [Conf] - Masahiro Miyakawa, Ivan Stojmenovic, Teruo Hikita, Hajime Machida, Rusins Freivalds
**Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions.**[Citation Graph (0, 0)][DBLP] Elektronische Informationsverarbeitung und Kybernetik, 1988, v:24, n:6, pp:251-266 [Journal] - Kohei Noshita, Etsuo Masuda, Hajime Machida
**On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs.**[Citation Graph (0, 0)][DBLP] Inf. Process. Lett., 1978, v:7, n:5, pp:237-243 [Journal] - Lucien Haddad, Hajime Machida, Ivo G. Rosenberg
**Maximal and Minimal Partial Clones.**[Citation Graph (0, 0)][DBLP] Journal of Automata, Languages and Combinatorics, 2002, v:7, n:1, pp:83-93 [Journal] - Hajime Machida, Takumi Kasai
**Space Complexity in On-Line Computation.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 1982, v:24, n:3, pp:362-372 [Journal] **Majority and Other Polynomials in Minimal Clones.**[Citation Graph (, )][DBLP]**On Maximal Hyperclones on {0, 1} — A New Approach.**[Citation Graph (, )][DBLP]**Polynomials as Generators of Minimal Clones.**[Citation Graph (, )][DBLP]**Monoidal Intervals of Partial Clones.**[Citation Graph (, )][DBLP]**On Endoprimal Monoids in Clone Theory.**[Citation Graph (, )][DBLP]**Hyperclones Determined by Total-Parts of Hyper-relations.**[Citation Graph (, )][DBLP]**Endoprimal Monoids and Witness Lemma in Clone Theory.**[Citation Graph (, )][DBLP]**Galois Connection for Hyperclones.**[Citation Graph (, )][DBLP]
Search in 0.005secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |