( en | de | ru )

 

Disambiguation of "Masuyama, Shigeru"

Author of the publication

copydeleteadd this publication to your clipboard
Acceleration of Byzantine Fault Tolerance by Parallelizing Consensuses.

, , and . PDCAT, page 80-87. IEEE Computer Society, (2009)

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.

Shigeru Noda

Shigeru Taguchi

 

Other publications of authors with the same name

Polarity Assignment to Causal Information Extracted from Financial Articles Concerning Business Performance of Companies., and . SGAI Conf., page 307-320. Springer, (2008)A Lower Bound of the Expected Maximum Number of Edge-disjoint S-t Paths on Probabilistic Graphs., and . Discret. Appl. Math., 56 (2-3): 137-155 (1995)Linear Time Algorithms for Finding Articulation and Hinge Vertices of Circular Permutation Graphs., , , and . IEICE Trans. Inf. Syst., 96-D (3): 419-425 (2013)Cause Information Extraction from Financial Articles Concerning Business Performance., and . IEICE Trans. Inf. Syst., 91-D (4): 959-968 (2008)Properties on the Average Number of Spanning Trees in Connected Spanning Subgraphs for an Undirected Graph., and . IEICE Trans. Fundam. Electron. Commun. Comput. Sci., 86-A (5): 1027-1033 (2003)Classification of Comments on Nico Nico Douga for Annotation Based on Referred Contents., , , and . NBiS, page 673-678. IEEE Computer Society, (2015)A Multiple-Document Summarization System with User Interaction., and . COLING, (2004)Extracting Causal Knowledge Using Clue Phrases and Syntactic Patterns., , and . PAKM, volume 5345 of Lecture Notes in Computer Science, page 111-122. Springer, (2008)Erratum and addendum to Ä linear time algorithm for finding all hinge vertices of a permutation graph" Information Processing Letters 59 (2) (1996) 103-107., , and . Inf. Process. Lett., 111 (18): 891-894 (2011)On the Equivalence in Complexity Among Three Computation Problems on Maximum Number of Edge-Disjoint s-t Paths in a Probabilistic Graph., and . Inf. Process. Lett., 51 (4): 195-199 (1994)