SIGPLAN
2008
13 years 11 months ago
2008
SIGPLAN
2008
13 years 11 months ago
2008
SIGPLAN
2008
13 years 11 months ago
2008
SIGPLAN
2008
13 years 11 months ago
2008
For several decades universities have taught programming languages as a fundamental part of their undergraduate curriculum. These courses cover the core topics used in the design ...
SIGPLAN
2008
13 years 11 months ago
2008
In this white paper, we propose a list of essential concepts of programming languages, and discuss the techniques we have used to teach these concepts. Categories and Subject Desc...
CC
2007
Springer
13 years 11 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
CC
2007
Springer
13 years 11 months ago
2007
Springer
Mergers are procedures that, with the aid of a short random string, transform k (possibly dependent) random sources into a single random source, in a way that ensures that if one ...
CC
2007
Springer
13 years 11 months ago
2007
Springer
CC
2007
Springer
13 years 11 months ago
2007
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
CC
2007
Springer
13 years 11 months ago
2007
Springer
Abstract. The problem of testing membership in the subset of the natural numbers produced at the output gate of a {∪, ∩,− , +, ×} combinational circuit is shown to capture a...