28888 search results - page 5387 / 5778 » Computability and complexity in analysis |
158
click to vote
CCS
2001
ACM
15 years 10 months ago
2001
ACM
We present a mathematical construct which provides a cryptographic protocol to verifiably shuffle a sequence of k modular integers, and discuss its application to secure, universa...
209
click to vote
EUROPAR
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Current approaches to parallel I/O demand extensive user effort to obtain acceptable performance. This is in part due to difficulties in understanding the characteristics...
215
click to vote
KBSE
2000
IEEE
15 years 10 months ago
2000
IEEE
c specifications provide a powerful method for the specification of abstract data types in programming languages and software systems. Completeness and ground confluence are fundam...
197
click to vote
ALT
1995
Springer
15 years 10 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
184
click to vote
NOSSDAV
1991
Springer
15 years 10 months ago
1991
Springer
One of the most important emerging developments for improving the user/computer interface has been the addition of multimedia facilities to high-performance workstations. Although...