default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDNitya Mani
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j7]Aaron Berger, Nitya Mani:
On sum-intersecting families of positive integers. Eur. J. Comb. 120: 103963 (2024)- [j6]Nitya Mani, Edward Yu
:
Turán problems for mixed graphs. J. Comb. Theory B 167: 119-163 (2024) - [j5]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Extremal results on feedback arc sets in digraphs. Random Struct. Algorithms 64(2): 287-308 (2024) - [i8]Dingding Dong, Nitya Mani:
Random local access for sampling k-SAT solutions. CoRR abs/2409.03951 (2024) - 2023
- [j4]Dingding Dong, Nitya Mani, Yufei Zhao:
On the number of error correcting codes. Comb. Probab. Comput. 32(5): 819-832 (2023) - [j3]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Making an H $H$ -free graph k $k$ -colorable. J. Graph Theory 102(2): 234-261 (2023) - [j2]Sayan Das, Zoe M. Himwich, Nitya Mani:
A fourth-moment phenomenon for asymptotic normality of monochromatic subgraphs. Random Struct. Algorithms 63(4): 968-996 (2023) - [c6]Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra:
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications. FOCS 2023: 810-845 - [c5]Zongchen Chen, Nitya Mani:
From Algorithms to Connectivity and Back: Finding a Giant Component in Random k-SAT. SODA 2023: 3437-3470 - [c4]József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao:
Nearly All k-SAT Functions Are Unate. STOC 2023: 958-962 - [i7]Zongchen Chen, Kuikui Liu, Nitya Mani, Ankur Moitra:
Strong spatial mixing for colorings on trees and its algorithmic applications. CoRR abs/2304.01954 (2023) - 2022
- [c3]Dingding Dong, Nitya Mani, Yufei Zhao:
Enumerating k-SAT functions. SODA 2022: 2141-2184 - [i6]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Extremal results on feedback arc sets in digraphs. CoRR abs/2204.01938 (2022) - [i5]Dingding Dong, Nitya Mani, Yufei Zhao:
On the number of error correcting codes. CoRR abs/2205.12363 (2022) - [i4]Zongchen Chen, Nitya Mani, Ankur Moitra:
From algorithms to connectivity and back: finding a giant component in random k-SAT. CoRR abs/2207.02841 (2022) - [i3]József Balogh, Dingding Dong, Bernard Lidický, Nitya Mani, Yufei Zhao:
Nearly all k-SAT functions are unate. CoRR abs/2209.04894 (2022) - 2021
- [j1]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut in H-Free Graphs via Semidefinite Programming. SIAM J. Discret. Math. 35(3): 1557-1568 (2021) - [c2]Tanvi Deshpande, Nitya Mani:
An Interpretable Approach to Hateful Meme Detection. ICMI 2021: 723-727 - [i2]Jacob Fox, Zoe M. Himwich, Nitya Mani:
Making an $H$-Free Graph $k$-Colorable. CoRR abs/2102.10220 (2021) - [i1]Tanvi Deshpande, Nitya Mani:
An Interpretable Approach to Hateful Meme Detection. CoRR abs/2108.10069 (2021) - 2020
- [c1]Charles Carlson, Alexandra Kolla, Ray Li, Nitya Mani, Benny Sudakov, Luca Trevisan:
Lower Bounds for Max-Cut via Semidefinite Programming. LATIN 2020: 479-490
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-10 22:15 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
