List View
 |   | 
Author (up) 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.; Montealecre, 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. Compact Distributed Certification of Planar Graphs 2021 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.; Montealegre-Barba, P.; Todinca, I. The complexity of the bootstraping percolation and other problems 2013 Theoretical Computer Science 504 73-82
Liedloff, M.; Montealegre, P.; Todinca, I. Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques 2019 Algorithmica 81 986-1005
Montealegre, R.; 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
Rapaport, I.; Suchan, K.; Todinca, I.; Verstraete, J. On Dissemination Thresholds in Regular and Irregular Graph Classes 2011 Algorithmica 59 16-34