The following pages link to (Q4515159):
Displayed 50 items.
- On generalizations of network design problems with degree bounds (Q378106) (← links)
- Approximately uniform online checkpointing with bounded memory (Q378218) (← links)
- Hardness of discrepancy computation and \(\varepsilon\)-net verification in high dimension (Q413466) (← links)
- Computing generalized ham-sandwich cuts (Q436593) (← links)
- Piercing quasi-rectangles-on a problem of Danzer and Rogers (Q439049) (← links)
- A survey of average case complexity for linear multivariate problems (Q462594) (← links)
- The range of a simple random walk on \(\mathbb{Z}\): an elementary combinatorial approach (Q463050) (← links)
- Intersections of hypergraphs (Q473105) (← links)
- Bounding the gap between the McCormick relaxation and the convex hull for bilinear functions (Q517317) (← links)
- Discrepancy of line segments for general lattice checkerboards (Q519959) (← links)
- Computing the coarseness with strips or boxes (Q526818) (← links)
- \(\varepsilon\)-Mnets: Hitting geometric set systems with subsets (Q527442) (← links)
- Computing hereditary convex structures (Q540446) (← links)
- Generalized ham-sandwich cuts (Q603848) (← links)
- Range minima queries with respect to a random permutation, and approximate range counting (Q629829) (← links)
- Covering numbers, dyadic chaining and discrepancy (Q647924) (← links)
- Fibonacci sets and symmetrization in discrepancy theory (Q657648) (← links)
- The cycle discrepancy of three-regular graphs (Q659662) (← links)
- Semidefinite optimization in discrepancy theory (Q715251) (← links)
- Distributed noise-shaping quantization. I: Beta duals of finite frames and near-optimal quantization of random measurements (Q737337) (← links)
- Random sampling scattered data with multivariate Bernstein polynomials (Q741483) (← links)
- A strong lower bound for approximate nearest neighbor searching (Q834886) (← links)
- Covering many or few points with unit disks (Q839638) (← links)
- Cuttings for disks and axis-aligned rectangles in three-space (Q848675) (← links)
- Computer-aided proof of Erdős discrepancy properties (Q892235) (← links)
- Combinatorial sublinear-time Fourier algorithms (Q972615) (← links)
- Online uniformity of integer points on a line (Q975527) (← links)
- Coloring geometric range spaces (Q1017922) (← links)
- Finding optimal volume subintervals with \( k\) points and calculating the star discrepancy are NP-hard problems (Q1023397) (← links)
- Small weak epsilon-nets (Q1025302) (← links)
- Deterministic and probabilistic discrepancies (Q1042558) (← links)
- Cubature formulas, discrepancy, and nonlinear approximation (Q1401998) (← links)
- On simplifying dot maps. (Q1421029) (← links)
- The Kadison-Singer problem in discrepancy theory. (Q1427482) (← links)
- Zero-sum subsequences in bounded-sum \(\{-1,1\}\)-sequences (Q1621429) (← links)
- A crossing lemma for Jordan curves (Q1647400) (← links)
- Optimal jittered sampling for two points in the unit square (Q1686366) (← links)
- The convexification effect of Minkowski summation (Q1755914) (← links)
- Money creation process in a random redistribution model (Q1782515) (← links)
- Optimal bounds for the predecessor problem and related problems (Q1869935) (← links)
- An efficient \(k\) nearest neighbors searching algorithm for a query line. (Q1874395) (← links)
- The structure and number of global roundings of a graph (Q1884844) (← links)
- Typical rounding problems (Q1884960) (← links)
- Lower bounds for intersection searching and fractional cascading in higher dimension (Q1887711) (← links)
- Geometric characterization of Weyl's discrepancy norm in terms of its \(n\)-dimensional unit balls (Q1930543) (← links)
- Uniformly inserting points on square grid (Q1944133) (← links)
- Randomness of the square root of 2 and the giant leap. I (Q1945262) (← links)
- Sampling scattered data with Bernstein polynomials: stochastic and deterministic error estimates (Q1946479) (← links)
- On the largest empty axis-parallel box amidst \(n\) points (Q1950392) (← links)
- Positive-definite functions, exponential sums and the greedy algorithm: a curious phenomenon (Q1996877) (← links)