Related papers: Throwing a Sofa Through the Window

Let K be a d-dimensional convex body, and let $K^{(n)}$ be the intersection of n halfspaces containing $K$ whose bounding hyperplanes are independent and identically distributed. Under suitable distributional assumptions, we prove an…

We investigate the folding problem that asks if a polygon P can be folded to a polyhedron Q for given P and Q. Recently, an efficient algorithm for this problem has been developed when Q is a box. We extend this idea to regular polyhedra,…

Let K be the convex hull of the path of a standard brownian motion B(t) in R^n, taken at time 0 < t < 1. We derive formulas for the expected volume and surface area of K. Moreover, we show that in order to approximate K by a discrete…

Continuous-time quantum walk is one of the alternative approaches to quantum computation, where a universal set of quantum gates can be achieved by scattering a quantum walker on some specially-designed structures embedded in a sparse graph…

We introduce a notion of $k$-convexity and explore polygons in the plane that have this property. Polygons which are \mbox{$k$-convex} can be triangulated with fast yet simple algorithms. However, recognizing them in general is a 3SUM-hard…

Let K be a closed bounded convex subset of $\Bbb R^n$; then by a result of the first author, which extends a classical theorem of Whitney there is a constant $w_m(K)$ so that for every continuous function f on K there is a polynomial $\phi$…

We study the space complexity of the following problem: For a fixed regular language $L$, we receive a stream of symbols and want to test membership of a sliding window of size $n$ in $L$. For deterministic streaming algorithms we prove a…

The aim in packing problems is to decide if a given set of pieces can be placed inside a given container. A packing problem is defined by the types of pieces and containers to be handled, and the motions that are allowed to move the pieces.…

We characterize the possible exterior shiftings of $K$, where $K$ runs over all triangulation of the torus, or the projective plane, or the Klein bottle. Further, we give a deterministic polynomial-time algorithm for computing the exterior…

Let $K$ be a convex body in $\R^d$, let $j\in\{1, ..., d-1\}$, and let $\varrho$ be a positive and continuous probability density function with respect to the $(d-1)$-dimensional Hausdorff measure on the boundary $\partial K$ of $K$. Denote…

We study the problem of recognizing regular languages in a variant of the streaming model of computation, called the sliding window model. In this model, we are given a size of the sliding window $n$ and a stream of symbols. At each time…

We study stochastic gradient descent {\em without replacement} (\sgdwor) for smooth convex functions. \sgdwor is widely observed to converge faster than true \sgd where each sample is drawn independently {\em with replacement}…

Fast classical processing is essential for most quantum fault-tolerance architectures. We introduce a sliding-window decoding scheme that provides fast classical processing for the surface code through parallelism. Our scheme divides the…

Duplicate detection is the problem of identifying whether a given item has previously appeared in a (possibly infinite) stream of data, when only a limited amount of memory is available. Unfortunately the infinite stream setting is…

We develop an algorithmic theory of convex optimization over discrete sets. Using a combination of algebraic and geometric tools we are able to provide polynomial time algorithms for solving broad classes of convex combinatorial…

In this paper, the problem of finding optimal success probabilities of static linear optics quantum gates is linked to the theory of convex optimization. It is shown that by exploiting this link, upper bounds for the success probability of…

This paper presents a class of boundary integral equation methods for the numerical solution of acoustic and electromagnetic time-domain scattering problems in the presence of unbounded penetrable interfaces in two-spatial dimensions. The…

The Rolling Ball Theorem asserts that given a convex body K in Euclidean space and having a smooth surface bd(K) with all principal curvatures not exceeding c>0 at all boundary points, K necessarily has the property that to each boundary…

Polytopes are the basic finite data structures for convex sets: they appear as feasible regions in linear optimization, as geometric summaries in algorithms, and as random objects in stochastic geometry. A natural geometric question is…

The Path Contraction and Cycle Contraction problems take as input an undirected graph $G$ with $n$ vertices, $m$ edges and an integer $k$ and determine whether one can obtain a path or a cycle, respectively, by performing at most $k$ edge…