I’ve graduated from the International Institute of Information Technology - Hyderabad and will be starting my professional career at Databricks. My interests span performance optimization, algorithms research, compilers, quantitative finance and competitive programming. I’ve contributed to projects on implementing C++ stdlib experimental extensions and worked on optimizing BLAS and bio-informatics algorithms like Needleman-Wunsch and the STAR DNA sequence aligner.

Lately, I’ve been exploring options pricing theory and ML theory. I intermittently write up my thoughts and notes on things I’ve learnt in my blog. If you are interested in my work, or would like to casually chat about research or CP or one of my other interests, feel free to reach out to me!


My Vault


  1. Basics Of Supervised Learning - Linear Regression
  2. Log-Structured Merge Tree (Lsm Trees)
  3. Building A Type-Safe Tool Framework For Llms In Scala
  4. "In Search Of An Understandable Consensus Algorithm (Extended Version)" - Raft
  5. Towards A Completely Self-Driven Dbms - Challenges OtterTune Faced
  6. OtterTune - Automatic Database Management System Tuning Through Large-Scale Machine Learning
  7. "What Goes Around Comes Around" - The History Of Database Systems - Part 1 (1960 - 2000)
  8. Getting Rid of Short-Form Content
  9. A C Programmer's Guide to C++
  10. Covered Calls Strategy
  11. Stock Multiples
  12. Technical Analysis
  13. The Economics of Foreign Exchange (Forex)
  14. The Black-Scholes-Merton Equation
  15. How the Economic Machine Works by Ray Dalio
  16. Derivatives - Options
  17. What Is the Stock Market?
  18. Smart Pointers
  19. `New` and `Delete`
  20. Shortest Common Superstring & De Brujin Graphs
  21. De-Novo Assembly & Overlap Graphs
  22. Algorithms for Approximate String Matching - Alignment
  23. Booyer-Moore & Knuth-Morris-Pratt for Exact Matching
  24. DNA Sequencing
  25. Network-Flow Algorithms, Ford Fulkerson
  26. Knapsack Using Branch and Bounding
  27. P vs NP
  28. Introduction to Complexity Theory
  29. Randomization, Primality Testing Algorithms
  30. Public Key Cryptography, Coming Up With RSA
  31. Wilson's Theorem, Fermat's Little Theorem & Euler's Totient Function
  32. Extended Euclidean Algorithm
  33. Shortest Reliable Path, Floyd Warshall & Max-Independent Set (Tree)
  34. A Deep Dive Into the Knapsack Problem
  35. Chain Matrix Multiplication
  36. Levenshtein Edit Distance
  37. Complexity Theory - Reductions
  38. DP as DAGs, Shortest Path on DAGs & LIS in O(nlogn)
  39. Set Cover & Approximation Algorithms
  40. More Greedy Algorithms! Kruskal's & Disjoint Set Union
  41. Activity Selection & Huffman Encoding
  42. The Fast Fourier Transform (FFT)
  43. Master's Theorem, Strassen's Matrix Multiplication & KTH-Order Statistics
  44. Analyzing Fibonacci & Karatsuba Multiplication
  45. How to Analyze Algorithms? Proving a Lower Bound for Comparison Based Sorting
  46. Church-Turing Hypothesis
  47. Are There Computational Problems That Computers Cannot Solve?
  48. Defining Computational Problems
  49. Mega-Project - kBLAS (Writing a Benchmark Library in C & Optimizing L1, L2 Basic Linear Algebra Subprograms)
  50. Brent's Theorem & Task Level Parallelism
  51. Parallelism With OMP
  52. Vectorization & Analyzing Loop Dependencies
  53. Flynn's Taxonomy
  54. Theoretical Metrics for Benchmarking
  55. Profiling a Program
  56. Amdahl's Law & Gustafson's Law
  57. Riemann Series Rearrangement
  58. Finite and Infinite Sums

Topics