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


Bibliography

Publications of the year

Doctoral Dissertations and Habilitation Theses

[1]
V. Aksenov.
Synchronization Costs in Parallel Programs and Concurrent Data Structures, ITMO University ; Paris Diderot University, September 2018.
https://hal.inria.fr/tel-01887505
[2]
L. Boczkowski.
Search and broadcast in stochastic environments, a biological perspective, Université Paris 7, November 2018.
https://tel.archives-ouvertes.fr/tel-01963290
[3]
L. Feuilloley.
Local certification in distributed computing: error-sensitivity, uniformity, redundancy, and interactivity, Université paris diderot, September 2018.
https://hal.archives-ouvertes.fr/tel-01962784
[4]
L. Planche.
Decomposing a graph with shortest paths of bounded eccentricity, Paris Descartes, November 2018.
https://tel.archives-ouvertes.fr/tel-01994139

Articles in International Peer-Reviewed Journals

[5]
P. Aboulker, J. Bang-Jensen, N. Bousquet, P. Charbit, F. Havet, F. Maffray, J. Zamora.
χ-bounded families of oriented graphs, in: Journal of Graph Theory, September 2018, vol. 89, no 3, pp. 304 - 326. [ DOI : 10.1002/jgt.22252 ]
https://hal.inria.fr/hal-01882395
[6]
A. Balliu, G. D 'angelo, P. Fraigniaud, D. Olivetti.
What Can Be Verified Locally?, in: Journal of Computer and System Sciences, 2018.
https://hal.inria.fr/hal-01964764
[7]
P. Berenbrink, R. Klasing, A. Kosowski, F. Mallmann-Trenn, P. Uznanski.
Improved Analysis of Deterministic Load-Balancing Schemes, in: ACM Transactions on Algorithms, December 2018, 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
[8]
L. Boczkowski, A. Korman, E. Natale.
Minimizing message size in stochastic communication patterns: fast self-stabilizing protocols with 3 bits, in: Distributed Computing, March 2018.
https://hal.archives-ouvertes.fr/hal-01965945
[9]
L. Boczkowski, E. Natale, O. Feinerman, A. Korman.
Limits on reliable information flows through stochastic populations, in: PLoS Computational Biology, June 2018, vol. 14, no 6. [ DOI : 10.1371/journal.pcbi.1006195 ]
https://hal.inria.fr/hal-01953778
[10]
C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum, M. Raynal.
Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems, in: IEEE Transactions on Parallel and Distributed Systems, September 2018, vol. 29, no 9, pp. 2033-2045. [ DOI : 10.1109/TPDS.2018.2809551 ]
https://hal.inria.fr/hal-01955906
[11]
P. Fraigniaud, J. Hirvonen, J. Suomela.
Node labels in local decision, in: Theoretical Computer Science, December 2018, vol. 751, pp. 61-73.
https://hal.inria.fr/hal-01964773
[12]
M. Habib, L. Nourine.
Representation of lattices via set-colored posets, in: Discrete Applied Mathematics, November 2018, vol. 249, pp. 64-73. [ DOI : 10.1016/j.dam.2018.03.068 ]
https://hal.inria.fr/hal-01955233
[13]
A. Korman, Y. Rodeh.
The Dependent Doors Problem: An Investigation into Sequential Decisions without Feedback, in: ACM Transactions on Algorithms, October 2018, vol. 14, no 4, pp. 1-23.
https://hal.inria.fr/hal-01953783

International Conferences with Proceedings

[14]
C. Avin, A. Cohen, P. Fraigniaud, Z. Lotker, D. Peleg.
Preferential Attachment as a Unique Equilibrium, in: World Wide Web Conference (WWW), Lyon, France, 2018, pp. 559-568. [ DOI : 10.1145/3178876.3186122 ]
https://hal.inria.fr/hal-01964759
[15]
L. Boczkowski, O. Feinerman, A. Korman, E. Natale.
Limits for Rumor Spreading in Stochastic Populations, in: ITCS 2018 - 9th Innovations in Theoretical Computer Science Conference, Cambridge, United States, January 2018, pp. 1-27.
https://hal.archives-ouvertes.fr/hal-01958152
[16]
L. Boczkowski, A. Korman, Y. Rodeh.
Searching a Tree with Permanently Noisy Advice, in: ESA 2018 - 26th Annual European Symposium on Algorithms, Helsinki, Finland, Leibniz International Proceedings in Informatics (LIPIcs), August 2018, pp. 1-32. [ DOI : 10.4230/LIPIcs.ESA.2018.54 ]
https://hal.archives-ouvertes.fr/hal-01958133
[17]
M. Bonamy, E. Bonnet, N. Bousquet, P. Charbit, S. Thomassé.
EPTAS for Max Clique on Disks and Unit Balls, in: FOCS: Foundations of Computer Science, Paris, France, October 2018, https://arxiv.org/abs/1803.01822. [ DOI : 10.4230/LIPIcs ]
https://hal.inria.fr/hal-01962198
[18]
E. Bonnet, N. Bousquet, P. Charbit, S. Thomassé, R. Watrigant.
Parameterized Complexity of Independent Set in H-free graphs, in: IPEC 2018 - 13th International Symposium on Parameterized and Exact Computation, Helsinki, Finland, August 2018. [ DOI : 10.4230/LIPIcs.CVIT.2016.23 ]
https://hal.inria.fr/hal-01962369
[19]
V. Chepoi, F. F. Dragan, M. Habib, Y. Vaxès, H. Alrasheed.
Fast Approximation of Centrality and Distances in Hyperbolic Graphs, in: COCOA 2018 - 12th Annual International Conference on Combinatorial Optimization and Applications, Atlanta, United States, December 2018, pp. 1-23.
https://hal.inria.fr/hal-01955263
[20]
S. Collet, P. Fraigniaud, P. Penna.
Equilibria of Games in Networks for Local Tasks, in: 22nd International Conference on Principles of Distributed Systems, Hong-Kong, China, 2018. [ DOI : 10.4230/LIPIcs.OPODIS.2018.0 ]
https://hal.inria.fr/hal-01964761
[21]
C. Delporte-Gallet, H. Fauconnier, E. Gafni, G. Losa.
The Assignment Problem, in: International Conference on Distributed Computing and Networking, ICDCN, Varanasi, India, 2018.
https://hal.inria.fr/hal-01955902
[22]
C. Delporte-Gallet, H. Fauconnier, S. Rajsbaum, N. Yanagisawa.
A Characterization of t-Resilient Colorless Task Anonymous Solvability, in: Structural Information and Communication Complexity - 25th International Colloquium, SIROCCO, Ma'ale HaHamisha, Israel, 2018.
https://hal.inria.fr/hal-01955837
[23]
B. Dudek, A. Kosowski.
Universal Protocols for Information Dissemination Using Emergent Signals, in: STOC 2018 Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, Los Angeles, United States, ACM, 2018, pp. 87-99, https://arxiv.org/abs/1705.09798. [ DOI : 10.1145/3188745.3188818 ]
https://hal.inria.fr/hal-01503359
[24]
L. Feuilloley, P. Fraigniaud, J. Hirvonen, A. Paz, M. Perry.
Redundancy in Distributed Proofs, in: 32nd International Symposium on Distributed Computing, New Orleans, United States, 2018. [ DOI : 10.4230/LIPIcs.DISC.2018.24 ]
https://hal.inria.fr/hal-01964771
[25]
A. Kosowski, P. Uznanski.
Ergodic Effects in Token Circulation, in: SODA '18 Proceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, United States, 2018, pp. 2668-2682.
https://hal.inria.fr/hal-01963249

Conferences without Proceedings

[26]
L. Boczkowski, B. Guinard, A. Korman, Z. Lotker, M. Renault.
Random Walks with Multiple Step Lengths, in: LATIN 2018: Theoretical Informatics - 13th Latin American Symposium, Buenos Aires, Argentina, April 2018, pp. 174-186.
https://hal.archives-ouvertes.fr/hal-01955582

Books or Proceedings Editing

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

Internal Reports

[28]
F. F. Dragan, M. Habib, L. Viennot.
Revisiting Radius, Diameter, and all Eccentricity Computation in Graphs through Certificates, Inria Paris ; Université paris diderot ; Kent State University, March 2018, https://arxiv.org/abs/1803.04660.
https://hal.inria.fr/hal-01729748

Other Publications

[29]
Y. Boufkhad, L. Linguaglossa, F. Mathieu, D. Perino, L. Viennot.
Efficient Loop Detection in Forwarding Networks and Representing Atoms in a Field of Sets, September 2018, https://arxiv.org/abs/1809.01896 - working paper or preprint.
https://hal.inria.fr/hal-01868778
[30]
S. Collet, A. Korman.
Intense Competition can Drive Selfish Explorers to Optimize Coverage, December 2018, https://arxiv.org/abs/1805.01319 - working paper or preprint.
https://hal.inria.fr/hal-01953800
[31]
L. Feuilloley, M. Habib.
Graph classes and forbidden patterns on three vertices, December 2018, https://arxiv.org/abs/1812.05913 - 40 pages.
https://hal.inria.fr/hal-01958194
[32]
P. Fraigniaud, A. Korman, Y. Rodeh.
Parallel Bayesian Search with no Coordination , August 2018, working paper or preprint.
https://hal.archives-ouvertes.fr/hal-01865469
[33]
S. Gupta, A. Kosowski, L. Viennot.
Exact Distance Oracles Using Hopsets, March 2018, https://arxiv.org/abs/1803.06977 - working paper or preprint.
https://hal.inria.fr/hal-01737210