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.


  • Home
  • Search Results
  • Page 1 of 1

Search for: All records

Award ID contains: 2223870

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. ; ; (, Proc. 35th Annual ACM SIAM Symposium on Discrete Algorithms)
    Full Text Available 
  2. ; ; ; (, Proc. 35th ACM SIAM Symposium on Discrete Algorithms)
    Full Text Available 
  3. ; ; ; (, Proc. 35th Annual ACM SIAM Symposium on Discrete Algorithms)
    Full Text Available 
  4. ; ; (, Proc. 37th Neural Information Processing Systems)
    Accepted Manuscript Full Text Available
  5. ; ; (, Proc. 37th Neural Information Processing Systems)
    Accepted Manuscript Full Text Available
  6. (, Proc. 11th International Conference on Learning Representations)
    Accepted Manuscript Full Text Available
  7. ; (, Schloss Dagstuhl – Leibniz-Zentrum für Informatik)
    Chambers, Erin W; Gudmundsson, Joachim (Ed.)
    Let ℬ be a set of n unit balls in ℝ³. We present a linear-size data structure for storing ℬ that can determine in O^*(n^{1/2}) time whether a query line intersects any ball of ℬ and report all k such balls in additional O(k) time. The data structure can be constructed in O(n log n) time. (The O^*(⋅) notation hides subpolynomial factors, e.g., of the form O(n^ε), for arbitrarily small ε > 0, and their coefficients which depend on ε.) We also consider the dual problem: Let ℒ be a set of n lines in ℝ³. We preprocess ℒ, in O^*(n²) time, into a data structure of size O^*(n²) that can determine in O^*(1) time whether a query unit ball intersects any line of ℒ, or report all k such lines in additional O(k) time. 
    more » « less
  8. (, Proc. 18th Scandinavian Symposium and Workshops on Algorithm Theory)
    Accepted Manuscript Full Text Available
  9. ; ; ; (, ACM Symposium on Theory of Computing)
    Full Text Available