The following pages link to (Q4247202):
Displaying 50 items.
- Efficient set intersection with simulation-based security (Q271588) (← links)
- Simple and optimal randomized fault-tolerant rumor spreading (Q287985) (← links)
- Balls into bins with related random choices (Q433413) (← links)
- Revisiting randomized parallel load balancing algorithms (Q442270) (← links)
- A novel robust on-line protocol for load-balancing in structured peer-to-peer systems (Q455942) (← links)
- Asymptotic behavior of the maximum and minimum singular value of random Vandermonde matrices (Q471516) (← links)
- Identifying frequent items in distributed data sets (Q488300) (← links)
- A generalization of multiple choice balls-into-bins: tight bounds (Q524374) (← links)
- Parallel randomized load balancing: a lower bound for a more general model (Q533886) (← links)
- Cliques in hyperbolic random graphs (Q724237) (← links)
- Balls into non-uniform bins (Q897392) (← links)
- On the \(k\)-orientability of random graphs (Q1024456) (← links)
- On the security of the WOTS-PRF signature scheme (Q1726024) (← links)
- Self-stabilizing repeated balls-into-bins (Q1733393) (← links)
- Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm (Q1750362) (← links)
- Self-stabilizing balls and bins in batches. The power of leaky bins (Q1799218) (← links)
- Computational aspects of ordered integer partitions with bounds (Q2006947) (← links)
- Randomized LU decomposition using sparse projections (Q2012724) (← links)
- Almost sure Assouad-like dimensions of complementary sets (Q2043071) (← links)
- The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy (Q2054532) (← links)
- Breaking the \(\log n\) barrier on rumor spreading (Q2075628) (← links)
- On parallel time in population protocols (Q2094385) (← links)
- Dynamic averaging load balancing on cycles (Q2118388) (← links)
- A model of random industrial SAT (Q2118866) (← links)
- Oblivious key-value stores and amplification for private set intersection (Q2128570) (← links)
- A novel algorithm for Max Sat calling MOCE to order (Q2149880) (← links)
- Fast and simple compact hashing via bucketing (Q2165038) (← links)
- Load balancing under \(d\)-thinning (Q2285765) (← links)
- Beyond conventional security in sponge-based authenticated encryption modes (Q2318091) (← links)
- D2B: A de Bruijn based content-addressable network (Q2368967) (← links)
- Concentration of maximum degree in random planar graphs (Q2673490) (← links)
- Go-MOCE: greedy order method of conditional expectations for Max Sat (Q2691199) (← links)
- Garbage Collection for Reversible Functional Languages (Q2822492) (← links)
- Security of Numerical Sensors in Automata (Q2947411) (← links)
- Revisiting Randomized Parallel Load Balancing Algorithms (Q3408172) (← links)
- Hierarchical routing over dynamic wireless networks (Q3460515) (← links)
- The VCG Mechanism for Bayesian Scheduling (Q3460800) (← links)
- Randomization helps to perform independent tasks reliably (Q4446875) (← links)
- Avoiding Communication in Primal and Dual Block Coordinate Descent Methods (Q4613501) (← links)
- To catch a fake: Curbing deceptive Yelp ratings and venues (Q4970003) (← links)
- Improved Ramsey-type results for comparability graphs (Q4987258) (← links)
- Speed and concentration of the covering time for structured coupon collectors (Q5005019) (← links)
- Buffered Count-Min Sketch on SSD: Theory and Experiments (Q5009602) (← links)
- An Optimal Algorithm for Strict Circular Seriation (Q5018899) (← links)
- Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms (Q5413210) (← links)
- Scalable Multi-party Private Set-Intersection (Q5738787) (← links)
- The Multi-user Security of Double Encryption (Q5738981) (← links)
- Two-way chaining for non-uniform distributions (Q5852152) (← links)
- VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets (Q5857774) (← links)
- Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time (Q5862374) (← links)
