2 Hits in 9.4 sec

A Simple Sublinear Algorithm for Gap Edit Distance [article]

Joshua Brakensiek and Moses Charikar and Aviad Rubinstein
2020 arXiv   pre-print
Building on the same framework, we also obtain a k-vs-k^2 algorithm for the one-sided preprocessing model with Õ(n) preprocessing time and Õ(n/k) query time (improving over a recent Õ(n/k+k^2)-query time  ...  Our main result is a very simple algorithm for this benchmark that runs in time Õ(n/√(k)), and in particular settles the open problem of obtaining a truly sublinear time for the entire range of relevant  ...  In Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2006, Miami, Florida, USA, January 22-26, 2006, pages 792-801, 2006.  ... 
arXiv:2007.14368v1 fatcat:oe6kb6h7rff5vmepdgrebyivzy

Playing (Almost-)Optimally in Concurrent Büchi and co-Büchi Games [article]

Benjamin Bordais, Patricia Bouyer, Stéphane Le Roux
2022 arXiv   pre-print
This characterization relies on properties of game forms underpinning the formalism for defining local interactions of the two players.  ...  We study two-player concurrent stochastic games on finite graphs, with Büchi and co-Büchi objectives. The goal of the first player is to maximize the probability of satisfying the given objective.  ...  Furthermore, at step n ∈ N, the probability that the event T occurs is equal to ε n . We will denote by P the probability measure of the corresponding measurable sets.  ... 
arXiv:2203.06966v1 fatcat:b3pawokc2vdphdd2bilxgfvvtm