You are here: Home › … › Previous Courses › 2025 › Seminar Distributed Algorithms, …

Seminar Distributed Algorithms, Network Algorithms and Cryptography (Summer 2025)

Seminar for Master students of Computer Science and Embedded Systems Engineering with research topics relevant to the chair.

News

  • 01.04.2025 webpage online
  • 01.04.2025 ILIAS is online

Dates

  • 1st meeting, calendar week 17 tbd., maybe 24.04.2025, 2pm 
  • 24.04.2025 - 05.05.2025:  submit 3 topics of your choice to the forum of ILIAS
  • 14.07.2025: Deadline for report
  • 28.07.2025: 9-17, block seminar day 1 (051-00-006)

  • 28.07.2025: 9-17, block seminar day 2 (051-00-006)

Contents

We discuss up-to-date topics of distributed algorithms, cryptography, localization and wireless communication. More topics appear here soon (see also ILIAS for the papers).

    1. Localization
      1. Tabaghi, P. and Dokmanić, I., 2020. Hyperbolic distance matrices. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining (pp. 1728-1738).

      2. Kreković, Miranda, Ivan Dokmanić, and Martin Vetterli. "Shapes from echoes: uniqueness from point-to-plane distance matrices." IEEE Transactions on Signal Processing 68 (2020): 2480-2498. (JB)

    2. Cryptography
      1. tbd.
    3. Visual Cryptography
      1. tbd
    4. MIMO and Near-Field
      1. Chuah, C.N., Tse, D.N.C., Kahn, J.M. and Valenzuela, R.A., 2002. Capacity scaling in MIMO wireless   systems under correlated fading. IEEE Transactions on Information theory, 48(3), pp.637-650. (CS)
      2. McKay, M.R., Collings, I.B. and Tulino, A.M., 2009. Achievable sum rate of MIMO MMSE receivers: A general analytic framework. IEEE Transactions on Information Theory, 56(1), pp.396-410. (CS)
    5. Peer-to-Peer Networks

      1. Lau, L. C., Tung, K. C., Wang, R.: Cheeger Inequalities for Directed Graphs and Hypergraphs using Reweighted Eigenvalues. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing (STOC 2023), pp. 1834–1847. Association for Computing Machinery, New York, NY, USA (2023). https://doi.org/10.1145/3564246.3585139 (SN)

      2. Dinitz, Y., Dolev, S. & Kumar, M. Local Deal-Agreement Algorithms for Load Balancing in Dynamic General Graphs. Theory Comput Syst 67, 348–382 (2023). https://doi.org/10.1007/s00224-022-10097-6 (SN)

      3. Lamport, L., Shostak, R. and Pease, M., 2019. The Byzantine generals problem. In Concurrency: the works of leslie lamport (pp. 203-226).

Supervisors

  • CS: Christian Schindelhauer (schindel at tf dot uni dash freiburg dot de)
  • JB: Joan Bordoy (bordoy at informatik dot uni dash freiburg dot de)
  • SM: Sneha Mohanty (mohanty at informatik dot uni dash freiburg dot de)
  • SN: Saptadi Nugroho (saptadinugroho at gmail dot com)

Schedule and Assinged Topics

will be published asap.

Deliverables

For a successful participation you have to 

  1. Write a written 2-4 pages report (LaTeX) and upload it using ILIAS until 14.07.2025 (1/4)
  2. Give a 30 minute final presentation during the block seminar (upload slides to ILIAS) (1/2)
  3. Survive the 15 minute discussion after your presentation (1/4)

Presentations may be recorded and published on ILIAS.  Active attendance to 12 presentations (including your own) is mandatory.