Amrinder Arora

computer science algorithms gwu data structures divide and conquer cs6212 union find amrinder arora algorithm np-completeness graph traversal dynamic programming euclid gcd bloom filters sets asymptotic notation binomial heap merge sort quick sort binary search closest pair of points quickselect path compression hermann ebbinghaus memory education competitive analysis binary search trees graphs btree splay trees self organizing self tuning trie b-trees r-trees minimum bounding rectangle mbr heaps fibonacci heap forecasting arima clique bron kerbosch graph theory dfs tree dfs depth first search branch and bound bfs cloud computing np-completness np-hard approximation performance bounds chan's algorithm output sensitive algorithm cs 6212 greedy algorithms 6212 matrix chain mulitplication all pairs shortest paths lis mvcs recursion iterative couterfeit coin lower bounds turing machine np machine learning online algorithms big data data mining secretary problem stopping rule convex hull