Name
Abstract | ||
|---|---|---|
Let Bdn denote the family which consists of all subsets S1 ×... × Sd, where Si ⊆ [n], and Si ≠ Φ for i = 1,..... d. We compute the L2-discrepancy of Bdn and give estimates for the Lp-discrepancy of Bdn for 1 ≤ p ≤ ∞. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1002/rsa.10055 | Random Struct. Algorithms |
Keywords | Field | DocType |
. discrepancy,probabilistic method. the,combinatorial rectangle,bdn denote,subsets s1,probabilistic method | Discrete mathematics,Combinatorics,Probabilistic method,Mathematics | Journal |
Volume | Issue | ISSN |
21 | 3-4 | 1042-9832 |
Citations | PageRank | References |
5 | 1.00 | 1 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Noga Alon | 1 | 10468 | 1688.16 |
| Benjamin Doerr | 2 | 1504 | 127.25 |
| Tomasz Łuczak | 3 | 225 | 40.26 |
| Tomasz Schoen | 4 | 36 | 12.04 |