1414 search results - page 179 / 283 » Randomness and Universal Machines |
131
Voted
PKC
1999
Springer
15 years 7 months ago
1999
Springer
One of the key directions in complexity theory which has also filtered through to cryptographic research, is the effort to classify related but seemingly distinct notions. Separa...
130
Voted
COMPGEOM
1992
ACM
15 years 7 months ago
1992
ACM
We present a simple randomized algorithm which solves linear programs with n constraints and d variables in expected minfO(d 22dn); e 2 pdln(n= p d)+O( p d+lnn)g time in the unit ...
137
Voted
EUROCRYPT
1990
Springer
15 years 7 months ago
1990
Springer
We describe results from an apparatus and protocol designed to implement quantum key distribution, by which two users, who share no secret information initially: 1) exchange a ran...
133
click to vote
SODA
2008
ACM
15 years 4 months ago
2008
ACM
Ranged hash functions generalize hash tables to the setting where hash buckets may come and go over time, a typical case in distributed settings where hash buckets may correspond ...
128
Voted
ASE
2010
15 years 3 months ago
2010
There exists a large and growing number of proposed estimation methods but little conclusive evidence ranking one method over another. Prior effort estimation studies suffered fro...