4940 search results - page 155 / 988 » On the Complexity of Universal Programs |
135
click to vote
PPOPP
1995
ACM
15 years 8 months ago
1995
ACM
paper we describe d/streams, a language-independent abstraction with a small set of simple primitives for buffered I/O on distributed data-structures. We describe the interface an...
130
click to vote
CORR
2006
Springer
15 years 5 months ago
2006
Springer
We study the problem of preemptive scheduling n jobs with given release times on m identical parallel machines. The objective is to minimize the average flow time. We show that wh...
132
click to vote
AMAST
2006
Springer
15 years 8 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
129
click to vote
SIGCSE
2005
ACM
15 years 10 months ago
2005
ACM
Java is the canonical language for teaching introductory programming, but its complex syntax and abundance of constructs are difficult for beginners to learn. This paper shows how...
126
Voted
TACS
1994
Springer
15 years 9 months ago
1994
Springer
traction for PCF1 Samson.Abramsky2 University of Edinburgh and Radha Jagadeesan3 Loyola University Chicago and Pasquale Malacaria4 Queen Mary and Westfield College An intensional m...