default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRishikesh Gajjala
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Conference and Workshop Papers
- 2024
[c7]L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan
:
Krenn-Gu Conjecture for Sparse Graphs. MFCS 2024: 41:1-41:15- [c6]Xavier Coiteux-Roy, Francesco D'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No Distributed Quantum Advantage for Approximate Graph Coloring. STOC 2024: 1901-1910 - 2022
- [c5]Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen, Yuhao Wang:
Learning Sparse Fixed-Structure Gaussian Bayesian Networks. AISTATS 2022: 9400-9429 - 2021
- [c4]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Efficient algorithms for decode efficient prefix codes. DCC 2021: 338 - [c3]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Generalizations of Length Limited Huffman Coding for Hierarchical Memory Settings. FSTTCS 2021: 8:1-8:23 - 2020
- [c2]Rishikesh R. Gajjala, Shashwat Banchhor, Ahmed M. Abdelmoniem, Aritra Dutta, Marco Canini, Panos Kalnis:
Huffman Coding Based Encoding Techniques for Fast Distributed Deep Learning. DistributedML@CoNEXT 2020: 21-27 - [c1]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Decode-Efficient Prefix Codes for Hierarchical Memory Models. DCC 2020: 360
Informal and Other Publications
- 2024
- [i8]Rishikesh Gajjala, Jayanth Ravi:
Improved upper bounds for the Heilbronn's Problem for k-gons. CoRR abs/2405.12945 (2024) - [i7]L. Sunil Chandran, Rishikesh Gajjala, Abraham M. Illickan:
Krenn-Gu conjecture for sparse graphs. CoRR abs/2407.00303 (2024) - [i6]L. Sunil Chandran, Rishikesh Gajjala, Shravan Mehra, Saladi Rahul:
Two Results on LPT: A Near-Linear Time Algorithm and Parcel Delivery using Drones. CoRR abs/2407.16323 (2024) - 2023
- [i5]L. Sunil Chandran, Rishikesh Gajjala:
Graph-theoretic insights on the constructability of complex entangled states. CoRR abs/2304.06407 (2023) - [i4]Xavier Coiteux-Roy, Francesco D'Amore, Rishikesh Gajjala, Fabian Kuhn, François Le Gall, Henrik Lievonen, Augusto Modanese, Marc-Olivier Renou, Gustav Schmid, Jukka Suomela:
No distributed quantum advantage for approximate graph coloring. CoRR abs/2307.09444 (2023) - 2022
- [i3]L. Sunil Chandran, Rishikesh Gajjala:
Perfect Matchings and Quantum Physics: Progress on Krenn's Conjecture. CoRR abs/2202.05562 (2022) - 2021
- [i2]Arnab Bhattacharyya, Davin Choo, Rishikesh Gajjala, Sutanu Gayen, Yuhao Wang:
Learning Sparse Fixed-Structure Gaussian Bayesian Networks. CoRR abs/2107.10450 (2021) - 2020
- [i1]Shashwat Banchhor, Rishikesh R. Gajjala, Yogish Sabharwal, Sandeep Sen:
Decode efficient prefix codes. CoRR abs/2010.05005 (2020)
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-07 21:25 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:
