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