MetaCart Sign in to MyCiteSeerX

Include Citations | Advanced Search | Help

Disambiguated Search | Include Citations | Advanced Search | Help

Searching for authors named "Moshe Dubiner" – sorted by Relevance.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB
Help! 6 documents found, showing 1 through 6.
ATOM RSS
  • Moshe Dubiner  
  • by Moshe Dubiner, Uri Zwick
  • …Moore and Shannon have shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone readonce formulae of size O(n ff+2 ) (where ff = log p 5\Gamma1 2 ' 3:27) that amplify (/ \Gamma 1 n ; / + …
  • Add To MetaCart
  • A lattice point problem and additive number theory  
  • by Noga Alon, Moshe Dubiner — 1995 — Combinatorica
  • …For every dimension d ≥ 1 there exists a constant c = c(d) such that for all n ≥ 1, every set of at least cn lattice points in the d-dimensional Euclidean space contains a subset of car-dinality precisely n whose centroid is also a lattice point. The proof combines techniques from additive number th…
  • Cited by 6 (0 self)Add To MetaCart
  • Amplification and Percolation  
  • by Moshe Dubiner, Uri Zwick — 1992
  • …Moore and Shannon had shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone read-once formulae of size O(n ff+2 ) (where ff = log p 5\Gamma1 2 ' 3:27) that amplify (/ \Gamma 1 n ; / +…
  • Cited by 10 (3 self)Add To MetaCart
  • How Do Read-Once Formulae Shrink?  
  • by Moshe Dubiner, Uri Zwick — 1994 — Math. Syst. Theory
  • …Let f be a de Morgan read-once function of n variables. Let f " be the random restriction obtained by independently assigning to each variable of f , the value 0 with probability (1 \Gamma ")=2, the value 1 with the same probability, and leaving it unassigned with probability ". We show that f " de…
  • Cited by 5 (2 self)Add To MetaCart
  • Zero-sum sets of prescribed size  
  • by Noga Alon, Moshe Dubiner — 1993 — Combinatorics, Paul Erdős is eighty
  • …Erdős, Ginzburg and Ziv proved that any sequence of 2n−1 integers contains a subsequence of cardinality n the sum of whose elements is divisible by n. We present several proofs of this result, illustrating various combinatorial and algebraic tools that have numerous other applications in Combinatori…
  • Cited by 13 (3 self)Add To MetaCart
  • Amplification By Read-Once Formulas  
  • by Moshe Dubiner Uri, Uri Zwick — 1997
  • …. Moore and Shannon have shown that relays with arbitrarily high reliability can be built from relays with arbitrarily poor reliability. Valiant used similar methods to construct monotone read-once formulas of size O(n #+2 ) (where # = log # 5-1 2 # 3.27) that amplify (#- 1 n ,#+ 1 n ) (w…
  • Add To MetaCart
Help! Showing 1 through 6.
ATOM RSS
Try your query at: Scholar | Yahoo! | Ask | Bing | CSB