UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

Compact routing messages in self-healing trees

Theoretical computer science, 2018-01, Vol.709, p.2-19

2018

Volltextzugriff (PDF)

Enhancing RSSI-Based Tracking Accuracy in Wireless Sensor Networks

ACM transactions on sensor networks, 2013-05, Vol.9 (3), p.1-28

2013

Volltextzugriff (PDF)

Theory of Computing and Systems: ISTCS '92, Israel Symposium Haifa, Israel, May 27–28, 1992 Proceedings

1992

Volltextzugriff (PDF)

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Distributed Computing, p.61-75

Volltextzugriff (PDF)

Enhanced calibration technique for RSSI-based ranging in body area networks

Ad hoc networks, 2013-01, Vol.11 (1), p.555-569

2013

Volltextzugriff (PDF)

Revisiting asynchronous fault tolerant computation with optimal resilience

Distributed computing, 2022-08, Vol.35 (4), p.333-355

2022

Volltextzugriff (PDF)

On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

Distributed Computing, p.193-207

Volltextzugriff (PDF)

Atomic snapshots of shared memory

Journal of the ACM, 1993-09, Vol.40 (4), p.873-890

1993

Volltextzugriff (PDF)

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

ACM transactions on economics and computation, 2019-02, Vol.7 (1), p.1-26

2019

Volltextzugriff (PDF)

Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation

Journal of the ACM, 2014-08, Vol.61 (5), p.1-74

2014

Volltextzugriff (PDF)

Perfectly secure message transmission

Journal of the ACM, 1993-01, Vol.40 (1), p.17-47

1993

Volltextzugriff (PDF)

Communication complexity of byzantine agreement, revisited

Distributed computing, 2023-03, Vol.36 (1), p.3-28

2023

Volltextzugriff (PDF)

Nonmalleable Cryptography

SIAM journal on computing, 2000, Vol.30 (2), p.391-437

2000

Volltextzugriff (PDF)

Fault Identification Via Nonparametric Belief Propagation

IEEE transactions on signal processing, 2011-06, Vol.59 (6), p.2602-2613

2011

Volltextzugriff (PDF)

Synchronous counting and computational algorithm design

Journal of computer and system sciences, 2016-03, Vol.82 (2), p.310-332

2016

Volltextzugriff (PDF)

On the minimal synchronism needed for distributed consensus

Journal of the ACM, 1987, Vol.34 (1), p.77-97

1987

Volltextzugriff (PDF)

Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip

Journal of computer and system sciences, 2014-06, Vol.80 (4), p.860-900

2014

Volltextzugriff (PDF)

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks

IEEE transactions on dependable and secure computing, 2010-01, Vol.7 (1), p.80-93

2010

Volltextzugriff (PDF)

HEX: Scaling honeycombs is easier than scaling clock trees

Journal of computer and system sciences, 2016-08, Vol.82 (5), p.929-956

2016

Volltextzugriff (PDF)

An Optimal Self-Stabilizing Firing Squad

SIAM journal on computing, 2012-01, Vol.41 (2), p.415-435

2012

Volltextzugriff (PDF)

Asynchronous resource discovery

Computer networks (Amsterdam, Netherlands : 1999), 2006-07, Vol.50 (10), p.1616-1629

2006

Volltextzugriff (PDF)

Internet resiliency to attacks and failures under BGP policy routing

Computer networks (Amsterdam, Netherlands : 1999), 2006-11, Vol.50 (16), p.3183-3196

2006

Volltextzugriff (PDF)

Sharing memory robustly in message-passing systems

Journal of the ACM, 1995-01, Vol.42 (1), p.124-142

1995

Volltextzugriff (PDF)

Asynchronous resource discovery : Algorithms for distributed systems

Computer networks (Amsterdam, Netherlands : 1999), 2006, Vol.50 (10), p.1616-1629

2006

Volltextzugriff (PDF)

Reaching approximate agreement in the presence of faults

Journal of the ACM, 1986-07, Vol.33 (3), p.499-516

1986

Volltextzugriff (PDF)

1 – 25 von 269

Menü

Weitere Dienste

Einstellungen

Compact routing messages in self-healing trees

Enhancing RSSI-Based Tracking Accuracy in Wireless Sensor Networks

Theory of Computing and Systems: ISTCS '92, Israel Symposium Haifa, Israel, May 27–28, 1992 Proceedings

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Enhanced calibration technique for RSSI-based ranging in body area networks

Revisiting asynchronous fault tolerant computation with optimal resilience

On Self-stabilizing Synchronous Actions Despite Byzantine Attacks

Atomic snapshots of shared memory

Distributed Protocols for Leader Election: A Game-Theoretic Perspective

Fault-tolerant algorithms for tick-generation in asynchronous logic: Robust pulse generation

Perfectly secure message transmission

Communication complexity of byzantine agreement, revisited

Nonmalleable Cryptography

Fault Identification Via Nonparametric Belief Propagation

Synchronous counting and computational algorithm design

On the minimal synchronism needed for distributed consensus

Rigorously modeling self-stabilizing fault-tolerant circuits: An ultra-robust clocking scheme for systems-on-chip

Steward: Scaling Byzantine Fault-Tolerant Replication to Wide Area Networks

HEX: Scaling honeycombs is easier than scaling clock trees

An Optimal Self-Stabilizing Firing Squad

Asynchronous resource discovery

Internet resiliency to attacks and failures under BGP policy routing

Sharing memory robustly in message-passing systems

Asynchronous resource discovery : Algorithms for distributed systems

Reaching approximate agreement in the presence of faults

Suchergebnisse filtern