485 citations
- A. Quadt7 profiles46 · h 86
- D. Schaile7 profiles46 · h 87
- A. Harel5 profiles45
- F. Fiedler4 profiles45 · h 87
- F. Guo5 profiles45
- P. Ermolov3 profiles45
- P. Mättig6 profiles45 · h 88
- P. Renkel6 profiles45 · h 51
- R. Ströhmer7 profiles45
- G. Wilson3 profiles44 · h 62
- M. Verzocchi7 profiles44 · h 86
- N. Wermes3 profiles44 · h 88
- University of FreiburgDE54 papers
- Joint Institute for Nuclear ResearchRU52 papers
- Columbia UniversityUS51 papers
- Ludwig-Maximilians-Universität MünchenDE51 papers
- Forschungszentrum JülichDE50 papers
- Johannes Gutenberg University MainzDE49 papers
- Fermi National Accelerator LaboratoryUS48 papers
- Lomonosov Moscow State UniversityRU47 papers
- University of California, RiversideUS47 papers
- Charles UniversityCZ46 papers
- Imperial College LondonGB46 papers
- University of AmsterdamNL46 papers
180 papers
Low-Memory Adaptive Prefix Coding
Travis Gagie, Marek Karpinski, Yakov Nekrich
In this paper we study the adaptive prefix coding problem in cases where the size of the input alphabet is large. We present an online prefix coding algorithm that uses $O(σ^{1 / λ…
The gravitational lens J1131-1231 - How to avoid missing an opportunity
Olaf Wucknitz, Filomena Volino
So far the lens J1131-1231 has been studied only at optical and X-ray wavelengths. A detection in the radio was almost missed as a result of an incorrect position and archive probl…
Morasses and finite support iterations
Bernhard Irrgang
We introduce a method of constructing a forcing along a simplified -morass such that the forcing satisfies the -chain condition. Alternatively, this may be seen as a meth…
From random walks to rough paths
Emmanuel Breuillard, Peter Friz, Martin Huesmann
Donsker's invariance principle is shown to hold for random walks in rough path topology. As application, we obtain Donsker-type weak limit theorems for stochastic integrals and dif…
1.25 Approximation Algorithm for the Steiner Tree Problem with Distances One and Two
Piotr Berman, Marek Karpinski, Alex Zelikovsky
We give a 1.25 approximation algorithm for the Steiner Tree Problem with distances one and two, improving on the best known bound for that problem.
Search for scalar leptoquarks and T-odd quarks in the acoplanar jet topology using 2.5 fb-1 of ppbar collision data at sqrt(s)=1.96 TeV
D0 Collaboration, V. Abazov
A search for new physics in the acoplanar jet topology has been performed in 2.5 fb-1 of data from ppbar collisions at sqrt(s)=1.96 TeV, recorded by the D0 detector at the Fermilab…