Filter your results
- 15
- 11
- 6
- 1
- 1
- 1
- 23
- 12
- 10
- 10
- 9
- 8
- 8
- 8
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 31
- 3
- 3
- 1
- 1
- 26
- 20
- 15
- 13
- 8
- 8
- 7
- 6
- 4
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 33
- 21
- 18
- 15
- 13
- 13
- 11
- 11
- 11
- 11
- 11
- 10
- 10
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 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
- 1
- 1
- 1
- 1
- 34
- 1
- 19
- 16
- 1
- 1
- 2
- 1
- 2
- 1
- 2
- 3
- 1
- 1
- 2
- 5
- 2
- 3
- 2
- 2
- 1
- 1
- 2
|
|
sorted by
|
Minimal proper interval completions2006, To appear
Conference papers
hal-00085565v1
|
|||
|
Allowing Each Node to Communicate Only Once in a Distributed System: Shared Whiteboard ModelsSPAA - 24th ACM Symposium on Parallelism in Algorithms and Architectures, 2012, United States. pp.7
Conference papers
hal-00704200v1
|
||
|
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⟩
Conference papers
halshs-02991868v1
|
||
|
Compact Distributed Certification of Planar GraphsAlgorithmica, 2021, 83 (7), pp.2215-2244. ⟨10.1007/s00453-021-00823-w⟩
Journal articles
hal-03540582v1
|
||
The effect of range and bandwidth on the round complexity in the congested clique modelLecture Notes in Computer Science, 2016, 22nd International Conference, COCOON 2016, Ho Chi Minh City, Vietnam, August 2-4, 2016, Proceedings, 9797, pp 182-193
Journal articles
halshs-01417273v1
|
|||
|
Distributed Testing of Excluded Subgraphs30th International Symposium on Distributed Computing (DISC 2016), Sep 2016, Paris, France. pp.342 - 356, ⟨10.1007/978-3-662-53426-7_25⟩
Conference papers
hal-01423633v1
|
||
|
Minimal proper interval completionsInformation Processing Letters, 2008, 106 (5), pp.195-202. ⟨10.1016/j.ipl.2007.11.013⟩
Journal articles
hal-00462388v1
|
||
|
Distributed computing of efficient routing schemes in generalized chordal graphsTheoretical Computer Science, 2012, 444 (27), pp.17-27
Journal articles
hal-00741970v1
|
||
|
A Meta-Theorem for Distributed CertificationStructural Information and Communication Complexity, 13298, Springer International Publishing, pp.116-134, 2022, Lecture Notes in Computer Science, ⟨10.1007/978-3-031-09993-9_7⟩
Book sections
hal-03872315v1
|
||
|
Proceedings of AUTOMATA 2011 : 17th International Workshop on Cellular Automata and Discrete Complex SystemsFatès, Nazim and Goles, Ericand Maass, Alejandro and Rappaport Ivan. Inria Nancy, pp.298, 2011, 978-2-905267-79-5
Books
hal-00654706v1
|
||
|
Traced communication complexity of Cellular AutomataTheoretical Computer Science, 2011, 412: Cellular Automata and Discrete Complex Systems (30), pp.3906--3916. ⟨10.1016/j.tcs.2011.02.025⟩
Journal articles
hal-01281009v1
|
||
Distributed computing of efficient routing schemes in generalized chordal graphsInternational Colloquium on Structural Information and Communication Complexity (SIROCCO), 2009, Piran, Slovenia
Conference papers
inria-00423454v1
|
|||
|
Interconnection network with a shared whiteboard: Impact of (a)synchronicity on computing power[Research Report] RR-7746, INRIA. 2011
Reports
inria-00627910v1
|
||
|
Discrete mathematical structures: From dynamics to complexityTheoretical Computer Science, 2013, 504, pp.3-4. ⟨10.1016/j.tcs.2013.09.001⟩
Journal articles
lirmm-01480616v1
|
||
Three Notes on Distributed Property TestingDISC 2017 - 31st International Symposium on Distributed Computing, Oct 2017, Vienna, France. pp.1-30
Conference papers
hal-01674664v1
|
|||
|
On Dissemination Thresholds in Regular and Irregular Graph ClassesLATIN 2008: Theoretical Informatics, Apr 2008, Buzios, Brazil. pp.24-35, ⟨10.1007/978-3-540-78773-0_3⟩
Conference papers
hal-00462308v1
|
||
|
Local Certification of Graphs with Bounded GenusDiscrete Applied Mathematics, 2023, 325, pp.9--36. ⟨10.1016/j.dam.2022.10.004⟩
Journal articles
hal-03663680v1
|
||
|
Average long-lived binary consensus: Quantifying the stabilizing role played by memoryTheoretical Computer Science, 2010, 411 (14-15), pp.1558-1566. ⟨10.1016/j.tcs.2010.01.005⟩
Journal articles
hal-00458941v1
|
||
|
Tiling groups for Wang tiles[Research Report] LIP RR-2001-32, Laboratoire de l'informatique du parallélisme. 2001, 2+14p
Reports
hal-02101843v1
|
||
|
Self-assemblying (classes of) shapes with a constant number of tiles.[Research Report] LIP RR-2004-38, Laboratoire de l'informatique du parallélisme. 2004, 2+12p
Reports
hal-02101777v1
|
||
|
Adding a referee to an interconnection network: What can(not) be computed in one round.[Research Report] 2010, pp.14
Reports
inria-00528733v1
|
||
|
Communication Complexity and Intrinsic Universality in Cellular Automata2009
Preprints, Working Papers, ...
hal-00440186v4
|
||
The Impact of Locality on the Detection of Cycles in the Broadcast Congested Clique ModelLatin American Symposium on Theoretical Informatics (LATIN), 2018, Buenos Aires, Argentina. pp.134-145, ⟨10.1007/978-3-319-77404-6_11⟩
Conference papers
hal-03541369v1
|
|||
|
Self-assemblying Classes of Shapes with a Minimum Number of Tiles, and in Optimal TimeFSTTCS, 2006, Kolkota, India. pp.45-56, ⟨10.1007/11944836_7⟩
Conference papers
hal-00460570v1
|
||
|
On Dissemination Thresholds in Regular and Irregular Graph ClassesAlgorithmica, 2009, pp.1432-0541 (Online). ⟨10.1007/s00453-009-9309-0⟩
Journal articles
hal-00480744v1
|
||
|
Reconstruire un graphe en une ronde13es Rencontres Francophones sur les Aspects Algorithmiques de Télécommunications (AlgoTel), 2011, Cap Estérel, France
Conference papers
inria-00587250v1
|
||
Brief Announcement: A Hierarchy of Congested Clique Models: From Broadcast to UnicastACM Symposium on Principles of Distributed Computing (PODC), Jun 2015, Donostia-San Sebastián, Spain
Conference papers
halshs-01196558v1
|
|||
The role of randomness in the broadcast congested clique modelInformation and Computation, 2021, 281, pp.104669. ⟨10.1016/j.ic.2020.104669⟩
Journal articles
hal-03540598v1
|
|||
|
The simultaneous number-in-hand communication model on graphs: private coins, public coins and determinismALGOTEL 2015 — 17èmes Rencontres Francophones sur les Aspects Algorithmiques des Télécommunications, Jun 2015, Beaune, France
Conference papers
hal-01148013v1
|
||
|
Undecidability of the global fixed point attractor problem on circular cellular automata.[Research Report] LIP RR-1997-34, Laboratoire de l'informatique du parallélisme. 1997, 2+14p
Reports
hal-02102003v1
|
- 1
- 2