Tools

"... It is shown that a static dictionary that offers constant-time access to n elements with w-bit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unit-cost RAM with word length w and a standard instruction set including multiplication. Whereas a rando ..."

It is shown that a static dictionary that offers constant-time access to n elements with w-bit keys and occupies O(n) words of memory can be constructed deterministically in O(n log n) time on a unit-cost RAM with word length w and a standard instruction set including multiplication. Whereas a

"... We consider static dictionaries over the universe U = on a unit-cost RAM with word size w. Construction of a static dictionary with linear space consumption and constant lookup time can be done in linear expected time by a randomized algorithm. In contrast, the best previous deterministic a ..."

We consider static dictionaries over the universe U = on a unit-cost RAM with word size w. Construction of a static dictionary with linear space consumption and constant lookup time can be done in linear expected time by a randomized algorithm. In contrast, the best previous deterministic

"... To appear in the special issue of JFAA on sparsity Abstract. We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of …nite groups. The oscillator dictionary consists of approximately p5 uni ..."

To appear in the special issue of JFAA on sparsity Abstract. We describe a new construction of an incoherent dictionary, referred to as the oscillator dictionary, which is based on considerations in the representation theory of …nite groups. The oscillator dictionary consists of approximately p5

"... . We consider dictionaries over the universe U = f0; 1g w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministic dictionary with membership queries in time (log log n) O(1) and updates in time (log n) O(1) , where n is the size of the se ..."

. We consider dictionaries over the universe U = f0; 1g w on a unit-cost RAM with word size w and a standard instruction set. We present a linear space deterministicdictionary with membership queries in time (log log n) O(1) and updates in time (log n) O(1) , where n is the size

"... This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministic dictionary, has small restricted isometry con ..."

This article extends the concept of compressed sensing to signals that are not sparse in an orthonormal basis but rather in a redundant dictionary. It is shown that a matrix, which is a composition of a random matrix of certain type and a deterministicdictionary, has small restricted isometry

"... Existing functional languages appear not to be suitable for implementing systems which are inherently concurrent, such as operating system environments. Adaptations to functional languages developed to support such applications have in the past always involved the introduction of non-determinism.
..."

Existing functional languages appear not to be suitable for implementing systems which are inherently concurrent, such as operating system environments. Adaptations to functional languages developed to support such applications have in the past always involved the introduction of non-determinism.

"... We consider dynamic dictionaries over the universe U = {0, 1}^w on a unit-cost RAM with word size w and a standard instruction set, and present a linear space deterministic dictionary accommodating membership queries in time (log log n)^O(1) and updates in time (log n)^O(1), where n is the size of t ..."

We consider dynamic dictionaries over the universe U = {0, 1}^w on a unit-cost RAM with word size w and a standard instruction set, and present a linear space deterministicdictionary accommodating membership queries in time (log log n)^O(1) and updates in time (log n)^O(1), where n is the size