The following pages link to Probability and Computing (Q5463630):
Displaying 50 items.
- Sorting and selection on dynamic data (Q541657) (← links)
- On the phase transitions of random \(k\)-constraint satisfaction problems (Q543632) (← links)
- On Euclidean norm approximations (Q614080) (← links)
- More on the Magnus-Derek game (Q620945) (← links)
- Hybridizing evolutionary algorithms with variable-depth search to overcome local optima (Q633833) (← links)
- Random half-integral polytopes (Q635514) (← links)
- Limiting size index distributions for ball-bin models with Zipf-type frequencies (Q652589) (← links)
- The number of \(K_{m,m}\)-free graphs (Q653990) (← links)
- Secure and highly-available aggregation queries in large-scale sensor networks via set sampling (Q658674) (← links)
- Minimum clique partition in unit disk graphs (Q659693) (← links)
- Identifying frequent items in a network using gossip (Q666263) (← links)
- Randomized methods based on new Monte Carlo schemes for control and optimization (Q666376) (← links)
- Efficient decentralized algorithms for the distributed trigger counting problem (Q693074) (← links)
- A note on uniform power connectivity in the physical signal to interference plus noise (SINR) model (Q714763) (← links)
- Monitoring churn in wireless networks (Q714767) (← links)
- Energy efficient alert in single-hop networks of extremely weak devices (Q714773) (← links)
- Nuclear norm minimization for the planted clique and biclique problems (Q717132) (← links)
- Secure and self-stabilizing clock synchronization in sensor networks (Q719301) (← links)
- A communication-efficient private matching scheme in client-server model (Q726566) (← links)
- The complexity of approximating conservative counting CSPs (Q743130) (← links)
- Decoupling with random quantum circuits (Q748450) (← links)
- A symmetric cryptographic scheme for data integrity verification in cloud databases (Q781030) (← links)
- Most binary matrices have no small defining set (Q785838) (← links)
- Cryptanalysis of a dynamic universal accumulator over bilinear groups (Q826264) (← links)
- A survey of the modified Moran process and evolutionary graph theory (Q826319) (← links)
- On the runtime and robustness of randomized broadcasting (Q838155) (← links)
- Complexity issues in color-preserving graph embeddings (Q846361) (← links)
- A universal online caching algorithm based on pattern matching (Q848635) (← links)
- Stability in the self-organized evolution of networks (Q848641) (← links)
- On mixing and edge expansion properties in randomized broadcasting (Q848940) (← links)
- Robust gossiping with an application to consensus (Q856404) (← links)
- Randomized algorithm for the sum selection problem (Q884471) (← links)
- Logit dynamics with concurrent updates for local interaction potential games (Q893316) (← links)
- Design and analysis of migration in parallel evolutionary algorithms (Q894073) (← links)
- Offline variants of the ``lion and man'' problem: some problems and techniques for measuring crowdedness and for safe path planning (Q930894) (← links)
- Randomized approximation scheme and perfect sampler for closed Jackson networks with multiple servers (Q940932) (← links)
- Improved random graph isomorphism (Q954962) (← links)
- Nanowire addressing with randomized-contact decoders (Q959817) (← links)
- A self-stabilizing algorithm for cut problems in synchronous networks (Q962165) (← links)
- On the probability of a rational outcome for generalized social welfare functions on three alternatives (Q965219) (← links)
- An approximation trichotomy for Boolean \#CSP (Q972385) (← links)
- The power of choice in growing trees (Q978747) (← links)
- Choice-memory tradeoff in allocations (Q990388) (← links)
- A robust randomized algorithm to perform independent tasks (Q1002110) (← links)
- On randomized broadcasting in star graphs (Q1003763) (← links)
- Markov type inequalities for fuzzy integrals (Q1004240) (← links)
- Matrix norms and rapid mixing for spin systems (Q1009479) (← links)
- Broadcasting in dynamic radio networks (Q1015809) (← links)
- Energy efficient randomised communication in unknown AdHoc networks (Q1029326) (← links)
- Spreading messages (Q1029342) (← links)
