scientific article; zbMATH DE number 873409
From MaRDI portal
Publication:4876454
zbMath0845.68057MaRDI QIDQ4876454
Publication date: 5 May 1996
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Parallel algorithms in computer science (68W10) Research exposition (monographs, survey articles) pertaining to computer science (68-02)
Related Items (11)
Linear waste of best fit bin packing on skewed distributions ⋮ On the distribution of the search cost for the move-to-front rule with random weights ⋮ Tight bounds for FEC-based reliable multicast ⋮ Computing similarity distances between rankings ⋮ Analytical depoissonization and its applications ⋮ ON THE COMBINATORICS OF BINARY SERIES-PARALLEL GRAPHS ⋮ Randomized allocation processes ⋮ Singularity analysis, Hadamard products, and tree recurrences ⋮ D?E?K=(1000)8 ⋮ A probabilistic analysis of some tree algorithms ⋮ The Maximum of a Random Walk and Its Application to Rectangle Packing
This page was built for publication:
