Bouras, C.
, Caragiannis, I., Gkamas, A., Protopapas, N., Sardelis, T. & Sgarbas, K. (2023).
State of the Art Analysis of Resource Allocation Techniques in 5G MIMO Networks. In
37th International Conference on Information Networking, ICOIN 2023 (pp. 632-637). IEEE.
https://doi.org/10.1109/ICOIN56518.2023.10049018
Bielikova, M.
, Nielsen, M., Kucera, A.
, Miltersen, P. B., Palamidessi, C., Tuma, P. & Valencia, F. (Eds.) (2009).
SOFSEM 2009: Theory and Practice of Computer Science: 35th Conference on Current Trends in Theory and Practice of Computer Science, Špindleruv Mlýn, Czech Republic, January 24-30, 2009. Proceedings. Springer. Lecture Notes in Computer Science Vol. 5404
https://doi.org/10.1007/978-3-540-95891-8
Barrington, D. A. M., Lu, C.-J.
, Miltersen, P. B. & Skyum, S. (1998).
Searching constant width mazes captures the AC0 hierarchy. In M. Morvan, C. Meinel & D. Krob (Eds.),
STACS 98: 15th Annual Symposium on Theoretical Aspects of Computer Science Paris, France, February 25-27, 1998 Proceedings (pp. 73-83). Springer.
https://doi.org/10.1007/BFb0028550
Chaugule, P., Kumar, M., Limaye, N., Mohapatra, C. K., She, A.
& Srinivasan, S. (2023).
Schur Polynomials Do Not Have Small Formulas If the Determinant does not.
Computational Complexity,
32(1), Article 3.
https://doi.org/10.1007/s00037-023-00236-x
Caragiannis, I., Gravin, N., Lu, P. & Wang, Z. (2022).
Relaxing the Independence Assumption in Sequential Posted Pricing, Prophet Inequality, and Random Bipartite Matching. In M. Feldman, H. Fu & I. Talgam-Cohen (Eds.),
Web and Internet Economics : 17th International Conference, WINE 2021 (pp. 131-148). Springer.
https://doi.org/10.1007/978-3-030-94676-0_8
Airiau, S., Aziz, H.
, Caragiannis, I., Kruger, J., Lang, J. & Peters, D. (2023).
Portioning using ordinal preferences: Fairness and efficiency.
Artificial Intelligence,
314, Article 103809.
https://doi.org/10.1016/j.artint.2022.103809
Hansen, T. D.
, Miltersen, P. B. & Sørensen, T. B. (2008).
On Range of Skill. In
Proceedings of the Twenty-Third AAAI Conference on Artificial Intelligence: Constraints, Satisfiability, and Search (pp. 277-282). AAAI Press.
Cryan, M.
& Miltersen, P. B. (2001).
On pseudorandom generators in NC0. In J. Sgall, A. Pultr & P. Kolman (Eds.),
Mathematical Foundations of Computer Science 2001: Lecture Notes in Computer Science (Lecture Notes in Computer Science 2136 ed., Vol. 2136/2001, pp. 272-284). Springer.