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

Topics