default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPéter Urbán
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2006
[c12]Matthias Wiesmann, Péter Urbán, Xavier Défago
:
An SNMP based failure detection service. SRDS 2006: 365-376- 2005
- [c11]Xavier Défago, Péter Urbán, Naohiro Hayashibara, Takuya Katayama:
Definition and Specification of Accrual Failure Detectors. DSN 2005: 206-215 - 2004
- [j3]Xavier Défago, André Schiper, Péter Urbán:
Total order broadcast and multicast algorithms: Taxonomy and survey. ACM Comput. Surv. 36(4): 372-421 (2004) - [c10]Péter Urbán, Naohiro Hayashibara, André Schiper, Takuya Katayama:
Performance Comparison of a Rotating Coordinator and a Leader Based Consensus Algorithm. SRDS 2004: 4-17 - [c9]Richard Ekwall, André Schiper, Péter Urbán:
Token-based Atomic Broadcast using Unreliable Failure Detectors. SRDS 2004: 52-65 - 2003
- [j2]Richard Ekwall, Péter Urbán, André Schiper:
Robust TCP Connections for Fault Tolerant Computing. J. Inf. Sci. Eng. 19(3): 503-516 (2003) - [c8]Péter Urbán, Ilya Shnayderman, André Schiper:
Comparison of Failure Detectors and Group Membership: Performance Study of Two Atomic Broadcast Algorithms. DSN 2003: 645-654 - 2002
- [j1]Péter Urbán, Xavier Défago, André Schiper:
Neko: A Single Environment to Simulate and Prototype Distributed Algorithms. J. Inf. Sci. Eng. 18(6): 981-997 (2002) - [c7]Andrea Coccoli, Péter Urbán, Andrea Bondavalli:
Performance Analysis of a Consensus Algorithm Combining Stochastic Activity Networks and Measurements. DSN 2002: 551-560 - [c6]Fernando Pedone, André Schiper, Péter Urbán, David Cavin:
Solving Agreement Problems with Weak Ordering Oracles. EDCC 2002: 44-61 - [c5]Richard Ekwall, Péter Urbán, André Schiper:
Robust TCP Connections for Fault Tolerant Computing. ICPADS 2002: 501-508 - 2001
- [c4]Péter Urbán, Xavier Défago, André Schiper:
Neko: A Single Environment to Simulate and Prototype Distributed Algorithms. ICOIN 2001: 503-511 - [c3]Péter Urbán, Xavier Défago, André Schiper:
Chasing the FLP Impossibility Result in a LAN or How Robust Can a Fault Tolerant Server Be?. SRDS 2001: 190-193 - 2000
- [c2]Péter Urbán, Xavier Défago, André Schiper:
Contention-aware metrics for distributed algorithms: comparison of atomic broadcast algorithms. ICCCN 2000: 582-589
1990 – 1999
- 1996
- [c1]Jörn Altmann, András Pataricza, Tamás Bartha, Péter Urbán, A. Petri:
Constraint Based System-Level Diagnosis of Multiprocessors. EDCC 1996: 403-420
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-04-24 22:58 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:
