( en | de | ru )

 

Disambiguation of "Masuzawa, Toshimitsu"

Author of the publication

copydeleteadd this publication to your clipboard
A layout adjustment problem for disjoint rectangles preserving orthogonal order.

, , , and . Syst. Comput. Jpn., 33 (2): 31-42 (2002)

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)A Method for Evaluating Efficiency of Protocols on the Asynchronous Shared-State Model., , and . Self-Stabilizing Systems, volume 2704 of Lecture Notes in Computer Science, page 141-153. Springer, (2003)Brief Announcement: An Adaptive Randomised Searching Protocol in Peer-to-Peer Systems Based on Probabilistic Weak Quorum System., , , , and . SSS, volume 4280 of Lecture Notes in Computer Science, page 586-587. Springer, (2006)Brief Announcement: Space-Efficient Uniform Deployment of Mobile Agents in Asynchronous Unidirectional Rings., , and . SSS, volume 10616 of Lecture Notes in Computer Science, page 489-493. Springer, (2017)A Self-Stabilizing Link-Coloring Protocol in Tree Networks with Permanent Byzantine Faults., , and . J. Aerosp. Comput. Inf. Commun., 3 (8): 420-436 (2006)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)Efficient Dispersion of Mobile Agents without Global Knowledge., , , and . SSS, volume 12514 of Lecture Notes in Computer Science, page 280-294. Springer, (2020)Loosely-Stabilizing Leader Election in Population Protocol Model., , , , , and . SIROCCO, volume 5869 of Lecture Notes in Computer Science, page 295-308. Springer, (2009)A distributed shortest-paths algorithm with distance-dependent message complexities., , and . Syst. Comput. Jpn., 25 (9): 53-66 (1994)An Interest-Based Peer Clustering Algorithm Using Ant Paradigm., and . BioADIT, volume 3853 of Lecture Notes in Computer Science, page 379-386. Springer, (2006)