Journal ArticleDOI
Storing a Sparse Table with 0(1) Worst Case Access Time
Reads0
Chats0
TLDR
A data structure for representing a set of n items from a universe of m items, which uses space n+o(n) and accommodates membership queries in constant time and is easy to implement.Abstract:
A data structure for representing a set of n items from a umverse of m items, which uses space n + o(n) and accommodates membership queries m constant time is described. Both the data structure and the query algorithm are easy to ~mplement.read more
Citations
More filters
DissertationDOI
Router Congestion Control
TL;DR: This thesis study study how to set the rules of a queuing system so that all the users have a self interest in controlling congestion when it happens, and achieves the desired game-theoretic equilibrium.
DissertationDOI
On low dimensional models for functions in high dimensions
TL;DR: A simple algorithm is derived that achieves nearly optimal regret bounds, with the rate depending only on k and not d, and is extended to the scenario where the subset of active coordinate variables can possibly change across time.
Proceedings ArticleDOI
Space optimal packet classification for 2D conflict-free filters
Chung Keung Poon,Andy Kwok +1 more
TL;DR: A linear space data structure with O(min{logiu loglogn, /spl radic/lognloglogn}) query time is designed for the 2D packet classification problem for a set of conflict-free filters in an IP network, which is the first optimal spaceData structure with poly-logarithmic query time for this problem.
Journal ArticleDOI
Incremental algorithms for dispatching in dynamically typed languages
ZibinYoav,GilJoseph (Yossi) +1 more
TL;DR: A fundamental problem in the implementation of object-oriented languages is that of a frugal dispatching data structure, i.e., support for quick response to dispatching queries combined with compac...
Proceedings ArticleDOI
Extended expedited forwarding: the in-time PHB group
TL;DR: This paper presents a new set of forwarding behaviors that fits rate-adaptive and delay-sensitive applications with limited loss tolerance, and defines a scheduling mechanism that can be implemented efficiently and supports the defined forwarding behaviors.
References
More filters
Journal ArticleDOI
Should Tables Be Sorted
TL;DR: It is shown that, in a rather general model including al1 the commonly-used schemes, $\lceil $ lg(n+l) $\rceil$ probes to the table are needed in the worst case, provided the key space is sufficiently large.
Journal ArticleDOI
Storing a sparse table
TL;DR: This work proposes a good worst-case method for storing a static table of n entries, each an integer between 0 and N - 1, and analysis shows why a simpler algorithm used for compressing LR parsing tables works so well.
Journal ArticleDOI
Perfect hashing functions: a single probe retrieving method for static sets
TL;DR: A refinement of hashing which allows retrieval of an item in a static table with a single probe is considered, and a rough comparison with ordinary hashing is given which shows that this method can be used conveniently in several practical applications.
Journal ArticleDOI
Reciprocal hashing: a method for generating minimal perfect hashing functions
TL;DR: A method is presented for building minimal perfect hash functions, i.e., functions which allow single probe retrieval from minimally sized tables of identifier sets, and a proof of existence for minimalperfect hash functions of a special type (reciprocal type) is given.