ICALP
2010
Springer
14 years 4 months ago
2010
Springer
We settle the question of tight thresholds for offline cuckoo hashing. The problem can be stated as follows: we have n keys to be hashed into m buckets each capable of holding a s...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
We associate a CNF-formula to every instance of the mean-payoff game problem in such a way that if the value of the game is non-negative the formula is satisfiable, and if the va...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
Knowledge extraction is a fundamental notion, modeling machine possession of values (witnesses) in a computational complexity sense and enabling one to argue about the internal st...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
A discrete distribution D over Σ1 × · · · × Σn is called (non-uniform) k-wise independent if for any set of k indexes {i1, . . . , ik} and for any z1 ∈ Σi1 , . . . , zk ...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
We consider two-player turn-based games with zero-reachability and zero-safety objectives generated by extended vector addition systems with states. Although the problem of decidin...
ICALP
2010
Springer
14 years 4 months ago
2010
Springer
ECOOP
2010
Springer
14 years 4 months ago
2010
Springer
Abstract. With the current surge of scripting technologies, large programs are being built with dynamically typed languages. As these programs grow in size, semantics-based tools g...
ECOOP
2010
Springer
14 years 4 months ago
2010
Springer
Automated refactorings as implemented in modern IDEs for Java usually make no special provisions for concurrent code. Thus, refactored programs may exhibit unexpected new concurren...