O(log n) EXPECTED ROUNDS RANDOMIZED BYZANTINE GENERALS PROTOCOL.

被引：0

|

作者：

Bracha, Gabriel ^{[1
]}

机构：

[1] Cornell Univ, Ithaca, NY, USA, Cornell Univ, Ithaca, NY, USA

来源：

Journal of the ACM | 1987年 / 34卷 / 04期

关键词：

COMPUTER NETWORKS - Protocols - COMPUTER PROGRAMMING - Algorithms - CRYPTOGRAPHY;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

收藏

页码：910 / 920

相关论文

共 35 条

[31] Randomized Consensus in Expected O(n2) Total Work Using Single-Writer Registers
Aspnes, James
DISTRIBUTED COMPUTING, 2011, 6950 : 363 - 373
[32] An O(log n) Dominating Set Protocol for Wireless Ad-Hoc Networks under the Physical Interference Model
Scheideler, Christian
Richa, Andrea W.
Santi, Paolo
MOBIHOC'08: PROCEEDINGS OF THE NINTH ACM INTERNATIONAL SYMPOSIUM ON MOBILE AD HOC NETWORKING AND COMPUTING, 2008, : 91 - 100
[33] Uniformly distributed seeds for randomized trace estimator on O(N2)-operation log-det approximation in Gaussian process regression
Zhang, Yunong
PROCEEDINGS OF THE 2006 IEEE INTERNATIONAL CONFERENCE ON NETWORKING, SENSING AND CONTROL, 2006, : 498 - 503
[34] The GKR Protocol Revisited: Nearly Optimal Prover-Complexity For Polynomial-Time Wiring Algorithms and For Primality Testing in n1/2+o(1) Rounds
Kaltofen, Erich L.
PROCEEDINGS OF THE 2022 INTERNATIONAL SYMPOSIUM ON SYMBOLIC AND ALGEBRAIC COMPUTATION, ISSAC 2022, 2022, : 177 - 186
[35] A Randomized O(logn)\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$\mathrm {O}(\log n)$$\end{document}-Competitive Algorithm for the Online Connected Facility Location Problem
Mário César San Felice
David P. Williamson
Orlando Lee
Algorithmica, 2016, 76 (4) : 1139 - 1157

← 1 2 3 4 →