Now showing items 1-3 of 3

  • A Concise Forwarding Information Base for Scalable and Fast Name Lookups 

    Yu, Ye; Belazzougui, Djamal; Qian, Chen; Zhang, Qin
    In : (IEEE, Toronto, Ontario, Canada, 2017-11-30)
    Forwarding information base (FIB) scalability and its lookup speed are fundamental problems of numerous net- work technologies that uses location-independent network names. In this paper we present a new network algorithm, Othello Hashing, and its application of a FIB design called Concise, which uses very little ...
  • Fully Dynamic de Bruijn Graphs 

    Belazzougui, Djamal; Gagie, Travis; Mäkinen, Veli; Previtali, Marco
    In : (Springer International Publishing, Beppu, Japan, 2016-09-21)
    We present a space- and time-efficient fully dynamic implementation of de Bruijn graphs, which can also support fixed-length jumbled pattern matching.
  • Optimal Las Vegas reduction from one-way set reconciliation to error correction 

    Belazzougui, Djamal
    In : (Springer Varlag, 2016-03-28)
    Suppose we have two players A and C, where player A has a string s[0..u−1] and player C has a string t[0..u−1] and none of the two players knows the other's string. Assume that s and t are both over an integer alphabet [σ]=[0,σ−1], where the first string contains n non-zero entries. We would wish to answer the ...

Tous les documents dans CERIST DIGITAL LIBRARY sont protégés par copyright, avec tous droits réservés. copyright © 2013-2015  CERIST
Powered by 
@mire NV