WOLLIC
2010
Springer
13 years 11 months ago
2010
Springer
sed Logic for Program Abstractions Martin Lange1 and Markus Latte2 1 Dept. of Computer Science, University of Kassel, Germany 2 Dept. of Computer Science, Ludwig-Maximilians-Univer...
TARK
1992
Springer
13 years 11 months ago
1992
Springer
We present a bimodal logic suitable for formalizing reasoning about points and sets, and also states of the world and views about them. The most natural interpretation of the logi...
FOCS
1989
IEEE
13 years 11 months ago
1989
IEEE
In this paper, Boolean functions in ,4C0 are studied using harmonic analysis on the cube. The main result is that an ACO Boolean function has almost all of its “power spectrum”...
SIGCSE
1993
ACM
13 years 11 months ago
1993
ACM
Programming contests can provide a high-profile method for attracting interest in computer science. We describe our philosophy as it pertains to the purpose and merits of program...
ICALP
1992
Springer
13 years 11 months ago
1992
Springer
Abstract Bernard Chazelle Department of Computer Science Princeton University Burton Rosenberg Department of Mathematics and Computer Science Dartmouth College We give a lower bou...
IFIP
1994
Springer
13 years 11 months ago
1994
Springer
Development of a research project in Computer Science, integrating a considerable number of research institutions and about 1200 individual researchers all over a country with big...
ACM
1993
13 years 11 months ago
1993
ional Frameworks: Toolkits and Abstractions In Introductory Computer Science Cynthia Brown, Harriet Fell, Viera Proulx, Richard Rasala College of Computer Science, Northeastern Uni...
IFIP
1997
Springer
13 years 11 months ago
1997
Springer
: National and international standards for professional groups may become a dominant and governing force as internet-based professional training becomes universally accepted. Educa...
STOC
1997
ACM
13 years 11 months ago
1997
ACM
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
TPHOL
1997
IEEE
13 years 11 months ago
1997
IEEE
This note lists references which address –in some way or another– the problems relating to formal manipulation of logical expressions where terms can fail to denote. Reference...