Author:
Jadhav S.,Mukhopadhyay A.
Publisher
Springer Science and Business Media LLC
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science
Reference9 articles.
1. R. Cole. Slowing down sorting networks to obtain faster sorting algorithms.J. Assoc. Comput. Mach., 34(1):200–208, 1987.
2. R. Cole, M. Sharir, and C. Yap. Onk-hulls and related problems.SIAM J. Comput., 16: 61–77, 1987.
3. H. Edelsbrunner.Algorithms in Combinatorial Geometry. Springer-Verlag, New York, 1987.
4. S. Jadhav and A. Mukhopadhyay. Designing optimal geometric algorithms using partial sorting networks. Technical Report TRCS-93-165, Indian Institute of Technology, Kanpur, 1993. Accepted in the Third National Seminar on Theoretical Computer Science, 1993, Kharagpur, India.
5. J. Matoušek. Approximations and optimal geometric divide-and-conquer.Proc. 23rd Annual ACM Symposium on Theory of Computing, pages 505–511, 1991.
Cited by
38 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Positive-unlabeled learning identifies vaccine candidate antigens in the malaria parasite Plasmodium falciparum;npj Systems Biology and Applications;2024-04-27
2. Digital Twins for Distributed Collaborative Work in Shared Production;2022 IEEE International Conference on Artificial Intelligence and Virtual Reality (AIVR);2022-12
3. Byzantine Resilient Distributed Learning in Multirobot Systems;IEEE Transactions on Robotics;2022-12
4. Optimal Algorithms for Geometric Centers and Depth;SIAM Journal on Computing;2022-05-19
5. Centerpoint Query Authentication;Proceedings of the 30th ACM International Conference on Information & Knowledge Management;2021-10-26