1274 search results - page 255 / 255 » New Proofs for |
PLDI
2012
ACM
11 years 8 months ago
2012
ACM
Linearizability is a key design methodology for reasoning about tations of concurrent abstract data types in both shared memory and message passing systems. It provides the illusi...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
We initiate a direction for proving lower bounds on the size of non-commutative arithmetic circuits. This direction is based on a connection between lower bounds on the size of no...
IFM
2007
Springer
13 years 11 months ago
2007
Springer
Material Flow Abstraction of Manufacturing Systems. ‣Umberto Costa, Ivan de Medeiros Jr and Marcel Oliveira. Specification and Verification of a MPI Implementation for a MP-SoC...
FQ
2003
Springer
13 years 10 months ago
2003
Springer
Every symplectic spread of PG(3, q), or equivalently every ovoid of Q(4, q), is shown to give a certain family of permutation polynomials of GF(q) and conversely. This leads to an...