Imagen de Portada

Optimal Non-Adaptive Cell Probe Dictionaries and Hashing

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Larsen, Kasper Green, Pagh, Rasmus, Persiano, Giuseppe, Pitassi, Toniann, Yeo, Kevin, Zamir, Or
Formato:	Preprint
Publicado:	2023
Materias:	Data Structures and Algorithms
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Tight Static Lower Bounds for Non-Adaptive Data Structures
por: Persiano, Giuseppe, et al.
Publicado: (2020)

Pseudorandom Hashing for Space-bounded Computation with Applications in Streaming
por: Kacham, Praneeth, et al.
Publicado: (2023)

Differential privacy from axioms
por: Blanc, Guy, et al.
Publicado: (2025)

Differentially Private Set Representations
por: Patel, Sarvar, et al.
Publicado: (2025)

Modern Minimal Perfect Hashing: A Survey
por: Lehmann, Hans-Peter, et al.
Publicado: (2025)

Profile Reconstruction from Private Sketches
por: Wu, Hao, et al.
Publicado: (2024)

Tensor Sketch: Fast and Scalable Polynomial Kernel Approximation
por: Pham, Ninh, et al.
Publicado: (2025)

DNF formulas are efficiently testable with relative error
por: Chen, Xi, et al.
Publicado: (2026)

Tight Bounds for Low-Error Frequency Moment Estimation and the Power of Multiple Passes
por: Green-Maimon, Naomi, et al.
Publicado: (2025)

Aleph Filter: To Infinity in Constant Time
por: Dayan, Niv, et al.
Publicado: (2024)

Faster Private Minimum Spanning Trees
por: Pagh, Rasmus, et al.
Publicado: (2024)

Relative-error testing of conjunctions and decision lists
por: Chen, Xi, et al.
Publicado: (2025)

Testing Juntas and Junta Subclasses with Relative Error
por: Chen, Xi, et al.
Publicado: (2025)

The Many Faces of Optimal Weak-to-Strong Learning
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2024)

Optimal Bounds for Private Minimum Spanning Trees via Input Perturbation
por: Pagh, Rasmus, et al.
Publicado: (2024)

A Smooth Binary Mechanism for Efficient Private Continual Observation
por: Andersson, Joel Daniel, et al.
Publicado: (2023)

Streaming Private Continual Counting via Binning
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

Adaptive Hashing: Faster Hash Functions with Fewer Collisions
por: Melis, Gábor
Publicado: (2026)

AdaBoost is not an Optimal Weak to Strong Learner
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2023)

Differentially Private Quantiles with Smaller Error
por: Imola, Jacob, et al.
Publicado: (2025)

ShockHash: Near Optimal-Space Minimal Perfect Hashing Beyond Brute-Force
por: Lehmann, Hans-Peter, et al.
Publicado: (2023)

Private Lossless Multiple Release
por: Andersson, Joel Daniel, et al.
Publicado: (2025)

Learning with Monotone Adversarial Corruptions
por: Larsen, Kasper Green, et al.
Publicado: (2026)

Nearly Optimal Internal Dictionary Matching
por: Chen, Jingbang, et al.
Publicado: (2023)

Optimal Static Fully Indexable Dictionaries
por: Liang, Jingxun, et al.
Publicado: (2025)

Count on Your Elders: Laplace vs Gaussian Noise
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

Daisy Bloom Filters
por: Bercea, Ioana O., et al.
Publicado: (2022)

Linear Hashing Is Optimal
por: Jaber, Michael, et al.
Publicado: (2025)

Invertible Bloom Lookup Tables with Less Memory and Randomness
por: Fleischhacker, Nils, et al.
Publicado: (2023)

Improved Margin Generalization Bounds for Voting Classifiers
por: Høgsgaard, Mikael Møller, et al.
Publicado: (2025)

Optimal Static Dictionary with Worst-Case Constant Query Time
por: Hu, Yang, et al.
Publicado: (2024)

Continual Counting with Gradual Privacy Expiration
por: Andersson, Joel Daniel, et al.
Publicado: (2024)

PLAN: Variance-Aware Private Mean Estimation
por: Aumüller, Martin, et al.
Publicado: (2023)

Revisiting Agnostic PAC Learning
por: Hanneke, Steve, et al.
Publicado: (2024)

An Exponential Separation Between Quantum and Quantum-Inspired Classical Algorithms for Linear Systems
por: Grønlund, Allan, et al.
Publicado: (2024)

Optimality of Frequency Moment Estimation
por: Braverman, Mark, et al.
Publicado: (2024)

Optimal Electrical Oblivious Routing on Expanders
por: Florescu, Cella, et al.
Publicado: (2024)

Replicable Learning of Large-Margin Halfspaces
por: Kalavasis, Alkis, et al.
Publicado: (2024)

Actively Learning Halfspaces without Synthetic Data
por: Black, Hadley, et al.
Publicado: (2025)

Hashing for Sampling-Based Estimation
por: Aamand, Anders, et al.
Publicado: (2024)