Sciweavers

61 search results - page 7 / 13
» Some Open Questions Related to Cuckoo Hashing
Sort
View
69
Voted
CORR
2010
Springer
151views Education» more  CORR 2010»
14 years 10 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
91
Voted
SODA
1998
ACM
159views Algorithms» more  SODA 1998»
15 years 1 months ago
Average-Case Analyses of First Fit and Random Fit Bin Packing
We prove that the First Fit bin packing algorithm is stable under the input distribution U{k - 2, k} for all k 3, settling an open question from the recent survey by Coffman, Gar...
Susanne Albers, Michael Mitzenmacher
IJMSO
2007
102views more  IJMSO 2007»
14 years 11 months ago
Referent tracking for Digital Rights Management
: Digital Rights Management (DRM) covers the description, identification, trading, protection, monitoring and tracking of all forms of rights over both tangible and intangible asse...
Werner Ceusters, Barry Smith
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 8 days ago
An axiomatic approach to algebrization
Non-relativization of complexity issues can be interpreted as giving some evidence that these issues cannot be resolved by "black-box" techniques. In the early 1990'...
Russell Impagliazzo, Valentine Kabanets, Antonina ...
99
Voted
ISAAC
2009
Springer
132views Algorithms» more  ISAAC 2009»
15 years 6 months ago
Hilbert's Thirteenth Problem and Circuit Complexity
We study the following question, communicated to us by Mikl´os Ajtai: Can all explicit (e.g., polynomial time computable) functions f : ({0, 1}w )3 → {0, 1}w be computed by word...
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Br...