Now showing items 1-3 of 3

    • Kiwi Krauskopf, Marcos; Thraves Caro, Christopher (Institute of Electrical and Electronics Engineers Inc., 2017)
      The two most intensively studied communication paradigms for spreading rumors are the so-called PUSH and PULL algorithms. The previous analysis of these protocols assumed that every node could process all such push/pull ...
    • Kiwi Krauskopf, Marcos; Soto San Martín, José (Cambridge University Press, 2009)
      It is well known that, when normalized by n, the expected length of a longest common subsequence of d sequences of length n over an alphabet of size σ converges to a constant γσ,d. We disprove a speculation by Steele ...
    • Kiwi Krauskopf, Marcos; Moisset de Espanes, Pablo; Rapaport Zimermann, Iván; Rica Mery, Sergio; Theyssier, G. (Elsevier, 2014)
      In the strict Majority Bootstrap Percolation process each passive vertex v becomes active if at least [fórmula] of its neighbors are active (and thereafter never changes its state). We address the problem of finding graphs ...