output
20052022
most citedThe Uncertainty Principle in the Presence of Quantum Memory

850 citations

researchers with a paper here

Counting papers with at most 25 authors, so collaboration author lists do not stand in for the people here.

collaborating institutions
Showing 2012Show all

9 papers · 1 filter

math.CO2012★ 1 cited

Counting and packing Hamilton cycles in dense graphs and oriented graphs

Asaf Ferber, Michael Krivelevich, Benny Sudakov

We present a general method for counting and packing Hamilton cycles in dense graphs and oriented graphs, based on permanent estimates. We utilize this approach to prove several ex…

math.OC2012★ 2 cited

Variable Metric Random Pursuit

Sebastian U. Stich, Christian L. Müller, Bernd Gärtner

We consider unconstrained randomized optimization of smooth convex objective functions in the gradient-free setting. We analyze Random Pursuit (RP) algorithms with fixed (F-RP) and…

cs.CG2012★ 7 cited

On Universal Point Sets for Planar Graphs

Jean Cardinal, Michael Hoffmann, Vincent Kusters

A set P of points in R^2 is n-universal, if every planar graph on n vertices admits a plane straight-line embedding on P. Answering a question by Kobourov, we show that there is no…

stat.CO2012★ 1 cited

Tangent space estimation for smooth embeddings of Riemannian manifolds

Hemant Tyagi, Elif Vural, Pascal Frossard

Numerous dimensionality reduction problems in data analysis involve the recovery of low-dimensional models or the learning of manifolds underlying sets of data. Many manifold learn…

cs.GT2012

Imperfect best-response mechanisms

Diodato Ferraioli, Paolo Penna

Best-response mechanisms (Nisan, Schapira, Valiant, Zohar, 2011) provide a unifying framework for studying various distributed protocols in which the participants are instructed to…

math.CO2012★ 25 cited

Erdos-Szekeres-type statements: Ramsey function and decidability in dimension 1

Boris Bukh, Jiri Matousek

A classical and widely used lemma of Erdos and Szekeres asserts that for every n there exists N such that every N-term sequence a of real numbers contains an n-term increasing subs…

cs.CC2012★ 3 cited

Tight Bounds for Low Dimensional Star Stencils in the Parallel External Memory Model

Philipp Hupp, Riko Jacob

Stencil computations on low dimensional grids are kernels of many scientific applications including finite difference methods used to solve partial differential equations. On typic…

cs.CG2012★ 3 cited

Simple Agents Learn to Find Their Way: An Introduction on Mapping Polygons

Jérémie Chalopin, Shantanu Das, Yann Disser +2

This paper gives an introduction to the problem of mapping simple polygons with autonomous agents. We focus on minimalistic agents that move from vertex to vertex along straight li…

cs.DS2012★ 52 cited

Computing Lempel-Ziv Factorization Online

Tatiana Starikovskaya

We present an algorithm which computes the Lempel-Ziv factorization of a word of length on an alphabet of size online in the following sense: it reads starting…