Sciweavers

3333 search results - page 349 / 667
» Abstract Proof Search
Sort
View
FOCS
2009
IEEE
16 years 1 months ago
Distance Oracles for Sparse Graphs
Abstract— Thorup and Zwick, in their seminal work, introduced the approximate distance oracle, which is a data structure that answers distance queries in a graph. For any integer...
Christian Sommer 0002, Elad Verbin, Wei Yu
CCA
2009
Springer
16 years 1 months ago
Weihrauch Degrees, Omniscience Principles and Weak Computability
Abstract. In this paper we study a reducibility that has been introduced by Klaus Weihrauch or, more precisely, a natural extension of this reducibility for multi-valued functions ...
Vasco Brattka, Guido Gherardi
IMA
2009
Springer
139views Cryptology» more  IMA 2009»
16 years 1 months ago
Security of Cyclic Double Block Length Hash Functions
Abstract. We provide the first proof of security for Abreast-DM, one of the oldest and most wellknown constructions for turning a block cipher with n-bit block length and 2n-bit k...
Ewan Fleischmann, Michael Gorski, Stefan Lucks
SSS
2009
Springer
195views Control Systems» more  SSS 2009»
16 years 1 months ago
Anonymous Transactions in Computer Networks
Abstract. We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as...
Shlomi Dolev, Marina Kopeetsky
HASKELL
2009
ACM
16 years 1 months ago
A compositional theory for STM Haskell
We address the problem of reasoning about Haskell programs that use Software Transactional Memory (STM). As a motivating example, we consider Haskell code for a concurrent non-det...
Johannes Borgström, Karthikeyan Bhargavan, An...