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

Topics