-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathindex.html
46 lines (46 loc) · 2.6 KB
/
index.html
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
<!DOCTYPE html>
<html>
<head>
<title>Andre Weltsch: MATH + PROGRAMMING</title>
<link rel="stylesheet" type="text/css" href="/static/site.css"/>
</head>
<body>
<h1>MATH + PROGRAMMING</h1>
<p>
Hi there! My Name is <em>Andre Weltsch</em> and I am a mathematician with a strong interest in computer science and programming.
I am currently employed as Senior Software Engineer at Zalando SE in Germany.
I have been employed in the software industry for more than 10 years now.
</p>
<p>
Right now I'm mostly working with Kotlin & Ktor, as well as frontend technologies like React and TypeScript.
I also have a lot of experience with Java and Spring Boot for webservice development.
</p>
<p>
My main areas of interest include:
<ul>
<li>Distributed Systems and Databases</li>
<li>Software Architecture</li>
<li>Operations Research and Graph Theory</li>
</ul>
</p>
<h2 id="posts">Posts</h2>
<ul>
<li><a href="/posts/pypy-garbage-collector">Simple Mark & Sweep Garbage collector in PyPy</a></li>
<li><a href="/posts/top-sort-1">Topological Sorting</a></li>
<li><a href="/posts/layout-optimization">Finding an Optimal Keyboard Layout</a></li>
</ul>
<h2 id="education">Education</h2>
<h3>Master's Degree in Mathematics (2018, TU-Berlin)</h3>
<h4>Master's Thesis: <a href="/static/masters-thesis.pdf">Fast Approximation of Equations of transient Gasflow</a></h4>
<p>The thesis compares different algorithms to approximate time-dependent gas flow in natural gas networks. I present different linearizations of the nonlinear gas flow equations and evalute the model performances.</p>
<h3>Bachelor's Degree in Mathematics (2016, TU-Berlin)</h3>
<h4>Bachelors's Thesis: <a href="/static/bachelors-thesis.pdf">Algorithmic testing of equivalence of polynomials to the determinant</a></h4>
<p>The thesis gives a detailed description and analysis of a randomized algorithm from "Affine Projections of polynomials" (Kayal, 2012) which can be used to solve the equivalence problem for the determinant polynomial in polynomial time.</p>
</body>
<footer>
<p>Contact: contact __strudel__ weltsch.de</p>
<p>
<a rel="license" href="http://creativecommons.org/licenses/by/4.0/"><img alt="Creative Commons License" style="border-width:0" src="https://i.creativecommons.org/l/by/4.0/88x31.png" /></a><br />This work by Andre Weltsch is licensed under a <a rel="license" href="http://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</a>.
</p>
</footer>
</html>