3208 search results - page 356 / 642 » A Lower Bound for Primality |
189
click to vote
INFOCOM
1998
IEEE
15 years 11 months ago
1998
IEEE
We consider the problem of constructing logical topologies over a wavelength-routed optical network with no wavelength changers. We present a general linear formulation which consi...
165
click to vote
CRYPTO
2008
Springer
15 years 8 months ago
2008
Springer
A black-box combiner for collision resistant hash functions (CRHF) is a construction which given black-box access to two hash functions is collision resistant if at least one of th...
176
click to vote
SIROCCO
2003
15 years 8 months ago
2003
In this work, we embark on a study of the possibility (or impossibility), and the corresponding costs, of devising concurrent, low-contention implementations of atomic Read-Modify...
200
click to vote
IOPADS
1997
15 years 8 months ago
1997
We provide a competitive analysis framework for online prefetching and buffer management algorithms in parallel I/O systems, using a read-once model of block references. This has ...
218
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
Maximum Boolean satisfiability (max-SAT) is the optimization counterpart of Boolean satisfiability (SAT), in which a variable assignment is sought to satisfy the maximum number of...