default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSajin Koroth
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[c9]Paul Beame
, Sajin Koroth:
On Disperser/Lifting Properties of the Index and Inner-Product Functions. ITCS 2023: 14:1-14:17- 2022
- [i16]Paul Beame, Sajin Koroth:
On Disperser/Lifting Properties of the Index and Inner-Product Functions. CoRR abs/2211.17211 (2022) - [i15]Paul Beame, Sajin Koroth:
On Disperser/Lifting Properties of the Index and Inner-Product Functions. Electron. Colloquium Comput. Complex. TR22 (2022) - 2021
- [j4]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. SIAM J. Comput. 50(1): 171-210 (2021) - [j3]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. ACM Trans. Comput. Theory 13(4): 23:1-23:37 (2021) - 2020
- [c8]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates. CCC 2020: 15:1-15:41 - [c7]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating cutting planes is NP-hard. STOC 2020: 68-77 - [i14]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. CoRR abs/2002.08533 (2020) - [i13]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard}. CoRR abs/2004.08037 (2020) - [i12]Mohammad Mahdi Jahanara, Sajin Koroth, Igor Shinkar:
Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality. CoRR abs/2009.04892 (2020) - [i11]Mika Göös, Sajin Koroth, Ian Mertz, Toniann Pitassi:
Automating Cutting Planes is NP-Hard. Electron. Colloquium Comput. Complex. TR20 (2020) - [i10]Mohammad Mahdi Jahanara, Sajin Koroth, Igor Shinkar:
Toward Probabilistic Checking against Non-Signaling Strategies with Constant Locality. Electron. Colloquium Comput. Complex. TR20 (2020) - [i9]Valentine Kabanets, Sajin Koroth, Zhenjian Lu, Dimitrios Myrisiotis, Igor C. Oliveira:
Algorithms and Lower Bounds for de Morgan Formulas of Low-Communication Leaf Gates. Electron. Colloquium Comput. Complex. TR20 (2020)
2010 – 2019
- 2019
- [j2]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. ACM Trans. Comput. Theory 11(2): 8:1-8:22 (2019) - [c6]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-To-Communication Lifting for BPP Using Inner Product. ICALP 2019: 35:1-35:15 - [i8]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-communication lifting for BPP using inner product. CoRR abs/1904.13056 (2019) - [i7]Arkadev Chattopadhyay, Yuval Filmus, Sajin Koroth, Or Meir, Toniann Pitassi:
Query-to-Communication Lifting Using Low-Discrepancy Gadgets. Electron. Colloquium Comput. Complex. TR19 (2019) - 2018
- [c5]Sajin Koroth, Or Meir:
Improved Composition Theorems for Functions and Relations. APPROX-RANDOM 2018: 48:1-48:18 - 2017
- [j1]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. Fundam. Informaticae 152(2): 123-144 (2017) - 2016
- [c4]Shankar Balachandran, Sajin Koroth:
Subclasses of Baxter Permutations Based on Pattern Avoidance. CSR 2016: 192-206 - [c3]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension. FSTTCS 2016: 37:1-37:14 - [i6]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. CoRR abs/1604.07200 (2016) - [i5]Krishnamoorthy Dinesh, Sajin Koroth, Jayalal Sarma:
Characterization and Lower Bounds for Branching Program Size using Projective Dimension. Electron. Colloquium Comput. Complex. TR16 (2016) - 2014
- [c2]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. COCOON 2014: 596-607 - [i4]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. CoRR abs/1404.7443 (2014) - [i3]Sajin Koroth, Jayalal Sarma:
Depth Lower Bounds against Circuits with Sparse Orientation. Electron. Colloquium Comput. Complex. TR14 (2014) - 2011
- [i2]Shankar Balachandran, Sajin Koroth:
A study on the number of Hierarchical Rectangular Partitions of Order k. CoRR abs/1112.1374 (2011) - [i1]Shankar Balachandran, Sajin Koroth:
A Study on Hierarchical Floorplans of Order k. CoRR abs/1112.1396 (2011)
2000 – 2009
- 2009
- [c1]Saurav Muralidharan, Sajin Koroth, Nevil Anto, Rafeeque Pandarachalil:
Galaxia: A Semi-decentralized System for Implementing Secure-Group P2P Networks. NetCoM 2009: 289-294
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-24 22:49 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:
