TU Wien Informatics

Overview Professors Scientific Staff Administrative Staff Student Staff External Lecturers By Responsibilities By Committee By Name
Related
Guest Professors Honoraries Alumni (LinkedIn) #5qw

Hugo Rincon Galeana

Projektass. Dr.techn. / MSc

Hugo Rincon Galeana

Role

Contact

  • Lower Bounds for k-Set Agreement in Fault-Prone Networks / Fraigniaud, P., Nguyen, M. H., Paz, A., Schmid, U., & Rincon Galeana, H. (2025). Lower Bounds for k-Set Agreement in Fault-Prone Networks. In D. R. Kowalski (Ed.), 39th International Symposium on Distributed Computing (DISC 2025). Schloss Dagstuhl. https://doi.org/https://doi.org/10.4230/LIPIcs.DISC.2025.31
  • Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems / Felber, S., Hummes Flores, B., & Rincon Galeana, H. (2025). Brief Announcement: A Sheaf-Theoretic Characterization of Tasks in Distributed Systems. In U. Schmid & R. Kuznets (Eds.), Structural Information and Communication Complexity : 32nd International Colloquium, SIROCCO 2025, Delphi, Greece, June 2–4, 2025, Proceedings (pp. 425–430). Springer. https://doi.org/10.1007/978-3-031-91736-3_26
  • Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models / Felber, S., & Galeana, H. R. (2025). Stabilizing Consensus Is Impossible in Lossy Iterated Immediate Snapshot Models. In S. Bonomi, L. Galletta, E. Rivière, & V. Schiavoni (Eds.), 28th International Conference on Principles of Distributed Systems (OPODIS 2024) (pp. 18:1-18:16). https://doi.org/10.4230/LIPIcs.OPODIS.2024.18
  • Methods for analyzing task solvability in distributed computing / Rincón Galeana, H. (2025). Methods for analyzing task solvability in distributed computing [Dissertation, Technische Universität Wien]. reposiTUm. https://doi.org/10.34726/hss.2025.137846
    Download: PDF (1.94 MB)
  • The Time Complexity of Consensus Under Oblivious Message Adversaries / Winkler, K., Paz, A., Rincon Galeana, H., Schmid, S., & Schmid, U. (2024). The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica, 86(6), 1830–1861. https://doi.org/10.1007/s00453-024-01209-4
  • Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems / Rincon Galeana, H., & Schmid, U. (2024). Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. In Structural Information and Communication Complexity : 31st International Colloquium, SIROCCO 2024, Vietri sul Mare, Italy, May 27–29, 2024, Proceedings (pp. 501–506). Springer. https://doi.org/10.1007/978-3-031-60603-8_29
    Projects: ByzDEL (2020–2025) / DMAC (2019–2024)
  • Logic of Communication Interpretation: How to Not Get Lost in Translation / Cignarale, G., Kuznets, R., Rincón Galeana, H., & Schmid, U. (2023). Logic of Communication Interpretation: How to Not Get Lost in Translation. In U. Sattler & M. Suda (Eds.), Frontiers of Combining Systems: 14th International Symposium, FroCoS 2023, Prague, Czech Republic, September 20–22, 2023. Proceedings (pp. 119–136). Springer. https://doi.org/10.1007/978-3-031-43369-6_7
    Download: PDF (339 KB)
    Project: ByzDEL (2020–2025)
  • The Time Complexity of Consensus Under Oblivious Message Adversaries / Winkler, K., Paz, A., Galeana, H. R., Schmid, S., & Schmid, U. (2023). The Time Complexity of Consensus Under Oblivious Message Adversaries. In Y. T. Kalai (Ed.), 14th Innovations in Theoretical Computer Science Conference (ITCS’23) (pp. 1–28). Schloss-Dagstuhl - Leibniz Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2023.100
    Projects: ADynNet (2016–2020) / ByzDEL (2020–2025)
  • Towards a Topological Semantics for Epistemic Reasoning in Byzantine Fault-Tolerant Distributed Systems / Randrianomentsoa, R. F., Rincon Galeana, H., & Schmid, U. (2022, October 24). Towards a Topological Semantics for Epistemic Reasoning in Byzantine Fault-Tolerant Distributed Systems [Conference Presentation]. Workshop on Connections between Epistemic Logic and Topology (CELT’22), University of Amsterdam, Netherlands (the). http://hdl.handle.net/20.500.12708/153197
    Project: ByzDEL (2020–2025)
  • Continuous Tasks and the Asynchronous Computability Theorem / Galeana, H. R., Rajsbaum, S., & Schmid, U. (2022). Continuous Tasks and the Asynchronous Computability Theorem. In M. Braverman (Ed.), 13th Innovations in Theoretical Computer Science Conference (ITCS’22) (pp. 73:1-73:27). Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2022.73
    Project: ByzDEL (2020–2025)
  • A Topological View of Partitioning Arguments: Reducing 𝑘-Set Agreement to Consensus / Rincon Galeana, H., Winkler, K., Schmid, U., & Rajsbaum, S. (2019). A Topological View of Partitioning Arguments: Reducing 𝑘-Set Agreement to Consensus. In Stabilization, Safety, and Security of Distributed Systems 21st International Symposium, SSS 2019, Pisa, Italy, October 22–25, 2019, Proceedings (pp. 307–322). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-030-34992-9_25