Browsing by Subject "Hashing"
Now showing items 1-3 of 3
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 ...
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.
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 ...