Sciweavers

537 search results - page 29 / 108
» A Call to Regularity
Sort
View
136
Voted
LATA
2010
Springer
16 years 26 days ago
Complexity of the Satisfiability Problem for a Class of Propositional Schemata
Abstract. Iterated schemata allow to define infinite languages of propositional formulae through formulae patterns. Formally, schemata extend propositional logic with new (generali...
Vincent Aravantinos, Ricardo Caferra, Nicolas Pelt...
EUROCRYPT
2004
Springer
15 years 9 months ago
Hash Function Balance and Its Impact on Birthday Attacks
Textbooks tell us that a birthday attack on a hash function h with range size r requires r1/2 trials (hash computations) to find a collision. But this is quite misleading, being t...
Mihir Bellare, Tadayoshi Kohno
108
Voted
ICCAD
2002
IEEE
146views Hardware» more  ICCAD 2002»
16 years 11 days ago
Conflict driven learning in a quantified Boolean Satisfiability solver
Within the verification community, there has been a recent increase in interest in Quantified Boolean Formula evaluation (QBF) as many interesting sequential circuit verification ...
Lintao Zhang, Sharad Malik
139
Voted
FSTTCS
2005
Springer
15 years 9 months ago
Causal Closure for MSC Languages
Abstract. Message sequence charts (MSCs) are commonly used to specify interactions between agents in communicating systems. Their visual nature makes them attractive for describing...
Bharat Adsul, Madhavan Mukund, K. Narayan Kumar, V...
DSD
2006
IEEE
131views Hardware» more  DSD 2006»
15 years 7 months ago
Designing Efficient Irregular Networks for Heterogeneous Systems-on-Chip
Abstract-- Networks-on-Chip will serve as the central integration platform in future complex SoC designs, composed of a large number of heterogeneous processing resources. Most res...
Christian Neeb, Norbert Wehn