828 search results - page 39 / 166 » Bounded Hairpin Completion |
131
click to vote
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Orthogonal range reporting is the problem of storing a set of n points in d-dimensional space, such that the k points in an axis-orthogonal query box can be reported efficiently. ...
115
Voted
OPODIS
2008
15 years 2 months ago
2008
We consider wait-free implementations of a regular read/ write register for unauthenticated data using a collection of 3t + k base objects, t of which can be subject to Byzantine ...
109
click to vote
RTSS
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract—Many embedded platforms consist of a heterogeneous collection of processing elements, memory modules, and communication subsystems. These components often implement diff...
98
Voted
STOC
1997
ACM
15 years 4 months ago
1997
ACM
We consider exploration problems where a robot has to construct a complete map of an unknown environment. We assume that the environment is modeled by a directed, strongly connecte...
118
click to vote
CRYPTO
2010
Springer
14 years 9 months ago
2010
Springer
We present a general method to compile any cryptographic algorithm into one which resists side channel attacks of the only computation leaks information variety for an unbounded nu...