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.

 

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

Faster Online Matrix-Vector Multiplication., и . CoRR, (2016)A Faster External Memory Priority Queue with DecreaseKeys., и . CoRR, (2018)I/O-Efficient Data Structures for Colored Range and Prefix Reporting, и . CoRR, (2011)Adapt or Die: Polynomial Lower Bounds for Non-Adaptive Dynamic Data Structures, и . CoRR, (2012)Crossing the logarithmic barrier for dynamic Boolean data structure lower bounds., , и . STOC, стр. 978-989. ACM, (2018)Optimal Minimal Margin Maximization with Boosting., , и . ICML, том 97 из Proceedings of Machine Learning Research, стр. 4392-4401. PMLR, (2019)DecreaseKeys are expensive for external memory priority queues., , и . STOC, стр. 1081-1093. ACM, (2017)Towards Tight Lower Bounds for Range Reporting on the RAM., и . ICALP, том 55 из LIPIcs, стр. 92:1-92:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Linear-Space Data Structures for Range Mode Query in Arrays., , , , и . STACS, том 14 из LIPIcs, стр. 290-301. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2012)Optimal Planar Orthogonal Skyline Counting Queries., и . SWAT, том 8503 из Lecture Notes in Computer Science, стр. 110-121. Springer, (2014)