Personal Information
Organización/Lugar de trabajo
Washington D.C. Metro Area United States
Ocupación
Computer Science Faculty
Sector
Technology / Software / Internet
Sitio web
www.bizmerlin.com
Acerca de
CEO @ BizMerlin HCM: http://www.bizmerlin.com
Adjunct faculty @ GWU
Author: "Design & Analysis of Algorithms" 3rd Edition: (University Readers, ISBN: 978-1-5165-1310-9) http://amzn.to/2qUQcxJ
Etiquetas
computer science
algorithms
gwu
data structures
divide and conquer
cs6212
union find
amrinder arora
algorithm
graph traversal
np-completeness
gcd
euclid
dynamic programming
convex hull
cs 6212
output sensitive algorithm
chan's algorithm
performance bounds
approximation
np-hard
np-completness
cloud computing
bfs
branch and bound
depth first search
dfs
dfs tree
graph theory
bron kerbosch
clique
arima
forecasting
stopping rule
secretary problem
data mining
big data
online algorithms
machine learning
np
turing machine
lower bounds
couterfeit coin
iterative
recursion
mvcs
lis
all pairs shortest paths
matrix chain mulitplication
6212
greedy algorithms
path compression
quickselect
closest pair of points
binary search
quick sort
merge sort
asymptotic notation
bloom filters
sets
binomial heap
fibonacci heap
heaps
mbr
minimum bounding rectangle
r-trees
b-trees
trie
self tuning
self organizing
splay trees
btree
graphs
binary search trees
competitive analysis
education
memory
hermann ebbinghaus
Ver más
Presentaciones
(31)Recomendaciones
(3)Time complexity of union find
Wei (Terence) Li
•
Hace 8 años
NP completeness
Amrinder Arora
•
Hace 9 años
Graphs, Trees, Paths and Their Representations
Amrinder Arora
•
Hace 10 años
Personal Information
Organización/Lugar de trabajo
Washington D.C. Metro Area United States
Ocupación
Computer Science Faculty
Sector
Technology / Software / Internet
Sitio web
www.bizmerlin.com
Acerca de
CEO @ BizMerlin HCM: http://www.bizmerlin.com
Adjunct faculty @ GWU
Author: "Design & Analysis of Algorithms" 3rd Edition: (University Readers, ISBN: 978-1-5165-1310-9) http://amzn.to/2qUQcxJ
Etiquetas
computer science
algorithms
gwu
data structures
divide and conquer
cs6212
union find
amrinder arora
algorithm
graph traversal
np-completeness
gcd
euclid
dynamic programming
convex hull
cs 6212
output sensitive algorithm
chan's algorithm
performance bounds
approximation
np-hard
np-completness
cloud computing
bfs
branch and bound
depth first search
dfs
dfs tree
graph theory
bron kerbosch
clique
arima
forecasting
stopping rule
secretary problem
data mining
big data
online algorithms
machine learning
np
turing machine
lower bounds
couterfeit coin
iterative
recursion
mvcs
lis
all pairs shortest paths
matrix chain mulitplication
6212
greedy algorithms
path compression
quickselect
closest pair of points
binary search
quick sort
merge sort
asymptotic notation
bloom filters
sets
binomial heap
fibonacci heap
heaps
mbr
minimum bounding rectangle
r-trees
b-trees
trie
self tuning
self organizing
splay trees
btree
graphs
binary search trees
competitive analysis
education
memory
hermann ebbinghaus
Ver más