scientific article; zbMATH DE number 863495

From MaRDI portal
Revision as of 04:32, 8 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:4871774

zbMath0851.11043MaRDI QIDQ4871774

József Beck, Vera T. Sós

Publication date: 29 May 1996


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items (38)

On the discrepancy of circular sequences of realsBalanced partitions of vector sequencesThe structure and number of global roundings of a graphTypical rounding problemsRecent progress on combinatorics and algorithms for low discrepancy roundingsOn the \(L_{2}\)-discrepancyBin packing and cutting stock problems: mathematical models and exact algorithmsA Discrepancy Problem: Balancing Infinite Dimensional VectorsOn combinatorial rectangles with minimum ∞−discrepancyComputer-aided proof of Erdős discrepancy propertiesPartial Colorings of Unimodular HypergraphsDiscrepancy of Sums of two Arithmetic ProgressionsSmall sample uniformity in random number generationDiscrepancy theory and related algorithmsUnital designs with blocking setsReroute sequence planning in telecommunication networks and compact vector summation.Intersections of hypergraphsA note on the discrepancy of matrices with bounded row and column sumsOn the Computational Complexity of Linear DiscrepancyThe determinant bound for discrepancy is almost tightLaplace eigenvalues of graphs---a surveyA lower bound for the discrepancy of a random point setUnnamed ItemNon-independent randomized rounding and coloringCombinatorics and algorithms for low-discrepancy roundings of a real sequenceDiscrepancy and signed domination in graphs and hypergraphsVector balancing games with agingDiscrepancy of (centered) arithmetic progressions in \({\mathbb{Z}_p}\)The Geometry of Differential Privacy: The Small Database and Approximate CasesPrefaceFinding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problemsThe exponent of discrepancy is at least 1. 0669On the \(L_2\)-discrepancy for anchored boxesOn the linear and hereditary discrepanciesThe chip-firing gameSigned domination in regular graphs and set-systemsVector Balancing Games with AgingDiscrepancy of Sums of Arithmetic Progressions







This page was built for publication: