Filter your results
- 10
- 6
- 10
- 4
- 2
- 4
- 16
- 1
- 1
- 3
- 2
- 1
- 2
- 3
- 2
- 1
- 15
- 1
- 6
- 5
- 5
- 5
- 4
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 10
- 7
- 6
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
|
|
sorted by
|
The Topology of Randomized Symmetry-Breaking Distributed ComputingACM Symposium on Principles of Distributed Computing (PODC), 2021, Virtuel, France
Conference papers
hal-03872351v1
|
|||
|
A Doubling dimension Threshold !(log log n) for augmented graph navigability[Research Report] LIP RR-2006-09, Laboratoire de l'informatique du parallélisme. 2006, 2+9p
Reports
hal-02102264v1
|
||
|
A Doubling dimension Threshold $\Theta(\log\log n)$ for augmented graph navigability[Research Report] LIP RR-2006-16, Laboratoire de l'informatique du parallélisme. 2006, 2+7p
Reports
hal-02102345v1
|
||
|
Attachement préférentiel comme unique équilibreALGOTEL 2018 - 20èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2018, Roscoff, France
Conference papers
hal-01782206v1
|
||
|
A propos des schémas d'augmentation universels pour la navigation dans les réseaux9ème Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2007, Ile d'Oléron, France. pp.23-26
Conference papers
inria-00176942v1
|
||
|
Lower and upper bounds for deterministic convergecast with labeling schemes[Research Report] Sorbonne Université. 2020
Reports
hal-02650472v2
|
||
From Balls and Bins to Points and VerticesAlgorithmic Operations Research, 2009, 4 (2), pp.133--143
Journal articles
hal-00342915v1
|
|||
|
Preferential Attachment as a Unique EquilibriumWorld Wide Web Conference (WWW), 2018, Lyon, France. pp.559-568, ⟨10.1145/3178876.3186122⟩
Conference papers
hal-01964759v1
|
||
|
Universal Augmentation Schemes for Network Navigability: Overcoming the $\sqrtn$-BarrierTheoretical Computer Science, 2009, 410 (21-23), pp.1970-1981. ⟨10.1016/j.tcs.2008.12.061⟩
Journal articles
hal-00998529v1
|
||
|
Random Walks with Multiple Step LengthsLATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Apr 2018, Buenos Aires, Argentina. pp.174-186
Conference papers
hal-01955582v1
|
||
From Balls and Bins to Points and VerticesProceedings of the 16th Annual International Symposium on Algorithms and Computation (ISAAC 2005), Dec 2005, China. pp.757--766
Conference papers
hal-00307227v1
|
|||
|
Recovering the Long Range Links in Augmented Graphs[Research Report] RR-6197, INRIA. 2007, pp.27
Reports
inria-00147536v4
|
||
Core-periphery clustering and collaboration networks IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM), 2016, San Francisco, United States
Conference papers
hal-01423645v1
|
|||
|
Universal augmentation schemes for network navigability: overcoming the $\sqrt n$-barriernineteenth annual ACM symposium on parallelism and architectures, 2007, San Diego, California, United States. pp.1-7
Conference papers
hal-00155186v1
|
||
Sparsifying Congested Cliques and Core-Periphery Networks 23rd International Colloquium on Structural Information and Communication Complexity (SIROCCO), 2016, Helsinki, Finland
Conference papers
hal-01423688v1
|
|||
|
Collaborative search on the plane without communicationACM Symposium on Principles of Distributed Computing, PODC 2012, Jul 2012, Madeira, Portugal. ⟨10.1145/2332432.2332444⟩
Conference papers
hal-01241094v2
|