Sciweavers

ICALP
2005
Springer
14 years 6 months ago
Hadamard Tensors and Lower Bounds on Multiparty Communication Complexity
We develop a new method for estimating the discrepancy of tensors associated with multiparty communication problems in the “Number on the Forehead” model of Chandra, Furst and...
Jeff Ford, Anna Gál
ICALP
2005
Springer
14 years 6 months ago
Measure and Conquer: Domination - A Case Study
Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch
ICALP
2005
Springer
14 years 6 months ago
A Finite Basis for Failure Semantics
Abstract. We present a finite ω-complete axiomatization for the process algebra BCCSP modulo failure semantics, in case of a finite alphabet. This solves an open question by Gro...
Wan Fokkink, Sumit Nain
ICALP
2005
Springer
14 years 6 months ago
Completely Non-malleable Schemes
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
Marc Fischlin
ICALP
2005
Springer
14 years 6 months ago
Optimal Spaced Seeds for Faster Approximate String Matching
Filtering is a standard technique for fast approximate string matching in practice. In filtering, a quick first step is used to rule out almost all positions of a text as possib...
Martin Farach-Colton, Gad M. Landau, Süleyman...
ICALP
2005
Springer
14 years 6 months ago
Recursive Markov Decision Processes and Recursive Stochastic Games
We introduce Recursive Markov Decision Processes (RMDPs) and Recursive Simple Stochastic Games (RSSGs), which are classes of (finitely presented) countable-state MDPs and zero-su...
Kousha Etessami, Mihalis Yannakakis
ICALP
2005
Springer
14 years 6 months ago
Online Interval Coloring and Variants
We study interval coloring problems and present new upper and lower bounds for several variants. We are interested in four problems, online coloring of intervals with and without b...
Leah Epstein, Meital Levy
ICALP
2005
Springer
14 years 6 months ago
Fast Neighbor Joining
Isaac Elias, Jens Lagergren
ICALP
2005
Springer
14 years 6 months ago
Approximation Algorithms for Euclidean Group TSP
In the Euclidean group Traveling Salesman Problem (TSP), we are given a set of points P in the plane and a set of m connected regions, each containing at least one point of P. We w...
Khaled M. Elbassioni, Aleksei V. Fishkin, Nabil H....
ICALP
2005
Springer
14 years 6 months ago
New Approaches for Virtual Private Network Design
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
Friedrich Eisenbrand, Fabrizio Grandoni, Gianpaolo...