default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSiddharth Iyer
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j1]Siddharth Iyer
, Igor E. Shparlinski:
Character sums over elements of extensions of finite fields with restricted coordinates. Finite Fields Their Appl. 93: 102335 (2024)- [c5]Siddharth Iyer, Anup Rao:
An XOR Lemma for Deterministic Communication Complexity. FOCS 2024: 429-432 - [c4]Siddharth Iyer, Anup Rao:
XOR Lemmas for Communication via Marginal Information. STOC 2024: 652-658 - [i10]Siddharth Iyer, Anup Rao:
An XOR Lemma for Deterministic Communication Complexity. CoRR abs/2407.01802 (2024) - [i9]Siddharth Iyer, Anup Rao:
An XOR Lemma for Deterministic Communication Complexity. Electron. Colloquium Comput. Complex. TR24 (2024) - 2023
- [c3]Siddharth Iyer, Michael Whitmeyer:
Searching for Regularity in Bounded Functions. ICALP 2023: 83:1-83:20 - [i8]Siddharth Iyer, Anup Rao:
XOR Lemmas for Communication via Marginal Information. CoRR abs/2312.03076 (2023) - [i7]Siddharth Iyer, Anup Rao:
XOR Lemmas for Communication via Marginal Information. Electron. Colloquium Comput. Complex. TR23 (2023) - 2022
- [i6]Siddharth Iyer, Michael Whitmeyer:
Searching for Regularity in Bounded Functions. CoRR abs/2207.13312 (2022) - [i5]Siddharth Iyer, Michael Whitmeyer:
Searching for Regularity in Bounded Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [i4]Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff:
Tight bounds on the Fourier growth of bounded functions on the hypercube. CoRR abs/2107.06309 (2021) - [i3]Siddharth Iyer, Anup Rao, Victor Reis, Thomas Rothvoss, Amir Yehudayoff:
Tight bounds on the Fourier growth of bounded functions on the hypercube. Electron. Colloquium Comput. Complex. TR21 (2021)
2010 – 2019
- 2019
- [c2]Ran Gelles, Siddharth Iyer:
Interactive Coding Resilient to an Unknown Number of Erasures. OPODIS 2019: 13:1-13:16 - 2018
- [c1]Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. FSTTCS 2018: 19:1-19:21 - [i2]Samir Datta, Siddharth Iyer, Raghav Kulkarni, Anish Mukherjee:
Shortest k-Disjoint Paths via Determinants. CoRR abs/1802.01338 (2018) - [i1]Ran Gelles, Siddharth Iyer:
Interactive coding resilient to an unknown number of erasures. CoRR abs/1811.02527 (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 2025-01-09 12:54 CET 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:
