Sciweavers

412 search results - page 60 / 83
» A New Proof of the F5 Algorithm
Sort
View
CRYPTO
2006
Springer
92views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Rigorous Bounds on Cryptanalytic Time/Memory Tradeoffs
In this paper we formalize a general model of cryptanalytic time/memory tradeoffs for the inversion of a random function f : {0, 1, . . . , N - 1} {0, 1, . . . , N - 1}. The model...
Elad Barkan, Eli Biham, Adi Shamir
CIE
2007
Springer
14 years 11 months ago
Constructive Dimension and Weak Truth-Table Degrees
This paper examines the constructive Hausdorff and packing dimensions of weak truth-table degrees. The main result is that every infinite sequence S with constructive Hausdorff...
Laurent Bienvenu, David Doty, Frank Stephan
DLS
2008
213views Languages» more  DLS 2008»
14 years 11 months ago
A parsing machine for PEGs
Parsing Expression Grammar (PEG) is a recognition-based foundation for describing syntax that renewed interest in top-down parsing approaches. Generally, the implementation of PEG...
Sérgio Medeiros, Roberto Ierusalimschy
JGT
2008
59views more  JGT 2008»
14 years 9 months ago
Pebbling and optimal pebbling in graphs
Given a distribution of pebbles on the vertices of a graph G, a pebbling move takes two pebbles from one vertex and puts one on a neighboring vertex. The pebbling number (G) is th...
David P. Bunde, Erin W. Chambers, Daniel W. Cranst...
JCT
2010
112views more  JCT 2010»
14 years 8 months ago
Annular embeddings of permutations for arbitrary genus
In the symmetric group on a set of size 2n, let P2n denote the conjugacy class of involutions with no fixed points (equivalently, we refer to these as “pairings”, since each ...
I. P. Goulden, William Slofstra