We find the weak rate of convergence of the spatially semidiscrete finite element approximation of the nonlinear stochastic heat equation. Both multiplicative and additive noise ...
We study analytical properties of the Toro-Titarev solver for generalized Riemann problems (GRPs), which is the heart of the flux computation in ADER generalized Godunov schemes. ...
Abstract. The general number field sieve (GNFS) is the most efficient algorithm known for factoring large integers. It consists of several stages, the first one being polynomial ...
Shi Bai, Cyril Bouvier, Alexander Kruppa, Paul Zim...
Assuming GRH, we prove an explicit upper bound for the number of zeros of a Dedekind zeta function having imaginary part in [T−a, T+a]. We also prove a bound for the multiplicity...
With the pervasiveness of online social media and rapid growth of web data, a large amount of multimedia data is available online. However, how to organize them for facilitating us...
We consider drawings of graphs in the plane in which edges are represented by polygonal paths with at most one bend and the number of different slopes used by all segments of thes...
We study the compressed representation of a ranked tree by a straight-line program (SLP) for its preorder traversal string, and compare it with the previously studied representatio...
Moses Ganardi, Danny Hucke, Markus Lohrey, Eric No...
We study information gathering in ad-hoc radio networks. Initially, each node of the network has a piece of information called a rumor, and the overall objective is to gather all t...
We consider the problem of sampling a uniformly random spanning tree of a graph. This is a classic algorithmic problem for which several exact and approximate algorithms are known....