Siddhartha Jain

Orcid: 0000-0003-2142-5801

Affiliations:

University of Texas at Austin, TX, USA
EPFL, Lausanne, Switzerland (former)
IIIT-Delhi, India (former)

According to our database¹, Siddhartha Jain authored at least 11 papers between 2019 and 2025.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Bibliography

2025

Quantum Communication Advantage in TFNP.

[BibT_eX]

[DOI]

Proceedings of the 57th Annual ACM Symposium on Theory of Computing, 2025

Consumable Data via Quantum Communication.

[BibT_eX]

[DOI]

Dar Gilboa

Siddhartha Jain

Jarrod R. McClean

Proceedings of the Approximation, 2025

2024

Further Collapses in \(\boldsymbol{\mathsf{TFNP}}\).

[BibT_eX]

[DOI]

SIAM J. Comput., 2024

On Pigeonhole Principles and Ramsey in TFNP.

[BibT_eX]

[DOI]

Proceedings of the 65th IEEE Annual Symposium on Foundations of Computer Science, 2024

2023

On the Rational Degree of Boolean Functions and Applications.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2023

2022

Separations in Proof Complexity and TFNP.

[BibT_eX]

[DOI]

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

Further Collapses in TFNP.

[BibT_eX]

[DOI]

Proceedings of the 37th Computational Complexity Conference, 2022

Communication Complexity of Collision.

[BibT_eX]

[DOI]

Mika Göös

Siddhartha Jain

Proceedings of the Approximation, 2022

2021

Unambiguous DNFs from Hex.

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2021

Unambiguous DNFs and Alon-Saks-Seymour.

[BibT_eX]

[DOI]

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2019

Inapproximability of Additive Weak Contraction under SSEH and Strong UGC.

[BibT_eX]

[DOI]

Siddhartha Jain

CoRR, 2019

Siddhartha Jain

Timeline

Legend:

Links

Online presence:

On csauthors.net:

Bibliography

Loading...