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

Topics