( en | de | ru )

 

Disambiguation of "Katoh, Naoki"

Author of the publication

copydeleteadd this publication to your clipboard
Multiversion Cautious Schedulers for Database Concurrency Control.

, , and . IEEE Trans. Software Eng., 16 (3): 302-315 (1990)

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.

Eishow Katoh

Eishow Katoh

Naoki Yoshida

Marcus Katoh

Eishow Katoh

 

Other publications of authors with the same name

The Line-Constrained Maximum Coverage Facility Location Problem., , , and . COCOA (1), volume 14461 of Lecture Notes in Computer Science, page 406-418. Springer, (2023)Online Exploration of All Vertices in a Simple Polygon., and . FAW-AAIM, volume 7285 of Lecture Notes in Computer Science, page 315-326. Springer, (2012)An Efficient Algorithm for the Evacuation Problem in a Certain Class of a Network with Uniform Path-Lengths., , and . AAIM, volume 4508 of Lecture Notes in Computer Science, page 178-190. Springer, (2007)Multiple Sink Location Problems in Dynamic Path Networks., , and . AAIM, volume 8546 of Lecture Notes in Computer Science, page 149-161. Springer, (2014)A Rooted-Forest Partition with Uniform Vertex Demand., and . WALCOM, volume 5942 of Lecture Notes in Computer Science, page 179-190. Springer, (2010)Minimax Regret 1-Sink Location Problems in Dynamic Path Networks., , , , , and . TAMC, volume 7876 of Lecture Notes in Computer Science, page 121-132. Springer, (2013)A Geometric Spanner of Segments., , , and . Int. J. Comput. Geom. Appl., 20 (1): 43-67 (2010)Continuous Folding of Regular Dodecahedra., , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 120-131. Springer, (2015)Geometric p-Center Problems with Centers Constrained to Two Lines., , , , , and . JCDCGG, volume 9943 of Lecture Notes in Computer Science, page 24-36. Springer, (2015)A New Probabilistic Analysis of Karger's Randomized Algorithm for Minimum Cut Problems., , and . Inf. Process. Lett., 64 (5): 255-261 (1997)