Akhil S

Doctoral candidate
Computer Science and Engineering
Indian Institute of Technology, Kanpur
Email: akhis@cse.iitk.ac.in
Supervisor: Satyadev Nandakumar

Research Interests

I am interested in the theory of algorithmic randomness and geometric measure theory, particularly Hausdorff and constructive dimension. I also explore information theory from finite-state computation and entropy.

I am also broadly interested in complexity theory especially meta-complexity and its connections to algorithmic randomness and cryptography.

Talks

1. CCR 2025: Resource-Bounded Kučera-Gács Theorems. Slides
2. Complexity Theory Update Meeting 2025: One-way functions and Polynomial-time dimension. Slides

Conference Publications

1. Point-to-set Principle and Constructive Dimension Faithfulness (joint work with Satyadev Nandakumar and Subin Pulari)
   • 49th International Symposium on Mathematical Foundations of Computer Science (MFCS) 2024, Bratislava, Slovakia [Link]
   • ArXiv: [link]
2. Effective Continued Fraction Dimension versus Effective Hausdorff Dimension of Reals (joint work with Satyadev Nandakumar and Prateek Vishnoi)
   • 48th International Symposium on MFCS 2023, Bordeaux, France [Link]
   • ArXiv: [link]
3. Finite-State Relative Dimension and the Dimensions of AP Subsequences (joint work with Satyadev Nandakumar and Subin Pulari)
   • 17th TAMC 2022, Tianjin, China [Link]
   • ArXiv: [link]

Journal Publications

1. Effective Continued Fraction Dimension versus Effective Hausdorff Dimension of Reals (joint work with Satyadev Nandakumar and Prateek Vishnoi)
   • ACM Transactions on Computation Theory [Link]
2. Finite-state relative dimension, dimensions of A.P. subsequences and a finite-state van Lambalgen's theorem (joint work with Satyadev Nandakumar and Subin Pulari)
   • Information and Computation, Volume 298, June 2024, 105156 [Link]

Preprints

1. One-Way Functions and Polynomial Time Dimension (joint work with Satyadev Nandakumar, Subin Pulari and Suronjona Sarma)
   • ECCC [Link]
   • Slides [Link]