Samarth Tiwari

Full Name

S.S.K. Tiwari

Samarth.Tiwari@cwi.nl

Phone

+31 20 592 4093

Room

M239

Department(s)

Networks and Optimization

Function(s)

PhD student

Research

Samarth Tiwari obtained his bachelor's degree in mathematics from the Courant Institute of Mathematical Sciences at New York University in 2019. His research in Networks & Optimization at CWI involves proof complexity and integer programming, and is under the supervision of Daniel Dadush.

Publications:

On the Complexity of Branching Proofs
D. Dadush, S. Tiwari. To appear in Computational Complexity Conference, 2020

Madhusudan, A., Sedaghat, M., Tiwari, S., Cong, K., & Preneel, B. (2023). Reusable, instant and private payment guarantees for cryptocurrencies. In Proceedings of the Australasian Conference on Information Security and Privacy (pp. 580–605). doi:10.1007/978-3-031-35486-1_25
Avarikioti, Z., Pietrzak, K., Salem, I., Schmid, S., Tiwari, S., & Teo, M. (2022). Hide & Seek: Privacy-preserving rebalancing on payment channel networks. In Proceedings of International Conference on Financial Cryptography and Data Security (pp. 358–373). doi:10.1007/978-3-031-18283-9_17
Borst, S., Dadush, D., Huiberts, S., & Tiwari, S. (2021). On the integrality gap of binary integer programs with Gaussian data. In Lecture Notes in Computer Science/Lecture Notes in Artificial Intelligence (pp. 427–442). doi:10.1007/978-3-030-73879-2_30
Dadush, D., & Tiwari, S. (2020). On the complexity of branching proofs. In 35th Computational Complexity Conference, CCC 2020 (pp. 34:1–34:35). doi:10.4230/LIPIcs.CCC.2020.34

Best Paper Award at CCC'20 (2020)

Towards a Quantitative Theory of Integer Programming (QIP)

Samarth Tiwari

Research

Publications

Awards

Current projects with external funding

Samarth Tiwari

Research

Publications

Awards

Current projects with external funding

Cookies