-
1
-
2
-
3
Competitive algorithms for online matching and vertex cover problems
Published 2014Get full text
Thesis -
4
Combinatorial scientific computing /
Published c201“…Several discrete combinatorial problems and data structures, such as graph and hypergraph partitioning, supernodes and elimination trees, vertex and edge reordering, vertex and edge coloring, and bipartite graph matching, arise in these contexts. As an example, parallel partitioning tools can be used to ease the task of distributing the computational workload across the processors. …”
-
5
-
6
-
7
-
8
-
9
-
10
-
11
-
12
-
13
-
14
-
15
A q-analogue of spanning trees : nilpotent transformations over finite fields
Published 2010Get full text
Thesis -
16
-
17
Optimizing tensor contractions for nuclear correlation functions
Published 2015Get full text
Thesis -
18
-
19
-
20