SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Lattice approximation and linear discrepency of totally unimodular matrices
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Matrix rounding under the Lp-discrepancy measure and its application to digital halftoning
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Dispencery in different numbers of colors
Discrete Mathematics
Optimal roundings of sequences and matrices
Nordic Journal of Computing
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
On the Complexities of the Optimal Rounding Problems of Sequences and Matrices
SWAT '00 Proceedings of the 7th Scandinavian Workshop on Algorithm Theory
Combinatorics and Algorithms on Low-Discrepancy Roundings of a Real Sequence
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Recursive Randomized Coloring Beats Fair Dice Random Colorings
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Balanced Coloring: Equally Easy for All Numbers of Colors?
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
APPROX '02 Proceedings of the 5th International Workshop on Approximation Algorithms for Combinatorial Optimization
Irregularities of Distribution, Derandomization, and Complexity Theory
FST TCS 2000 Proceedings of the 20th Conference on Foundations of Software Technology and Theoretical Computer Science
Problems and results on judicious partitions
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
Consistent load balancing via spread minimization
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
On the solution of reroute sequence planning problem in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Combinatorics, Probability and Computing
Linear and Hereditary Discrepancy
Combinatorics, Probability and Computing
Theoretical Computer Science
The structure and number of global roundings of a graph
Theoretical Computer Science - Special papers from: COCOON 2003
Combinatorics and algorithms for low-discrepancy, roundings of a real sequence
Theoretical Computer Science - Automata, languages and programming
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
Small sample uniformity in random number generation
Computers & Mathematics with Applications
Discrete Applied Mathematics
Parity-based inference control for multi-dimensional range sum queries
Journal of Computer Security
Non-independent randomized rounding and coloring
Discrete Applied Mathematics - Special issue: Efficient algorithms
The structure and number of global roundings of a graph
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Discrepancy-based digital halftoning: automatic evaluation and optimization
Proceedings of the 11th international conference on Theoretical foundations of computer vision
Hereditary Discrepancies in Different Numbers of Colors II
SIAM Journal on Discrete Mathematics
Deterministic discrepancy minimization
ESA'11 Proceedings of the 19th European conference on Algorithms
Rounding of sequences and matrices, with applications
WAOA'05 Proceedings of the Third international conference on Approximation and Online Algorithms
Bin packing via discrepancy of permutations
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Tight hardness results for minimizing discrepancy
Proceedings of the twenty-second annual ACM-SIAM symposium on Discrete Algorithms
Bin Packing via Discrepancy of Permutations
ACM Transactions on Algorithms (TALG) - Special Issue on SODA'11
The geometry of differential privacy: the sparse and approximate cases
Proceedings of the forty-fifth annual ACM symposium on Theory of computing
Discrepancy of (centered) arithmetic progressions in Zp
European Journal of Combinatorics
Unital designs with blocking sets
Discrete Applied Mathematics
A lower bound for the discrepancy of a random point set
Journal of Complexity
| Hi-index | 0.01 |