default search action
Utkarsh Tripathi
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [j6]Aswin Balaji
, Utkarsh Tripathi
Toward Safer Vehicular Transit: Implementing Deep Learning on Single Channel EEG Systems for Microsleep Detection. IEEE Trans. Intell. Transp. Syst. 24(1): 1052-1061 (2023) - [c4]Srikanth Srinivasan
Optimal Explicit Small-Depth Formulas for the Coin Problem. STOC 2023: 881-894 - 2022
- [j5]Varun Kohli
A review on Virtual Reality and Augmented Reality use-cases of Brain Computer Interface based applications for smart cities. Microprocess. Microsystems 88: 104392 (2022) - 2021
- [j4]Nutan Limaye, Karteek Sreenivasaiah
A Fixed-Depth Size-Hierarchy Theorem for $\mathrm{AC}^0[\oplus]$ via the Coin Problem. SIAM J. Comput. 50(4): 1461-1499 (2021) - [j3]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean Functions. SIAM J. Discret. Math. 35(3): 2070-2092 (2021) - [j2]Divyanshu Gupta, Shorya Jain, Utkarsh Tripathi, Pratik Chattopadhyay
A robust and efficient image de-fencing approach using conditional generative adversarial networks. Signal Image Video Process. 15(2): 297-305 (2021) - 2020
- [j1]Srikanth Srinivasan
Decoding Variants of Reed-Muller Codes over Finite Grids. ACM Trans. Comput. Theory 12(4): 25:1-25:11 (2020)
2010 – 2019
- 2019
- [c3]Nutan Limaye, Srikanth Srinivasan
More on AC^0[oplus] and Variants of the Majority Function. FSTTCS 2019: 22:1-22:14 - [c2]Srikanth Srinivasan
On the Probabilistic Degrees of Symmetric Boolean Functions. FSTTCS 2019: 28:1-28:14 - [c1]Nutan Limaye, Karteek Sreenivasaiah
A fixed-depth size-hierarchy theorem for AC0[⊕] via the coin problem. STOC 2019: 442-453 - [i8]Divyanshu Gupta, Shorya Jain, Utkarsh Tripathi, Pratik Chattopadhyay, Lipo Wang:
Fully Automated Image De-fencing using Conditional Generative Adversarial Networks. CoRR abs/1908.06837 (2019) - [i7]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
Decoding Downset codes over a finite grid. CoRR abs/1908.07215 (2019) - [i6]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean functions. CoRR abs/1910.02465 (2019) - [i5]Nutan Limaye, Srikanth Srinivasan, Utkarsh Tripathi:
More on $AC^0[\oplus]$ and Variants of the Majority Function. Electron. Colloquium Comput. Complex. TR19 (2019) - [i4]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
Decoding Downset codes over a finite grid. Electron. Colloquium Comput. Complex. TR19 (2019) - [i3]Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
On the Probabilistic Degrees of Symmetric Boolean functions. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [i2]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity Gates. CoRR abs/1809.04092 (2018) - [i1]Nutan Limaye, Karteek Sreenivasaiah, Srikanth Srinivasan, Utkarsh Tripathi, S. Venkitesh:
The Coin Problem in Constant Depth: Sample Complexity and Parity gates. Electron. Colloquium Comput. Complex. TR18 (2018)
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-04-25 05:54 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: