Add to ORKGThe interval searching algorithm for broadcast communications of Gallager, Tsybakov and Mikhailov is analyzed. We present ultimate characterizations of the burst response of the algorithm, that is. when the number of collided packers becomes large. Three quantities are of interest: the conflict resolution interval (CRI), the fraction of the resolved interval (RI) and the number of resolved packets (RP). If n is the multi-plicity of a conflict, then it is proved that the m-th moments of eRr, RI and RP are o (log" ' n), 0 (n-m) and 0 (1) respectively. In addition, for the first two moments of the parameters precise asymptotic approximations are presented. The methodology proposed in this paper is, in particular, applicable to asympt...
Abstract — We present a novel algorithm for efficiently gath-ering statistics about the hit frequenc...
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a numbe...
We use ideas from game theory to define a new notion for an optimal threshold for the number of erro...
AbstractOnline interval selection is a problem in which intervals arrive one by one, sorted by their...
We study streaming algorithms for the interval selection problem: finding a maximum car-dinality sub...
In a rendezvous search problem, two players are placed in a network and must try to meet each other ...
n this paper random access algorithms for packet broadcast channels are considered. It is shown that...
This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of...
[[abstract]]The authors propose a new concept, the conflict-based algorithm, to derive efficient alg...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
The communication complexity of interval orders is studied within the following model. Two players c...
In the problem of Scheduling with Interval Conflicts, there is a ground set of items indexed by inte...
The more complex the problem, the more complex the system necessary for solving this problem. For ve...
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a posit...
In the problem of Scheduling with Interval Conflicts, there is a ground set of items indexed by inte...
Abstract — We present a novel algorithm for efficiently gath-ering statistics about the hit frequenc...
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a numbe...
We use ideas from game theory to define a new notion for an optimal threshold for the number of erro...
AbstractOnline interval selection is a problem in which intervals arrive one by one, sorted by their...
We study streaming algorithms for the interval selection problem: finding a maximum car-dinality sub...
In a rendezvous search problem, two players are placed in a network and must try to meet each other ...
n this paper random access algorithms for packet broadcast channels are considered. It is shown that...
This paper describes efficient coarse-grained parallel algorithms and implementations for a suite of...
[[abstract]]The authors propose a new concept, the conflict-based algorithm, to derive efficient alg...
A problem arising in statistical data analysis and pattern recognition is to find a longest interval...
The communication complexity of interval orders is studied within the following model. Two players c...
In the problem of Scheduling with Interval Conflicts, there is a ground set of items indexed by inte...
The more complex the problem, the more complex the system necessary for solving this problem. For ve...
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a posit...
In the problem of Scheduling with Interval Conflicts, there is a ground set of items indexed by inte...
Abstract — We present a novel algorithm for efficiently gath-ering statistics about the hit frequenc...
Given a set of jobs, each consisting of a number of weighted intervals on the real line, and a numbe...
We use ideas from game theory to define a new notion for an optimal threshold for the number of erro...