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 2

Search for: All records

Award ID contains: 1815328

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. ; (, Random Structures & Algorithms)
    Abstract We give polynomial time algorithms for the seminal results of Kahn, who showed that the Goldberg–Seymour and list‐coloring conjectures for (list‐)edge coloring multigraphs hold asymptotically. Kahn's arguments are based on the probabilistic method and are non‐constructive. Our key insight is that we can combine sophisticated techniques due to Achlioptas, Iliopoulos, and Kolmogorov for the analysis of local search algorithms with correlation decay properties of the probability spaces on matchings used by Kahn in order to construct efficient edge‐coloring algorithms. 
    more » « less
  2. ; (, ACM-SIAM)
  3. ; ; (, SIAM Journal on Computing)
    Full Text Available 
  4. ; (, ACM)
  5. ; ; (, Combinatorics, Probability and Computing)
    Full Text Available 
  6. ; ; ; ; (, The Annals of Applied Probability)
    Full Text Available 
  7. ; ; (, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA))
    Accepted Manuscript Full Text Available
  8. ; (, Proceedings of the 31st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA))
    Full Text Available 
  9. ; ; (, Proceedings of the 2020 ACM-SIAM Symposium on Discrete Algorithms (SODA))
    Full Text Available 
  10. ; ; (, Proceedings of the 60th IEEE Symposium on Foundations of Computer Science (FOCS))
    Full Text Available