Postdoctoral Researcher
School of Technology and Computer Science
Tata Institute of Fundamental Research, Mumbai
Brief Bio
I am currently a postdoctoral researcher in the STCS group at the Tata Institute of Fundamental Research, Mumbai, hosted by Arkadev Chattopadhyay. I completed my Ph.D. in theoretical computer science at the Institute of Mathematical Sciences, Chennai, under the guidance of Prof. Meena Mahajan.
Previously, I obtained a Master's degree in Computer Science from IIT Kanpur, advised by Prof. Surender Baswana, and a Bachelor's degree in Electronics and Communication Engineering from IIT BHU.
I have a broad interest in theoretical computer science, with current research focuses on query complexity, communication complexity, proof complexity, and sketching and sampling algorithms for big data problems.
News & Activities
- Visiting Meena, June 2024, at IMSc Chennai.
- A paper accepted at SAT 24 on lower bounds for Polynomial Calculus over non-Boolean bases. We present a lifting theorem for PC over {+1,-1} encoding and a new lower bound for PC over finite fields with extension variables.
- Gave a talk on Randomness gives little advantage for decision tree size at the MIAO Seminar.
- Visited Nutan and Srikanth, October 2023, at the University of Copenhagen, Denmark.
- Visited the University of Bergen, Norway, September-November 2023.
- Presented our paper on Query Complexity of Search Problems at MFCS 23, August 2023.
- A paper accepted at MFCS 23 on Query Complexity of Search Problems. We study pseudo-deterministic query and size complexity in various decision tree models.
- A paper accepted in STOC 23 on Randomized versus Deterministic Decision Tree Size. We derandomize the size measure in the query model adding to the classical result of Nisan's, which derandomized the query measure. As a consequence, we obtain that randomness gives little advantage in the AND query and the AND-OR query models.
- Visited Prof. Arkadev Chattopadhyay, January-April 2023, at TIFR, Mumbai.
- Gave a talk on Time and Space Complexity of Query Algorithms at the IMSc60 event celebrating the 60th foundation year of the Institute of Mathematical Sciences, January 2023.
- Visited Prof. Arkadev Chattopadhyay, September 2022, at TIFR, Mumbai.
- Gave a talk on Decision Tree Rank at the TCS seminar, IMSc, November 2021.
- A paper accepted at FSTTCS 21 on the decision tree rank. We study the rank of decision trees for Boolean functions and relate it to other measures like depth, size, sparsity, and certificate complexity. We also proved a decision tree size composition theorem.
- A paper accepted at ICML 21 on Fixed-Parameter Approximation Algorithms for PCA in the presence of outliers.
- Gave a talk on Sketching for Numerical Linear Algebra at the summer school on Algorithmic Tractability via Sparsifiers, Leh, India, 2019.
- Attended the Workshop on Kernelization (Worker) 2019 at the University of Bergen, Norway.
- Visited Prof. Saket Saurabh, from May to July 2019, at the University of Bergen, Norway.
Publications
New lower bounds for Polynomial Calculus over non-Boolean bases
With Meena Mahajan and Sasank Mouli.
To appear in Proceedings of the 27th International Conference on Theory and Applications of Satisfiability Testing (SAT 2024).
ECCC Report
Query Complexity of Search Problems
With Arkadev Chattopadhyay and Meena Mahajan.
Proceedings of 48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023)
ECCC Report
Linear threshold functions in decision lists, decision trees, and depth-2 circuits
With Vignesh K, Meena Mahajan, Karteek Sreenivasaiah.
Information Processing Letters, Vol. 183 (106418) (IPL 2024).
ECCC Report
Randomized Versus Deterministic Decision Tree Size
With Arkadev Chattopadhyay, Nikhil Mande, Jaikumar Radhakrishnan, and Swagato Sanyal.
Proceedings of 55th ACM Symposium on Theory of Computing (STOC 2023)
ECCC Report
On (Simple) decision tree rank
With Meena Mahajan
Proceedings of 41st FSTTCS Conference (FSTTCS 2021)
Full version to appear in Theoretical Computer Science.
ECCC Report
Fixed-Parameter and Approximation Algorithms for PCA with Outliers
With Fedor Fomin, Fahad Panolan and Kirill Simonov
Proceedings of 38th International Conference on Machine Learning (ICML 2021) paper
An Empirical Evaluation of Sketching for Numerical Linear Algebra
With Dimitris Konomis and David Woodruff
SIGKDD Conference on Knowledge Discovery and Data Mining (KDD 2018) paper
Discovering Response-Eliciting Factors in
Social Question Answering
With Danish and Partha Talukdar
AAAI Conference on Web and Social Media (ICWSM-16) paper
Contact
Email: yogeshdahiya (at) imsc (dot) res (dot) in
Office: NL-02 Library Building