Resolving SINR Queries in a Dynamic Setting

DOI10.1137/19M128733XzbMath1497.68135arXiv1804.10654MaRDI QIDQ3387759

Gali Bar-On, Boris Aronov, Matthew J. Katz

Publication date: 13 January 2021

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1804.10654

zbMATH Keywords

computational geometrywireless networksdynamic data structuresinterference cancellationSINR

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Data structures (68P05) Randomized algorithms (68W20) Communication theory (94A05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Space efficient data structures for dynamic orthogonal range counting
• The design of dynamic data structures
• Worst-case optimal insertion and deletion methods for decomposable searching problems
• Efficient partition trees
• Nonuniform SINR+Voroni diagrams are effectively uniform
• Batched Point Location in SINR Diagrams via Algebraic Tools
• Adding range restriction capability to dynamic data structures
• Dynamic Planar Voronoi Diagrams for General Distance Functions and their Algorithmic Applications
• A Functional Approach to Data Structures and Its Use in Multidimensional Searching
• Approximate Nearest Neighbor Searching with Non-Euclidean and Weighted Distances
• SINR Diagrams
• The topology of wireless communication
• Approximating Minimization Diagrams and Generalized Proximity Search
• On approximate range counting and depth

This page was built for publication: Resolving SINR Queries in a Dynamic Setting