Pages that link to "Item:Q1011761"
From MaRDI portal
The following pages link to On the complexity of crossings in permutations (Q1011761):
Displayed 5 items.
- On the computation of median linear orders, of median complete preorders and of median weak orders (Q449031) (← links)
- The nearest neighbor Spearman footrule distance for bucket, interval, and partial orders (Q2392744) (← links)
- COMPARING AND AGGREGATING PARTIAL ORDERS WITH KENDALL TAU DISTANCES (Q2846476) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- The Nearest Neighbor Spearman Footrule Distance for Bucket, Interval, and Partial Orders (Q3004688) (← links)