scientific article; zbMATH DE number 1301967
From MaRDI portal
Publication:4247202
zbMath0928.60001MaRDI QIDQ4247202
Publication date: 9 January 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (61)
Efficient set intersection with simulation-based security ⋮ Balanced Allocation: Patience Is Not a Virtue ⋮ Oblivious key-value stores and amplification for private set intersection ⋮ Simple and optimal randomized fault-tolerant rumor spreading ⋮ D2B: A de Bruijn based content-addressable network ⋮ Hierarchical routing over dynamic wireless networks ⋮ The VCG Mechanism for Bayesian Scheduling ⋮ A novel algorithm for Max Sat calling MOCE to order ⋮ Fast and simple compact hashing via bucketing ⋮ Security of Numerical Sensors in Automata ⋮ Concentration of maximum degree in random planar graphs ⋮ 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 ⋮ Balls into non-uniform bins ⋮ 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 ⋮ Go-MOCE: greedy order method of conditional expectations for Max Sat ⋮ Balls into bins with related random choices ⋮ Revisiting randomized parallel load balancing algorithms ⋮ Avoiding Communication in Primal and Dual Block Coordinate Descent Methods ⋮ A novel robust on-line protocol for load-balancing in structured peer-to-peer systems ⋮ Asymptotic behavior of the maximum and minimum singular value of random Vandermonde matrices ⋮ On the security of the WOTS-PRF signature scheme ⋮ Self-stabilizing repeated balls-into-bins ⋮ Identifying frequent items in distributed data sets ⋮ Buffered Count-Min Sketch on SSD: Theory and Experiments ⋮ Optimal static and self-adjusting parameter choices for the \((1+(\lambda ,\lambda ))\) genetic algorithm ⋮ Implementation of Boolean functions with a bounded number of zeros by disjunctive normal forms ⋮ A generalization of multiple choice balls-into-bins: tight bounds ⋮ Parallel randomized load balancing: a lower bound for a more general model ⋮ Scalable Multi-party Private Set-Intersection ⋮ The Multi-user Security of Double Encryption ⋮ Computational aspects of ordered integer partitions with bounds ⋮ Randomized LU decomposition using sparse projections ⋮ Cliques in hyperbolic random graphs ⋮ Load balancing under \(d\)-thinning ⋮ Self-stabilizing balls and bins in batches. The power of leaky bins ⋮ Almost sure Assouad-like dimensions of complementary sets ⋮ Randomization helps to perform independent tasks reliably ⋮ To catch a fake: Curbing deceptive Yelp ratings and venues ⋮ The cost of privacy: optimal rates of convergence for parameter estimation with differential privacy ⋮ Garbage Collection for Reversible Functional Languages ⋮ On the \(k\)-orientability of random graphs ⋮ Improved Ramsey-type results for comparability graphs ⋮ Beyond conventional security in sponge-based authenticated encryption modes ⋮ Revisiting Randomized Parallel Load Balancing Algorithms ⋮ Breaking the \(\log n\) barrier on rumor spreading ⋮ Two-way chaining for non-uniform distributions ⋮ Speed and concentration of the covering time for structured coupon collectors ⋮ On parallel time in population protocols ⋮ VD-PSI: Verifiable Delegated Private Set Intersection on Outsourced Private Datasets ⋮ Modifications of the Floyd-Warshall algorithm with nearly quadratic expected-time ⋮ An Optimal Algorithm for Strict Circular Seriation ⋮ Dynamic averaging load balancing on cycles ⋮ A model of random industrial SAT
This page was built for publication:
