506 search results - page 19 / 102 » Proving Properties about Lists Using Containers |
SPAA
2005
ACM
15 years 3 months ago
2005
ACM
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip grap...
CSFW
2006
IEEE
15 years 3 months ago
2006
IEEE
Secrecy properties can be guaranteed through a combination of static and dynamic checks. The static checks may include the application of special type systems with notions of secr...
TIT
2010
14 years 4 months ago
2010
We examine the structure of families of distortion balls from the perspective of Kolmogorov complexity. Special attention is paid to the canonical rate-distortion function of a so...
68
Voted
CALCO
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We present a coalgebraic semantics for reasoning about information update in multi-agent systems. The novelty is that we have one structure for both states and actions an...
IPL
2002
14 years 9 months ago
2002
An algorithm, described by Sedgewick, finds the distance between the closest pair of n given points in a plane using a variant of mergesort. This takes O(n log n) time. To prove t...