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: Random matrices with log-range correlations, and log-Sobolev inequalities
Award ID(s):
1800733
PAR ID:
10332857
Author(s) / Creator(s):
;
Date Published:
Journal Name:
Annales Mathématiques Blaise Pascal
Volume:
27
Issue:
2
ISSN:
2118-7436
Page Range / eLocation ID:
207 to 232
Format(s):
Medium: X
Sponsoring Org:
National Science Foundation
More Like this
  1. ; ; ; ; (, TheoretiCS)
    Dynamic connectivity is one of the most fundamental problems in dynamic graphalgorithms. We present a randomized Las Vegas dynamic connectivity datastructure with $$O(\log n(\log\log n)^2)$$ amortized expected update time and$$O(\log n/\log\log\log n)$$ worst case query time, which comes very close to thecell probe lower bounds of Patrascu and Demaine (2006) and Patrascu and Thorup(2011). 
    more » « less
  2. ; ; ; (, Transactions of the American Mathematical Society)
    null (Ed.)
  3. ; ; (, PODC '23: Proceedings of the 2023 ACM Symposium on Principles of Distributed Computing)
  4. ; ; ; (, Tunisian Journal of Mathematics)
    null (Ed.)
  5. (, Algebra & Number Theory)
  • Citation Formats
  • MLA
  • APA
  • Chicago
  • BibTeX
  • Save / Share this Record
  • Send to Email