scientific article; zbMATH DE number 1301967
From MaRDI portal
Publication:4247202
Recommendations
Cited in
(82)- On the k-orientability of random graphs
- On the security of the WOTS-PRF signature scheme
- Self-stabilizing repeated balls-into-bins
- Optimal static and self-adjusting parameter choices for the (1+( , )) genetic algorithm
- Self-stabilizing balls and bins in batches. The power of leaky bins
- Computational aspects of ordered integer partitions with bounds
- Randomized LU decomposition using sparse projections
- Almost sure Assouad-like dimensions of complementary sets
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy
- Breaking the \(\log n\) barrier on rumor spreading
- On parallel time in population protocols
- Dynamic averaging load balancing on cycles
- A model of random industrial SAT
- Oblivious key-value stores and amplification for private set intersection
- A novel algorithm for Max Sat calling MOCE to order
- Fast and simple compact hashing via bucketing
- Load balancing under \(d\)-thinning
- Beyond conventional security in sponge-based authenticated encryption modes
- D2B: A de Bruijn based content-addressable network
- Concentration of maximum degree in random planar graphs
- Go-MOCE: greedy order method of conditional expectations for Max Sat
- Efficient set intersection with simulation-based security
- Garbage Collection for Reversible Functional Languages
- Simple and optimal randomized fault-tolerant rumor spreading
- Security of numerical sensors in automata
- On power-law distributed balls in bins and its applications to view size estimation
- Revisiting Randomized Parallel Load Balancing Algorithms
- Hierarchical routing over dynamic wireless networks
- The VCG Mechanism for Bayesian Scheduling
- Balls into bins with related random choices
- scientific article; zbMATH DE number 1058049 (Why is no real title available?)
- Simple proofs of occupancy tail bounds
- Revisiting randomized parallel load balancing algorithms
- Randomization helps to perform independent tasks reliably
- scientific article; zbMATH DE number 2079854 (Why is no real title available?)
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods
- Balls and bins: A study in negative dependence
- Asymptotic behavior of the maximum and minimum singular value of random Vandermonde matrices
- Identifying frequent items in distributed data sets
- The forgetfulness of balls and bins
- To catch a fake: Curbing deceptive Yelp ratings and venues
- Improved Ramsey-type results for comparability graphs
- Speed and concentration of the covering time for structured coupon collectors
- Buffered Count-Min Sketch on SSD: Theory and Experiments
- An Optimal Algorithm for Strict Circular Seriation
- A short note on the average maximal number of balls in a bin
- A generalization of multiple choice balls-into-bins: tight bounds
- Parallel randomized load balancing: a lower bound for a more general model
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms
- Scalable multi-party private set-intersection
- The Multi-user Security of Double Encryption
- Two-way chaining for non-uniform distributions
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time
- Balanced Allocation: Patience Is Not a Virtue
- On statistical tests of functional connectome fingerprinting
- The impact of heterogeneity and geometry on the proof complexity of random satisfiability
- Private polynomial commitments and applications to MPC
- Haystack hunting hints and locker room communication
- Mixed-technique multi-party computations composed of two-party computations
- Expansion of random 0/1 polytopes
- High-probability generalization bounds for pointwise uniformly stable algorithms
- Long-term balanced allocation via thinning
- Divide \& Scale: formalization and roadmap to robust sharding
- The Power of Filling in Balanced Allocations
- Multi-channel assignment and link scheduling for prioritized latency-sensitive applications
- Bounds for \(c\)-ideal hashing
- Linear hashing with \(\ell_\infty\) guarantees and two-sided Kakeya bounds
- Defending hash tables from algorithmic complexity attacks with resource burning
- Universality and sharp matrix concentration inequalities
- Distribution estimation under the infinity norm
- Wots-BC-Winternitz signature scheme based on lightweight block ciphers
- Paging and the address-translation problem
- Tiny pointers
- An efficient toolkit for computing third-party private set intersection
- An asymptotically optimal algorithm for generating bin cardinalities
- Balanced allocations with the choice of noise
- The quantum supremacy Tsirelson inequality
- Haystack hunting hints and locker room communication
- Cliques in hyperbolic random graphs
- Balls into non-uniform bins
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4247202)
