976 search results - page 69 / 196 » The Complexity of Timetable Construction Problems |
ECIS
2000
13 years 10 months ago
2000
Definitions of electronic commerce are many and varied. They indicate a lack of consensus about what electronic commerce is. `A `definition' implies a direct and unproblematic...
PE
2002
Springer
13 years 8 months ago
2002
Springer
Today many formalisms exist for specifying complex Markov chains. In contrast, formalisms for specifying rewards, enabling the analysis of long-run average performance properties,...
TCC
2009
Springer
14 years 9 months ago
2009
Springer
Proofs of Retrievability (PoR), introduced by Juels and Kaliski [JK07], allow the client to store a file F on an untrusted server, and later run an efficient audit protocol in whi...
STOC
1989
ACM
14 years 1 months ago
1989
ACM
Division is a fundamental problem for arithmetic and algebraic computation. This paper describes Boolean circuits of bounded fan-in for integer division nding reciprocals that...
EUROCRYPT
2007
Springer
14 years 29 days ago
2007
Springer
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...