1701 search results - page 26 / 341 » Computer Science and State Machines |
ACSAC
2001
IEEE
15 years 1 months ago
2001
IEEE
The state of the science of information security is astonishingly rich with solutions and tools to incrementally and selectively solve the hard problems. In contrast, the state of...
MFCS
2010
Springer
14 years 8 months ago
2010
Springer
We prove that coverability and termination are not primitive-recursive for lossy counter machines and for Reset Petri nets.
DATE
2002
IEEE
15 years 2 months ago
2002
IEEE
By using a macro/micro state model we show how assumptions on the resolution of logical and physical timing of computation in computer systems has resulted in design methodologies...
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
TCC
2004
Springer
15 years 3 months ago
2004
Springer
Quantum 2-party cryptography differs from its classical counterpart in at least one important way: Given blak-box access to a perfect commitment scheme there exists a secure 1−2...