Solving some discrepancy problems in NC

Algorithmica (New York)

Volumn 29, Issue 3, 2001, Pages 371-395

  Mahajan, S ^a   Ramos, E A ^b   Subrahmanyam, K V ^c  

^a AGERE SYSTEMS   (United States)

^b MAX PLANCK INSTITUTE FOR INFORMATICS   (Germany)

^c CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

Derandomization; Discrepancy; Geometric sampling; Lattice approximation; Parallel algorithms

Indexed keywords

APPROXIMATION THEORY; GEOMETRY; INTEGER PROGRAMMING; PARALLEL ALGORITHMS; PROBABILITY; PROBLEM SOLVING; SAMPLING;

DISCREPANCY PROBLEMS;

COMBINATORIAL MATHEMATICS;

EID: 0005258733     PISSN: 01784617     EISSN: None     Source Type: Journal    
DOI: 10.1007/s004530010046     Document Type: Article

References (42)

1. P.K. Agarwal and J. Matoušek. On range searching with semialgebraic sets. Discrete Comput. Geom. 11 (1994), 393-418.
2. M. Ajtai. Approximate counting with uniform constant depth circuits. In J.-Y. Cai (ed.), Advances in Computational Complexity Theory, DIMACS Series in Discrete Mathematics and Theoretical Computer Science, American Mathematical Society, Providence, RI, 1993, pp. 1-20.
3. N. Alon and J. Spencer. The Probabilistic Method. Wiley-Interscience, New York, 1992.
4. N. Alon and A. Srinivasan. Improved parallel approximation of a class of integer programming problems. Algorithmica 17 (1997), 449-462.
5. N.M. Amato, M.T. Goodrich, and E.A. Ramos. Parallel algorithms for higher-dimensional convex hulls. In Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., 1994, pp. 683-694.
6. N.M. Amato, M.T. Goodrich, and E.A. Ramos. Computing faces in segment and simplex arrangements. In Proc. 27th Annu. ACM Sympos. Theory Comput., 1995, pp. 672-682.
7. J. Beck and W. Chen. Irregularities of Distribution. Cambridge University Press, Cambridge, 1987.
8. J. Beck and T. Fiala. Integer-making theorems. Discrete Appl. Math. 3 (1981), 1-8.
9. J. Beck and J.H. Spencer, Integral approximation sequences. Math. Programming 30 (1984), 88-98.
10. M. Bellare and J. Rompel. Randomness-efficient oblivious sampling. In Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., 1994, pp. 276-287.
11. c n)-wise independence in NC. J. Assoc. Comput. Mach. 38 (1991), 1026-1046.
12. S. Chari, P. Rohatgi, and A. Srinivasan. Improved algorithms via approximations of probability distributions. In Proc. ACM Sympos. Theory Comput. (1994), pp. 584-592. Revised version as DIMACS Technical Report 97-01.
13. B. Chazelle and J. Friedman. A deterministic view of random sampling and its use in geometry. Combinatorica 10 (1990), 229-249.
14. B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, 1993, pp. 281-290. Revised version in J. Algorithms 21 (1996), 579-597.
15. B. Chazelle and J. Matoušek. On linear-time deterministic algorithms for optimization problems in fixed dimension. In Proc. 4th ACM-SIAM Sympos. Discrete Algorithms, 1993, pp. 281-290. Revised version in J. Algorithms 21 (1996), 579-597.
16. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Statist. 23 (1952), 493-509.
17. K.L. Clarkson and P.W. Shor. Applications of random sampling in computational geometry, II. Discrete Comput. Geom. 4 (1989), 387-421.
18. T. Goldberg and U. Zwick. Optimal deterministic approximate parallel prefix sums and their applications. In Proc. 4th IEEE Israel Sympos. Theory Comput. Systems, 1995, pp. 220-228.
19. M.T. Goodrich. Geometric partitioning made easier, even in parallel. In Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 73-82.
20. M.T. Goodrich. Fixed-dimensional parallel linear programming via relative ε-approximations. In Proc. 7th ACM-SIAM Sympos. Discrete Algebra, 1996, pp. 132-141.
21. M.T. Goodrich and E.A. Ramos. Bounded independence derandomization of geometric partitioning with applications to parallel fixed-dimensional linear programming. Discrete Comput. Geom. 18 (1997), 397-420.
22. W. Hoeffding. Probability inequalities for sums of bounded random variables. Amer. Statist. Assoc. J. 58 (1963), 13-30.
23. A. Joffe. On a set of almost deterministic k-independent random variables. Ann. Probab. 2 (1974), 161-162.
24. D.R. Karger and D. Koller. (De)randomized constructions of small sample spaces in NC. In Proc. 35th Annu. IEEE Sympos. Found. Comput. Sci., 1994, pp. 252-263.
25. H.J. Karloff and Y. Mansour. On construction of k-wise independent random variables. In Proc. 26th Annu. ACM Sympos. Theory Comput., 1994, pp. 564-573. Revised version in Combinatorica 17 (1997), 91-107.
26. H.J. Karloff and Y. Mansour. On construction of k-wise independent random variables. In Proc. 26th Annu. ACM Sympos. Theory Comput., 1994, pp. 564-573. Revised version in Combinatorica 17 (1997), 91-107.
27. H.J. Karloff and D.B. Shmoys. Efficient parallel algorithms for edge coloring problems. J. Algorithms 8 (1987), 39-52.
28. M. Luby and N. Nisan. A parallel approximation algorithm for positive linear programming. In Proc. 25th Annu. ACM Sympos. Theory Comput., 1993, pp. 448-457.
29. J. Matoušek. Approximations and optimal geometric divide-and-conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput., 1991, pp. 505-511. Revised version in J. Comput. System Sci. 50 (1995), 203-208.
30. J. Matoušek. Approximations and optimal geometric divide-and-conquer. In Proc. 23rd Annu. ACM Sympos. Theory Comput., 1991, pp. 505-511. Revised version in J. Comput. System Sci. 50 (1995), 203-208.
31. J. Matoušek. Cutting hyperplane arrangements. Discrete Comput. Geom. 6 (1991), 385-406.
32. J. Matoušek. Efficient partition trees Discrete Comput. Geom. 8 (1992), 315-334.
33. J. Matoušek. Derandomization in computational geometry. J. Algorithms 20 (1996), 545-580.
34. J. Matoušek, E. Welzl, and L. Wernisch. Discrepancy and ε-approximations for bounded VC-dimension. Combinatorica 13 (1993), 838-856.
35. R. Motwani, J. Naor, and M. Naor. The probabilistic method yields deterministic parallel algorithms. J. Comput. System Sci. 49 (1994), 478-516.
36. K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, Englewood Cliffs, NJ, 1993.
37. J. Naor and M. Naor. Small-bias probability spaces: efficient constructions and applications. SIAM J. Comput. 22 (1993), 838-856.
38. N. Nisan. Pseudorandom generators for space-bounded computation. Combinatorica 12 (1992), 449-461.
39. P. Raghavan. Probabilistic construction of deterministic algorithms: approximating packing integer programs. J. Comput. System Sci. 37 (1988), 130-143.
40. P. Raghavan and C.D. Thompson. Randomized rounding: a technique for provably good algorithms and algorithmic proofs. Combinatorica 7 (1987), 365-374.
41. J.P. Schmidt, A. Siegel, and A. Srinivasan. Chernoff-Hoeffding bounds for applications with limited independence. SIAM J. Discrete Math. 8 (1995), 223-250.
42. V.N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory Probab. Appl. 16 (1971), 264-280.