- Parallel tropical algebra routines similar to BLAS routines
- Random weighted bipartite graph generation using Java or C, see http://arxiv.org/abs/1010.5943
- Parallel random bipartite graph generation
- All pair shortest path for sparse bipartite graphs
- K-th order all pair shortest path problem for bipartite graphs
- All pair shortest path for N-partite graphs.
Constructive Algebraic Topology – Session 6
Simplicial cohomology.
DNA Computing Models
|
|||||||||||||||||||||||||||||||
Discrete Mathematics – Lecture 8
Kombinatorische Optimierung, Rucksack-Problem, Backtracking-Verfahren, Verkleinern des Suchraumes.
Computability Theory – Lecture 6
LOOP programs, LOOP computable functions and primitive recursive functions, LOOP hierarchy.
Small Ackermann functions – basic properties.
Discrete Mathematics – Lecture 7
Die Sätze von König-Egervary und Hall, Konstruktion von maximalen bzw. vollständigen Paarungen.
Die Klassen P und NP, NP-vollständig, NP-hart.
Computability Theory – Lecture 5
GOTO and URM computability. GOTO-2 computability. Thesis of Church.
Discrete Mathematics – Lecture 6
Weiteres Beispiel zu Ford-Fulkerson, Ganzzahligkeitssatz, 0-1-Fluss, Satz von Menger (Knoten- und Kantenversion).
Computability Theory – Lecture 4
Introduction to partial recursive functions, GOTO programs, and GOTO computability.
Doctoral thesis: Neural synchronization and light-weight cryptography in embedded systems
Defender: Oscar Mauricio Reyes Torres, May 23, 12 am, room SBS 95, H-0.09.