20 citations · 86 across the 16 of their papers we have counts for
3 papers · 1 filter
Dynamic graph connectivity with improved worst case update time and sublinear space
David Gibb, Bruce Kapron, Valerie King +1
This paper considers fully dynamic graph algorithms with both faster worst case update time and sublinear space. The fully dynamic graph connectivity problem is the following: give…
On an almost-universal hash function family with applications to authentication and secrecy codes
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan +1
Universal hashing, discovered by Carter and Wegman in 1979, has many important applications in computer science. MMH, which was shown to be -universal by Halevi and Krawczyk…
Restricted linear congruences
Khodakhast Bibak, Bruce M. Kapron, Venkatesh Srinivasan +2
In this paper, using properties of Ramanujan sums and of the discrete Fourier transform of arithmetic functions, we give an explicit formula for the number of solutions of the line…