skip to main content
US FlagAn official website of the United States government
dot gov icon
Official websites use .gov
A .gov website belongs to an official government organization in the United States.
https lock icon
Secure .gov websites use HTTPS
A lock ( lock ) or https:// means you've safely connected to the .gov website. Share sensitive information only on official, secure websites.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.


Title: The Radar Echo Telescope for Cosmic Rays: Pathfinder experiment for a next-generation neutrino observatory
Award ID(s):
2033500 2019597 2012980
PAR ID:
10319914
Author(s) / Creator(s):
; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; ; more » ; ; ; ; ; ; ; ; « less
Date Published:
Journal Name:
Physical Review D
Volume:
104
Issue:
10
ISSN:
2470-0010
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; (, Southeastern Robert Noyce Conference)
    null (Ed.)
    This presentation poster summarizes the recruitment efforts, insights gained, and lessons learned through the VolsTeach for Appalachia project that focuses on recruiting and preparing community college students in becoming STEM teachers in East Tennessee. 
    more » « less
  2. ; (, Journal of Construction Engineering and Management)
    null (Ed.)
  3. (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Beyersdorff, Olaf; Kanté, Mamadou Moustapha; Kupferman, Orna; Lokshtanov, Daniel (Ed.)
    Given a set P of n points and a set S of n segments in the plane, we consider the problem of computing for each segment of S its closest point in P. The previously best algorithm solves the problem in n^{4/3}2^{O(log^*n)} time [Bespamyatnikh, 2003] and a lower bound (under a somewhat restricted model) Ω(n^{4/3}) has also been proved. In this paper, we present an O(n^{4/3}) time algorithm and thus solve the problem optimally (under the restricted model). In addition, we also present data structures for solving the online version of the problem, i.e., given a query segment (or a line as a special case), find its closest point in P. Our new results improve the previous work. 
    more » « less
  4. ; ; ; (, Sustainable Earth Reviews)
  5. ; ; ; ; ; (, ACM Conference on Datta and Application Security and Privacy (CODASPY) 2021)
    null (Ed.)
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email