Combinatorics and algorithms for low-discrepancy roundings of a real sequence
From MaRDI portal
Publication:1770423
DOI10.1016/j.tcs.2004.09.030zbMath1070.68143OpenAlexW2095773079MaRDI QIDQ1770423
Takeshi Tokuyama, Nadia Takki-Chebihi, Kunihiko Sadakane
Publication date: 6 April 2005
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.09.030
Combinatorics in computer science (68R05) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Related Items (1)
Cites Work
- The Structure and Number of Global Roundings of a Graph
- Graph-Based Algorithms for Boolean Function Manipulation
- Digital halftones by dot diffusion
- Algorithms on Strings, Trees and Sequences
- Faster Scaling Algorithms for Network Problems
- Discrepancy-Based Digital Halftoning: Automatic Evaluation and Optimization
- Algorithms and Computation
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Combinatorics and algorithms for low-discrepancy roundings of a real sequence
