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

Topics