Linear probing and graphs
From MaRDI portal
Publication:1277382
DOI10.1007/PL00009240zbMath0918.68079arXivcs/9801103OpenAlexW1979069302WikidataQ61386877 ScholiaQ61386877MaRDI QIDQ1277382
Publication date: 2 February 1999
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/cs/9801103
Related Items (48)
The binomial transform and the analysis of skip lists ⋮ A Vervaat-like path transformation for the reflected Brownian bridge conditioned on its local time at 0 ⋮ Gončarov polynomials and parking functions ⋮ Probabilizing parking functions ⋮ Distance-sensitive planar point location ⋮ On a resource-constrained scheduling problem with application to distributed systems reconfiguration ⋮ Average case analysis for tree labelling schemes ⋮ A unified approach to linear probing hashing with buckets ⋮ Parking functions and tree inversions revisited ⋮ On quickselect, partial sorting and multiple Quickselect ⋮ On the lexicographical generation of compressed codes ⋮ Algorithms for the continuous nonlinear resource allocation problem -- new implementations and numerical studies ⋮ Generic complexity of Presburger arithmetic ⋮ Distances in random digital search trees ⋮ Gelation in coagulating systems ⋮ A Cartesian embedded boundary method for the compressible Navier-Stokes equations ⋮ On directed lattice paths with vertical steps ⋮ Эволюционные уравнения и случайные графы ⋮ Multi-stage optimization of decision and inhibitory trees for decision tables with many-valued decisions ⋮ An improved version of cuckoo hashing: average case analysis of construction cost and search operations ⋮ Synchronous parallel kinetic Monte Carlo for continuum diffusion-reaction systems ⋮ Parking functions: from combinatorics to probability ⋮ On smoothed analysis of quicksort and Hoare's find ⋮ Lightweight data indexing and compression in external memory ⋮ Posets with seven linear extensions sortable by three comparisons ⋮ Exact formulas for moments of sums of classical parking functions ⋮ An approximation algorithm for binary searching in trees ⋮ Analysis of a drop-push model for percolation and coagulation ⋮ The \(m\)-version of binary search trees: an average case analysis ⋮ The analysis of range quickselect and related problems ⋮ On linear-time algorithms for the continuous quadratic Knapsack problem ⋮ Multiparking functions, graph searching, and the Tutte polynomial ⋮ The impact of randomization in smoothing networks ⋮ Evaluating geometric queries using few arithmetic operations ⋮ Frequency-based views to pattern collections ⋮ D?E?K=(1000)8 ⋮ Random maps, coalescing saddles, singularity analysis, and Airy phenomena ⋮ Limit laws for terminal nodes in random circuits with restricted fan-out: a family of graphs generalizing binary search trees ⋮ New hook length formulas for binary trees ⋮ Generalized parking functions, tree inversions, and multicolored graphs ⋮ New hook length formulas for binary trees ⋮ Fuzzy lattice reasoning (FLR) classifier and its application for ambient ozone estimation ⋮ A CAT algorithm for generating permutations with a fixed number of inversions ⋮ A conditional Berry–Esseen inequality ⋮ Sorting networks of logarithmic depth, further simplified ⋮ Approximation results for a bicriteria job scheduling problem on a single machine without preemption ⋮ Double hashing with passbits ⋮ Asymptotic analysis of an optimized quicksort algorithm.
This page was built for publication: Linear probing and graphs
