Bilò, Davide
9  Ergebnisse:
Personensuche X
?
1

Finding Diameter-Reducing Shortcuts in Trees:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Bilò, Davide ; Gualà, Luciano ; Leucci, Stefano. - p. 164-178 , 2023
 
?
2

Compact Distance Oracles with Large Sensitivity and Low Str..:

, In: Lecture Notes in Computer Science; Algorithms and Data Structures,
Bilò, Davide ; Choudhary, Keerti ; Cohen, Sarel... - p. 149-163 , 2023
 
?
3

Approximate Distance Sensitivity Oracles in Subquadratic Sp..:

, In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing,
Bilò, Davide ; Chechik, Shiri ; Choudhary, Keerti... - p. 1396-1409 , 2023
 
?
4

Blackout-Tolerant Temporal Spanners:

, In: Algorithmics of Wireless Networks; Lecture Notes in Computer Science,
 
?
5

New Approximation Algorithms for the Heterogeneous Weighted..:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
Bilò, Davide ; Gualà, Luciano ; Leucci, Stefano.. - p. 167-184 , 2021
 
?
6

Geometric Network Creation Games:

, In: The 31st ACM Symposium on Parallelism in Algorithms and Architectures,
 
?
7

Tracking Routes in Communication Networks:

, In: Structural Information and Communication Complexity; Lecture Notes in Computer Science,
 
?
8

Locality-based network creation games:

, In: Proceedings of the 26th ACM symposium on Parallelism in algorithms and architectures,
Bilò, Davide ; Gualà, Luciano ; Leucci, Stefano. - p. 277-286 , 2014
 
?
9

An algorithm composition scheme preserving monotonicity:

, In: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing,
Bilò, Davide ; Forlizzi, Luca ; Gualà, Luciano. - p. 360-361 , 2007
 
1-9