default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHajime Machida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[c42]Hajime Machida:
Orderly Majority Functions with their Relation to Minimal Clones. ISMVL 2024: 1-6- 2023
- [j21]Hajime Machida:
A Study on Centralizing Monoids with Majority Operation Witnesses. Sci. Ann. Comput. Sci. 33(1): 79-92 (2023) - [c41]Hajime Machida:
Search for Some Majority Operation and Studies of its Centralizing Monoid. ISMVL 2023: 122-127 - 2022
- [c40]Hajime Machida:
Centralizing Monoids, Majority Operations and the Słupecki Clone. ISMVL 2022: 62-67 - 2021
- [j20]Hajime Machida, Péter P. Pálfy:
Self-commuting Operations. J. Multiple Valued Log. Soft Comput. 36(4-5): 383-390 (2021) - 2020
- [j19]Hajime Machida:
Introduction. J. Multiple Valued Log. Soft Comput. 34(3-4): 201 (2020) - [c39]Mike Behrisch
, Hajime Machida:
On Minimality of Some Binary Clones Related to Unary Functions. ISMVL 2020: 297-302
2010 – 2019
- 2019
- [j18]Hajime Machida, Jovanka Pantovic:
Closed Sets of Monomials in Two Variables Generated by Singletons. J. Multiple Valued Log. Soft Comput. 33(3): 219-238 (2019) - [c38]Mike Behrisch, Hajime Machida:
An Approach Toward Classification of Minimal Groupoids on a Finite Set. ISMVL 2019: 164-169 - 2018
- [j17]Hajime Machida:
Introduction. J. Multiple Valued Log. Soft Comput. 31(3): 211 (2018) - [j16]Hajime Machida, Jovanka Pantovic:
Monomial Clones Over Small Finite Fields. J. Multiple Valued Log. Soft Comput. 31(3): 271-286 (2018) - [c37]Hajime Machida, Jovanka Pantovic:
One Class of Maximal Binary Monomials. ISMVL 2018: 80-84 - [c36]Hajime Machida, Ivo G. Rosenberg:
Commutation for Functions of Small Arity Over a Finite Set. ISMVL 2018: 85-90 - 2017
- [j15]Hajime Machida:
Preface. J. Multiple Valued Log. Soft Comput. 28(1): 1-4 (2017) - [c35]Hajime Machida, Jovanka Pantovic:
Three Classes of Closed Sets of Monomials. ISMVL 2017: 100-105 - [c34]Hajime Machida, Ivo G. Rosenberg:
Centralizing Monoids and the Arity of Witnesses. ISMVL 2017: 236-241 - 2016
- [c33]Hajime Machida, Jovanka Pantovic:
Monomial Clones: Local Results and Global Properties. ISMVL 2016: 78-83 - [c32]Hajime Machida, Ivo G. Rosenberg:
Centralizing Monoids on a Three-Element Set Related to Binary Idempotent Functions. ISMVL 2016: 84-89 - 2015
- [j14]Jelena Colic, Hajime Machida, Jovanka Pantovic:
Upward Saturated Hyperclones. J. Multiple Valued Log. Soft Comput. 24(1-4): 189-201 (2015) - [c31]Hajime Machida, Tamás Waldhauser:
Lazy Clones and Essentially Minimal Groupoids. ISMVL 2015: 199-204 - [c30]Martin Goldstern, Hajime Machida, Ivo G. Rosenberg:
Some Classes of Centralizing Monoids on a Three-Element Set. ISMVL 2015: 205-210 - 2014
- [j13]Jelena Colic, Hajime Machida, Jovanka Pantovic:
One-point Extension of the Algebra of Incompletely Specified Operations. J. Multiple Valued Log. Soft Comput. 22(1-2): 79-94 (2014) - [c29]Hajime Machida, Ivo G. Rosenberg:
Essentially Minimal Clones of Rank 3 on a Three-Element Set. ISMVL 2014: 97-102 - 2013
- [c28]Hajime Machida, Ivo G. Rosenberg:
A Study on Essentially Minimal Clones. ISMVL 2013: 117-122 - [c27]Jelena Colic, Hajime Machida, Jovanka Pantovic:
On Hyper Co-Clones. ISMVL 2013: 182-185 - 2012
- [j12]Hajime Machida:
Editorial. J. Multiple Valued Log. Soft Comput. 18(2): 115-116 (2012) - [j11]Hajime Machida, Jovanka Pantovic:
Three Classes of Maximal Hyperclones. J. Multiple Valued Log. Soft Comput. 18(2): 201-210 (2012) - [j10]Hajime Machida, Ivo G. Rosenberg:
Some Centralizing Monoids on a Three-Element Set. J. Multiple Valued Log. Soft Comput. 18(2): 211-221 (2012) - [j9]Hajime Machida, Jovanka Pantovic, Ivo G. Rosenberg:
Regular Sets of Operations. J. Multiple Valued Log. Soft Comput. 19(1-3): 149-162 (2012) - [c26]Jelena Colic, Hajime Machida, Jovanka Pantovic:
Clones of Incompletely Specified Operations. ISMVL 2012: 256-261 - [c25]Hajime Machida, Ivo G. Rosenberg:
Centralizing Monoids on a Three-Element Set. ISMVL 2012: 274-280 - [c24]Hajime Machida, Teruo Hikita:
Honouring Ivo G. Rosenberg: His Contributions to ISMVL. ISMVL 2012: 322-330 - 2011
- [j8]Ivan Chajda, Radomír Halas, Hajime Machida:
Completeness of Order Algebras? J. Multiple Valued Log. Soft Comput. 17(1): 93-98 (2011) - [c23]Hajime Machida, Ivo G. Rosenberg:
Maximal Centralizing Monoids and their Relation to Minimal Clones. ISMVL 2011: 153-159 - [c22]Jelena Colic, Hajime Machida, Jovanka Pantovic:
Maximal Hyperclones Determined by Monotone Operations. ISMVL 2011: 160-163 - [c21]Hajime Machida, Lucien Haddad, Jovanka Pantovic:
Invitation to Clone Theory with Partial Clones and Hyperclones. ISMVL 2011: 205-212 - 2010
- [j7]Léonard Kwuida, Hajime Machida:
On the isomorphism problem of concept algebras. Ann. Math. Artif. Intell. 59(2): 223-239 (2010) - [c20]Hajime Machida, Ivo G. Rosenberg:
Endoprimal Monoids and Witness Lemma in Clone Theory. ISMVL 2010: 195-200 - [c19]Hajime Machida, Jovanka Pantovic, Ivo G. Rosenberg:
Galois Connection for Hyperclones. ISMVL 2010: 201-204
2000 – 2009
- 2009
- [j6]Hajime Machida, Jovanka Pantovic:
Maximal Hyperclones on E2 as Hypercores. J. Multiple Valued Log. Soft Comput. 15(4): 315-328 (2009) - [c18]Hajime Machida, Jovanka Pantovic:
Hyperclones Determined by Total-Parts of Hyper-relations. ISMVL 2009: 161-166 - [c17]Hajime Machida, Ivo G. Rosenberg:
On Endoprimal Monoids in Clone Theory. ISMVL 2009: 167-172 - 2008
- [c16]Hajime Machida, Jovanka Pantovic:
On Maximal Hyperclones on {0, 1} - A New Approach. ISMVL 2008: 32-37 - [c15]Hajime Machida, Tamás Waldhauser:
Majority and Other Polynomials in Minimal Clones. ISMVL 2008: 38-43 - 2007
- [j5]Hajime Machida, Michael Pinsker:
Some Polynomials Generating Minimal Clones. J. Multiple Valued Log. Soft Comput. 13(4-6): 353-366 (2007) - [c14]Hajime Machida, Michael Pinsker:
Polynomials as Generators of Minimal Clones. ISMVL 2007: 7 - [c13]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Monoidal Intervals of Partial Clones. ISMVL 2007: 9 - 2006
- [c12]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Theoretical Basis of Commutation Theory for Partial Clones. ISMVL 2006: 22 - [c11]Hajime Machida, Michael Pinsker:
Some Observations on Minimal Clones. ISMVL 2006: 24 - 2005
- [c10]Hajime Machida, Ivo G. Rosenberg:
Centralizers of Monoids Containing the Symmetric Group. ISMVL 2005: 227-233 - 2004
- [c9]Hajime Machida, Ivo G. Rosenberg:
Monoids whose Centralizer is the Least Clone. ISMVL 2004: 102-108 - 2003
- [c8]Hajime Machida, Ivo G. Rosenberg:
On the Centralizers of Monoids in Clone Theory. ISMVL 2003: 303-308 - 2002
- [j4]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
Maximal and Minimal Partial Clones. J. Autom. Lang. Comb. 7(1): 83-93 (2002) - [c7]Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg:
Some Results on the Centralizers of Monoids in Clone Theory. ISMVL 2002: 10-16 - 2001
- [c6]Hajime Machida, Masahiro Miyakawa, Ivo G. Rosenberg:
Relations between Clones and Full Monoids. ISMVL 2001: 279-286 - 2000
- [c5]Hajime Machida:
Some Properties of Hyperoperations and Hyperclones. Words, Languages & Combinatorics 2000: 286-296 - [c4]Lucien Haddad, Hajime Machida, Ivo G. Rosenberg:
On the Intersection of Maximal Partial Clones and the Join of Minimal Partial Clones. ISMVL 2000: 396-401
1990 – 1999
- 1999
- [c3]Ivo G. Rosenberg, Hajime Machida:
Gigantic Pairs of Minimal Clones. ISMVL 1999: 74-79 - 1998
- [c2]Hajime Machida:
Some Continuous Maps on the Space of Clones in Multiple-Valued Logic. ISMVL 1998: 374-379 - 1995
- [c1]Hajime Machida:
Finitary Approximations and Metric Structure of the Space of Clones. ISMVL 1995: 200-205
1980 – 1989
- 1988
- [j3]Masahiro Miyakawa, Ivan Stojmenovic, Teruo Hikita, Hajime Machida, Rusins Freivalds:
Sheffer and Symmetric Sheffer Boolean Functions under Various Functional Constructions. J. Inf. Process. Cybern. 24(6): 251-266 (1988) - 1982
- [j2]Hajime Machida, Takumi Kasai:
Space Complexity in On-Line Computation. J. Comput. Syst. Sci. 24(3): 362-372 (1982)
1970 – 1979
- 1978
- [j1]Kohei Noshita, Etsuo Masuda, Hajime Machida:
On the Expected Behaviors of the Dijkstra's Shortest Path Algorithm for Complete Graphs. Inf. Process. Lett. 7(5): 237-243 (1978)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-07 02:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
