default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHugo Rincon Galeana
Person information
- affiliation: TU Wien, Vienna, Austria
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid
, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. Algorithmica 86(6): 1830-1861 (2024)- [c5]Hugo Rincon Galeana, Ulrich Schmid:
Network Abstractions for Characterizing Communication Requirements in Asynchronous Distributed Systems. SIROCCO 2024: 501-506 - [i6]Stephan Felber, Hugo Rincon Galeana:
Stabilizing Agreement is Impossible in Delayed Message Passing Models. CoRR abs/2402.09168 (2024) - [i5]Giorgio Cignarale, Stephan Felber, Hugo Rincon Galeana:
A Sufficient Epistemic Condition for Solving Stabilizing Agreement. CoRR abs/2403.01025 (2024) - 2023
- [c4]Giorgio Cignarale, Roman Kuznets, Hugo Rincon Galeana, Ulrich Schmid:
Logic of Communication Interpretation: How to Not Get Lost in Translation. FroCoS 2023: 119-136 - [c3]Kyrill Winkler, Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid:
The Time Complexity of Consensus Under Oblivious Message Adversaries. ITCS 2023: 100:1-100:28 - [i4]Hugo Rincon Galeana, Ulrich Schmid, Kyrill Winkler, Ami Paz, Stefan Schmid:
Topological Characterization of Consensus Solvability in Directed Dynamic Networks. CoRR abs/2304.02316 (2023) - [i3]Hugo Rincon Galeana:
An Asynchronous Graph Characterization of Byzantine Firing Rebels. CoRR abs/2310.12615 (2023) - 2022
- [j1]Hortensia Galeana-Sánchez, Hugo Rincon Galeana, Ricardo Strausz:
H-Kernels by Walks. Graphs Comb. 38(3): 94 (2022) - [c2]Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid:
Continuous Tasks and the Asynchronous Computability Theorem. ITCS 2022: 73:1-73:27 - [i2]Ami Paz, Hugo Rincon Galeana, Stefan Schmid, Ulrich Schmid, Kyrill Winkler:
Time Complexity of Consensus in Dynamic Networks Under Oblivious Message Adversaries. CoRR abs/2202.12397 (2022) - 2021
- [i1]Hugo Rincon Galeana, Sergio Rajsbaum, Ulrich Schmid:
Continuous Tasks and the Chromatic Simplicial Approximation Theorem. CoRR abs/2109.01439 (2021)
2010 – 2019
- 2019
- [c1]Hugo Rincon Galeana, Kyrill Winkler, Ulrich Schmid, Sergio Rajsbaum:
A Topological View of Partitioning Arguments: Reducing k-Set Agreement to Consensus. SSS 2019: 307-322
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
