Author  |
Title |
Year |
Publication |
Volume |
Pages |
| Becker, F.; Kosowski, A.; Matamala, M.; Nisse, N.; Rapaport, I.; Suchan, K.; Todinca, I. |
Allowing each node to communicate only once in a distributed system: shared whiteboard models |
2015 |
Distributed Computing |
28 |
189-200 |
| Becker, F.; Montealegre, P.; Rapaport, I.; Todinca, I. |
The role of randomness in the broadcast congested clique model |
2021 |
Information and Computation |
281 |
104669 |
| Becker, F.; Montealegre, P.; Rapaport, I.; Todinca, I. |
The Impact Of Locality In The Broadcast Congested Clique Model |
2020 |
Siam Journal On Discrete Mathematics |
34 |
682-700 |
| Feuilloley, L.; Fraigniaud, P.; Montealegre, P.; Rapaport, I.; Remila, E.; Todinca, I. |
Local certification of graphs with bounded genus |
2023 |
Discrete Applied Mathematics |
325 |
9-36 |
| Feuilloley, L.; Fraigniaud, P.; Montealegre, P.; Rapaport, I.; Remila, E.; Todinca, I. |
Compact Distributed Certification of Planar Graphs |
2021 |
Algorithmica |
83 |
2215-2244 |
| Fraigniaud, P.; Montealegre, P.; Rapaport, I.; Todinca, I. |
Alert Results A Meta-Theorem for Distributed Certification 5 of 28 A Meta-Theorem for Distributed Certification |
2023 |
Algorithmica |
Early Access |
|
| Fraigniaud, P.; Montealegre-Barba, P.; Oshman, R.; Rapaport, I.; Todinca, I. |
On Distributed Merlin-Arthur Decision Protocols |
2019 |
Lecture Notes in Computer Sciences |
11639 |
|
| Goles, E.; Guillon, P.; Rapaport, I. |
Traced communication complexity of cellular automata |
2011 |
Theoretical Computer Science |
412 |
3906-3916 |
| Goles, E.; Leal, L.; Montealegre, P.; Rapaport, I.; Rios-Wilson, M. |
Distributed maximal independent set computation driven by finite-state dynamics |
2023 |
International Journal of Parallel Emergent and Distributed Systems |
Early Access |
|
| Goles, E.; Meunier, P.E.; Rapaport, I.; Theyssier, G. |
Communication complexity and intrinsic universality in cellular automata |
2011 |
Theoretical Computer Science |
412 |
2-21 |
| Goles, E.; Moreira, A.; Rapaport, I. |
Communication complexity in number-conserving and monotone cellular automata |
2011 |
Theoretical Computer Science |
412 |
3616-3628 |
| Kiwi, M.; de Espanes, P.M.; Rapaport, I.; Rica, S.; Theyssier, G. |
Strict Majority Bootstrap Percolation in the r-wheel |
2014 |
Information Processing Letters |
114 |
277-281 |
| Leal, L.; Montealegre, P.; Osses, A.; Rapaport, I. |
A large diffusion and small amplification dynamics for density classification on graphs |
2022 |
International Journal Of Modern Physics C |
Early Access |
|
| Montealegre, P.; Perez-Salazar, S.; Rapaport, I.; Todinca, I. |
Graph reconstruction in the congested clique |
2020 |
Journal Of Computer And System Sciences |
113 |
1-17 |
| Montealegre-Barba, P.; Perez-Salazar, S.; Rapaport, I.; Todinca, I. |
Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model |
2018 |
Lecture Notes in Computer Sciences |
11085 |
|
| Nisse, N.; Rapaport, I.; Suchan, K. |
Distributed computing of efficient routing schemes in generalized chordal graphs |
2012 |
Theoretical Computer Science |
444 |
17-27 |
| Rapaport, I.; Suchan, K.; Todinca, I.; Verstraete, J. |
On Dissemination Thresholds in Regular and Irregular Graph Classes |
2011 |
Algorithmica |
59 |
16-34 |
