Sciweavers

736 search results - page 97 / 148
» Algorithms for Ordinal Arithmetic
Sort
View
APLAS
2011
ACM
12 years 8 months ago
Solving Recursion-Free Horn Clauses over LI+UIF
Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively auusing abstraction and refinement schemes that rely o...
Ashutosh Gupta, Corneliu Popeea, Andrey Rybalchenk...
ARITH
2011
IEEE
12 years 8 months ago
Fast Ripple-Carry Adders in Standard-Cell CMOS VLSI
— This paper presents a number of new high-radix ripple-carry adder designs based on Ling’s addition technique and a recently-published expansion thereof. The proposed adders a...
Neil Burgess
IACR
2011
115views more  IACR 2011»
12 years 8 months ago
Pseudorandom Functions and Lattices
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
Abhishek Banerjee, Chris Peikert, Alon Rosen
IACR
2011
124views more  IACR 2011»
12 years 8 months ago
Group Law Computations on Jacobians of Hyperelliptic Curves
We derive an explicit method of computing the composition step in Cantor’s algorithm for group operations on Jacobians of hyperelliptic curves. Our technique is inspired by the g...
Craig Costello, Kristin Lauter
STOC
2012
ACM
242views Algorithms» more  STOC 2012»
11 years 11 months ago
Separating multilinear branching programs and formulas
This work deals with the power of linear algebra in the context of multilinear computation. By linear algebra we mean algebraic branching programs (ABPs) which are known to be com...
Zeev Dvir, Guillaume Malod, Sylvain Perifel, Amir ...