4940 search results - page 650 / 988 » On the Complexity of Universal Programs |
145
click to vote
STACS
1992
Springer
15 years 10 months ago
1992
Springer
abstract Rafail Ostrovskyy Ramarathnam Venkatesanz Moti Yungx Secure commitment is a primitive enabling information hiding, which is one of the most basic tools in cryptography. S...
206
Voted
SWAT
1992
Springer
15 years 10 months ago
1992
Springer
In PODS'91, Nurmi and Soisalon-Soininen presented a new type of binary search tree for databases, which they call a chromatic tree. The aim is to improve runtime performance ...
185
click to vote
ASPDAC
2007
ACM
15 years 10 months ago
2007
ACM
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
159
click to vote
SOUPS
2010
ACM
15 years 10 months ago
2010
ACM
We examine the password policies of 75 different websites. Our goal is understand the enormous diversity of requirements: some will accept simple six-character passwords, while o...
157
click to vote
ISER
1995
Springer
15 years 10 months ago
1995
Springer
Minimalism pursues the following agenda: For a given robotics task, nd the minimal con guration of resources required to solve the task. Thus, minimalism attempts to reduce the re...