( en | de | ru )

 

Disambiguation of "Masuzawa, Toshimitsu"

Author of the publication

copydeleteadd this publication to your clipboard
Design for Strong Testability of RTL Data Paths to Provide Complete Fault Efficiency.

, , , and . VLSI Design, page 300-305. IEEE Computer Society, (2000)

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.

No persons found for author name Masuzawa, Toshimitsu
add a person with the name Masuzawa, Toshimitsu
 

Other publications of authors with the same name

A Self-Stabilizing Minimal k-Grouping Algorithm., , , and . ICDCN, page 3. ACM, (2017)Parallelizability of Some P-Complete Problems., , and . IPDPS Workshops, volume 1800 of Lecture Notes in Computer Science, page 116-122. Springer, (2000)One-Step Consensus Solvability., and . DISC, volume 4167 of Lecture Notes in Computer Science, page 224-237. Springer, (2006)Brief Announcement: Loosely-stabilizing Leader Election with Polylogarithmic Convergence Time., , , and . DISC, volume 121 of LIPIcs, page 52:1-52:3. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2018)A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults., , and . J. Aerosp. Comput. Inf. Commun., 3 (8): 420-436 (2006)Efficient Dispersion of Mobile Agents without Global Knowledge., , , and . SSS, volume 12514 of Lecture Notes in Computer Science, page 280-294. Springer, (2020)A Communication-Efficient Self-stabilizing Algorithm for Breadth-First Search Trees., , and . OPODIS, volume 8878 of Lecture Notes in Computer Science, page 293-306. Springer, (2014)Loosely-Stabilizing Leader Election in Population Protocol Model., , , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 295-308. Springer, (2009)A cooperative partial snapshot algorithm for checkpoint-rollback recovery of large-scale and dynamic distributed systems and experimental evaluations., , , and . Concurr. Comput. Pract. Exp., (2021)A distributed shortest-paths algorithm with distance-dependent message complexities., , and . Syst. Comput. Jpn., 25 (9): 53-66 (1994)