Related papers: Computing the Mertens function on a GPU

The Max-Cut problem is a well known combinatorial optimization problem. In this paper we describe a fast approximation method. Given a graph G, we want to find a cut whose size is maximal among all possible cuts. A cut is a partition of the…

In this work, we study the trade-off between the running time of approximation algorithms and their approximation guarantees. By leveraging a structure of the `hard' instances of the Arora-Rao-Vazirani lemma [JACM'09], we show that the…

We present a deterministic algorithm which, given a graph G with n vertices and an integer 1<m < n, computes in n^{O(ln m)} time the sum of weights w(S) over all m-subsets S of the set of vertices of G, where w(S)=exp{gamma t m +O(1/m)}…

We describe GPU implementations of the matrix recommender algorithms CCD++ and ALS. We compare the processing time and predictive ability of the GPU implementations with existing multi-core versions of the same algorithms. Results on the…

We describe a method to accelerate the numerical computation of the coefficients of the polynomials $P_k(x)$ that appear in the conjectured asymptotics of the $2k$-th moment of the Riemann zeta function. We carried out our method to compute…

We study approximation algorithms for the following geometric version of the maximum coverage problem: Let P be a set of n weighted points in the plane. We want to place m a * b rectangles such that the sum of the weights of the points in P…

We provide sharp bounds for the exponential moments and $p$-moments, $1\leqslant p \leqslant 2$, of the terminate distribution of a martingale whose square function is uniformly bounded by one. We introduce a Bellman function for the…

We introduce a method for calculating individual elements of matrix functions. Our technique makes use of a novel series expansion for the action of matrix functions on basis vectors that is memory efficient even for very large matrices. We…

This paper deals with coefficient estimates for close-to-convex functions with argument $\beta$ ($-\pi/2<\beta<\pi/2$). By using Herglotz representation formula, sharp bounds of coefficients are obtained. In particluar, we solve the problem…

An algorithm is presented to compute isolated values of the divisor summatory function in O(n^(1/3)) time and O (log n) space. The algorithm is elementary and uses a geometric approach of successive approximation combined with coordinate…

The maximum bipartite matching problem is among the most fundamental and well-studied problems in combinatorial optimization. A beautiful and celebrated combinatorial algorithm of Hopcroft and Karp (1973) shows that maximum bipartite…

We present a set of rules to guide the design of GPU algorithms. These rules are grounded on the principle of reducing waste in GPU utility to achieve good speed up. In accordance to these rules, we propose GPU algorithms for 2D…

A new Monte Carlo algorithm is introduced for the simulation of supercooled liquids and glass formers, and tested in two model glasses. The algorithm is shown to thermalize well below the Mode Coupling temperature and to outperform other…

A method that uses order statistics to construct multivariate distributions with fixed marginals and which utilizes a representation of the Bernstein copula in terms of a finite mixture distribution is proposed. Expectation-maximization…

A new algorithm for computing a point on a polynomial or rational curve in B\'{e}zier form is proposed. The method has a geometric interpretation and uses only convex combinations of control points. The new algorithm's computational…

An algorithm is proposed to solve robust control problems constrained by partial differential equations with uncertain coefficients, based on the so-called MG/OPT framework. The levels in this MG/OPT hierarchy correspond to discretization…

We present an efficient and elementary algorithm for computing the number of primes up to $N$ in $\tilde{O}(\sqrt N)$ time, improving upon the existing combinatorial methods that require $\tilde{O}(N ^ {2/3})$ time. Our method has a similar…

In this paper we study the MAX-CUT problem on power law graphs (PLGs) with power law exponent $\beta$. We prove some new approximability results on that problem. In particular we show that there exist polynomial time approximation schemes…

We show how to accelerate the direct solution of the Boltzmann equation using Graphics Processing Units (GPUs). In order to fully exploit the computational power of the GPU, we choose a method of solution which combines a finite difference…

We present a polynomial-time $(\alpha_{GW} + \varepsilon)$-approximation algorithm for the Maximum Cut problem on interval graphs and split graphs, where $\alpha_{GW} \approx 0.878$ is the approximation guarantee of the Goemans-Williamson…