Today I started an experiment I created an excercise for coursework in algorithms and data structures that is very unusuale and many people have been criticle if this was a good idea. The idea behind the exercise is that studens should read wikipedia articles to topics related to lectures and find mistakes or suggest things …
Tag: PhD
My first PhD year summerized: What a great choice of mine!
2011 is almost over and more than 9 months of my PhD have already passed by. During my math diploma I was founded by the german national academic foundation. Besides some really nice benefits that came along with this every 6 months I was forced to write reports about my study progress. Even though theses …
balanced binary search trees exercise for algorithms and data structures class
I created some exercises regarding binary search trees. This time there is no coding involved. My experience from teaching former classes is that many people have a hard time understanding why trees are usefull and what the dangers of these trees is. Therefor I have created some straight forward exercises that nevertheless involve some work …
Graphity: An efficient Graph Model for Retrieving the Top-k News Feeds for users in social networks
UPDATE: the paper got accepted at SOCIALCOM2012 and the source code and data sets are online especially the source code of the graphity server software is now online! UPDATE II: Download the paper (11 Pages from Social Com 2012 with Co Authors: Thomas Gottron, Jonas Kunze, Ansgar Scherp and Steffen Staab) and the slides I already said …
3 exercises for Sorting problems (Quicksort , Mergesort) in Algorithms and data structures class
#1: Sorting huge files Sorting big files might not be as simple as just implementing an sort algorithm. As soon as the file does not fit in memory any more smarter implementations have to be applied. One way is to sort the file on the hard disk. We remark that not every algorithm is easily …
3 exercises for Sorting problems (Quicksort , Mergesort) in Algorithms and data structures class
#1: Sorting huge files Sorting big files might not be as simple as just implementing an sort algorithm. As soon as the file does not fit in memory any more smarter implementations have to be applied. One way is to sort the file on the hard disk. We remark that not every algorithm is easily …
My Blog guesses your name – Binary Search Exercise for Algorithms and data structures class
Binary Search http://en.wikipedia.org/wiki/Binary_search_algorithm is a very basic algorithm in computer science. Despite this fact it is also important to understand the fundamental principle behind it. Unfortunately the algorithm is tought so early and the algorithm is so simple that beginning students sometimes have a hard time to understand the abstract principle behind it. Also many …
11 lessons learnt after my first scientific paper was submitted
During the last month my blog was rather quite. I dicided that I was aiming to submit my first paper to a top conference with a deadline of november first. Well besides the fact that I almost forgot about the fact that I also have a private life – as well as my collegues helping …
First Youtube DVD online for Ballads n Bullets by In Legend
Recently I was rather quiet in my blog. Currently I am writing my first research paper for SIGMOD which takes 90% of my resources. In my very limited time I had the chance to work on a very cool web project about which I want to share some insights and talk about today. Inspired by …
Download network graph data sets from Konect – the koblenz network colection
UPDATE: now with link to the PhD thesis. By the time of blogging the thesis was not published. thanks to Patrick Durusau for pointing out the missing link. One of the first things I did @ my Institute when starting my PhD program was reading the PhD thesis of Jérôme Kunegis. For a mathematician a …