3145 search results - page 144 / 629 » Key Improvements to XTR |
129
click to vote
ENTCS
2008
15 years 6 months ago
2008
This paper describes the Signature Compiler, which can compile an LF signature to a custom proof checker in either C++ or Java, specialized for that signature. Empirical results a...
166
click to vote
IJES
2006
15 years 6 months ago
2006
This paper proposes a solution to improve the security of SRAM FPGAs through bitstream encryption. This proposition is distinct from other works because it uses the latest capabil...
153
click to vote
IPL
2006
15 years 6 months ago
2006
Knuth-Bendix completions of the equational theories of k 2 commuting group endomorphisms are obtained, using automated theorem proving and modern termination checking. This impro...
169
click to vote
JGT
2007
15 years 6 months ago
2007
A graph is uniquely hamiltonian if it contains exactly one hamiltonian cycle. In this note we prove that there are no r-regular uniquely hamiltonian graphs when r > 22. This im...
174
click to vote
IPPS
2007
IEEE
16 years 28 days ago
2007
IEEE
Software transactional memory systems enable a programmer to easily write concurrent data structures such as lists, trees, hashtables, and graphs, where non-conflicting operation...