( en | de | ru )

 

Disambiguation of "Kawachi, Akinori"

Author of the publication

copydeleteadd this publication to your clipboard
Derandomizing Arthur-Merlin Games and Approximate Counting Implies Exponential-Size Lower Bounds.

, and . CCC, page 38-49. IEEE Computer Society, (2010)

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.

Akinori Shiotani

 

Other publications of authors with the same name

Approximated Two Choices in Randomized Load Balancing., and . ISAAC, volume 3341 of Lecture Notes in Computer Science, page 545-557. Springer, (2004)General Constructions of Rational Secret Sharing with Expected Constant-Round Reconstruction., , , and . Comput. J., 60 (5): 711-728 (2017)Computational Indistinguishability Between Quantum States and Its Cryptographic Application., , , and . EUROCRYPT, volume 3494 of Lecture Notes in Computer Science, page 268-284. Springer, (2005)Hard Functions for Low-Degree Polynomials over Prime Fields., , and . MFCS, volume 6907 of Lecture Notes in Computer Science, page 120-131. Springer, (2011)Generalized Predecessor Existence Problems for Boolean Finite Dynamical Systems., , and . MFCS, volume 83 of LIPIcs, page 8:1-8:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)Randomness Bounds for Private Simultaneous Messages and Conditional Disclosure of Secrets., and . IACR Cryptol. ePrint Arch., (2021)Compact routing with stretch factor of less than three (brief announcement)., and . PODC, page 337. ACM, (2000)Quantum Sampling for Balanced Allocations., , and . COCOON, volume 2697 of Lecture Notes in Computer Science, page 304-318. Springer, (2003)Progress in Quantum Computational Cryptography., and . J. Univers. Comput. Sci., 12 (6): 691-709 (2006)Improved algorithms for quantum identification of Boolean oracles., , , , and . Theor. Comput. Sci., 378 (1): 41-53 (2007)