math.IT

Papers

• PANDA: Query Evaluation in Submodular Width (2025)
  Mahmoud Abo Khamis et al.
  9.03
• Distortion-Resistant Hashing for rapid search of similar DNA subsequence (2016)
  Jarek Duda
  —
• The Capacity of Private Information Retrieval (2017)
  Hua Sun and Syed A. Jafar
  —
• New Error Tolerant Method to Search Long Repeats in Symbol Sequences (2016)
  Sergey Tsarev et al.
  —
• Lower Bounds on Time-Space Trade-Offs for Approximate Near Neighbors (2016)
  Alexandr Andoni et al.
  —
• Theory of the GMM Kernel (2016)
  Ping Li and Cun-Hui Zhang
  —
• Breaking the Bandwidth Barrier: Geometrical Adaptive Entropy Estimation (2016)
  Weihao Gao and Sewoong Oh and Pramod Viswanath
  —
• The Famine of Forte: Few Search Problems Greatly Favor Your Algorithm (2017)
  George D. Montanez
  —
• Multiround Private Information Retrieval: Capacity and Storage Overhead (2016)
  Hua Sun and Syed A. Jafar
  —
• Sparse Ternary Codes for similarity search have higher coding gain than dense binary codes (2017)
  Sohrab Ferdowsi et al.
  —
• Leveraging Sparsity for Efficient Submodular Data Summarization (2017)
  Erik M. Lindgren et al.
  —
• The $\mathcal{E}$-Average Common Submatrix: Approximate Searching in a Restricted Neighborhood (2017)
  Alessia Amelio and Darko Brodi\'c
  —
• Efficient Compression Technique for Sparse Sets (2017)
  Rameshwar Pratap et al.
  —
• A multi-layer network based on Sparse Ternary Codes for universal vector compression (2017)
  Sohrab Ferdowsi et al.
  —
• The Asymptotic Capacity of Private Search (2018)
  Zhen Chen et al.
  —
• Bandit-Based Monte Carlo Optimization for Nearest Neighbors (2021)
  Vivek Bagaria et al.
  —
• Privacy-Preserving Identification via Layered Sparse Code Design: Distributed Servers and Multiple Access Authorization (2018)
  Behrooz Razeghi et al.
  —
• Discovering Reliable Dependencies from Data: Hardness and Improved Algorithms (2018)
  Panagiotis Mandros et al.
  —
• Fast, Small, and Simple Document Listing on Repetitive Text Collections (2019)
  Dustin Cobas and Gonzalo Navarro
  —
• The Capacity of Private Information Retrieval from Heterogeneous Uncoded Caching Databases (2019)
  Karim Banawan and Batuhan Arasli and Yi-Peng Wei and Sennur Ulukus
  —
• SHREWD: Semantic Hierarchy-based Relational Embeddings for Weakly-supervised Deep Hashing (2019)
  Heikki Arponen et al.
  —
• Improved Storage for Efficient Private Information Retrieval (2019)
  Karim Banawan and Batuhan Arasli and Sennur Ulukus
  —
• Deep Learning-Aided Tabu Search Detection for Large MIMO Systems (2019)
  NhanThanh Nguyen and Kyungchun Lee
  —
• The Capacity of Multi-user Private Information Retrieval for Computationally Limited Databases (2020)
  William Barnhart and Zhi Tian
  —
• Mutual Information Decay Curves and Hyper-Parameter Grid Search Design for Recurrent Neural Architectures (2020)
  Abhijit Mahalunkar and John D. Kelleher
  —
• On Continuous Local BDD-Based Search for Hybrid SAT Solving (2021)
  Anastasios Kyrillidis et al.
  —
• High-Order Conditional Mutual Information Maximization for dealing with High-Order Dependencies in Feature Selection (2022)
  Francisco Souza and Cristiano Premebida and Rui Ara\'ujo
  —
• Approximate sorting and its application in I/O model (2023)
  Tianpeng Gao et al.
  —
• Compressing integer lists with Contextual Arithmetic Trits (2025)
  Yann Barsamian and Andr\'e Chailloux
  —
• Cache-Aided Multi-User Private Information Retrieval using PDAs (2022)
  Kanishak Vaidya and B Sundar Rajan
  —
• Massively Parallel Continuous Local Search for Hybrid SAT Solving on GPUs (2023)
  Yunuo Cen et al.
  —
• Matrix Completion with Hypergraphs:Sharp Thresholds and Efficient Algorithms (2026)
  Zhongtian Ma et al.
  —
• Efficient Gradient Estimation for Parameterized Quantum Systems with Lie Algebraic Symmetries (2026)
  Mohsen Heidari et al.
  —
• Linear Index for Logarithmic Search-Time for any String under any Internal Node in Suffix Trees (2024)
  Anas Al-okaily
  —
• Quantum search in a dictionary based on fingerprinting-hashing (2024)
  Farid Ablayev et al.
  —
• Uniform Universal Sets, Splitters, and Bisectors (2025)
  Elisabet Burjons and Peter Rossmanith
  —
• Communication-Efficient Hybrid Language Model via Uncertainty-Aware Opportunistic and Compressed Transmission (2026)
  Seungeun Oh et al.
  —
• Plan for Speed: Dilated Scheduling for Masked Diffusion Language Models (2026)
  Omer Luxembourg et al.
  —
• Succinct Preferential Attachment Graphs (2025)
  Ziad Ismaili Alaoui and Namrata and Sebastian Wild
  —
• TelecomTS: A Multi-Modal Observability Dataset for Time Series and Language Analysis (2026)
  Austin Feng et al.
  —
• The Information Theory of Similarity (2025)
  Nikit Phadke
  —
• Information Theoretic Perspective on Representation Learning (2026)
  Deborah Pereg et al.
  —
• Envy-Free Allocation of Indivisible Goods via Noisy Queries (2026)
  Zihan Li et al.
  —
• ArcMark: Distortion-Free Multi-Byte LLM Watermark via Optimal Transport (2026)
  Atefeh Gilani et al.
  —
• MARS: Margin and Semantic-Aware Data Augmentation for Reward Modeling (2026)
  Payel Bhattacharjee et al.
  —
• Training-Free Rate-Distortion-Perception Traversal With Diffusion (2026)
  Yuhan Wang et al.
  —
• Order-Optimal Sequential 1-Bit Mean Estimation in General Tail Regimes (2026)
  Ivan Lau et al.
  —
• Context-Aware Search and Retrieval Under Token Erasure (2026)
  Sara Ghasvarianjahromi and Joshua Barr and Yauhen Yakimenka and J\"org Kliewer
  —
• SPHERICAL KV: Angle-Domain Attention and Rate-Distortion Retention for Efficient Long-Context Inference (2026)
  Anay Chauhan et al.
  —
• Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology (2026)
  Christo Kurisummoottil Thomas et al.
  —