4940 search results - page 233 / 988 » On the Complexity of Universal Programs |
170
click to vote
SIGUCCS
2000
ACM
15 years 11 months ago
2000
ACM
Academic Technology Services at the University of Rochester is in the process of revamping its student staff training program. This is in an effort to provide top-notch customer s...
126
click to vote
ICALP
2000
Springer
15 years 10 months ago
2000
Springer
We study contention-resolution protocols for multiple-access channels. We show that every backoff protocol is transient if the arrival rate, , is at least 0.42 and that the capaci...
177
click to vote
WDAG
1995
Springer
15 years 10 months ago
1995
Springer
Larchant-RDOSS is a distributed shared memory that persists on reliable storage across process lifetimes. Memory management is automatic: including consistent caching of data and ...
181
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Guided Abstraction Simplification Roberto Giacobazzi1 and Francesco Ranzato2 1 University of Verona, Italy 2 University of Padova, Italy Abstract. In static analysis, approximation...
174
click to vote
CORR
2007
Springer
15 years 6 months ago
2007
Springer
We give a simple order-theoretic construction of a Cartesian closed category of sequential functions. It is based on bistable biorders, which are sets with a partial order — the ...