Pages that link to "Item:Q2835470"
From MaRDI portal
The following pages link to An improved bound for the star discrepancy of sequences in the unit interval (Q2835470):
Displaying 17 items.
- On the discrepancy of sequences in the unit-interval (Q266166) (← links)
- A note on E. Thiémard's algorithm to compute bounds for the star discrepancy (Q558008) (← links)
- Symbolic representation of piecewise linear functions on the unit interval and application to discrepancy (Q1314404) (← links)
- Computing bounds for the star discrepancy (Q1592539) (← links)
- Positive-definite functions, exponential sums and the greedy algorithm: a curious phenomenon (Q1996877) (← links)
- On an explicit lower bound for the star discrepancy in three dimensions (Q1996946) (← links)
- On Proinov's lower bound for the diaphony (Q2129351) (← links)
- Dynamically defined sequences with small discrepancy (Q2297588) (← links)
- On the star discrepancy of sequences in the unit interval (Q2347963) (← links)
- Greedy energy minimization can count in binary: point charges and the van der Corput sequence (Q2662175) (← links)
- An elementary proof of a lower bound for the inverse of the star discrepancy (Q2685069) (← links)
- Improvements on the star discrepancy of \((t,s)\)-sequences (Q2889255) (← links)
- A new upper bound on the star discrepancy of \(0,1\)-sequences (Q3377533) (← links)
- On fractional parts of rapidly growing functions (Q4804407) (← links)
- A generalization of NUT digital (0,1)-sequences and best possible lower bounds for star discrepancy (Q4915126) (← links)
- Discrepancy of Digital Sequences: New Results on a Classical QMC Topic (Q5117922) (← links)
- On combinatorial properties of greedy Wasserstein minimization (Q6140904) (← links)
