535 search results - page 77 / 107 » Checking Computations in Polylogarithmic Time |
CGO
2011
IEEE
12 years 11 months ago
2011
IEEE
— The emergence and wide adoption of web applications have moved the client-side component, often written in JavaScript, to the forefront of computing on the web. Web application...
DAC
2009
ACM
14 years 8 months ago
2009
ACM
Boolean satisfiability (SAT) solvers are used heavily in hardware and software verification tools for checking satisfiability of Boolean formulas. Most state-of-the-art SAT solver...
DAC
2001
ACM
14 years 8 months ago
2001
ACM
An approach for factoring general boolean functions was described in [15, 16] which is based on graph partitioning algorithms. In this paper, we present a very fast algorithm for ...
DSN
2003
IEEE
14 years 1 months ago
2003
IEEE
Processor caches already play a critical role in the performance of today’s computer systems. At the same time, the data integrity of words coming out of the caches can have ser...
PODC
1997
ACM
13 years 12 months ago
1997
ACM
Conditions on a shared object type T are given that are both necessary and sufficient for wait-free n-process consensus to be solvable using objects of type T and registers. The co...