1.8k citations · 16.3k across the 107 of their papers we have counts for
10 papers · 1 filter
An analysis of Bennett's pebble game
Emanuel Knill
Bennett's pebble game was introduced to obtain better time/space tradeoffs in the simulation of standard Turing machines by reversible ones. So far only upper bounds for the tradeo…
Group testing problems in experimental molecular biology
Emanuel Knill, S. Muthukrishnan
In group testing, the task is to determine the distinguished members of a set of objects L by asking subset queries of the form ``does the subset Q of L contain a distinguished obj…
Efficient pooling designs for library screening
William J. Bruno, Emanuel Knill, David J. Balding +6
We describe efficient methods for screening clone libraries, based on pooling schemes which we call ``random -sets designs''. In these designs, the pools in which any clone occu…
Notes on the connectivity of Cayley coset digraphs
Emanuel Knill
Hamidoune's connectivity results for hierarchical Cayley digraphs are extended to Cayley coset digraphs and thus to arbitrary vertex transitive digraphs. It is shown that if a Cayl…
Generalized degrees and densities for families of sets
Emanuel Knill
Let F be a family of subsets of {1,2,...,n}. The width-degree of an element x in at least one member of F is the width of the family {U in F | x in U}. If F has maximum width-degre…
Lower bounds for identifying subset members with subset queries
Emanuel Knill
An instance of a group testing problem is a set of objects $\cO$ and an unknown subset of $\cO$. The task is to determine by using queries of the type ``does intersect…