R. Inkulu
Associate Professor
Department of Computer Science and Engineering
Indian Institute of Technology Guwahati
rinkulu
AT iitg.ac.in
bio
papers
courses
Discrete Mathematics
Data Structures
Algorithms
Theory of Computation
Advanced Algorithms
Computational Geometry
Introduction to Computing
Note -
Tree metrics
Arora's PTAS for Euclidean TSP
Geometry and algebra of LP
Computing shortest path trees in simple polygons
Computing a Euclidean shortest path in the plane
A few spanners in the Euclidean plane
Tarjan's SCC finding
Satisfiability of a 2-CNF formula
Boolean product witness matrix
An algorithm for reachability in dynamic directed graphs
Computing an approximate minimum degree spanning tree
Boruvka's and KKT's algorithms for MST
A few spanners for undirected graphs
Uniform buy-at-bulk network design
Three fingerprinting techniques
Height-biased leftist heap
AVL tree
Amortized analysis of splay trees
Amortized analysis of disjoint-set forest
Bloom filter for set membership
Analysis of skip lists
A short note on tries
Lower bounding with adversary arguments
A few popular NP-complete problems
Randomized complexity classes
A simple experiment to estimate Π
A few special numbers
On k-sets and k-levels
Two famous theorems on (anti)chains