1274 search results - page 57 / 255 » New Proofs for |
97
Voted
ENTCS
2002
15 years 12 days ago
2002
Once you have proved your refinement correct, that is not the end. Real products, and their accompanying specifications, develop over time, with new improved versions having added...
63
Voted
DM
2006
15 years 19 days ago
2006
Our main result describes how to extend a matroid so that its ground set is a modular hyperplane of the larger matroid. This result yields a new way to view Dowling lattices and ne...
124
Voted
ECCC
2010
14 years 11 months ago
2010
Parameterized Resolution and, moreover, a general framework for parameterized proof complexity was introduced by Dantchev, Martin, and Szeider [16] (FOCS’07). In that paper, Dan...
121
Voted
JISE
1998
15 years 8 days ago
1998
In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformation. We build upon recent results by ...
84
Voted
DCC
2010
IEEE
15 years 21 days ago
2010
IEEE
We investigate unconditional security for message authentication protocols that are designed using two-channel cryptography. We look at both noninteractive message authentication ...