( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Toward Sustainable Insights, or Why Polygamy is Bad for You.

, , , , , и . CIDR, www.cidrdb.org, (2017)

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.

Lorenzo Cubillos

Lorenzo Pettazzi

Lorenzo Sguaitamatti

Lorenzo Zani

Lorenzo Guiducci

 

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

On the I/O complexity of hybrid algorithms for Integer Multiplication.. CoRR, (2019)Tiered sampling: An efficient method for approximate counting sparse motifs in massive graph streams., , и . IEEE BigData, стр. 776-786. IEEE Computer Society, (2017)The DAG Visit Approach for Pebbling and I/O Lower Bounds., и . FSTTCS, том 250 из LIPIcs, стр. 7:1-7:23. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2022)TRIÈST: Counting Local and Global Triangles in Fully Dynamic Streams with Fixed Memory Size., , , и . ACM Trans. Knowl. Discov. Data, 11 (4): 43:1-43:50 (2017)Exploiting non-constant safe memory in resilient algorithms and data structures, и . CoRR, (2013)VizRec: A framework for secure data exploration via visual representation., , , и . CoRR, (2018)The I/O Complexity of Strassen's Matrix Multiplication with Recomputation., и . WADS, том 10389 из Lecture Notes in Computer Science, стр. 181-192. Springer, (2017)VizCertify: A Framework for Secure Visual Data Exploration., , , и . DSAA, стр. 241-251. IEEE, (2019)The I/O Complexity of Hybrid Algorithms for Square Matrix Multiplication.. ISAAC, том 149 из LIPIcs, стр. 33:1-33:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2019)TRIÈST: Counting Local and Global Triangles in Fully-Dynamic Streams with Fixed Memory Size., , , и . KDD, стр. 825-834. ACM, (2016)