8699 search results - page 1580 / 1740 » Elements of the Theory of Computation |
CHI
2004
ACM
15 years 11 months ago
2004
ACM
Level of Web experience is often a factor for which researchers attempt to control while conducting experimental studies on Web usability. It is typically measured by some means o...
191
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
The TCP/IP protocols and Sockets API underlie much of modern computation, but their semantics have historically been very complex and ill-defined. The real standard is the de fact...
180
click to vote
POPL
2006
ACM
15 years 11 months ago
2006
ACM
In POPL 2002, Petrank and Rawitz showed a universal result-finding optimal data placement is not only NP-hard but also impossible to approximate within a constant factor if P = NP...
STOC
2006
ACM
15 years 11 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
102
click to vote
STOC
2004
ACM
15 years 11 months ago
2004
ACM
The Collect problem for an asynchronous shared-memory system has the objective for the processors to learn all values of a collection of shared registers, while minimizing the tot...