• 1.10.2024: Web page online
• 14.10.2024-22.10.2024 If you want to participate, submit your choice of topics to the forum of ILIAS.

Dates

• 1st meeting, 18.10.2024, 12-14  (room tbd), presentation of the topics, organization
• 14.10.2024-22.10.2024:  submit 3 topics of your choice to the forum of ILIAS
• 10,02.2025 9-17, block seminar day 1 (room tbd)

• 11,02.2025 9-17, block seminar day 2 (room tbd)

Contents

We discuss up-to-date topics of distributed algorithms, cryptography, localization and wireless communication. More topics appear here soon.

1. Localization

   1. Shuai Huang, and Ivan Dokmanić. "Reconstructing point sets from distance distributions." IEEE Transactions on Signal Processing 69 (2021): 1811-1827. (JB)

   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)

   3. Plinge, A., Fink, G.A. and Gannot, S., 2017. Passive online geometry calibration of acoustic sensor networks. IEEE Signal Processing Letters, 24(3), pp.324-328.(CS)
2. Cryptography
   1. Aranha, D.F., Baum, C., Gjøsteen, K., Silde, T. and Tunge, T., 2021, May. Lattice-based proof of shuffle and applications to electronic voting. In Cryptographers’ Track at the RSA Conference (pp. 227-251). Cham: Springer International Publishing. (CS)
   2. Goldreich, O. and Oren, Y., 1994. Definitions and properties of zero-knowledge proof systems. Journal of Cryptology, 7(1), pp.1-32. (CS)
   3. Ronald L. Rivest, Adi Shamir, and Yael Tauman. 2001. How to Leak a Secret. In Proceedings of the 7th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology (ASIACRYPT '01). Springer-Verlag, Berlin, Heidelberg, 552–565.
3. Visual Cryptography
   1. Liu, Z., Zhang, Z. and Fang, H., 2023. Approximating complex 3D curves using origami spring structures. Communications Engineering, 2(1), p.90. (SM)
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)
   3. N. Garcia, H. Wymeersch, E. G. Larsson, A. M. Haimovich and M. Coulon, "Direct Localization for Massive MIMO," in IEEE Transactions on Signal Processing, vol. 65, no. 10, pp. 2475-2487, 15 May15, 2017, doi: 10.1109/TSP.2017.2666779. (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. Sauerwald, T. and Sun, H., 2012, October. Tight bounds for randomized load balancing on arbitrary network topologies. In 2012 IEEE 53rd Annual Symposium on Foundations of Computer Science (pp. 341-350). IEEE. (CS)

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

Deliverables

For a successful participation you have to 

1. Write a written 2-5 pages report (LaTeX) and upload it using ILIAS until 31.01.2024 (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.  Attendance to 12 final presentations (plus your own) is mandatory.