A lower bound for sorting networks based on the shuffle permutation (Q4311642): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sorting in \(c \log n\) parallel steps / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Lower Bound on the Size of Shellsort Sorting Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Theoretical Aspects of VLSI Pin Limitations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5585020 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified theory of interconnection network structure / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4002466 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interpolation between bases and the shuffle exchange network / rank
 
Normal rank
Property / cites work
 
Property / cites work: Notes on Shuffle/Exchange-Type Switching Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved sorting networks with O(log N) depth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4230344 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rearrangeability of multistage shuffle/exchange networks / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:04, 23 May 2024

scientific article; zbMATH DE number 679590
Language Label Description Also known as
English
A lower bound for sorting networks based on the shuffle permutation
scientific article; zbMATH DE number 679590

    Statements