| 
Citations
 | 
   web
Becker, F., Kosowski, A., Matamala, M., Nisse, N., Rapaport, I., Suchan, K., et al. (2015). Allowing each node to communicate only once in a distributed system: shared whiteboard models. Distrib. Comput., 28(3), 189–200.
toggle visibility
Becker, F., Montealegre, P., Rapaport, I., & Todinca, I. (2020). The Impact Of Locality In The Broadcast Congested Clique Model. SIAM Discret. Math., 34(1), 682–700.
toggle visibility
Becker, F., Montealegre, P., Rapaport, I., & Todinca, I. (2021). The role of randomness in the broadcast congested clique model. Inf. Comput., 281, 104669.
toggle visibility
Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., Remila, E., & Todinca, I. (2021). Compact Distributed Certification of Planar Graphs. Algorithmica, 83(7), 2215–2244.
toggle visibility
Feuilloley, L., Fraigniaud, P., Montealegre, P., Rapaport, I., Remila, E., & Todinca, I. (2023). Local certification of graphs with bounded genus. Discret Appl. Math., 325, 9–36.
toggle visibility
Fraigniaud, P., Montealegre, P., Rapaport, I., & Todinca, I. (2023). Alert Results A Meta-Theorem for Distributed Certification 5 of 28 A Meta-Theorem for Distributed Certification. Algorithmica, Early Access.
toggle visibility
Fraigniaud, P., Montealegre-Barba, P., Oshman, R., Rapaport, I., & Todinca, I. (2019). On Distributed Merlin-Arthur Decision Protocols. In Lecture Notes in Computer Sciences (Vol. 11639).
toggle visibility
Goles, E., Montealegre-Barba, P., & Todinca, I. (2013). The complexity of the bootstraping percolation and other problems. Theor. Comput. Sci., 504, 73–82.
toggle visibility
Liedloff, M., Montealegre, P., & Todinca, I. (2019). Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques. Algorithmica, 81(3), 986–1005.
toggle visibility
Montealegre, P., Perez-Salazar, S., Rapaport, I., & Todinca, I. (2020). Graph reconstruction in the congested clique. J. Comput. Syst. Sci., 113, 1–17.
toggle visibility
Montealegre-Barba, P., Perez-Salazar, S., Rapaport, I., & Todinca, I. (2018). Two Rounds Are Enough for Reconstructing Any Graph (Class) in the Congested Clique Model. In Lecture Notes in Computer Sciences (Vol. 11085).
toggle visibility
Rapaport, I., Suchan, K., Todinca, I., & Verstraete, J. (2011). On Dissemination Thresholds in Regular and Irregular Graph Classes. Algorithmica, 59(1), 16–34.
toggle visibility