Funder
Division of Computing and Communication Foundations
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference28 articles.
1. Ambrus, G., Bárány, I.: Longest convex chains. Rand. Struct. Algorithm 35(2), 137–162 (2009). https://doi.org/10.1002/rsa.20269
2. Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319–342 (1987). https://doi.org/10.1007/BF00116828
3. Bárány, I.: A generalization of Carathéodory’s theorem. Discrete Math. 40(2–3), 141–152 (1982). https://doi.org/10.1016/0012-365X(82)90115-7
4. Bárány, I., Füredi, Z.: Computing the volume is difficulte. Discrete Comput. Geom. 2, 319–326 (1987). https://doi.org/10.1007/BF02187886
5. Chan, T.M.: An optimal randomized algorithm for maximum Tukey depth. In: J.I. Munro (ed.) Proceedings of 15th ACM-SIAM Symposium Discrete Algs. (SODA), pp. 430–436. SIAM (2004). URL http://dl.acm.org/citation.cfm?id=982792.982853