74 search results - page 7 / 15 » icalp 2005 |
142
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Trevisan has shown that constructions of pseudo-random generators from hard functions (the Nisan-Wigderson approach) also produce extractors. We show that constructions of pseudo-r...
151
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We investigate a general paradigm for constructing arbitraryinput-length (AIL) MACs from fixed-input-length (FIL) MACs, define the waste as the relevant efficiency para...
162
Voted
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
d Abstract) MohammadReza Mousavi and Michel A. Reniers Department of Computer Science, Eindhoven University of Technology, NL-5600MB Eindhoven, The Netherlands Abstract. In this pa...
162
click to vote
ICALP
2005
Springer
15 years 11 months ago
2005
Springer
Although every terminating loop has a ranking function, not every loop has a ranking function of a restricted form, such as a lexicographic tuple of polynomials over program variab...
152
click to vote
ICALP
2005
Springer
15 years 11 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...