toggle visibility Search & Display Options

Select All    Deselect All
List View
 |   | 
   print
  Author Title Year Publication Volume Pages Links
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 details   doi
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 details   doi
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 details   pdf doi
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 details   pdf doi
Nisse, N.; Rapaport, I.; Suchan, K. Distributed computing of efficient routing schemes in generalized chordal graphs 2012 Theoretical Computer Science 444 17-27 details   pdf doi
Goles, E.; Moreira, A.; Rapaport, I. Communication complexity in number-conserving and monotone cellular automata 2011 Theoretical Computer Science 412 3616-3628 details   pdf doi
Goles, E.; Guillon, P.; Rapaport, I. Traced communication complexity of cellular automata 2011 Theoretical Computer Science 412 3906-3916 details   pdf doi
Rapaport, I.; Suchan, K.; Todinca, I.; Verstraete, J. On Dissemination Thresholds in Regular and Irregular Graph Classes 2011 Algorithmica 59 16-34 details   pdf doi
Goles, E.; Meunier, P.E.; Rapaport, I.; Theyssier, G. Communication complexity and intrinsic universality in cellular automata 2011 Theoretical Computer Science 412 2-21 details   pdf doi
Select All    Deselect All
List View
 |   | 
   print

Save Citations:
Export Records: