Constructions of permutation arrays for certain scheduling cost measures
From MaRDI portal
Publication:4322473
DOI10.1002/rsa.3240060105zbMath0853.05019OpenAlexW2058841548MaRDI QIDQ4322473
Joseph (Seffi) Naor, Ron M. Roth
Publication date: 9 December 1996
Published in: Random Structures & Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/rsa.3240060105
Combinatorics in computer science (68R05) Other designs, configurations (05B30) Orthogonal arrays, Latin squares, Room squares (05B15) Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)
Related Items (2)
A tight analysis and near-optimal instances of the algorithm of Anderson and Woll ⋮ Performing work with asynchronous processors: Message-delay-sensitive bounds
Cites Work
- Generating pseudo-random permutations and maximum flow algorithms
- Explicit group-theoretical constructions of combinatorial schemes and their application to the design of expanders and concentrators
- Ramanujan graphs
- Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs
- A Note on Ramsey's Theorem
- Class of constructive asymptotically good algebraic codes
This page was built for publication: Constructions of permutation arrays for certain scheduling cost measures
