Sciweavers

TACAS
2009
Springer
111views Algorithms» more  TACAS 2009»
14 years 5 months ago
The Complexity of Predicting Atomicity Violations
Azadeh Farzan, P. Madhusudan
TACAS
2009
Springer
134views Algorithms» more  TACAS 2009»
14 years 5 months ago
Compositional Predicate Abstraction from Game Semantics
ional Predicate Abstraction from Game Semantics Adam Bakewell and Dan R. Ghica University of Birmingham, U.K. We introduce a technique for using conventional predicate abstraction ...
Adam Bakewell, Dan R. Ghica
TACAS
2009
Springer
99views Algorithms» more  TACAS 2009»
14 years 5 months ago
Ground Interpolation for the Theory of Equality
Abstract. Given a theory T and two formulas A and B jointly unsatisfiable in T , a theory interpolant of A and B is a formula I such that (i) its non-theory symbols are shared by ...
Alexander Fuchs, Amit Goel, Jim Grundy, Sava Krsti...
TACAS
2009
Springer
157views Algorithms» more  TACAS 2009»
14 years 5 months ago
Alpaga: A Tool for Solving Parity Games with Imperfect Information
Alpaga is a solver for parity games with imperfect information. Given the description of a game, it determines whether the first player can ensure to win and, if so, it constructs...
Dietmar Berwanger, Krishnendu Chatterjee, Martin D...
ARC
2009
Springer
142views Hardware» more  ARC 2009»
14 years 5 months ago
A Hardware Analysis of Twisted Edwards Curves for an Elliptic Curve Cryptosystem
Abstract. This paper presents implementation results of a reconfigurable elliptic curve processor defined over prime fields GF(p). We use this processor to compare a new algorit...
Brian Baldwin, Richard Moloney, Andrew Byrne, Gary...
WWW
2009
ACM
14 years 5 months ago
Tagommenders: connecting users to items through tags
Tagging has emerged as a powerful mechanism that enables users to find, organize, and understand online entities. Recommender systems similarly enable users to efficiently navig...
Shilad Sen, Jesse Vig, John Riedl
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
14 years 5 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
STOC
2009
ACM
238views Algorithms» more  STOC 2009»
14 years 5 months ago
Fully homomorphic encryption using ideal lattices
We propose a fully homomorphic encryption scheme – i.e., a scheme that allows one to evaluate circuits over encrypted data without being able to decrypt. Our solution comes in t...
Craig Gentry
STOC
2009
ACM
118views Algorithms» more  STOC 2009»
14 years 5 months ago
How long does it take to catch a wild kangaroo?
The discrete logarithm problem asks to solve for the exponent x, given the generator g of a cyclic group G and an element h ∈ G such that gx = h. We give the first rigorous pro...
Ravi Montenegro, Prasad Tetali
SC
2009
ACM
14 years 5 months ago
Autotuning multigrid with PetaBricks
Algorithmic choice is essential in any problem domain to realizing optimal computational performance. Multigrid is a prime example: not only is it possible to make choices at the ...
Cy P. Chan, Jason Ansel, Yee Lok Wong, Saman P. Am...