2084 search results - page 140 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
268
click to vote
POPL
2004
ACM
16 years 5 months ago
2004
ACM
We present a polynomial time randomized algorithm for global value numbering. Our algorithm is complete when conditionals are treated as non-deterministic and all operators are tr...
124
click to vote
CCS
2003
ACM
15 years 10 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
164
click to vote
OPODIS
2010
15 years 2 months ago
2010
The Earliest Deadline First (EDF) scheduling algorithm is known to be suboptimal for meeting all deadlines under global scheduling on multiprocessor platforms. However, EDF is an a...
148
Voted
WEA
2005
Springer
15 years 10 months ago
2005
Springer
Ordered Binary Decision Diagrams (OBDDs) are a data structure for Boolean functions which supports many useful operations. It finds applications in CAD, model checking, and symbol...
121
click to vote
DAC
2002
ACM
16 years 5 months ago
2002
ACM
CT The traditional approach to worst-case static-timing analysis is becoming unacceptably conservative due to an ever-increasing number of circuit and process effects. We propose a...