Sajin Koroth
ScholarGPS® ID: 86095406631939
Affiliation History
Discipline
Computer Science
Metrics Summary
Publication Count
9
Predicted Citations
27
Predicted h-index
2
Ranking
Publications and Citation History
Publications based on Top Specialties
Types of Publication
- Publications
- Books
- Patents
- NIH/NSF
Add
Delete
|
---|
Algorithms and Lower Bounds for De Morgan Formulas of Low-Communication Leaf Gates (journal article) ACM Transactions on Computation Theory, volume 13, issue 4, pages 1-37 (2021). |
Query-to-Communication Lifting Using Low-Discrepancy Gadgets (journal article) SIAM Journal on Computing, volume 50, issue 1, pages 171-210 (2021). |
Automating cutting planes is NP-hard (conference) STOC '20: 52nd Annual ACM SIGACT Symposium on Theory of Computing (2020) Chicago IL USA |
Characterization and Lower Bounds for Branching Program Size using Projective Dimension (journal article) ACM Transactions on Computation Theory, volume 11, issue 2, pages 1-22 (2019). |
Depth Lower Bounds against Circuits with Sparse Orientation* (journal article) Fundamenta Informaticae, volume 152, issue 2, pages 123-144 (2017). |
Subclasses of Baxter Permutations Based on Pattern Avoidance (book chapter) In Computer Science – Theory and Applications Springer International Publishing (2016) |
Characterization and Lower Bounds for Branching Program Size Using Projective Dimension (conference) Foundations of Software Technology and Theoretical Computer Science (2016) |
Depth Lower Bounds against Circuits with Sparse Orientation (book chapter) In Computing and Combinatorics Springer International Publishing (2014) |
2009 First International Conference on Networks & Communications (2009) Chennai, India |