This paper introduces a simple Markov process inspired by the problem of quasicrystal growth. It acts over two-letter words by randomly performing flips, a local transformation whi...
Abstract. This paper presents a method for adding end-to-end verifiability to any optical-scan vote counting system. A serial number and set of letters, paired with every candidat...
Stefan Popoveniuc, Jeremy Clark, Richard Carback, ...
This is the first part of a tutorial discussing the major strategies and methodologies by which a test of the Null hypothesis of no Torah effect can be done. The basic concepts of...
We prove that the variance of the number of different letters in random words of length n, with letters i and probabilities 2-i attached to them, is 1 + o(1). Likewise, the varian...
We address a key problem in grapheme-tophoneme conversion: the ambiguity in mapping grapheme units to phonemes. Rather than using single letters and phonemes as units, we propose ...