One-Sided Interval Trees

author

  • Svante Janson
Abstract:

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

One-sided Interval Trees

We give an alternative treatment and extension of some results of Itoh and Mahmoud on one-sided interval trees. The proofs are based on renewal theory, including a case with mixed multiplicative and additive renewals.

full text

On one-sided interval edge colorings of biregular bipartite graphs

A proper edge t-coloring of a graphG is a coloring of edges of G with colors 1, 2, . . . , t such that all colors are used, and no two adjacent edges receive the same color. The set of colors of edges incident with a vertex x is called a spectrum of x. Any nonempty subset of consecutive integers is called an interval. A proper edge t-coloring of a graph G is interval in the vertex x if the spec...

full text

On one-sided versus two-sided classification

One-sided classiiers are computable devices which read the characteristic function of a set and output a sequence of guesses which converges to 1 ii the set on the input belongs to the given class. Such a classiier is two-sided if the sequence of its output in addition converges to 0 on sets not belonging to the class. The present work obtains the below mentioned results for one-sided classes (...

full text

One-sided Logic in Two-sided Markets

In this paper, I consider eight basic fallacies that can arise from using conventional wisdom from one-sided markets in two-sided market settings. These fallacies are illustrated using statements made in the context of regulatory investigations into credit card schemes in Australia and the United Kingdom. I discuss how these fallacies may be reconciled by proper use of a two-sided market analys...

full text

One-sided epsilon-approximants

Given a finite point set P ⊂ R, we call a multiset A a one-sided weak ε-approximant for P (with respect to convex sets), if |P ∩ C|/|P | − |A ∩C|/|A| ≤ ε for every convex set C. We show that, in contrast with the usual (two-sided) weak ε-approximants, for every set P ⊂ R there exists a one-sided weak ε-approximant of size bounded by a function of ε and d.

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 3  issue None

pages  149- 164

publication date 2004-11

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023