Pseudo-deterministic streaming by Goldwasser, Shafrira, Grossman, Ofer.

“…A pseudo-deterministic algorithm is a (randomized) algorithm which, when run multiple times on the same input, with high probability outputs the same result on all executions. …”
Get full text

Concurrent disjoint set union by Jayanti, Siddhartha V, Tarjan, Robert E

“…The analysis of the second randomized algorithm is valid even if the scheduler is adversarial. …”
Get full text

Broadcasting in unreliable radio networks by Kuhn, Fabian, Lynch, Nancy Ann, Newport, Calvin Charles, Oshman, Rotem, Richa, Andrea

“…On the positive side, we give two algorithms that tolerate unreliability: an O(n3/2 √log n)-time deterministic algorithm and a randomized algorithm which terminates in O(n log2 n) rounds with high probability.…”
Get full text
Get full text

Approximating the influence of monotone boolean functions in O(√n) query complexity by Ron, Dana, Rubinfeld, Ronitt, Safra, Muli, Weinstein, Omri

Get full text
Get full text

Partially Symmetric Functions Are Efficiently Isomorphism Testable by Blais, Eric, Weinstein, Amit, Yoshida, Yuichi

“…Given a Boolean function f, the f-isomorphism testing problem requires a randomized algorithm to distinguish functions that are identical to f up to relabeling of the input variables from functions that are far from being so. …”
Get full text

The development of cloud modelling and motion analysis for virtual environment by Sunar, Mohd. Shahrizal, Daman, Daut, Kari, Sarudin, Mohd. Suaib, Norhaida, Bade, Abdullah

“…This invention uses the newly developed randomized algorithm to fill the cloud volume with particle systems. …”
Get full text

The development of cloud modelling and motion analysis for virtual environment by Sunar, Mohd. Shahrizal, Daman, Daut, Kari, Sarudin, Mohd. Suaib, Norhaida, Bade, Abdullah

“…This invention uses the newly developed randomized algorithm to fill the cloud volume with particle systems. …”
Get full text

A randomized approach to speed up the analysis of large-scale read-count data in the application of CNV detection by WeiBo Wang, Wei Sun, Wei Wang, Jin Szatkiewicz

“…In this study, we aimed to speed up substantially the GLM+NB method by using a randomized algorithm and we demonstrate here the utility of our approach in the application of detecting copy number variants (CNVs) using a real example. …”
Get full text

A hybrid recommender system based-on link prediction for movie baskets analysis by Mohammadsadegh Vahidi Farashah, Akbar Etebarian, Reza Azmi, Reza Ebrahimzadeh Dastjerdi

“…The results show that the Mean Squared Error (MSE) of the proposed model has decreased respectively 8.59%, 8.67%, 8.45% and 8.15% compared to the basic models such as Naive Bayes, multi-attribute decision tree and randomized algorithm. In addition, Mean Absolute Error (MAE) of the proposed method decreased by 4.5% compared to SVD and approximately 4.4% compared to ApproSVD and Root Mean Squared Error (RMSE) of the proposed method decreased by 6.05 % compared to SVD and approximately 6.02 % compared to ApproSVD.…”
Get full text

Essays on optimization and incentive contracts by Goundan, Pranava Raja

Get full text

Hardness of Low Delay Network Scheduling by Shah, Devavrat, Tse, David N. C., Tsitsiklis, John N.

“…In particular, the average delay of Tassiulas' randomized algorithm must grow super-polynomially. To establish our results, we employ a clever graph transformation introduced by Lund and Yannakakis (1994).…”
Get full text
Get full text
Get full text

Robust hybrid control for autonomous vehicle motion planning by Frazzoli, Emilio, 1970-

Get full text

A stochastic process approach for multi-agent path finding with non-asymptotic performance guarantees by He, Xiaoyu, Tang, Xueyan, Cai, Wentong, Li, Jingning

“…In this article, we provide a modeling paradigm that converts a MAPF problem into a stochastic process and adopts a confidence bound based rule for finding the optimal state transition strategy. A randomized algorithm is proposed to solve this stochastic process, which combines ideas from conflict based search and Monte Carlo tree search. …”
Get full text

On low-risk heavy hitters and sparse recovery schemes by Li, Yi, Nakos, Vasileios, Woodruff, David P.

“…For the weakest variant, we give a randomized algorithm improving the failure probability analysis of the ubiquitous Count-Min data structure. …”
Get full text
Get full text

Treating depression with a smartphone-delivered self-help cognitive behavioral therapy for insomnia: study protocol for a parallel group randomized controlled trial by Victoria Ka-Ying Hui, Christy Yim-Fan Wong, Eric Ka-Yiu Ma, Fiona Yan-Yee Ho, Christian S. Chan

“…This smartphone app has been pilot tested and revamped to improve user experience. An online randomized algorithm is used to perform randomization to ensure allocation concealment. …”
Get full text

Efficient algorithms for learning mixture models by Huang, Qingqing, Ph. D. Massachusetts Institute of Technology

Get full text

Towards breaking the exponential barrier for general secret sharing by Liu, Tianren, Vaikuntanathan, Vinod, Wee, Hoeteck

“…A secret-sharing scheme for a monotone Boolean (access) function F: {0, 1}[superscript n] → {0, 1} is a randomized algorithm that on input a secret, outputs n shares s[subscript 1]., s[subscript n] such that for any (x[subscript 1]., x[subscript n]) ∈ {0, 1}[superscript n] the collection of shares {s[subscript i]: xi = 1} determine the secret if F(x[subscript 1]., x[subscript n]) = 1 and reveal nothing about the secret otherwise. …”
Get full text

High-precision Estimation of Random Walks in Small Space by Ahmadinejad, AmirMahdi, Kelner, Jonathan, Murtagh, Jack, Peebles, John, Sidford, Aaron, Vadhan, Salil

“…Previously, this problem was known to be solvable by a randomized algorithm using space O(log N) (following Aleliunas et al., FOCS'79) and by a deterministic algorithm using space O(log{3/2}N) (Saks and Zhou, FOCS'95 and JCSS'99), both of which held for arbitrary directed graphs but had not been improved even for undirected graphs. …”
Get full text

Results on a Super Strong Exponential Time Hypothesis by Vyas, Nikhil, Williams, Ryan

“…It has also been hypothesized that k-SAT is hard to solve for randomly chosen instances near the “critical threshold”, where the clause-to-variable ratio is 2k ln 2 −Θ(1). We give a randomized algorithm which refutes the Super-Strong ETH for the case of random k-SAT and planted k-SAT for any clause-to-variable ratio. …”
Get full text

The complexity of solution concepts in Lipschitz games by Katzman, M

“…</p> <p>We show a query lower bound exponential in nλ/𝜖 against randomized algorithms finding 𝜖- approximatepure Nash equilibria of n-player, λ-Lipschitz games. …”