( en | de | ru )

 

Disambiguation of "Mani, Nitya"

Author of the publication

copydeleteadd this publication to your clipboard
From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT.

, and . SODA, page 3437-3470. SIAM, (2023)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Anjana Nityanandam

Maheswaran Mani

Mani Dabui

Helen Mani

Peter Mani

 

Other publications of authors with the same name

Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications., , , and . FOCS, page 810-845. IEEE, (2023)Turán problems for mixed graphs., and . J. Comb. Theory B, (2024)Nearly all k-SAT functions are unate., , , , and . CoRR, (2022)Enumerating k-SAT functions., , and . SODA, page 2141-2184. SIAM, (2022)Making an H $H$ -free graph k $k$ -colorable., , and . J. Graph Theory, 102 (2): 234-261 (2023)From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT., and . SODA, page 3437-3470. SIAM, (2023)Random local access for sampling k-SAT solutions., and . CoRR, (2024)Lower bounds for Max-Cut in $H$-free graphs via semidefinite programming, , , , , and . (2018)cite arxiv:1810.10044Comment: 21 pages, to be published in LATIN 2020 proceedings, Updated version is rewritten to include additional results along with corrections to original arguments.An Interpretable Approach to Hateful Meme Detection., and . ICMI, page 723-727. ACM, (2021)Lower Bounds for Max-Cut via Semidefinite Programming., , , , , and . LATIN, volume 12118 of Lecture Notes in Computer Science, page 479-490. Springer, (2020)