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