2498 search results - page 21 / 500 » Data Structures with Unpredictable Timing |
ICWS
2007
IEEE
14 years 11 months ago
2007
IEEE
Complex and dynamic web service compositions may introduce unpredictable and unintentional sharing of security-sensitive data (e.g., credit card numbers) as well as unexpected vul...
STACS
2012
Springer
13 years 5 months ago
2012
Springer
A mode of a multiset S is an element a ∈ S of maximum multiplicity; that is, a occurs at least as frequently as any other element in S. Given an array A[1 : n] of n elements, we...
67
Voted
SPIRE
2005
Springer
15 years 3 months ago
2005
Springer
Output-sensitive data structures result from preprocessing n items and are capable of reporting the items satisfying an on-line query in O(t(n) + ℓ) time, where t(n) is the cost ...
CORR
2007
Springer
14 years 9 months ago
2007
Springer
Motivated by an application in computational topology, we consider a novel variant of the problem of efficiently maintaining dynamic rooted trees. This variant allows an operation...
SODA
2001
ACM
14 years 11 months ago
2001
ACM
We address a longstanding open problem of [11, 10], and present a general transformation that transforms any pointer based data structure to be confluently persistent. Such transf...