406 search results - page 20 / 82 » Pseudorandomness and Combinatorial Constructions |
RECOMB
2000
Springer
15 years 2 months ago
2000
Springer
Custom-designed DNA arrays offer the possibility of simultaneously monitoring thousands of hybridization reactions. These arrays show great potential for many medical and scientif...
CORR
2007
Springer
14 years 11 months ago
2007
Springer
—Difference triangle sets are useful in many practical problems of information transmission. This correspondence studies combinatorial and computational constructions for differe...
ICALP
2001
Springer
15 years 3 months ago
2001
Springer
We give simple algorithms for the construction of generator matrices for minimal tail-biting trellises for a powerful and practical subclass of the linear cyclic codes, from which ...
TCC
2009
Springer
15 years 11 months ago
2009
Springer
Extractable functions are functions where any adversary that outputs a point in the range of the function is guaranteed to "know" a corresponding preimage. Here, knowledg...
83
Voted
AAAI
2004
15 years 15 days ago
2004
Combinatorial auctions (CAs) are important mechanisms for allocating interrelated items. Unfortunately, winner determination is NP-complete unless there is special structure. We s...