497 search results - page 37 / 100 » DNA Computing Based on Splicing: Universality Results |
FOCS
1999
IEEE
14 years 1 days ago
1999
IEEE
Naor and Yung show that a one-bit-compressing universal one-way hash function (UOWHF) can be constructed based on a one-way permutation. This construction can be iterated to build...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Abstract. Oblivious transfer (OT) is a primitive of paramount importance in cryptography or, more precisely, two- and multi-party computation due to its universality. Unfortunately...
ICALP
2000
Springer
13 years 11 months ago
2000
Springer
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
JPDC
2006
13 years 7 months ago
2006
In the context of mobile communication, an efficient algorithm for the base-station placement problem is developed in this paper. The objective is to place a given number of base-...
CLUSTER
2005
IEEE
14 years 1 months ago
2005
IEEE
A large organization, such as a university, commonly supplies computational power through multiple independently administered computational domains (e.g. clusters). Each computati...