( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs.

, , , и . TAPAS, том 6595 из Lecture Notes in Computer Science, стр. 92-103. Springer, (2011)

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.

Luca Crescenzi

Pierluigi Casale

Pierluigi Ramadori

Pierluigi Migliano

Pierluigi Nuzzo

 

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

To Weight or Not to Weight: Where is the Question?, , и . ISTCS, стр. 68-77. IEEE Computer Society, (1996)How to find the best approximation results., и . SIGACT News, 29 (4): 90-97 (1998)Greedily Improving Our Own Closeness Centrality in a Network., , , и . ACM Trans. Knowl. Discov. Data, 11 (1): 9:1-9:32 (2016)Reversible Simulation of Space-Bounded Computations., и . Theor. Comput. Sci., 143 (1): 159-165 (1995)On Computing the Diameter of (Weighted) Link Streams., , и . SEA, том 190 из LIPIcs, стр. 11:1-11:21. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2021)Adapting moodle to better support CS education., , , , , и . ITiCSE-WGR, стр. 15-27. ACM, (2010)From theory to practice: NP-completeness for every CS student., , и . ITiCSE, стр. 16-21. ACM, (2013)Analyzing and Comparing On-Line News Sources via (Two-Layer) Incremental Clustering., , и . FUN, том 49 из LIPIcs, стр. 9:1-9:14. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)A Short Guide to Approximation Preserving Reductions.. CCC, стр. 262-273. IEEE Computer Society, (1997)Finding the Diameter in Real-World Graphs - Experimentally Turning a Lower Bound into an Upper Bound., , , , и . ESA (1), том 6346 из Lecture Notes in Computer Science, стр. 302-313. Springer, (2010)