20 search results - page 2 / 4 » Theoretical and Computational Properties of Preference-based... |
STACS
2001
Springer
13 years 9 months ago
2001
Springer
We study effectively given positive reals (more specifically, computably enumerable reals) under a measure of relative randomness introduced by Solovay [32] and studied by Calud...
DCC
2008
IEEE
14 years 4 months ago
2008
IEEE
We present improved lower bounds on the sizes of small maximal partial ovoids in the classical hermitian polar spaces, and improved upper bounds on the sizes of large maximal part...
PODC
2011
ACM
12 years 7 months ago
2011
ACM
Dynamic memory management is a significant source of complexity in the design and implementation of practical concurrent data structures. We study how hardware transactional memo...
STOC
1997
ACM
13 years 9 months ago
1997
ACM
Shor has showed how to perform fault tolerant quantum computation when the probability for an error in a qubit or a gate, η, decays with the size of the computation polylogarithmi...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
We prove the existence of an algorithm A for computing 2-d or 3-d convex hulls that is optimal for every point set in the following sense: for every set S of n points and for ever...