3146 search results - page 112 / 630 » Efficient Consequence Finding |
129
click to vote
ASIACRYPT
2006
Springer
15 years 8 months ago
2006
Springer
Pseudorandom Generators (PRGs) based on the RSA inversion (one-wayness) problem have been extensively studied in the literature over the last 25 years. These generators have the a...
144
click to vote
ASPLOS
2006
ACM
15 years 8 months ago
2006
ACM
Debugging data races in parallel applications is a difficult task. Error-causing data races may appear to vanish due to changes in an application's optimization level, thread...
144
click to vote
DATE
2006
IEEE
15 years 8 months ago
2006
IEEE
The clock latency scheduling problem is usually solved on the sequential graph, also called register-to-register graph. In practice, the the extraction of the sequential graph for...
139
click to vote
ASPDAC
2001
ACM
15 years 8 months ago
2001
ACM
Given n points in a plane, a minimum spanning tree is a set of edges which connects all the points and has a minimum total length. A naive approach enumerates edges on all pairs o...
119
click to vote
ASYNC
2001
IEEE
15 years 8 months ago
2001
IEEE
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-f...