Cover Image

Online Distributed Queue Length Estimation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Bhaskara, Aditya, Gollapudi, Sreenivas, Im, Sungjin, Kollias, Kostas, Munagala, Kamesh
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Data Exchange Markets via Utility Balancing
by: Bhaskara, Aditya, et al.
Published: (2024)

Compact Conformal Subgraphs
by: Gollapudi, Sreenivas, et al.
Published: (2026)

Sample-Efficient Optimization over Generative Priors via Coarse Learnability
by: Awasthi, Pranjal, et al.
Published: (2025)

Why is My Route Different Today? An Algorithm for Explaining Route Selection
by: Schild, Aaron, et al.
Published: (2025)

First Passage Percolation with Queried Hints
by: Karntikoon, Kritkorn, et al.
Published: (2024)

Individual Fairness in Graph Decomposition
by: Munagala, Kamesh, et al.
Published: (2024)

Online Scheduling via Gradient Descent for Weighted Flow Time Minimization
by: Chen, Qingyun, et al.
Published: (2024)

Balanced Spanning Tree Distributions Have Separation Fairness
by: Chen, Harry, et al.
Published: (2025)

Learning-Augmented Online Scheduling with Parsimonious Preemption
by: Blue, Mugen, et al.
Published: (2026)

Efficient Online Conformal Selection with Limited Feedback
by: Gollapudi, Sreenivas, et al.
Published: (2026)

Online Load and Graph Balancing for Random Order Inputs
by: Im, Sungjin, et al.
Published: (2024)

Differential Privacy with Multiple Selections
by: Goel, Ashish, et al.
Published: (2024)

Efficient Algorithms for Cardinality Estimation and Conjunctive Query Evaluation With Simple Degree Constraints
by: Im, Sungjin, et al.
Published: (2025)

The Limits of Interval-Regulated Price Discrimination
by: Munagala, Kamesh, et al.
Published: (2024)

Fair Multi-agent Persuasion with Submodular Constraints
by: Bai, Yannan, et al.
Published: (2025)

New Tools for Smoothed Analysis: Least Singular Value Bounds for Random Matrices with Dependent Entries
by: Bhaskara, Aditya, et al.
Published: (2024)

Group Fairness and Multi-criteria Optimization in School Assignment
by: A., Santhini K., et al.
Published: (2024)

Binary Search with Distributional Predictions
by: Dinitz, Michael, et al.
Published: (2024)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
by: Im, Sungjin, et al.
Published: (2023)

Near-optimal Algorithms for Stochastic Online Bin Packing
by: Ayyadevara, Nikhil, et al.
Published: (2022)

Strategic Facility Location via Predictions
by: Chen, Qingyun, et al.
Published: (2024)

Improving Order with Queues
by: Karrenbauer, Andreas, et al.
Published: (2022)

The Robotaxi Placement Problem: Minimizing Expected ETA for Stochastic Demand
by: Caragiannis, Ioannis, et al.
Published: (2026)

Beyond a Single Queue: Multi-Level-Multi-Queue as an Effective Design for SSSP problems on GPUs
by: Hu, Zhengding, et al.
Published: (2026)

Concurrent Double-Ended Priority Queues
by: Fatourou, Panagiota, et al.
Published: (2025)

Exploring Monotone Priority Queues for Dijkstra Optimization
by: Costa, Jonas, et al.
Published: (2024)

Guessing Efficiently for Constrained Subspace Approximation
by: Bhaskara, Aditya, et al.
Published: (2025)

Bin Packing under Random-Order: Breaking the Barrier of 3/2
by: Hebbar, Anish, et al.
Published: (2024)

PIPQ: Strict Insert-Optimized Concurrent Priority Queue
by: Grimes, Olivia, et al.
Published: (2025)

Online Knapsack Problems with Estimates
by: Balabán, Jakub, et al.
Published: (2025)

Online Bin Packing with Item Size Estimates
by: Gehnen, Matthias, et al.
Published: (2025)

Improved Approximation Algorithms for Three-Dimensional Knapsack
by: Jansen, Klaus, et al.
Published: (2025)

The Peculiarities of Extending Queue Layouts
by: Depian, Thomas, et al.
Published: (2025)

Distribution Testing Meets Sum Estimation
by: Pradhan, Pinki, et al.
Published: (2025)

Length-Constrained Directed Expander Decomposition and Length-Constrained Vertex-Capacitated Flow Shortcuts
by: Haeupler, Bernhard, et al.
Published: (2025)

Distributed Sparsest Cut via Eigenvalue Estimation
by: Maus, Yannic, et al.
Published: (2025)

zSort: Stable Distribution Sort using Z-Score Partitioning
by: Jain, Hriday, et al.
Published: (2026)

Simple Length-Constrained Expander Decompositions
by: Bodwin, Greg, et al.
Published: (2025)

Counting on General Run-Length Grammars
by: Navarro, Gonzalo, et al.
Published: (2024)

Improved Approximations for Hard Graph Problems using Predictions
by: Aamand, Anders, et al.
Published: (2025)