Zobrazeno 1 - 10
of 13 875
pro vyhledávání: '"Gotsman"'
Autor:
Di Battista, Giuseppe, Frati, Fabrizio
The algorithm of Tutte for constructing convex planar straight-line drawings and the algorithm of Floater and Gotsman for constructing planar straight-line morphs are among the most popular graph drawing algorithms. In this paper, focusing on maximal
Externí odkaz:
http://arxiv.org/abs/2108.09483
Autor:
Chapman, Brynmor
Publikováno v:
Proceedings of the 2018 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 692-699, 2018
In 1991, Craig Gotsman and Nathan Linial conjectured that for all $n$ and $d$, the average sensitivity of a degree-$d$ polynomial threshold function on $n$ variables is maximized by the degree-$d$ symmetric polynomial which computes the parity functi
Externí odkaz:
http://arxiv.org/abs/2108.02288
We give an infinite class of counterexamples to the Gotsman-Linial conjecture when d = 2. On the other hand, we establish an asymptotic form of the conjecture for quadratic threshold functions whose non-zero quadratic terms define a graph with either
Externí odkaz:
http://arxiv.org/abs/1709.06650
Autor:
Bravo, Manuel, Chockler, Gregory, Gotsman, Alexey, Naser-Pastoriza, Alejandro, Roldán, Christian
Atomic broadcast is a reliable communication abstraction ensuring that all processes deliver the same set of messages in a common global order. It is a fundamental building block for implementing fault-tolerant services using either active (aka state
Externí odkaz:
http://arxiv.org/abs/2408.08702
Autor:
Kane, Daniel M.
We prove a new bound on the average sensitivity of polynomial threshold functions. In particular we show that a polynomial threshold function of degree $d$ in at most $n$ variables has average sensitivity at most $\sqrt{n}(\log(n))^{O(d\log(d))}2^{O(
Externí odkaz:
http://arxiv.org/abs/1210.1283
We study implementations of basic fault-tolerant primitives, such as consensus and registers, in message-passing systems subject to process crashes and a broad range of communication failures. Our results characterize the necessary and sufficient con
Externí odkaz:
http://arxiv.org/abs/2305.15150
Publikováno v:
In The American Journal of Cardiology 1 January 2025 234:14-21
Byzantine state-machine replication (SMR) ensures the consistency of replicated state in the presence of malicious replicas and lies at the heart of the modern blockchain technology. Byzantine SMR protocols often guarantee safety under all circumstan
Externí odkaz:
http://arxiv.org/abs/2202.06679
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.