scientific article
From MaRDI portal
Publication:3361878
zbMath0734.68031MaRDI QIDQ3361878
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (20)
Clique decompositions of multipartite graphs and completion of Latin squares ⋮ The Existence of Designs via Iterative Absorption: Hypergraph 𝐹-designs for Arbitrary 𝐹 ⋮ Tight bounds for parallel randomized load balancing ⋮ An optimal parallel algorithm for sorting multisets ⋮ Improved parallel integer sorting without concurrent writing ⋮ The complexity of parallel prefix problems on small domains ⋮ Parallel construction of succinct trees ⋮ (Probabilistic) recurrence relations revisited ⋮ The log-star revolution ⋮ Probabilistic recurrence relations revisited ⋮ Conservative algorithms for parallel and sequential integer sorting ⋮ Threshold for Steiner triple systems ⋮ Minimalist designs ⋮ Decompositions into isomorphic rainbow spanning trees ⋮ Improved deterministic parallel integer sorting ⋮ Edge-decompositions of graphs with high minimum degree ⋮ A blow-up lemma for approximate decompositions ⋮ On a compaction theorem of Ragde ⋮ Improved parallel construction of wavelet trees and rank/select structures ⋮ On the decomposition threshold of a given graph
This page was built for publication:
