( en | de | ru )

 

Disambiguation of "Tatsuta, Makoto"

Author of the publication

copydeleteadd this publication to your clipboard
Micro-Clustering: Finding Small Clusters in Large Diversity.

, , , , , and . CoRR, (2015)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Makoto Yamamoto

Makoto Nakamura

Makoto Arai

Makoto Ida

Makoto Kobayashi

 

Other publications of authors with the same name

Realizability of Monotone Coinductive Definitions and Its Application to Program Synthesis.. MPC, volume 1422 of Lecture Notes in Computer Science, page 338-364. Springer, (1998)Non-Commutative Infinitary Peano Arithmetic., and . CSL, volume 12 of LIPIcs, page 538-552. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2011)Equivalence of Intuitionistic Inductive Definitions and Intuitionistic Cyclic Proofs under Arithmetic., and . CoRR, (2017)Completeness of Cyclic Proofs for Symbolic Heaps., , and . CoRR, (2018)The function ëa/mûa/min sharply bounded arithmetic., and . Arch. Math. Log., 37 (1): 51-57 (1997)Internal models of system F for decompilation., and . Theor. Comput. Sci., (2012)Completeness of Pointer Program Verification by Separation Logic., , and . SEFM, page 179-188. IEEE Computer Society, (2009)Program Synthesis Using Realizability.. Theor. Comput. Sci., 90 (2): 309-353 (1991)A Decidable Fragment in Separation Logic with Inductive Predicates and Arithmetic., , , and . CAV (2), volume 10427 of Lecture Notes in Computer Science, page 495-517. Springer, (2017)Positive Arithmetic Without Exchange Is a Subclassical Logic., and . APLAS, volume 4807 of Lecture Notes in Computer Science, page 271-285. Springer, (2007)