Zum Inhalt springen
Technische Universität München

SCCS Kolloquium

The SCCS Colloquium is a forum giving students, guests, and members of the chair the opportunity to present their research insights, results, and challenges. Do you need ideas for your thesis topic? Do you want to meet your potential supervisor? Do you want to discuss your research with a diverse group of researchers, rehearse your conference talk, or simply cheer for your colleagues? Then this is the right place for you (and you are also welcome to bring your friends along).

Upcoming talks

Lars Doll: Implementation of Pseudo-Verlet Lists in AutoPas

SCCS Colloquium |

Calculating pairwise interactions between millions of particles poses the biggest challenge in molecular dynamics simulations. By introducing the cutoff radius r_c, the problem can be solved efficiently using various algorithms. The aim is to calculate only the forces between particle pairs that are closer than r_c. This is achieved by dividing the simulation domain into smaller cells, storing the neighbors (i.e., the particles relevant for pairwise interactions per particle), or a combination of both.
This bachelor's thesis examines the pseudo-Verlet lists algorithm, which is based on Verlet lists and linked cells. First, the particles from two neighboring cells are projected onto a common axis, then sorted by the projected distance. This sorting allows for a termination condition when calculating pairwise interactions. If their projections are further apart than r_c, then all particles afterwards are also further apart because of the sorting. This termination condition reduces the number of calculated particle interactions compared to the linked cells approach, while optimizing memory consumption by storing neighbors per cell rather than per particle, unlike Verlet lists.
The pseudo-Verlet lists algorithm was implemented in AutoPas, an open source C++ library for particle simulations. This implementation was tested against other algorithms across several simulation scenarios, and it outperformed them only in rare, specific cases. Since the implementation is not highly optimized, the algorithm could become a useful extension of AutoPas in the future.

Bachelor's thesis presentation. Lars is advised by Samuel James Newcome.

◄ Zurück zu: SCCS Kolloquium

You don't want to miss a talk? Subscribe to our mailing list and our Colloquium calendar .

Previous talks →

Contribute a talk

To register and schedule a talk, you should fill the form Colloquium Registration at least four weeks before the earliest preferred date, at the end of a semester typically even earlier reservation is necessary due to a very high influx of presentations. Keep in mind that we only have limited slots, so please plan your presentation early! In special cases, contact colloquium@mailsccs.in.tum.de.

Colloquium sessions are now on-campus. We have booked room MI 02.07.023 for WS25/26. You can either bring your own laptop or send us the slides as a PDF ahead of time. The projector only has an HDMI connection, so please bring your own adapters if necessary.

We invite students doing their Bachelor's or Master's thesis, as well as IDP, Guided Research, or similar projects at SCCS to give one 20min presentation to discuss their results and potential future work. The time for this is typically after submitting your final text. Check also with your study program regarding any requirements for a final presentation of your project work.

New: In regular times, we will now have slots for presenting early stage projects (talk time 2-10min). This is an optional opportunity for getting additional feedback early and there is no strict timeline.

Apart from students, we also welcome doctoral candidates and guests to present their projects.

During the colloquium, things usually go as follows:

  • 10min before the colloquium starts, the speakers setup their equipment with the help of the moderator. The moderator currently is Ana Cukarska. Make sure to be using an easily identifiable name in the online session's waiting room.
  • The colloquium starts with an introduction to the agenda and the moderator asks the speaker's advisor/host to put the talk into context.
  • Your talk starts. The scheduled time for your talk is normally 20min with additional 5-10min for discussion.
  • During the discussion session, the audience can ask questions, which are meant for clarification or for putting the talk into context. The audience can also ask questions in the chat.
  • Congratulations! Your talk is over and it's now time to celebrate! Have you already tried the parabolic slides that bring you from the third floor to the Magistrale?

Do you remember a talk that made you feel very happy for attending? Do you also remember a talk that confused you? What made these two experiences different?

Here are a few things to check if you want to improve your presentation:

  • What is the main idea that you want people to remember after your presentation? Do you make it crystal-clear? How quickly are you arriving to it?
  • Which aspects of your work can you cover in the given time frame, with a reasonable pace and good depth?
  • What can you leave out (but maybe have as back-up slides) to not confuse or overwhelm the audience?
  • How are you investing the crucial first two minutes of your presentation?
  • How much content do you have on your slides? Is all of it important? Will the audience know which part of a slide to look at? Will somebody from the last row be able to read the content? Will somebody with limited experience in your field have time to understand what is going on?
  • Are the figures clear? Are you explaining the axes or any other features clearly?

In any case, make sure to start preparing your talk early enough so that you can potentially discuss it, rehearse it, and improve it.

Here are a few good videos to find out more:

Did you know that the TUM English Writing Center can also help you with writing good slides?

Work with us!

Do your thesis/student project in Informatics / Mathematics / Physics: Student Projects at the SCCS.

To top