171 citations
- Aarhus UniversityDK1 paper
- ETH ZurichCH1 paper
- Hiroshima UniversityJP1 paper
- Institut des Hautes Études ScientifiquesFR1 paper
- International Center for Relativistic AstrophysicsIT1 paper
- Istituto Nazionale di Fisica Nucleare, Sezione di TorinoIT1 paper
- Jet Propulsion LaboratoryUS1 paper
- Joint Institute for VLBI ERICNL1 paper
- Lancaster UniversityGB1 paper
- Ludwig-Maximilians-Universität MünchenDE1 paper
- Max Planck Institute for Gravitational PhysicsDE1 paper
- Max Planck Institute of Quantum OpticsDE1 paper
6 papers · 1 filter
The M/M/1 queue is Bernoulli
Michael Keane, Neil O'Connell
The classical output theorem for the M/M/1 queue, due to Burke (1956), states that the departure process from a stationary M/M/1 queue, in equilibrium, has the same law as the arri…
Accurate Effective-One-Body waveforms of inspiralling and coalescing black-hole binaries
Thibault Damour, Alessandro Nagar, Mark Hannam +2
The Effective-One-Body (EOB) formalism contains several flexibility parameters, notably , $\vp$ and $\a$. We show here how to jointly constrain the values of these parameters…
Some remarks on the size of bodies and black holes
Gregory J. Galloway, Niall O'Murchadha
We consider the application of stable marginally outer trapped surfaces to problems concerning the size of material bodies and the area of black holes. The results presented extend…
Reconstructing the geometric structure of a Riemannian symmetric space from its Satake diagram
Sebastian Klein
The local geometry of a Riemannian symmetric space is described completely by the Riemannian metric and the Riemannian curvature tensor of the space. In the present article I descr…
Minimum Leaf Out-branching and Related Problems
G. Gutin, I. Razgon, E. J. Kim
Given a digraph , the Minimum Leaf Out-Branching problem (MinLOB) is the problem of finding in an out-branching with the minimum possible number of leaves, i.e., vertices of…
Almost 2-SAT is Fixed-Parameter Tractable
Igor Razgon, Barry O'Sullivan
We consider the following problem. Given a 2-CNF formula, is it possible to remove at most clauses so that the resulting 2-CNF formula is satisfiable? This problem is known to…