Subject
General Computer Science,Theoretical Computer Science
Reference17 articles.
1. The Art of Computer Programming;Knuth,1968
2. The Design and Analysis of Algorithms;Aho,1974
3. M. Ajtai, J. Komlos, E. Szemeredi, An O(nlogn) sorting network, in: Proc. 15th ACM Symp. on Theory of Computing, 1983, pp. 1–9
4. K. Batcher, Sorting networks and their applications, in: Proc. of the AFIPS Spring Joint Comput. Conf., 1968, pp. 307–314
5. Algorithms for reporting and counting geometric intersections;Bentley;IEEE Transactions on Computers,1979
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. A Low Arithmetic-Degree Algorithm for Computing Proximity Graphs;International Journal of Computational Geometry & Applications;2018-09