:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Brunelli, Filippo, Crescenzi, Pierluigi, Viennot, Laurent
Format:	Preprint
Published:	2025
Subjects:	Data Structures and Algorithms Networking and Internet Architecture
Online Access:	https://arxiv.org/abs/2501.12708
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

On The Complexity of Maximizing Temporal Reachability via Trip Temporalisation
by: Brunelli, Filippo, et al.
Published: (2021)

Certificates in P and Subquadratic-Time Computation of Radius, Diameter, and all Eccentricities in Graphs
by: Dragan, Feodor F., et al.
Published: (2018)

SQUID: Faster Analytics via Sampled Quantile Estimation
by: Ben-Basat, Ran, et al.
Published: (2022)

Revisiting RFID Missing Tag Identification
by: Liu, Kanghuai, et al.
Published: (2025)

Vermilion: A Traffic-Aware Reconfigurable Optical Interconnect with Formal Throughput Guarantees
by: Addanki, Vamsi, et al.
Published: (2025)

Indirect Coflow Scheduling
by: Lindermayr, Alexander, et al.
Published: (2025)

Cost-driven prunings for iterative solving of constrained routing problem with SRLG-disjoint protection
by: Mosharev, P. A., et al.
Published: (2025)

Universal Connection Schedules for Reconfigurable Networking
by: Baral, Shaleen, et al.
Published: (2025)

FastReChain: A Novel Bidirectional Model-Based Algorithm for Topology Engineering of OCS-Based Clusters
by: Zhu, Zihan, et al.
Published: (2025)

Adaptive determinantal scheduling with fairness in wireless networks
by: Keeler, H. P., et al.
Published: (2025)

An improved Lower Bound for Local Failover in Directed Networks via Binary Covering Arrays
by: Akker, Erik van den, et al.
Published: (2026)

An Improved Modular Addition Checksum Algorithm
by: Koopman, Philip
Published: (2023)

Deterministic Scheduling of Periodic Messages for Low Latency in Cloud RAN
by: Barth, Dominique, et al.
Published: (2018)

Polylogarithmic Approximation for Covering and Connecting Multi-Interface Networks
by: Szyfelbein, Michał, et al.
Published: (2026)

PlanB: Efficient Software IPv6 Lookup with Linearized $B^+$-Tree
by: Zhang, Zhihao, et al.
Published: (2026)

Toward Self-Adjusting k-ary Search Tree Networks
by: Feder, Evgenii, et al.
Published: (2023)

Dynamic Demand-Aware Link Scheduling for Reconfigurable Datacenters
by: Hanauer, Kathrin, et al.
Published: (2023)

Competitive Analysis of Online Path Selection: Impacts of Path Length, Topology, and System-Level Costs
by: Cao, Ying, et al.
Published: (2024)

EdgeSketch: Efficient Analysis of Massive Graph Streams
by: Lemiesz, Jakub, et al.
Published: (2026)

In the Search of Optimal Tree Networks: Hardness and Heuristics
by: Buzdalov, Maxim, et al.
Published: (2024)

A Grouped Sorting Queue Supporting Dynamic Updates for Timer Management in High-Speed Network Interface Cards
by: Wang, Zekun, et al.
Published: (2026)

Perfect Network Resilience in Polynomial Time
by: Bentert, Matthias, et al.
Published: (2026)

Solving No-wait Scheduling for Time-Sensitive Networks with Daisy-Chain Topology
by: Li, Qian, et al.
Published: (2026)

SpiderDAN: Matching Augmentation in Demand-Aware Networks
by: Figiel, Aleksander, et al.
Published: (2024)

Generic Dijkstra
by: Szcześniak, Ireneusz, et al.
Published: (2022)

Parameterized Restless Temporal Path
by: Cauvi, Justine, et al.
Published: (2025)

Minimum Congestion Routing of Unsplittable Flows in Data-Center Networks
by: Ferreira, Miguel, et al.
Published: (2025)

Tree algorithms for set reconciliation
by: Lázaro, Francisco, et al.
Published: (2025)

Algorithm Design for Continual Learning in IoT Networks
by: Hao, Shugang, et al.
Published: (2024)

Geometry helps in routing scalability
by: Piekenbrock, Matt
Published: (2024)

Multipartite Entanglement Distribution in Quantum Networks using Subgraph Complementations
by: Sen, Aniruddha, et al.
Published: (2023)

Learning-Augmented Online Packet Scheduling with Deadlines
by: Liang, Ya-Chun, et al.
Published: (2023)

On Computing Top-$k$ Simple Shortest Paths from a Single Source
by: D'Emidio, Mattia, et al.
Published: (2025)

Instability of backoff protocols with arbitrary arrival rates
by: Goldberg, Leslie Ann, et al.
Published: (2022)

Greedy Routing in a Sequentially Grown One-Dimensional Random Graph
by: Ponomarenko, Alexander
Published: (2026)

Quantum Algorithms for Network Signal Coordination
by: Dixit, Vinayak, et al.
Published: (2026)

Practical Byzantine Reliable Broadcast on Partially Connected Networks (Extended version)
by: Bonomi, Silvia, et al.
Published: (2021)

Quantizing With Randomized Hadamard Transforms: Efficient Heuristic Now Proven
by: Ben-Basat, Ran, et al.
Published: (2026)

MementoHash: A Stateful, Minimal Memory, Best Performing Consistent Hash Algorithm
by: Coluzzi, Massimo, et al.
Published: (2023)

Optimal and Near-Optimal Adaptive Vector Quantization
by: Ben-Basat, Ran, et al.
Published: (2024)