#### Filter Results:

- Full text PDF available (27)

#### Publication Year

1987

2018

- This year (2)
- Last 5 years (21)
- Last 10 years (44)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

A random variable is sampled from a discrete distribution. The missing mass is the probability of the set of points not observed in the sample. We sharpen and simplify McAllester and Ortizâ€™s resultsâ€¦ (More)

- Daniel Berend, Peter HarremoÃ«s, Aryeh Kontorovich
- IEEE Transactions on Information Theory
- 2014

Pinsker's widely used inequality upper-bounds the total variation distance âˆ¥P - Qâˆ¥1 in terms of the Kullback-Leibler divergence D(Pâˆ¥Q). Although, in general, a bound in the reverse direction isâ€¦ (More)

- Daniel Berend, Tamir Tassa
- 2010

We provide bounds for moments of sums of sequences of independent random variables. Concentrating on uniformly bounded non-negative random variables, we are able to improve upon previous results dueâ€¦ (More)

- Daniel Berend, Luba Sapir
- Social Choice and Welfare
- 2007

Condorcetâ€™s Jury Theorem (CJT) provides a theoretical basis of public choice theory and political science. This paper provides an extension of CJT for random subcommittees consisting of dependentâ€¦ (More)

- Daniel Berend, Luba Sapir
- JAMDS
- 2002

- Daniel Berend, Steven Skiena, Yochai Twitto
- ACM Trans. Algorithms
- 2008

The design and analysis of approximation algorithms for NP-hard problems is perhaps the most active research area in the theory of combinatorial algorithms. In this article, we study the notion of aâ€¦ (More)

- Eitan Bachmat, Daniel Berend, Luba Sapir, Steven Skiena
- AAIM
- 2005

We show how the process of passengers boarding an airplane and the process of optimal I/O scheduling to a disk drive with a linear seek function can be asymptotically modeled by 2-dimensionalâ€¦ (More)

- Daniel Berend, Luba Sapir
- 1991

We study the uncertain dichotomous choice model. In this model a group of decision makers is required to select one of two alternatives. The applications of this model are relevant to a wide varietyâ€¦ (More)

- Daniel Berend, Christiane Frougny
- Mathematical systems theory
- 1994

We prove that the function of normalization in base Î¸, which maps any Î¸-representation of a real number onto its Î¸-development, obtained by a greedy algorithm, is a function computable by a finiteâ€¦ (More)

- Daniel Berend, Yuri Bilu
- 1996

Given a polynomial with integer coefficients, we calculate the density of the set of primes modulo which the polynomial has a root. We also give a simple criterion to decide whether or not theâ€¦ (More)