
A tierbased typed programming language characterizing Feasible Functionals
The class of Basic Feasible Functionals BFF_2 is the type2 counterpart ...
read it

MMH* with arbitrary modulus is always almostuniversal
Universal hash functions, discovered by Carter and Wegman in 1979, are o...
read it

Unweighted linear congruences with distinct coordinates and the Varshamov–Tenengolts codes
In this paper, we first give explicit formulas for the number of solutio...
read it

The Cayley graphs associated with some quasiperfect Lee codes are Ramanujan graphs
Let _n[i] be the ring of Gaussian integers modulo a positive integer n. ...
read it

Typetwo Iteration with Bounded Query Revision
Motivated by recent results of Kapron and Steinberg (LICS 2018) we intro...
read it

Typetwo polynomialtime and restricted lookahead
This paper provides an alternate characterization of typetwo polynomial...
read it

A generalization of Schönemann's theorem via a graph theoretic method
Recently, Grynkiewicz et al. [ Israel J. Math. 193 (2013), 359398], us...
read it
Bruce M. Kapron
is this you? claim profile