Making polynomials robust to noise
AA Sherstov - Proceedings of the forty-fourth annual ACM symposium …, 2012 - dl.acm.org
A basic question in any computational model is how to reliably compute a given function
when the inputs or intermediate computations are subject to noise at a constant rate. Ideally …
when the inputs or intermediate computations are subject to noise at a constant rate. Ideally …
Broadcasting in noisy radio networks
The widely-studied radio network model [Chlamtac and Kutten, 1985] is a graph-based
description that captures the inherent impact of collisions in wireless communication. In this …
description that captures the inherent impact of collisions in wireless communication. In this …
Lower bounds for in-network computation of arbitrary functions
In this paper, we provide a family of bounds for the rate at which the functions of many inputs
can be computed in-network on general topologies. Going beyond simple symmetric …
can be computed in-network on general topologies. Going beyond simple symmetric …
A majority lemma for randomised query complexity
We show that computing the majority of n copies of a boolean function g has randomised
query complexity R (Maj∘ gⁿ)= Θ (n⋅ R ̅_ {1/n}(g)). In fact, we show that to obtain a similar …
query complexity R (Maj∘ gⁿ)= Θ (n⋅ R ̅_ {1/n}(g)). In fact, we show that to obtain a similar …
When is amplification necessary for composition in randomized query complexity?
Suppose we have randomized decision trees for an outer function $ f $ and an inner function
$ g $. The natural approach for obtaining a randomized decision tree for the composed …
$ g $. The natural approach for obtaining a randomized decision tree for the composed …
Random walk based in-network computation of arbitrary functions
We study in-network computation on general network topologies. Specifically, we are given
the description of a function, and a network with distinct nodes at which the operands of the …
the description of a function, and a network with distinct nodes at which the operands of the …
A Sampling Technique of Proving Lower Bounds for Noisy Computations
C Dutta, J Radhakrishnan - arXiv preprint arXiv:1503.00321, 2015 - arxiv.org
We present a technique of proving lower bounds for noisy computations. This is achieved by
a theorem connecting computations on a kind of randomized decision trees and sampling …
a theorem connecting computations on a kind of randomized decision trees and sampling …
How Hard is Computing Parity with Noisy Communications?
We show a tight lower bound of $\Omega (N\log\log N) $ on the number of transmissions
required to compute the parity of $ N $ input bits with constant error in a noisy …
required to compute the parity of $ N $ input bits with constant error in a noisy …
[PDF][PDF] A Complete Bibliography of Publications in the IEEE symposia on Foundations of Computer Science (FOCS) for 2000–2009
NHF Beebe - 2018 - ctan.math.utah.edu
A Complete Bibliography of Publications in the IEEE symposia on Foundations of Computer
Science (FOCS) for 2000–2009 Page 1 A Complete Bibliography of Publications in the IEEE …
Science (FOCS) for 2000–2009 Page 1 A Complete Bibliography of Publications in the IEEE …
[引用][C] Lower Bounds for Noisy Computations
C Dutta - 2009 - shodhganga.inflibnet.ac.in
Shodhganga@INFLIBNET: Lower Bounds for Noisy Computations Skip navigation DSpace
logo Home Browse Universities & Departments Browse by : Upload Date Researcher/Guide …
logo Home Browse Universities & Departments Browse by : Upload Date Researcher/Guide …