Publisher
Springer Berlin Heidelberg
Reference30 articles.
1. M. Ajtai and N. Megiddo, “A deterministic poly(log log N)-time N-processor algorithm for linear programming in fixed dimension,” SIAM J. Comput., 25 (6) (1996), pp. 1171–1195.
2. N. Alon and N. Megiddo, “Parallel linear programming in fixed dimension almost surely in constant time,” Proc. 31st Annual IEEE Symp. on Foundation of Computer Science, 1990, pp. 574–582.
3. M. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, and R.E. Tarjan, “Time bounds for selection,” Journal of Computer and System Sciences, 7 (1973), pp. 448–461.
4. R.P. Brent, “The parallel evaluation of general arithmetic expressions,” Journal of the ACM, 21 (1974), pp. 201–206.
5. B. Chazelle and J. Matoušek, “On linear-time deterministic algorithms for optimization problems in fixed dimension,” Proc. 4th Annual ACM-SIAM Symp. on Discrete Algorithms, 1993, pp. 281–290.