Sciweavers

10447 search results - page 357 / 2090
» The Philosophy of Computer Science
Sort
View
STACS
2010
Springer
16 years 1 months ago
Computing Least Fixed Points of Probabilistic Systems of Polynomials
We study systems of equations of the form X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a poly
Javier Esparza, Andreas Gaiser, Stefan Kiefer
160
Voted
EUROPAR
2003
Springer
16 years 2 hour ago
The Verifying Compiler: A Grand Challenge for Computing Research
I propose a set of criteria which distinguish a grand challenge in science or engineering from the many other kinds of short-term or long-term research problems that engage the int...
C. A. R. Hoare
CAD
2010
Springer
15 years 6 months ago
Volumes with piecewise quadratic medial surface transforms: Computation of boundaries and trimmed offsets
MOS surfaces are rational surfaces in R3,1 which provide rational envelopes of the associated two-parameter family of spheres. Moreover, all the offsets admit rational parameteriz...
Bohumír Bastl, Bert Jüttler, Jir&iacut...
FOCS
2010
IEEE
15 years 4 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai