Browsing by Subject "Lower bounds"
Now showing items 1-17 of 17
-
Article
The complexity of synchronous iterative Do-All with crashes
(2004)The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to distributed simulation and multi-agent collaboration. ...
-
Article
The cost of concurrent, low-contention Read&Modify&Write
(2005)The possibility or impossibility and the corresponding costs of devising concurrent, low-contention implementations of atomic Read&Modify&Write (or RMW) operations in a distributed system were addressed. A natural class ...
-
Article
Decoding algorithm and architecture for BCH codes under the Lee metric
(2008)The Lee metric measures the circular distance between two elements in a cyclic group and is particularly appropriate as a measure of distance for data transmission under phase-shift-keying modulation over a white noise ...
-
Article
Efficiency of oblivious versus nonoblivious schedulers for optimistic, rate-based flow control
(2005)Two important performance parameters of distributed, rate-based flow control algorithms are their locality and convergence complexity. The former is characterized by the amount of global knowledge that is available to their ...
-
Conference Object
Eigenvalue estimates on bakry–Émery manifolds
(Springer Verlag, 2015)We demonstrate lower bounds for the eigenvalues of compact Bakry– Émery manifolds with and without boundary. The lower bounds for the first eigenvalue rely on a generalized maximum principle which allows gradient estimates ...
-
Article
Information theoretic modeling and analysis for global interconnects with process variations
(2011)As the CMOS semiconductor technology enters nanometer regime, interconnect processes must be compatible with device roadmaps and meet manufacturing targets at the specified wafer size. The resulting ubiquitous process ...
-
Conference Object
A mathematical framework for robust control over uncertain communication channels
(2005)In this paper, a mathematical framework for studying robust control over uncertain communication channels is introduced. The theory is developed by 1) Generalizing the classical information theoretic measures to the robust ...
-
Article
Meeting the deadline: On the complexity of fault-tolerant continuous gossip
(2011)In this paper we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
-
Conference Object
Meeting the deadline: On the complexity of fault-tolerant Continuous Gossip
(2010)In this paper, we introduce the problem of Continuous Gossip in which rumors are continually and dynamically injected throughout the network. Each rumor has a deadline, and the goal of a continuous gossip protocol is to ...
-
Article
Mutual information expansion for MIMO systems and capacity formulae at low SNR
(2011)The paper introduces a new asymptotic series expansion for the mutual information of multiple-input multiple-output (MIMO) channels. The expansion approaches mutual information from below, and for low signal to noise ratio ...
-
Article
The price of defense and fractional matchings
(2006)Consider a network vulnerable to security attacks and equipped with defense mechanisms. How much is the loss in the provided security guarantees due to the selfish nature of attacks and defenses? The Price of Defense was ...
-
Conference Object
Rate distortion function with causal decoding
(2010)This paper considers source coding of general sources with memory, when causal feedback is available at the decoder. The rate distortion function is defined as the infimum of the so-called directed information over causal ...
-
Article
Reliable internet-based master-worker computing in the presence of malicious workers
(2012)We consider a Master-Worker distributed system where a master processor assigns, over the Internet, tasks to a collection of n workers, which are untrusted and might act maliciously. In addition, a worker may not reply to ...
-
Article
Search for the decays B(s)0→e+μ- and B(s)0→e+e- in CDF run II
(2009)We report results from a search for the lepton flavor violating decays Bs0→e+μ- and B0→e+μ-, and the flavor-changing neutral-current decays Bs0→e+e- and B0→e+e-. The analysis uses data corresponding to 2fb-1 of integrated ...
-
Conference Object
Stochastic control over finite capacity channels: Causality, feedback and uncertainty
(2009)Optimal communication/control analysis and design of dynamical controlled systems, when there are finite capacity communication constraints often involve information and control theoretic analysis. This paper, employees ...
-
Article
Trade-off results for connection management
(2003)A connection management protocol establishes and handles a connection between two hosts across a wide-area network to allow reliable message delivery. We continue the previous work of Kleinberg et al. (Proceedings of the ...
-
Conference Object
An upper and a lower bound for tick synchronization
(1992)The tick synchronization problem is defined and studied in the semi-synchronous complete network with n processes. An algorithm for the tick synchronization problem enables each process to make an estimate of real time ...