Saved in:
| Main Authors: | Mari, Mathieu, Mukherjee, Anish, Ren, Runtian, Sankowski, Piotr |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2401.05834 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
Online Multi-level Aggregation with Delays and Stochastic Arrivals
by: Mari, Mathieu, et al.
Published: (2024)
by: Mari, Mathieu, et al.
Published: (2024)
Online matching with delays and stochastic arrival times
by: Mari, Mathieu, et al.
Published: (2022)
by: Mari, Mathieu, et al.
Published: (2022)
Faster Semi-streaming Matchings via Alternating Trees
by: Mitrović, Slobodan, et al.
Published: (2024)
by: Mitrović, Slobodan, et al.
Published: (2024)
Dynamic PageRank: Algorithms and Lower Bounds
by: Jayaram, Rajesh, et al.
Published: (2024)
by: Jayaram, Rajesh, et al.
Published: (2024)
Fully Dynamic Shortest Paths in Sparse Digraphs
by: Karczmarz, Adam, et al.
Published: (2024)
by: Karczmarz, Adam, et al.
Published: (2024)
Streaming Graph Algorithms in the Massively Parallel Computation Model
by: Czumaj, Artur, et al.
Published: (2025)
by: Czumaj, Artur, et al.
Published: (2025)
Log Diameter Rounds MST Verification and Sensitivity in MPC
by: Coy, Sam, et al.
Published: (2024)
by: Coy, Sam, et al.
Published: (2024)
Online Weighted Paging with Unknown Weights
by: Levy, Orin, et al.
Published: (2024)
by: Levy, Orin, et al.
Published: (2024)
Non-Linear Paging
by: Doron-Arad, Ilan, et al.
Published: (2024)
by: Doron-Arad, Ilan, et al.
Published: (2024)
Online Sampling and Decision Making with Low Entropy
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2021)
by: Hajiaghayi, Mohammad Taghi, et al.
Published: (2021)
Learning-Augmented Algorithms for $k$-median via Online Learning
by: Hebbar, Anish, et al.
Published: (2026)
by: Hebbar, Anish, et al.
Published: (2026)
Instance-Optimality in PageRank Computation
by: Thorup, Mikkel, et al.
Published: (2025)
by: Thorup, Mikkel, et al.
Published: (2025)
New and Improved Bounds for Markov Paging
by: Pabbaraju, Chirag, et al.
Published: (2025)
by: Pabbaraju, Chirag, et al.
Published: (2025)
Personalized PageRank Estimation in Undirected Graphs
by: Bertram, Christian, et al.
Published: (2026)
by: Bertram, Christian, et al.
Published: (2026)
Revisiting Local Computation of PageRank: Simple and Optimal
by: Wang, Hanzhi, et al.
Published: (2024)
by: Wang, Hanzhi, et al.
Published: (2024)
PageRank Centrality in Directed Graphs with Bounded In-Degree
by: Thorup, Mikkel, et al.
Published: (2025)
by: Thorup, Mikkel, et al.
Published: (2025)
Efficient Algorithms for Personalized PageRank Computation: A Survey
by: Yang, Mingji, et al.
Published: (2024)
by: Yang, Mingji, et al.
Published: (2024)
Bin Packing under Random-Order: Breaking the Barrier of 3/2
by: Hebbar, Anish, et al.
Published: (2024)
by: Hebbar, Anish, et al.
Published: (2024)
Approximating Single-Source Personalized PageRank with Absolute Error Guarantees
by: Wei, Zhewei, et al.
Published: (2024)
by: Wei, Zhewei, et al.
Published: (2024)
Revisiting Local PageRank Estimation on Undirected Graphs: Simple and Optimal
by: Wang, Hanzhi
Published: (2024)
by: Wang, Hanzhi
Published: (2024)
Parameterized complexity of isometric path partition: treewidth and diameter
by: Chakraborty, Dibyayan, et al.
Published: (2025)
by: Chakraborty, Dibyayan, et al.
Published: (2025)
Dimension-Accuracy Tradeoffs in Contrastive Embeddings for Triplets, Terminals & Top-k Nearest Neighbors
by: Chatziafratis, Vaggos, et al.
Published: (2023)
by: Chatziafratis, Vaggos, et al.
Published: (2023)
Testing frequency distributions in a stream
by: Mathieu, Claire, et al.
Published: (2023)
by: Mathieu, Claire, et al.
Published: (2023)
LMQ-Sketch: Lagom Multi-Query Sketch for High-Rate Online Analytics
by: Hilgendorf, Martin, et al.
Published: (2025)
by: Hilgendorf, Martin, et al.
Published: (2025)
Online Matrix Factorization, Online Private Query Release, and Online Discrepancy Minimization
by: Nikolov, Aleksandar, et al.
Published: (2026)
by: Nikolov, Aleksandar, et al.
Published: (2026)
Towards Optimal Robustness in Learning-Augmented Paging
by: Chen, Peng, et al.
Published: (2026)
by: Chen, Peng, et al.
Published: (2026)
Improved and Parameterized Algorithms for Online Multi-level Aggregation: A Memory-based Approach
by: Turoczy, Alexander, et al.
Published: (2025)
by: Turoczy, Alexander, et al.
Published: (2025)
Anytime Sorting Algorithms (Extended Version)
by: Caizergues, Emma, et al.
Published: (2024)
by: Caizergues, Emma, et al.
Published: (2024)
Approximating the Maximum Independent Set of Convex Polygons with a Bounded Number of Directions
by: Grandoni, Fabrizio, et al.
Published: (2024)
by: Grandoni, Fabrizio, et al.
Published: (2024)
Tight Bounds for Online Balanced Partitioning in the Generalized Learning Model
by: Räcke, Harald, et al.
Published: (2024)
by: Räcke, Harald, et al.
Published: (2024)
Near-Optimality for Single-Source Personalized PageRank
by: Jiang, Xinpeng, et al.
Published: (2025)
by: Jiang, Xinpeng, et al.
Published: (2025)
Online Matching under KIID: Enhanced Competitive Analysis through Ordinary Differential Equation Systems
by: Xu, Pan
Published: (2025)
by: Xu, Pan
Published: (2025)
Optimal Decentralized Smoothed Online Convex Optimization
by: Bhuyan, Neelkamal, et al.
Published: (2024)
by: Bhuyan, Neelkamal, et al.
Published: (2024)
Online String Attractors
by: Whittington, Philip
Published: (2024)
by: Whittington, Philip
Published: (2024)
Online Unbounded Knapsack
by: Böckenhauer, Hans-Joachim, et al.
Published: (2024)
by: Böckenhauer, Hans-Joachim, et al.
Published: (2024)
Improved Online Sorting
by: Nirjhor, Jubayer, et al.
Published: (2025)
by: Nirjhor, Jubayer, et al.
Published: (2025)
Online Metric TSP
by: Bertram, Christian
Published: (2025)
by: Bertram, Christian
Published: (2025)
Improved Online Reachability Preservers
by: Bodwin, Greg, et al.
Published: (2024)
by: Bodwin, Greg, et al.
Published: (2024)
Dependency-Aware Online Caching
by: Dallot, Julien, et al.
Published: (2024)
by: Dallot, Julien, et al.
Published: (2024)
The Online Submodular Assignment Problem
by: Hathcock, Daniel, et al.
Published: (2024)
by: Hathcock, Daniel, et al.
Published: (2024)
Similar Items
-
Online Multi-level Aggregation with Delays and Stochastic Arrivals
by: Mari, Mathieu, et al.
Published: (2024) -
Online matching with delays and stochastic arrival times
by: Mari, Mathieu, et al.
Published: (2022) -
Faster Semi-streaming Matchings via Alternating Trees
by: Mitrović, Slobodan, et al.
Published: (2024) -
Dynamic PageRank: Algorithms and Lower Bounds
by: Jayaram, Rajesh, et al.
Published: (2024) -
Fully Dynamic Shortest Paths in Sparse Digraphs
by: Karczmarz, Adam, et al.
Published: (2024)