default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
Exact matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 52 matches
- 2024
- Uma Girish:
Quantum versus Classical Communication and Query Complexity. Princeton University, USA, 2024 - Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. SOSA 2024: 144-150 - Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. STOC 2024: 1488-1497 - 2023
- Srinivasan Arunachalam, Uma Girish:
Trade-Offs Between Entanglement and Communication. CCC 2023: 25:1-25:23 - Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. FOCS 2023: 721-732 - Uma Girish, Ran Raz, Wei Zhan:
Is Untrusted Randomness Helpful? ITCS 2023: 56:1-56:18 - Srinivasan Arunachalam, Uma Girish:
Trade-offs between Entanglement and Communication. CoRR abs/2306.01233 (2023) - Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. CoRR abs/2307.11083 (2023) - Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
Fourier Growth of Communication Protocols for XOR Functions. CoRR abs/2307.13926 (2023) - Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. CoRR abs/2310.02406 (2023) - Uma Girish, Makrand Sinha, Avishay Tal, Kewen Wu:
The Power of Adaptivity in Quantum Query Algorithms. CoRR abs/2311.16057 (2023) - Srinivasan Arunachalam, Uma Girish, Noam Lifshitz:
One Clean Qubit Suffices for Quantum Communication Advantage. Electron. Colloquium Comput. Complex. TR23 (2023) - Uma Girish, Ran Raz, Wei Zhan:
Quantum Logspace Computations are Verifiable. Electron. Colloquium Comput. Complex. TR23 (2023) - A. Srinivasan, Uma Girish:
Trade-offs between Entanglement and Communication. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- Uma Girish, Ran Raz, Avishay Tal:
Quantum versus Randomized Communication Complexity, with Efficient Players. Comput. Complex. 31(2): 17 (2022) - R. S. Cant, Umair Ahmed, Jian Fang, N. Chakarborty, Girish V. Nivarti, Charles Moulinec, D. R. Emerson:
An unstructured adaptive mesh refinement approach for computational fluid dynamics of reacting flows. J. Comput. Phys. 468: 111480 (2022) - Honey Yadav, Umang Soni, Shubham Gupta, Girish Kumar:
Evaluation of Barriers in the Adoption of E-Commerce Technology in SMEs: A Fuzzy DEMATEL Approach. J. Electron. Commer. Organ. 20(1): 1-18 (2022) - Saksham Jain, Gautam Seth, Arpit Paruthi, Umang Soni, Girish Kumar:
Synthetic data augmentation for surface defect detection and classification using deep learning. J. Intell. Manuf. 33(4): 1007-1020 (2022) - Promila Sharma, Uma Meena, Girish Kumar Sharma:
Intelligent Data Analysis using Optimized Support Vector Machine Based Data Mining Approach for Tourism Industry. ACM Trans. Knowl. Discov. Data 16(5): 94:1-94:20 (2022) - Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds on Parallel Repetition for All 3-Player Games with Binary Inputs. APPROX/RANDOM 2022: 6:1-6:17 - Uma Girish, Ran Raz:
Eliminating Intermediate Measurements Using Pseudorandom Generators. ITCS 2022: 76:1-76:18 - Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel repetition for all 3-player games over binary alphabet. STOC 2022: 998-1009 - Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition For All 3-Player Games Over Binary Alphabet. CoRR abs/2202.06826 (2022) - Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. CoRR abs/2204.00858 (2022) - Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition For All 3-Player Games Over Binary Alphabet. Electron. Colloquium Comput. Complex. TR22 (2022) - Uma Girish, Kunal Mittal, Ran Raz, Wei Zhan:
Polynomial Bounds On Parallel Repetition For All 3-Player Games With Binary Inputs. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- Uma Girish, Justin Holmgren, Kunal Mittal, Ran Raz, Wei Zhan:
Parallel Repetition for the GHZ Game: A Simpler Proof. APPROX-RANDOM 2021: 62:1-62:19 - Uma Girish, Ran Raz, Wei Zhan:
Lower Bounds for XOR of Forrelations. APPROX-RANDOM 2021: 52:1-52:14 - Uma Girish, Avishay Tal, Kewen Wu:
Fourier Growth of Parity Decision Trees. CCC 2021: 39:1-39:36 - Girish Hegde, Tushar Pharale, Soumya Jahagirdar, Vaishakh Nargund, Ramesh Ashok Tabib, Uma Mudenagudi, Basavaraja S. Vandrotti, Ankit Dhiman:
DeepDNet: Deep Dense Network for Depth Completion Task. CVPR Workshops 2021: 2190-2199
skipping 22 more matches
loading more results
failed to load more results, please try again later
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.
retrieved on 2024-09-14 19:51 CEST from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint