منابع مشابه
Computing Vertex-Disjoint Paths using MAOs
Let G be a graph with minimum degree δ. It is well-known that maximal adjacency orderings (MAOs) compute a vertex set S such that every pair of S is connected by at least δ internally vertex-disjoint paths in G. We present an algorithm that, given any pair of S, computes these δ paths in linear time O(n+m). This improves the previously best solutions for these special vertex pairs, which were f...
متن کاملCuckoo Hashing
We present a simple and e cient dictionary with worst case constant lookup time, equaling the theoretical performance of the classic dynamic perfect hashing scheme of Dietzfelbinger et al. (Dynamic perfect hashing: Upper and lower bounds. SIAM J. Comput., 23(4):738 761, 1994). The space usage is similar to that of binary search trees, i.e., three words per key on average. The practicality of th...
متن کاملMaos non-volatile memory structures with lower bandgap storage layer
2014 Introduction of a thin Si3N4 layer in metal-Al2O3-SiO2-Si (MAOS) memory structures leads to increased charge storage capability and reduced writing voltages for these MANOS structures. O2 annealing significantly affects these properties and the charging mechanism. Preliminary results on charge retention are presented. REVUE DE PHYSIQUE APPLIQUÉE TOME 13, DÉCEMBRE 1978,
متن کاملAdaptive Cuckoo Filters
We introduce the adaptive cuckoo filter (ACF), a data structure for approximate set membership that extends cuckoo filters by reacting to false positives, removing them for future queries. As an example application, in packet processing queries may correspond to flow identifiers, so a search for an element is likely to be followed by repeated searches for that element. Removing false positives ...
متن کاملCuckoo hashing: Further analysis
We consider cuckoo hashing as proposed by Pagh and Rodler in 2001. We show that the expected construction time of the hash table is O(n) as long as the two open addressing tables are each of size at least (1 + ǫ)n, where ǫ > 0 and n is the number of data points. Slightly improved bounds are obtained for various probabilities and constraints. The analysis rests on simple properties of branching ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Index on Censorship
سال: 2001
ISSN: 0306-4220,1746-6067
DOI: 10.1080/03064220108536886