In resource allocation, we often require that the output allocation of an algorithm is stable
against input perturbation because frequent reallocation is costly and untrustworthy. Varma …

Dynamic programming (DP) is one of the fundamental paradigms in algorithm design.
However, many DP algorithms have to fill in large DP tables, represented by two …

An important goal in algorithm design is determining the best running time for solving a
problem (approximately). For some problems, we know the optimal running time, assuming …

Quantum Computing is revolutionary paradigm that harnesses the principles of quantum
mechanics such as superposition and entanglement to process the information in …

Packing problems are a range of very interesting problems that stem from simple real world
examples. Imagine we want to fly into holidays and we need to pack our luggage for the …

Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve
guaranteed good worst-case behaviour in a more realistic setting. Most of the previous …

Semi-online algorithms that are allowed to perform a bounded amount of repacking achieve
guaranteed good worst-case behaviour in a more realistic setting. Most of the previous …

• Kickoff/Questions (today)• Topic Assignment/Questions (this week)• Everyone gets a topic
to present (1-2 persons per topic)• With poll and short meeting• Preparation phase (at least …