Fast parallel algorithms for the maximum empty rectangle problem. (Q5955753): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Geometric applications of a matrix-searching algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on finding a maximum empty rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient algorithm for maxdominance, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the Largest Empty Rectangle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the largest rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3992991 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5186760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new algorithm for the largest empty rectangle problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3326832 / rank
 
Normal rank

Revision as of 22:51, 3 June 2024

scientific article; zbMATH DE number 1706636
Language Label Description Also known as
English
Fast parallel algorithms for the maximum empty rectangle problem.
scientific article; zbMATH DE number 1706636

    Statements