( en | de | ru )

 

Disambiguation of "Crescenzi, Pierluigi"

Author of the publication

copydeleteadd this publication to your clipboard
Rumor spreading in random evolving graphs.

, , , , , and . Random Struct. Algorithms, 48 (2): 290-312 (2016)

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. You can also use the button next to the name to display some publications already assigned to the person.

Luca Crescenzi

Pierluigi Casale

Pierluigi Ramadori

Pierluigi Migliano

Pierluigi Nuzzo

 

Other publications of authors with the same name

On computing Pareto optimal paths in weighted time-dependent networks., , and . Inf. Process. Lett., (2021)A Uniform Approach to Define Complexity Classes., , and . Theor. Comput. Sci., 104 (2): 263-283 (1992)Finding Top-k Nodes for Temporal Closeness in Large Temporal Graphs., , and . Algorithms, 13 (9): 211 (2020)On the Complexity of Approximating Colored-Graph Problems., , and . COCOON, volume 1627 of Lecture Notes in Computer Science, page 281-290. Springer, (1999)Text Sparsification via Local Maxima., , , , , and . FSTTCS, volume 1974 of Lecture Notes in Computer Science, page 290-301. Springer, (2000)On the Complexity of Computing Minimum Energy Consumption Broadcast Subgraphs., , , , and . STACS, volume 2010 of Lecture Notes in Computer Science, page 121-131. Springer, (2001)On Computing the Diameter of Real-World Directed (Weighted) Graphs., , , and . SEA, volume 7276 of Lecture Notes in Computer Science, page 99-110. Springer, (2012)A Comparison of Three Algorithms for Approximating the Distance Distribution in Real-World Graphs., , , and . TAPAS, volume 6595 of Lecture Notes in Computer Science, page 92-103. Springer, (2011)An Axiomatic and an Average-Case Analysis of Algorithms and Heuristics for Metric Properties of Graphs., , and . CoRR, (2016)Minimum-Area h-v Drawings of Complete Binary Trees., and . GD, volume 1353 of Lecture Notes in Computer Science, page 371-382. Springer, (1997)