Copertina

EdgeSketch: Efficient Analysis of Massive Graph Streams

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Lemiesz, Jakub, Yang, Dingqi, Cudré-Mauroux, Philippe
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Data Structures and Algorithms Networking and Internet Architecture
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

An Improved Modular Addition Checksum Algorithm
di: Koopman, Philip
Pubblicazione: (2023)

Revisiting RFID Missing Tag Identification
di: Liu, Kanghuai, et al.
Pubblicazione: (2025)

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

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

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

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

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

Indirect Coflow Scheduling
di: Lindermayr, Alexander, et al.
Pubblicazione: (2025)

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

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

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

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

Making Temporal Betweenness Computation Faster and Restless
di: Brunelli, Filippo, et al.
Pubblicazione: (2025)

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

Generic Dijkstra
di: Szcześniak, Ireneusz, et al.
Pubblicazione: (2022)

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

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

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

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

Geometry helps in routing scalability
di: Piekenbrock, Matt
Pubblicazione: (2024)

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

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

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

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

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

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

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

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

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

The Structure of Hypergraphs Arising in Cellular Mobile Communication Systems
di: Ganesan, Ashwin
Pubblicazione: (2022)

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

On the Resilience of Fast Failover Routing Against Dynamic Link Failures
di: Dai, Wenkai, et al.
Pubblicazione: (2024)