Sciweavers

227
Voted
COMPSAC
2011
IEEE
14 years 7 months ago
L1 - An Intermediate Language for Mixed-Protocol Secure Computation
—Secure Computation (SC) enables secure distributed computation of arbitrary functions of private inputs. It has many useful applications, e.g. benchmarking or auctions. Several ...
Axel Schröpfer, Florian Kerschbaum, Guenter M...
COMPSAC
2011
IEEE
14 years 7 months ago
Palimpsests of Time and Place
— This paper discusses ongoing research into the development of an original composition portfolio themed on the concept of palimpsests of time and place. The research involves th...
Jerry Fishenden, Andrew Hugill
COMBINATORICA
2011
14 years 7 months ago
Binary subtrees with few labeled paths
We prove several quantitative Ramseyan results involving ternary complete trees with {0, 1}-labeled edges where we attempt to find a complete binary subtree with as few labels as ...
Rodney G. Downey, Noam Greenberg, Carl G. Jockusch...
COMBINATORICA
2011
14 years 7 months ago
A q-analogue of the FKG inequality and some applications
Let L be a finite distributive lattice and µ : L → R+ a logsupermodular function. For functions k : L → R+ let Eµ(k; q) def = x∈L k(x)µ(x)qrank(x) ∈ R+ [q]. We prove fo...
Anders Björner
COMBINATORICA
2011
14 years 7 months ago
A local criterion for Tverberg graphs
The topological Tverberg theorem states that for any prime power q and continuous map from a (d + 1)(q − 1)-simplex to Rd , there are q disjoint faces Fi of the simplex whose im...
Alexander Engström
COMBINATORICA
2011
14 years 7 months ago
On planarity of compact, locally connected, metric spaces
Thomassen [Combinatorica 24 (2004), 699–718] proved that a 2–connected, compact, locally connected metric space is homeomorphic to a subset of the sphere if and only if it doe...
R. Bruce Richter, Brendan Rooney, Carsten Thomasse...
COMBINATORICA
2011
14 years 7 months ago
On the chromatic number of random geometric graphs
Given independent random points X1, . . . , Xn ∈ Rd with common probability distribution ν, and a positive distance r = r(n) > 0, we construct a random geometric graph Gn wi...
Colin McDiarmid, Tobias Müller
CODES
2011
IEEE
14 years 7 months ago
DistRM: distributed resource management for on-chip many-core systems
The trend towards many-core systems comes with various issues, among them their highly dynamic and non-predictable workloads. Hence, new paradigms for managing resources of many-c...
Sebastian Kobbe, Lars Bauer, Daniel Lohmann, Wolfg...
CODES
2011
IEEE
14 years 7 months ago
Analysis and optimization of fault-tolerant task scheduling on multiprocessor embedded systems
Reliability is a major requirement for most safety-related systems. To meet this requirement, fault-tolerant techniques such as hardware replication and software re-execution are ...
Jia Huang, Jan Olaf Blech, Andreas Raabe, Christia...