( en | de | ru )

 

Disambiguation of "Nishizeki, Takao"

Author of the publication

copydeleteadd this publication to your clipboard
Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key.

, , and . EUROCRYPT, volume 1592 of Lecture Notes in Computer Science, page 389-401. Springer, (1999)

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.

Takao Tsuboi

Takao Ito

Mario Takao Inoue

 

Other publications of authors with the same name

Nearly uniform scheduling of file transfers., and . IPCO, page 425-431. CIACO, (1993)Multicommodity Flows in Planar Undirected Graphs and Shortest Paths, , and . STOC, page 195-204. ACM, (1985)Dealing Necessary and Sufficient Numbers of Cards for Sharing a One-Bit Secret Key., , and . EUROCRYPT, volume 1592 of Lecture Notes in Computer Science, page 389-401. Springer, (1999)Best Security Index for Digital Fingerprinting., , , and . Information Hiding, volume 3727 of Lecture Notes in Computer Science, page 398-412. Springer, (2005)Spanning Distribution Trees of Graphs., and . FAW-AAIM, volume 7924 of Lecture Notes in Computer Science, page 153-162. Springer, (2013)Scheduling File Transfers under Port and Channel Constraints., and . ISA, volume 557 of Lecture Notes in Computer Science, page 43-51. Springer, (1991)A Linear-Time Algorithm to Find Four Independent Spanning Trees in Four-Connected Planar Graphs., , , and . WG, volume 1517 of Lecture Notes in Computer Science, page 310-323. Springer, (1998)Convex Grid Drwaings of Four-Connected Plane Graphs., , and . ISAAC, volume 1969 of Lecture Notes in Computer Science, page 254-265. Springer, (2000)Inner Rectangular Drawings of Plane Graphs., , and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 693-704. Springer, (2004)A Parallel Algorithm for Edge-Coloring Partial k-Trees., , and . SWAT, volume 824 of Lecture Notes in Computer Science, page 359-369. Springer, (1994)