Sciweavers

ICALP
2007
Springer
13 years 9 months ago
Reconciling Data Compression and Kolmogorov Complexity
While data compression and Kolmogorov complexity are both about effective coding of words, the two settings differ in the following respect. A compression algorithm or compressor...
Laurent Bienvenu, Wolfgang Merkle
ICALP
2007
Springer
13 years 9 months ago
Categorical Views on Computations on Trees (Extended Abstract)
Ichiro Hasuo, Bart Jacobs, Tarmo Uustalu
ICALP
2007
Springer
13 years 9 months ago
Unrestricted Aggregate Signatures
Mihir Bellare, Chanathip Namprempre, Gregory Neven
ICALP
2007
Springer
13 years 9 months ago
Low Distortion Spanners
A spanner of an undirected unweighted graph is a subgraph that approximates the distance metric of the original graph with some specified accuracy. Specifically, we say H ⊆ G i...
Seth Pettie
ICALP
2007
Springer
13 years 9 months ago
Mechanism Design for Fractional Scheduling on Unrelated Machines
In this paper, we consider the mechanism design version of the fractional variant of the scheduling problem on unrelated machines. We give a lower bound of 2 − 1/n for any fracti...
George Christodoulou, Elias Koutsoupias, Annam&aac...
ICALP
2007
Springer
13 years 9 months ago
Separating Deterministic from Nondeterministic NOF Multiparty Communication Complexity
d Abstract) Paul Beame1, , Matei David2, , Toniann Pitassi2, , and Philipp Woelfel2,† 1 University of Washington 2 University of Toronto Abstract. We solve some fundamental probl...
Paul Beame, Matei David, Toniann Pitassi, Philipp ...