scientific article
From MaRDI portal
Publication:3773321
zbMath0634.68019MaRDI QIDQ3773321
Publication date: 1987
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
permutationsbin packingsorting algorithmsaverage case analysis of algorithmsalgorithms for communicating networksmathematical analysis of algorithms
Searching and sorting (68P10) Exact enumeration problems, generating functions (05A15) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items (24)
An analysis of a class of algorithms for \(S\)-box construction ⋮ Next-fit packs a list and its reverse into the same number of bins ⋮ Applications of the theory of records in the study of random trees ⋮ Probabilistische analyse von heuristiken der kombinatorischen optimierung – ein überbllck ⋮ Average-case analysis of the smart next fit algorithm ⋮ Analytic methods in asymptotic enumeration ⋮ Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations ⋮ On-line bin packing ? A restricted survey ⋮ Polytopes, permutation shapes and bin packing ⋮ Beyond the worst-case bisection bound: Fast sorting and ranking on meshes ⋮ A guided tour of Chernoff bounds ⋮ Private vs. common random bits in communication complexity ⋮ Probabilistic estimation of the number of prefixes of a trace ⋮ Mellin transforms and asymptotics: Harmonic sums ⋮ Nondegenerate functions and permutations ⋮ Efficient enumeration of cyclic permutations in situ ⋮ A new model for the linear 1-dimensional online clustering problem ⋮ Majority gates vs. general weighted threshold gates ⋮ Techniques from combinatorial approximation algorithms yield efficient algorithms for random 2\(k\)-SAT ⋮ How the (1+1) ES using isotropic mutations minimizes positive definite quadratic forms ⋮ A MAINTENANCE MODEL FOR MANUFACTURING LEAD TIME IN A PRODUCTION SYSTEM WITH BMAP INPUT AND BILEVEL SETUP CONTROL ⋮ Largest-first sequential selection with a sum constraint ⋮ Enumerating \(S_n\) by associated transpositions and linear extensions of finite posets ⋮ A Band and Bound Technique for Simple Random Algorithms
Uses Software
This page was built for publication:
