Filtrer vos résultats
- 30
- 6
- 18
- 9
- 8
- 1
- 1
- 35
- 4
- 1
- 1
- 6
- 5
- 9
- 2
- 3
- 3
- 1
- 3
- 3
- 33
- 3
- 21
- 20
- 9
- 6
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 36
- 7
- 7
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 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
- 1
- 1
36 résultats
|
|
triés par
|
|
When Should You Wait Before Updating? Toward a Robustness Refinement2023
Pré-publication, Document de travail
hal-04101692v1
|
||
|
A Hierarchy of Local Decision2016
Pré-publication, Document de travail
hal-01290693v1
|
||
|
Local certification in distributed computing: error-sensitivity, uniformity, redundancy, and interactivityComputer Science [cs]. Université paris diderot, 2018. English. ⟨NNT : ⟩
Thèse
tel-01962784v1
|
||
|
Vérification de preuves distribuées : compromis temps-espaceALGOTEL 2019 - 21èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2019, Saint Laurent de la Cabrerisse, France
Communication dans un congrès
hal-02118043v1
|
||
|
Local Certification of Graphs with Bounded GenusDiscrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
Article dans une revue
hal-03663680v1
|
||
|
Local certification of local properties: tight bounds, trade-offs and new parameters2024
Pré-publication, Document de travail
hal-04440851v1
|
||
|
Brief Announcement: Local Certification of Graph Decompositions and Applications to Minor-Free Classes35th International Symposium on Distributed Computing, (DISC)2021,, Oct 2021, Freiburg, Germany. ⟨10.4230/LIPIcs.DISC.2021.49⟩
Communication dans un congrès
hal-03394564v1
|
||
|
Redundancy in Distributed Proofs32nd International Symposium on Distributed Computing, 2018, New Orleans, United States. ⟨10.4230/LIPIcs.DISC.2018.24⟩
Communication dans un congrès
hal-01964771v1
|
||
|
Distributed Recoloring of Interval and Chordal Graphs25th International Conference on Principles of Distributed Systems, OPODIS 2021, Dec 2021, Strasbourg, France. ⟨10.4230/LIPIcs.OPODIS.2021.19⟩
Communication dans un congrès
hal-03610449v1
|
||
|
Classifying grounded intersection graphs via ordered forbidden patterns2022
Pré-publication, Document de travail
hal-03663668v1
|
||
|
Silent MST Approximation for Tiny MemorySSS 2020 : The 22th International Symposium on Stabilization, Safety, and Security of Distributed Systems, Nov 2020, Austin, TX / Virtual, United States. pp.118-132, ⟨10.1007/978-3-030-64348-5_10⟩
Communication dans un congrès
hal-03140584v1
|
||
|
Graph classes and forbidden patterns on three vertices2018
Pré-publication, Document de travail
hal-01958194v1
|
||
|
What Can Be Certified Compactly?PODC '22: ACM Symposium on Principles of Distributed Computing, Jul 2022, Salerno, Italy. pp.131-140, ⟨10.1145/3519270.3538416⟩
Communication dans un congrès
hal-03773011v1
|
||
|
Graph classes and forbidden patterns on three verticesSIAM Journal on Discrete Mathematics, 2021, 35 (1), pp.55--90. ⟨10.1137/19M1280399⟩
Article dans une revue
hal-04101700v1
|
||
|
Locally Optimal Load BalancingDISC 2015, Toshimitsu Masuzawa; Koichi Wada, Oct 2015, Tokyo, Japan. ⟨10.1007/978-3-662-48653-5_36⟩
Communication dans un congrès
hal-01207214v1
|
||
|
A lower bound for constant-size local certificationStabilization, Safety, and Security of Distributed Systems, 24th International Symposium, SSS 2022, Clermont-Ferrand, France, Nov 2022, Clermont-Ferrand, France. pp.114068, ⟨10.1007/978-3-031-21017-4_16⟩
Communication dans un congrès
hal-03874784v1
|
||
A Hierarchy of Local Decision43rd International Colloquium on Automata, Languages, and Programming (ICALP) , 2016, Roma, Italy
Communication dans un congrès
hal-01423644v1
|
|||
|
How long it takes for an ordinary node with an ordinary id to output?Theoretical Computer Science, In press, ⟨10.1016/j.tcs.2019.01.023⟩
Article dans une revue
hal-02076161v1
|
||
|
Complexité en moyenne pour le modèle LOCALALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Communication dans un congrès
hal-01148513v1
|
||
|
Pattern detection in ordered graphs2023
Pré-publication, Document de travail
hal-04003273v1
|
||
|
A lower bound for constant-size local certificationTheoretical Computer Science, 2023, 971, pp.114068. ⟨10.1016/j.tcs.2023.114068⟩
Article dans une revue
hal-03874894v1
|
||
|
Survey of Distributed Decision2016
Pré-publication, Document de travail
hal-01331880v1
|
||
|
Local certification of graph decompositions and applications to minor-free classes25th International Conference on Principles of Distributed Systems, OPODIS 2021, Dec 2021, Starsbourg, France. pp.22:1--22:17, ⟨10.4230/LIPIcs.OPODIS.2021.22⟩
Communication dans un congrès
hal-03772974v1
|
||
|
Randomized local network computing : Derandomization beyond locally checkable labelingsACM Transactions on Parallel Computing, 2021, 8 (4), pp.1-25. ⟨10.1145/3470640⟩
Article dans une revue
hal-03610006v1
|
||
|
Introduction to local certificationDiscrete Mathematics and Theoretical Computer Science, 2021, 23 (3), ⟨10.46298/dmtcs.6280⟩
Article dans une revue
hal-03615706v1
|
||
|
Compact Distributed Certification of Planar GraphsAlgorithmica, 2021, 83 (7), pp.2215-2244. ⟨10.1007/s00453-021-00823-w⟩
Article dans une revue
hal-03540582v1
|
||
|
Compact Distributed Certification of Planar Graphs39th ACM Symposium on Principles of Distributed Computing, Aug 2020, Virtual Event Italy, Italy. pp.319-328, ⟨10.1145/3382734.3404505⟩
Communication dans un congrès
halshs-02991868v1
|
||
|
Lower bounds for text indexing with mismatches and differencesSODA 2019 - Symposium on Discrete Algorithms, Jan 2019, San Diego, United States
Communication dans un congrès
hal-01960182v1
|
||
|
Borne inférieure optimale pour la complexité spatiale des algorithmes déterministes auto-stabilisants d'électionAlgoTel 2022 - 24èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, May 2022, Saint-Rémy-Lès-Chevreuse, France
Communication dans un congrès
hal-03651152v2
|
||
|
The Secretary Problem with Independent SamplingProceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, SODA 2021, Virtual Conference, January 10 - 13, 2021, Jan 2021, Virtual, United States. pp.2047-2058, ⟨10.1137/1.9781611976465.122⟩
Communication dans un congrès
hal-03621793v1
|
- 1
- 2