Author of the publication

Learning Deterministic even Linear Languages From Positive Examples.

, , and . Theor. Comput. Sci., 185 (1): 63-79 (1997)

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

Reducing Complexity Assumptions for Oblivious Transfer., and . IACR Cryptology ePrint Archive, (2008)Typed pattern languages and their learnability.. EuroCOLT, volume 904 of Lecture Notes in Computer Science, page 367-379. Springer, (1995)Private Comparison Protocol and Its Application to Range Queries., , , and . IDCS, volume 10794 of Lecture Notes in Computer Science, page 128-141. Springer, (2017)Universal Test for Quantum One-Way Permutations., , , and . MFCS, volume 3153 of Lecture Notes in Computer Science, page 839-850. Springer, (2004)Multiple Linear Cryptanalysis of a Reduced Round RC6., , and . FSE, volume 2365 of Lecture Notes in Computer Science, page 76-88. Springer, (2002)Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication., and . ISIT, page 2614-2618. IEEE, (2018)Decision Tree Learning Systems with Switching Evaluators.. AI, volume 1081 of Lecture Notes in Computer Science, page 349-361. Springer, (1996)Fully Secure Lattice-Based Group Signatures with Verifier-Local Revocation., and . AINA, page 795-802. IEEE Computer Society, (2017)Perfectly Secure Message Transmission Against Rational Timid Adversaries., , and . GameSec, volume 11199 of Lecture Notes in Computer Science, page 127-144. Springer, (2018)Universal test for quantum one-way permutations., , , and . Theor. Comput. Sci., 345 (2-3): 370-385 (2005)