WADS
2005
Springer
14 years 4 months ago
2005
Springer
We consider the lower bound for building a heap in the worst case and the upper bound in the average case. We will prove that the supposedly fastest algorithm in the average case[2...
ICALP
2005
Springer
14 years 5 months ago
2005
Springer
This paper presents several advances in the understanding of dynamic data structures in the bit-probe model: – We improve the lower bound record for dynamic language membership p...
CP
2005
Springer
14 years 5 months ago
2005
Springer
Besides search, complete inference methods can also be used to solve soft constraint problems. Their main drawback is the high spatial complexity. To improve its practical usage, w...
CIE
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We prove that the one-dimensional sandpile prediction problem is in AC1 . The previously best known upper bound on the ACi -scale was AC2 . We also prove that it is not i...
ASIACRYPT
2005
Springer
14 years 5 months ago
2005
Springer
Abstract. We give improved upper bounds on the communication complexity of optimally-resilient secure multiparty computation in the cryptographic model. We consider evaluating an n...
WIOPT
2005
IEEE
14 years 5 months ago
2005
IEEE
We propose a model under which several inherent properties of the Exponential Age SEarch routing protocol can be derived. By making simplifications on this model, we are able to ...
SAC
2006
ACM
14 years 5 months ago
2006
ACM
Randomization has been a primary tool to hide sensitive private information during privacy preserving data mining.The previous work based on spectral filtering, show the noise ma...
AAECC
2006
Springer
14 years 5 months ago
2006
Springer
Abstract. We examine the well-known problem of determining the capacity of multi-dimensional run-length-limited constrained systems. By recasting the problem, which is essentially ...
GLOBECOM
2006
IEEE
14 years 5 months ago
2006
IEEE
— We consider a ring topology with limited or full switching capability as deployed in high bandwidth metro optical networks and develop a model to estimate the probability of bl...
FOCS
2006
IEEE
14 years 5 months ago
2006
IEEE
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...