3378 search results - page 250 / 676 » A universe of binding and computation |
162
click to vote
ICALP
2003
Springer
15 years 12 months ago
2003
Springer
We consider the issues of implicitness and cache-obliviousness in the classical dictionary problem for n distinct keys over an unbounded and ordered universe. One finding in this ...
152
click to vote
TAMC
2010
Springer
15 years 11 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
196
click to vote
SIGUCCS
1999
ACM
15 years 11 months ago
1999
ACM
The University of Portland Office of Computer and Telecommunication Services (CTS) created an Intranet web site for the University community during the summer of 1998. In the summ...
186
click to vote
PKC
1999
Springer
15 years 11 months ago
1999
Springer
Abstract. Many applications rely on the security of their random number generator. It is therefore essential that such devices be extensively tested for malfunction. The purpose of...
168
click to vote
WDAG
1998
Springer
15 years 11 months ago
1998
Springer
d Abstract) James H. Anderson, Rohit Jain, and David Ott Department of Computer Science University of North Carolina at Chapel Hill We consider wait-free synchronization in multipr...