Approximate Maximum Rank Aggregation: Beyond the Worst-Case
10.4230/LIPIcs.FSTTCS.2023.12
Saved in:
Main Authors: | Alvin, YHY, Chakraborty, D |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
Schloss Dagstuhl - Leibniz-Zentrum für Informatik
2024
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/247660 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
In-order sliding-window aggregation in worst-case constant time
by: Kanat Tangwongsan, et al.
Published: (2022) -
Fair Rank Aggregation
by: Chakraborty, D, et al.
Published: (2024) -
Low-latency sliding-window aggregation in worst-case constant time
by: Kanat Tangwongsan, et al.
Published: (2018) -
Fair Rank Aggregation.
by: Chakraborty, Diptarka, et al.
Published: (2024) -
Approximating the Center Ranking Under Ulam
by: Chakraborty, D, et al.
Published: (2023)