Sciweavers

288 search results - page 37 / 58
» An algebraic generalization of Kripke structures
Sort
View
ATAL
2010
Springer
13 years 2 months ago
Approximate dynamic programming with affine ADDs
The Affine ADD (AADD) is an extension of the Algebraic Decision Diagram (ADD) that compactly represents context-specific, additive and multiplicative structure in functions from a...
Scott Sanner, William T. B. Uther, Karina Valdivia...
ESORICS
2005
Springer
14 years 1 months ago
Limits of the Cryptographic Realization of Dolev-Yao-Style XOR
The abstraction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently si...
Michael Backes, Birgit Pfitzmann
STOC
2004
ACM
121views Algorithms» more  STOC 2004»
14 years 8 months ago
Lower bounds for dynamic connectivity
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
Mihai Patrascu, Erik D. Demaine
ICCAD
2008
IEEE
153views Hardware» more  ICCAD 2008»
14 years 4 months ago
Boolean factoring and decomposition of logic networks
This paper presents new methods for restructuring logic networks based on fast Boolean techniques. The basis for these are 1) a cut based view of a logic network, 2) exploiting th...
Alan Mishchenko, Robert K. Brayton, Satrajit Chatt...
LATIN
2010
Springer
14 years 2 months ago
Gradual Sub-lattice Reduction and a New Complexity for Factoring Polynomials
We present a lattice algorithm specifically designed for some classical applications of lattice reduction. The applications are for lattice bases with a generalized knapsack-type ...
Mark van Hoeij, Andrew Novocin