10271 search results - page 485 / 2055 » Computer Science |
139
Voted
MFCS
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. Problem parameters are ubiquitous. In every area of computer science, we find all kinds of “special aspects” to the problems encountered. Hence, the study of paramet...
137
click to vote
STACS
2001
Springer
15 years 10 months ago
2001
Springer
Abstract. We consider a collection of robots which are identical (anonymous), have limited visibility of the environment, and no memory of the past (oblivious); furthermore, they a...
172
click to vote
TLCA
2001
Springer
15 years 10 months ago
2001
Springer
Using methods drawn from Game Semantics, we build a sound and computationally adequate model of a simple calculus that includes both subtyping and recursive types. Our model solves...
160
click to vote
FOCS
1997
IEEE
15 years 10 months ago
1997
IEEE
We show that in the context of nonuniform complexity, nondeterministic logarithmic space bounded computation can be made unambiguous. An analogous result holds for the class of pr...
186
click to vote
MFPS
1993
15 years 10 months ago
1993
al abstract machine for graph reduction Alan Jeffrey Report 3/92 August 1992 Computer Science School of Cognitive and Computing Sciences University of Sussex Brighton BN1 9QH ISSN ...