14.2k citations
- Pennsylvania State UniversityUS156 papers
- Tata Institute of Fundamental ResearchIN156 papers
- Cardiff UniversityGB146 papers
- Centre National de la Recherche ScientifiqueFR144 papers
- Max Planck Institute for Gravitational PhysicsDE143 papers
- California Institute of TechnologyUS136 papers
- Inter-University Centre for Astronomy and AstrophysicsIN134 papers
- Leibniz University HannoverDE133 papers
- Montclair State UniversityUS133 papers
- University of BirminghamGB133 papers
- University of MississippiUS133 papers
- University of FloridaUS131 papers
19 papers · 1 filter
Computing Bits of Algebraic Numbers
Samir Datta, Rameshwar Pratap
We initiate the complexity theoretic study of the problem of computing the bits of (real) algebraic numbers. This extends the work of Yap on computing the bits of transcendental nu…
Localized Geometric Query Problems
John Augustine, Sandip Das, Anil Maheshwari +3
A new class of geometric query problems are studied in this paper. We are required to preprocess a set of geometric objects in the plane, so that for any arbitrary query point…
The 2.5PN linear momentum flux and associated recoil from inspiralling compact binaries in quasi-circular orbits: Nonspinning case
Chandra Kant Mishra, K. G. Arun, Bala R. Iyer
Anisotropic emission of gravitational waves (GWs) from inspiralling compact binaries leads to the loss of linear momentum and hence gravitational recoil of the system. The loss rat…
On a Generalization of Zaslavsky's Theorem for Hyperplane Arrangements
Priyavrat Deshpande
We define arrangements of codimension-1 submanifolds in a smooth manifold which generalize arrangements of hyperplanes. When these submanifolds are removed the manifold breaks up i…
Group velocity of neutrino waves
D. Indumathi, Romesh K. Kaul, M. V. N. Murthy +1
We follow up on the analysis of Mecozzi and Bellini (arXiv:1110:1253v1) where they showed, in principle, the possibility of superluminal propagation of neutrinos, as indicated by t…
Better abstractions for timed automata
Frédéric Herbreteau, B. Srivathsan, Igor Walukiewicz
We consider the reachability problem for timed automata. A standard solution to this problem involves computing a search tree whose nodes are abstractions of zones. These abstracti…