Image de couverture de livre

A Fair and Memory/Time-efficient Hashmap

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Asudeh, Abolfazl, Shahbazi, Nima, Sintos, Stavros
Format:	Preprint
Publié:	2023
Sujets:	Data Structures and Algorithms Databases
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Fair-Count-Min: Frequency Estimation under Equal Group-wise Approximation Factor
par: Shahbazi, Nima, et autres
Publié: (2025)

Weighted Set Multi-Cover on Bounded Universe and Applications in Package Recommendation
par: Shahbazi, Nima, et autres
Publié: (2026)

On Fair Epsilon Net and Geometric Hitting Set
par: Dehghankar, Mohsen, et autres
Publié: (2025)

Fair Set Cover
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Improved Approximation Algorithms for Relational Clustering
par: Esmailpour, Aryan, et autres
Publié: (2024)

Faster Relational Algorithms Using Geometric Data Structures
par: Esmailpour, Aryan, et autres
Publié: (2026)

Faster Algorithms for Fair Max-Min Diversification in $\mathbb{R}^d$
par: Kurkure, Yash, et autres
Publié: (2024)

Range (Rényi) Entropy Queries and Partitioning
par: Esmailpour, Aryan, et autres
Publié: (2023)

Clustering with Set Outliers and Applications in Relational Clustering
par: Surianarayanan, Vaishali, et autres
Publié: (2025)

A Theoretical Framework for Distribution-Aware Dataset Search
par: Esmailpour, Aryan, et autres
Publié: (2025)

Computing Data Distribution from Query Selectivities
par: Agarwal, Pankaj K., et autres
Publié: (2024)

HENN: A Hierarchical Epsilon Net Navigation Graph for Approximate Nearest Neighbor Search
par: Dehghankar, Mohsen, et autres
Publié: (2025)

Dynamic Necklace Splitting
par: Advani, Rishi, et autres
Publié: (2025)

Space-efficient B-tree Implementation for Memory-Constrained Flash Embedded Devices
par: Ould-Khessal, Nadir, et autres
Publié: (2026)

RSR-core: A High-Performance Engine for Low-Bit Matrix-Vector Multiplication
par: Dehghankar, Mohsen, et autres
Publié: (2026)

Approximate Butterfly Counting in Sublinear Time
par: Luo, Chi, et autres
Publié: (2026)

Aleph Filter: To Infinity in Constant Time
par: Dayan, Niv, et autres
Publié: (2024)

An Efficient Matrix Multiplication Algorithm for Accelerating Inference in Binary and Ternary Neural Networks
par: Dehghankar, Mohsen, et autres
Publié: (2024)

Querying in Constant Expected Time with Learned Indexes
par: Croquevielle, Luis, et autres
Publié: (2024)

Polynomial Time Convergence of the Iterative Evaluation of Datalogo Programs
par: Im, Sungjin, et autres
Publié: (2023)

Maximal Biclique Enumeration with Improved Worst-Case Time Complexity Guarantee: A Partition-Oriented Strategy
par: Wang, Kaixin, et autres
Publié: (2026)

CuckooGraph: A Scalable and Space-Time Efficient Data Structure for Large-Scale Dynamic Graphs
par: Fan, Zhuochen, et autres
Publié: (2024)

FB$^+$-tree: A Memory-Optimized B$^+$-tree with Latch-Free Update
par: Chen, Yuan, et autres
Publié: (2025)

Online Maximum Independent Set of Hyperrectangles
par: Advani, Rishi, et autres
Publié: (2023)

Reliability Evaluation of Individual Predictions: A Data-centric Approach
par: Shahbazi, Nima, et autres
Publié: (2022)

Metric $k$-clustering using only Weak Comparison Oracles
par: Raychaudhury, Rahul, et autres
Publié: (2026)

Fast Maximum Common Subgraph Search: A Redundancy-Reduced Backtracking Approach
par: Yu, Kaiqiang, et autres
Publié: (2025)

A High-Throughput GPU Framework for Adaptive Lossless Compression of Floating-Point Data
par: Li, Zheng, et autres
Publié: (2025)

A Matrix Logic Approach to Efficient Frequent Itemset Discovery in Large Data Sets
par: Li, Xuan, et autres
Publié: (2024)

A Unified and Scalable Algorithm Framework of User-Defined Temporal $(k,\mathcal{X})$-Core Query
par: Zhong, Ming, et autres
Publié: (2023)

A Simple Representation of Tree Covering Utilizing Balanced Parentheses and Efficient Implementation of Average-Case Optimal RMQs
par: Hamada, Kou, et autres
Publié: (2024)

UltraLogLog: A Practical and More Space-Efficient Alternative to HyperLogLog for Approximate Distinct Counting
par: Ertl, Otmar
Publié: (2023)

Memory Hierarchy Design for Caching Middleware in the Age of NVM
par: Ghandeharizadeh, Shahram, et autres
Publié: (2025)

Sampling Methods for Inner Product Sketching
par: Daliri, Majid, et autres
Publié: (2023)

Evaluating Regular Path Queries on Compressed Adjacency Matrices
par: Arroyuelo, Diego, et autres
Publié: (2023)

Grafite: Taming Adversarial Queries with Optimal Range Filters
par: Costa, Marco, et autres
Publié: (2023)

Simple Analysis of Priority Sampling
par: Daliri, Majid, et autres
Publié: (2023)

Weighted Minwise Hashing Beats Linear Sketching for Inner Product Estimation
par: Bessa, Aline, et autres
Publié: (2023)

Approximating Queries on Probabilistic Graphs
par: Amarilli, Antoine, et autres
Publié: (2023)

Efficient $k$-Clique Listing: An Edge-Oriented Branching Strategy
par: Wang, Kaixin, et autres
Publié: (2023)