Author of the publication

New bounds on the diameter vulnerability of iterated line digraphs.

, and . Discret. Math., 233 (1-3): 103-113 (2001)

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.

 

Other publications of authors with the same name

Secret sharing schemes on sparse homogeneous access structures with rank three., and . IACR Cryptology ePrint Archive, (2003)Optimal Algebraic Manipulation Detection Codes in the Constant-Error Model., , and . TCC (1), volume 9014 of Lecture Notes in Computer Science, page 481-501. Springer, (2015)Secret Sharing, Rank Inequalities and Information Inequalities., , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 277-288. Springer, (2013)A Note on Secure Computation of the Moore-Penrose Pseudoinverse and Its Application to Secure Linear Algebra., , and . CRYPTO, volume 4622 of Lecture Notes in Computer Science, page 613-630. Springer, (2007)On Secret Sharing with Nonlinear Product Reconstruction., , , , and . SIAM J. Discret. Math., 29 (2): 1114-1131 (2015)Common information, matroid representation, and secret sharing for matroid ports., , , and . Des. Codes Cryptogr., 89 (1): 143-166 (2021)Ideal Multipartite Secret Sharing Schemes., , and . EUROCRYPT, volume 4515 of Lecture Notes in Computer Science, page 448-465. Springer, (2007)Spanners of Underlying Graphs of Iterated Line Digraphs., and . SIROCCO, page 180-194. Carleton Scientific, (1996)Secret sharing schemes with three or four minimal qualified subsets., and . IACR Cryptology ePrint Archive, (2002)Matroids Can Be Far from Ideal Secret Sharing., , and . TCC, volume 4948 of Lecture Notes in Computer Science, page 194-212. Springer, (2008)