1209 search results - page 102 / 242 » Universal Algebra and Computer Science |
155
click to vote
CASC
2009
Springer
15 years 4 months ago
2009
Springer
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
136
Voted
P2P
2008
IEEE
15 years 9 months ago
2008
IEEE
We propose an efficient framework for enabling secure multi-party numerical computations in a Peer-to-Peer network. This problem arises in a range of applications such as collabo...
132
click to vote
DC
2007
15 years 3 months ago
2007
Suppose that some parties are connected by an incomplete network of reliable and private channels. The parties cooperate to execute some protocol. However, the parties are curious...
134
click to vote
TCC
2004
Springer
15 years 8 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...
167
click to vote
AOSD
2011
ACM
14 years 6 months ago
2011
ACM
Object-oriented frameworks support design and code reuse for specific application domains. To facilitate the development of evolutionary computation (EC) programs, such as geneti...