Team, Visitors, External Collaborators
Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Partnerships and Cooperations
Dissemination
Bibliography
XML PDF e-pub
PDF e-Pub


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

[1]
S. Collet.
Algorithmic Game Theory Applied to Networks and Populations, Université Paris 7 - Diderot, December 2019.
https://hal.inria.fr/tel-02433566
[2]
M. Zou.
Aspects of Efficiency in Selected Problems of Computation on Large Graphs, Université de Paris, December 2019.
https://tel.archives-ouvertes.fr/tel-02436610

Articles in International Peer-Reviewed Journals

[3]
J. Asplund, P. Charbit, C. Feghali.
Enclosings of decompositions of complete multigraphs in 2-edge-connected r -factorizations, in: Discrete Mathematics, August 2019, vol. 342, no 8, pp. 2195-2203. [ DOI : 10.1016/j.disc.2019.04.021 ]
https://hal.inria.fr/hal-02429274
[4]
A. Balliu, P. Fraigniaud.
Certification of Compact Low-Stretch Routing Schemes, in: The Computer Journal, May 2019, vol. 62, no 5, pp. 730-746. [ DOI : 10.1093/comjnl/bxy089 ]
https://hal.inria.fr/hal-02433473
[5]
P. Berenbrink, R. Klasing, A. Kosowski, F. Mallmann-Trenn, P. Uznanski.
Improved Analysis of Deterministic Load-Balancing Schemes, in: ACM Transactions on Algorithms, 2019, vol. 15, no 1, Art.10, https://arxiv.org/abs/1404.4344 - minor corrections; updated literature overview. [ DOI : 10.1145/3282435 ]
https://hal.inria.fr/hal-00979691
[6]
E. Birmele, F. de Montgolfier, L. Planche.
On the Minimum Eccentricity Isometric Cycle Problem, in: Electronic Notes in Theoretical Computer Science, August 2019, vol. 346, pp. 159-169. [ DOI : 10.1016/j.entcs.2019.08.015 ]
https://hal.inria.fr/hal-02430756
[7]
L. Boczkowski, A. Korman, E. Natale.
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, in: Distributed Computing, June 2019, A preliminary version of this work appears as a 3-pages Brief Announcement in PODC 2016 (https://doi.org/10.1145/2933057.2933075) and as an extended abstract at SODA 2017 (https://doi.org/10.1137/1.9781611974782.168), forthcoming. [ DOI : 10.1007/s00446-018-0330-x ]
https://hal.archives-ouvertes.fr/hal-01965945
[8]
A. Castañeda, C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum, M. Raynal.
Making Local Algorithms Wait-Free: the Case of Ring Coloring, in: Theory of Computing Systems, May 2019, pp. 344–365. [ DOI : 10.1007/s00224-017-9772-y ]
https://hal.archives-ouvertes.fr/hal-01672723
[9]
V. Chepoi, F. F. Dragan, M. Habib, Y. Vaxès, H. Alrasheed.
Fast approximation of eccentricities and distances in hyperbolic graphs, in: Journal of Graph Algorithms and Applications, 2019, vol. 23, no 2, pp. 393-433. [ DOI : 10.7155/jgaa.00496 ]
https://hal.inria.fr/hal-02423453
[10]
P. Fraigniaud, A. Korman, Y. Rodeh.
Parallel Bayesian Search with No Coordination, in: Journal of the ACM (JACM), June 2019, vol. 66, no 3, pp. 1-28. [ DOI : 10.1145/3304111 ]
https://hal.archives-ouvertes.fr/hal-02351345
[11]
P. Fraigniaud, A. Korman, Y. Rodeh.
Parallel Bayesian Search with No Coordination, in: Journal of the ACM (JACM), June 2019, vol. 66, no 3, pp. 1-28. [ DOI : 10.1145/3304111 ]
https://hal.inria.fr/hal-02433483
[12]
P. Fraigniaud, E. Natale.
Noisy rumor spreading and plurality consensus, in: Distributed Computing, August 2019, vol. 32, no 4, pp. 257-276. [ DOI : 10.1007/s00446-018-0335-5 ]
https://hal.inria.fr/hal-02433482
[13]
P. Fraigniaud, D. Olivetti.
Distributed Detection of Cycles, in: ACM Transactions on Parallel Computing, December 2019, vol. 6, no 3, pp. 1-20. [ DOI : 10.1145/3322811 ]
https://hal.inria.fr/hal-02433486
[14]
P. Fraigniaud, B. Patt-Shamir, M. Perry.
Randomized proof-labeling schemes, in: Distributed Computing, June 2019, vol. 32, no 3, pp. 217-234. [ DOI : 10.1007/s00446-018-0340-8 ]
https://hal.inria.fr/hal-02433478
[15]
N. Ghareghani, M. Habib, M. R. Hooshmandasl, R. Naserasr, P. Sharifani.
When an optimal dominating set with given constraints exists, in: Theoretical Computer Science, July 2019. [ DOI : 10.1016/j.tcs.2019.02.012 ]
https://hal.inria.fr/hal-02423707
[16]
A. Kosowski, D. Pajak.
Does Adding More Agents Make a Difference? A Case Study of Cover Time for the Rotor-Router, in: Journal of Computer and System Sciences, 2019, vol. 106, pp. 80-93. [ DOI : 10.1016/j.jcss.2019.07.001 ]
https://hal.inria.fr/hal-00950743
[17]
A. Watson, M. Habib, E. Bapteste.
Phylosystemics: Merging Phylogenomics, Systems Biology, and Ecology to Study Evolution, in: Trends in Microbiology, November 2019. [ DOI : 10.1016/j.tim.2019.10.011 ]
https://hal.inria.fr/hal-02423510

International Conferences with Proceedings

[18]
A. Castañeda, P. Fraigniaud, A. Paz, S. Rajsbaum, M. Roy, C. Travers.
A Topological Perspective on Distributed Network Algorithms, in: 26th International Colloquium on Structural Information and Communication Complexity (SIROCCO 2019), L'Aquila, Italy, K. Censor-Hillel, M. Flammini (editors), LNCS - Lecture Notes in Computer Science, Springer, July 2019, vol. 11639.
https://hal.inria.fr/hal-02433511
[19]
Best Paper
A. Castañeda, P. Fraigniaud, A. Paz, S. Rajsbaum, M. Roy, C. Travers.
Synchronous t-Resilient Consensus in Arbitrary Graphs, in: SSS 2019 - 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, Pisa, Italy, October 2019. [ DOI : 10.1007/978-3-030-34992-9_5 ]
https://hal.inria.fr/hal-02433524
[20]
P. Crescenzi, P. Fraigniaud, A. Paz.
Trade-Offs in Distributed Interactive Proofs, in: DISC 2019 - 33rd International Symposium on Distributed Computing, Budapest, Hungary, October 2019.
https://hal.inria.fr/hal-02433529
[21]
P. Crescenzi, P. Fraigniaud, A. Paz.
Simple and Fast Distributed Computation of Betweenness Centrality, in: IEEE INFOCOM 2020 - International Conference on Computer Communications, Pekin, China, April 2020.
https://hal.inria.fr/hal-02433541
[22]
G. Ducoffe, M. Habib, L. Viennot.
Fast Diameter Computation within Split Graphs, in: COCOA 2019 - 13th Annual International Conference on Combinatorial Optimization and Applications, Xiamen, China, December 2019, https://arxiv.org/abs/1910.03438.
https://hal.inria.fr/hal-02307397
[23]
G. Ducoffe, M. Habib, L. Viennot.
Diameter computation on H-minor free graphs and graphs of bounded (distance) VC-dimension, in: ACM-SIAM Symposium on Discrete Algorithms (SODA20), Salt Lake City, United States, January 2020, https://arxiv.org/abs/1907.04385.
https://hal.inria.fr/hal-02340382
[24]
P. Fraigniaud, P. Montealegre, R. Oshman, R. Ivan, I. Todinca.
On Distributed Merlin-Arthur Decision Protocols, in: SIROCCO 2019 - 26th International Colloquium on Structural Information and Communication Complexity, L'Aquila, Italy, K. Censor-Hillel, M. Flammini (editors), LNCS - Lecture Notes in Computer Science, 2019, vol. 11639.
https://hal.inria.fr/hal-02433519
[25]
S. Gupta, A. Kosowski, L. Viennot.
Exploiting Hopsets: Improved Distance Oracles for Graphs of Constant Highway Dimension and Beyond, in: ICALP 2019 - 46th International Colloquium on Automata, Languages, and Programming, Patras, Greece, July 2019, https://arxiv.org/abs/1803.06977.
https://hal.inria.fr/hal-01737210
[26]
M. Habib, F. de Montgolfier, L. Mouatadid, M. Zou.
A General Algorithmic Scheme for Modular Decompositions of Hypergraphs and Applications, in: IWOCA 2019 - 30th International Workshop on Combinatorial Algorithms, Pise, Italy, July 2019.
https://hal.inria.fr/hal-02423508
[27]
A. Korman, Y. Rodeh.
Multi-Round Cooperative Search Games with Multiple Players, in: ICALP 2019 - 46th International Colloquium on Automata, Languages and Programming, Patras, Greece, July 2019, https://arxiv.org/abs/1811.01270.
https://hal.archives-ouvertes.fr/hal-02105524
[28]
A. Kosowski, P. Uznanski, L. Viennot.
Hardness of Exact Distance Queries in Sparse Graphs Through Hub Labeling, in: PODC '19 - ACM Symposium on Principles of Distributed Computing, Toronto, Canada, 2019, pp. 272-279, https://arxiv.org/abs/1902.07055. [ DOI : 10.1145/3293611.3331625 ]
https://hal.inria.fr/hal-02429930
[29]
P. Penna, L. Viennot.
Independent Lazy Better-Response Dynamics on Network Games, in: CIAC 2019 2019 : 11th International Conference on Algorithms and Complexity, Rome, Italy, May 2019, https://arxiv.org/abs/1609.08953.
https://hal.inria.fr/hal-01373411
[30]
D.-M. Phan, L. Viennot.
Fast Public Transit Routing with Unrestricted Walking through Hub Labeling, in: Special Event on Analysis of Experimental Algorithms (SEA2), Kalamata, Greece, Special Event on Analysis of Experimental Algorithms, June 2019, https://arxiv.org/abs/1906.08971.
https://hal.inria.fr/hal-02161283

Conferences without Proceedings

[31]
C. Delporte-Gallet, H. Fauconnier, P. Fraigniaud, M. Rabie.
Brief Announcement: Distributed Computing in the Asynchronous LOCAL Model, in: SSS 2019 - 21st International Symposium on Stabilization, Safety, and Security of Distributed Systems, Pisa, Italy, October 2019.
https://hal.archives-ouvertes.fr/hal-02436289
[32]
C. Delporte-Gallet, H. Fauconnier, Y. Jurski, F. Laroussinie, A. Sangnier.
Towards Synthesis of Distributed Algorithms with SMT Solvers, in: NETYS 2019 - International conference on networked systems, Marrakech, Morocco, June 2019.
https://hal.archives-ouvertes.fr/hal-02434364
[33]
C. Delporte-Gallet, H. Fauconnier, M. Raynal.
Participant-Restricted Consensus in Asynchronous Crash-Prone Read/Write Systems and Its Weakest Failure Detector, in: PaCT 2019 - 15th International Conference on Parallel Computing Technologies, Almaty, Kazakhstan, August 2019.
https://hal.archives-ouvertes.fr/hal-02434365
[34]
C. Delporte-Gallet, H. Fauconnier, M. Raynal.
On the Weakest Failure Detector for Read/Write-Based Mutual Exclusion, in: AINA 2019 - 33rd International Conference on Advanced Information Networking and Applications, Matsue, Japan, March 2020.
https://hal.archives-ouvertes.fr/hal-02433606

Scientific Books (or Scientific Book chapters)

[35]
C. Delporte-Gallet, P. A. Abdulla.
Special Issue on NETYS 2016, Computing (journal), Springer, 2019.
https://hal.inria.fr/hal-01955924

Other Publications

[36]
H. Baktash, E. Natale, L. Viennot.
A Comparative Study of Neural Network Compression, October 2019, https://arxiv.org/abs/1910.11144 - working paper or preprint.
https://hal.inria.fr/hal-02321581