From post

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.

 

Другие публикации лиц с тем же именем

Optimal Oblivious RAM and Its Extensions.. Cornell University, USA, (2021)Sorting Short Keys in Circuits of Size o(n log n)., , и . SODA, стр. 2249-2268. SIAM, (2021)Co-evolvability of games in coevolutionary genetic algorithms., и . GECCO, стр. 1869-1870. ACM, (2009)Low-jitter, plain vanilla CMOS CDR with half-rate linear PD and half rate frequency detector., , , и . VLSI-SoC, стр. 1-6. IEEE, (2017)Can We Overcome the n log n Barrier for Oblivious Sorting?, , и . SODA, стр. 2419-2438. SIAM, (2019)A File Verification Scheme Based on Verkle Trees., и . ICCE-Taiwan, стр. 295-296. IEEE, (2023)Oblivious RAM with Worst-Case Logarithmic Overhead., , , и . CRYPTO (4), том 12828 из Lecture Notes in Computer Science, стр. 610-640. Springer, (2021)Deep Learning-based AOI System for Detecting Component Marks., , , и . BigComp, стр. 243-247. IEEE, (2023)Automatic path modeling by image processing techniques., и . ICMLC, стр. 2589-2594. IEEE, (2010)OptORAMa: Optimal Oblivious RAM., , , , , и . EUROCRYPT (2), том 12106 из Lecture Notes in Computer Science, стр. 403-432. Springer, (2020)