3454 search results - page 102 / 691 » Modern computer algebra |
179
click to vote
PPOPP
2010
ACM
16 years 3 months ago
2010
ACM
This poster is a case study on the application of a novel programming model, called Concurrent Collections (CnC), to the implementation of an asynchronous-parallel algorithm for c...
200
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
A new algebraic technique for the construction of interactive proof systems is presented. Our technique is used to prove that every language in the polynomial-time hierarchy has an...
163
click to vote
ENTCS
2007
15 years 6 months ago
2007
Lawvere theories and monads have been the two main category theoretic formulations of universal algebra, Lawvere theories arising in 1963 and the connection with monads being esta...
145
Voted
IEEEPACT
2006
IEEE
16 years 6 days ago
2006
IEEE
Modern compiler transformations that eliminate redundant computations or reorder instructions, such as partial redundancy elimination and instruction scheduling, are very effectiv...
138
click to vote
PARELEC
2006
IEEE
16 years 5 days ago
2006
IEEE
Modern microprocessors get more and more susceptible to transient faults, e.g. caused by high-energetic particles due to high integration, clock frequencies, temperature and decre...