107
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
141
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
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...
141
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
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...
166
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Weighted automata are used to describe quantitative properties in various areas such as probabilistic systems, image compression, speech-to-text processing. The behaviour...
93
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
131
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We study a particular aspect of the balanced allocation paradigm (also known as the “two-choices paradigm”): constant sized bins, packed as tightly as possible. Let d ≥ 1 be...
169
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
We establish the first polynomial-strength time-space lower bounds for problems in the lineartime hierarchy on randomized machines with two-sided error. We show that for any inte...
136
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
131
click to vote
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. Radio networks model wireless communication when processing units communicate using one wave frequency. This is captured by the property that multiple messages arriving s...
100
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
