Sciweavers

190 search results - page 20 / 38
» A Simple Proof Technique for Certain Parametricity Results
Sort
View
APPROX
2008
Springer
89views Algorithms» more  APPROX 2008»
13 years 9 months ago
Santa Claus Meets Hypergraph Matchings
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
Arash Asadpour, Uriel Feige, Amin Saberi
FCT
2003
Springer
14 years 24 days ago
On Boundaries of Highly Visible Spaces and Applications
The purpose of this paper is to investigate the properties of a certain class of highly visible spaces. For a given geometric space C containing obstacles specified by disjoint s...
John H. Reif, Zheng Sun
ECOOP
2005
Springer
14 years 1 months ago
Attached Types and Their Application to Three Open Problems of Object-Oriented Programming
The three problems of the title — the first two widely discussed in the literature, the third less well known but just as important for further development of object technology ...
Bertrand Meyer
VMCAI
2004
Springer
14 years 28 days ago
Boolean Algebra of Shape Analysis Constraints
Shape analysis is a promising technique for statically verifying and extracting properties of programs that manipulate complex data structures. We introduce a new characterization...
Viktor Kuncak, Martin C. Rinard
EUROCRYPT
2004
Springer
14 years 1 months ago
Chosen-Ciphertext Security from Identity-Based Encryption
Abstract. We propose a simple and efficient construction of a CCAsecure public-key encryption scheme from any CPA-secure identity-based encryption (IBE) scheme. Our construction re...
Ran Canetti, Shai Halevi, Jonathan Katz