Average-case lower bounds for the plurality problem

2008 ◽  
Vol 4 (3) ◽  
pp. 1-17 ◽  
Author(s):  
Laurent Alonso ◽  
Edward M. Reingold
Keyword(s):  
Lower Bounds ◽  
Average Case

ON THE AVERAGE CASE CIRCUIT DELAY OF DISJUNCTION

1995 ◽  
Vol 05 (02) ◽  
pp. 275-280 ◽  
Author(s):  
BEATE BOLLIG ◽  
MARTIN HÜHNE ◽  
STEFAN PÖLT ◽  
PETR SAVICKÝ
Keyword(s):  
Lower Bounds ◽  
Wide Class ◽  
Time Complexity ◽  
Upper And Lower Bounds ◽  
Average Case ◽  
Asymptotically Optimal ◽  
Circuit Delay ◽  
Suitable Measure

For circuits the expected delay is a suitable measure for the average case time complexity. In this paper, new upper and lower bounds on the expected delay of circuits for disjunction and conjunction are derived. The circuits presented yield asymptotically optimal expected delay for a wide class of distributions on the inputs even when the parameters of the distribution are not known in advance.

BOUNDS AND PERFORMANCE LIMITS OF CHANNEL ASSIGNMENT POLICIES IN CELLULAR NETWORKS

2002 ◽  
Vol 16 (1) ◽  
pp. 85-100
Author(s):  
Nicole Bäuerle ◽  
Anja Houdek
Keyword(s):  
Cellular Networks ◽  
Lower Bounds ◽  
Channel Assignment ◽  
Linear Program ◽  
Performance Limits ◽  
Average Case ◽  
Interference Graph ◽  
Deterministic Control ◽  
Fixed Channel Assignment ◽  
And Performance

We investigate the performance of channel assignment policies for cellular networks. The networks are given by an interference graph which describes the reuse constraints for the channels. In the first part, we derive lower bounds on the expected (weighted) number of blocked calls under any channel assignment policy over finite time intervals as well as in the average case. The lower bounds are solutions of deterministic control problems. As far as the average case is concerned, the control problem can be replaced by a linear program. In the second part, we consider the cellular network in the limit, when the number of available channels as well as the arrival intensities are linearly increased. We show that the network obeys a functional law of large numbers and that a fixed channel assignment policy which can be computed from a linear program is asymptotically optimal. Special networks like fully connected and star networks are considered.

scholarly journals The stretch-length tradeoff in geometric networks: average case and worst case study

2015 ◽  
Vol 159 (1) ◽  
pp. 125-151
Author(s):  
DAVID ALDOUS ◽  
TAMAR LANDO
Keyword(s):  
Lower Bounds ◽  
Poisson Point Process ◽  
Euclidean Distance ◽  
Unit Area ◽  
Average Density ◽  
Upper And Lower Bounds ◽  
Worst Case ◽  
Average Case ◽  
Route Length

AbstractConsider a network linking the points of a rate-1 Poisson point process on the plane. Write Ψave(s) for the minimum possible mean length per unit area of such a network, subject to the constraint that the route-length between every pair of points is at moststimes the Euclidean distance. We give upper and lower bounds on the function Ψave(s), and on the analogous “worst-case” function Ψworst(s) where the point configuration is arbitrary subject to average density one per unit area. Our bounds are numerically crude, but raise the question of whether there is an exponent α such that each function has Ψ(s) ≍ (s− 1)−αass↓ 1.

scholarly journals Average-Case Lower Bounds for Noisy Boolean Decision Trees

1998 ◽  
Vol 28 (2) ◽  
pp. 433-446 ◽  
Author(s):  
William Evans ◽  
Nicholas Pippenger
Keyword(s):  
Decision Trees ◽  
Lower Bounds ◽  
Average Case

Sampling Lower Bounds: Boolean Average-Case and Permutations

2020 ◽  
Vol 49 (1) ◽  
pp. 119-137 ◽  
Author(s):  
Emanuele Viola
Keyword(s):  
Lower Bounds ◽  
Average Case
Sign in / Sign up

Export Citation Format

Share Document