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)
- 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)
- 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)
- 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)
- 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)
- Approximate range searching: The absolute model (Q2269144) (← links)
- Recent progress on combinatorics and algorithms for low discrepancy roundings (Q2373430) (← links)
- Improved sparse Fourier approximation results: Faster implementations and stronger guarantees (Q2376358) (← links)
- Toric algebra of hypergraphs (Q2441562) (← links)
- Approximate range searching in higher dimension (Q2456663) (← links)
- The Littlewood-Gowers problem (Q2474568) (← links)
- A generalization of magic squares with applications to digital halftoning (Q2480747) (← links)
- Non-independent randomized rounding and coloring (Q2489958) (← links)
- Halton and Hammersley sequences in multivariate nonparametric regression (Q2493801) (← links)
- Locally consistent constraint satisfaction problems (Q2581264) (← links)
- Learning Complexity vs Communication Complexity (Q3557511) (← links)
- On the exponent of discrepancies (Q3584814) (← links)
- Tight lower bounds for the size of epsilon-nets (Q4924064) (← links)