Related papers: Farey Statistics in Time n^{2/3} and Counting Prim…

First passage distributions of semi-Markov processes are of interest in fields such as reliability, survival analysis, and many others. The problem of finding or computing first passage distributions is, in general, quite challenging. We…

In this article, we give a precise mathematical meaning to `linear? time' that matches experimental behaviour of the algorithm. The sorting algorithm is not our own, it is a variant of radix sort with counting sort as a subroutine. The true…

In a recent work \cite{BG}, given a collection of continuous semimartingales, authors derive a semimartingale decomposition from the corresponding ranked processes in the case that the ranked processes can meet more than two original…

In this paper, we propose new techniques for solving geometric optimization problems involving interpoint distances of a point set in the plane. Given a set $P$ of $n$ points in the plane and an integer $1 \leq k \leq \binom{n}{2}$, the…

This is a survey article on the theory of lattice points in large planar domains and bodies of dimensions 3 and higher, with an emphasis on recent developments and new methods, including a lot of results established only during the last few…

For many hard computational problems, simple algorithms that run in time $2^n \cdot n^{O(1)}$ arise, say, from enumerating all subsets of a size-$n$ set. Finding (exponentially) faster algorithms is a natural goal that has driven much of…

The problem of space-efficient depth-first search (DFS) is reconsidered. A particularly simple and fast algorithm is presented that, on a directed or undirected input graph $G=(V,E)$ with $n$ vertices and $m$ edges, carries out a DFS in…

We generalize the Farey-Brocot partition to a twodimensional continued fraction algorithm and generalized Farey-Brocot nets. We give an asymptotic formula for the moments of order \beta.

For a real number $x$, call $\frac1n \lfloor nx \rfloor$ the $n$-th lower rational approximation of $x$. We study the functions defined by taking the cumulative average of the first $n$ lower rational approximations of $x$, which we call…

We introduce space-efficient plane-sweep algorithms for basic planar geometric problems. It is assumed that the input is in a read-only array of $n$ items and that the available workspace is $\Theta(s)$ bits, where $\lg n \leq s \leq n…

We study a natural variant of scheduling that we call \emph{partial scheduling}: In this variant an instance of a scheduling problem along with an integer $k$ is given and one seeks an optimal schedule where not all, but only $k$ jobs, have…

We study graph ordering problems with a min-max objective. A classical problem of this type is cutwidth, where given a graph we want to order its vertices such that the number of edges crossing any point is minimized. We give a $…

The prime-counting function $\pi(x)$ which computes the number of primes smaller or equal to a given real number has a long-standing interest in number theory. The present manuscript proposes a method to compute $\pi(x)$ with time…

To analyze the worst-case running time of branching algorithms, the majority of work in exponential time algorithms focuses on designing complicated branching rules over developing better analysis methods for simple algorithms. In the…

For a large class of systems of o.d.e.'s which have first integrals, the method of arrays yields the following results: i) The first integrals $I$ can be found by solving systems of linear equations. ii) How the first integral $I$ responds…

Given a set $P$ of $n$ points and a set $S$ of $n$ segments in the plane, we consider the problem of computing for each segment of $S$ its closest point in $P$. The previously best algorithm solves the problem in $n^{4/3}2^{O(\log^*n)}$…

Classically, the time complexity of a first-order method is estimated by its number of gradient computations. In this paper, we study a more refined complexity by taking into account the `lingering' of gradients: once a gradient is computed…

We introduce the priority lattice, a structure arising from the priority search algorithm on rooted trees and forests. We prove bijectively that its maximal chains are labeled by parking functions, and that the maximal chains of its…

Given a full column rank $M \in \Z^{\ell \times m}$ and an $F \in \Z^{n \times m}$ we present an algorithm to compute the $n \times n$ basis in Hermite form of the integer lattice comprised of all rows $p \in \Z^{1 \times n}$ such that $pF…

Sorting is a fundamental algorithmic pre-processing technique which often allows to represent data more compactly and, at the same time, speeds up search queries on it. In this paper, we focus on the well-studied problem of sorting and…