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.

 

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

Breaking the 2n barrier for 5-coloring and 6-coloring.. CoRR, (2020)Testing Sumsets is Hard., , , , и . CoRR, (2024)Undetectable Watermarks for Language Models., , и . IACR Cryptol. ePrint Arch., (2023)The amortized cost of finding the minimum., , и . SODA, стр. 757-768. SIAM, (2015)Tight Space Complexity of the Coin Problem., , и . FOCS, стр. 1068-1079. IEEE, (2021)Subtree Isomorphism Revisited., , , , и . ACM Trans. Algorithms, 14 (3): 27:1-27:23 (2018)Bottleneck Paths and Trees and Deterministic Graphical Games., , , , и . STACS, том 47 из LIPIcs, стр. 27:1-27:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Excuse me, sir? Your language model is leaking (information).. CoRR, (2024)A sort of an adversary., , и . SODA, стр. 1291-1310. SIAM, (2019)Dynamic Ordered Sets with Approximate Queries, Approximate Heaps and Soft Heaps., , и . ICALP, том 132 из LIPIcs, стр. 95:1-95:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)