共 50 条
- [41] Computing Minimal Triangulations in Time O(nα log n) = o(n2.376) PROCEEDINGS OF THE SIXTEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2005, : 907 - 916
- [42] An O((log log n)2) time convex hull algorithm on reconfigurable meshes FIRST MERGED INTERNATIONAL PARALLEL PROCESSING SYMPOSIUM & SYMPOSIUM ON PARALLEL AND DISTRIBUTED PROCESSING, 1998, : 439 - 446
- [47] Solving the string statistics problem in time O(n log n) AUTOMATA, LANGUAGES AND PROGRAMMING, 2002, 2380 : 728 - 739
- [48] Sorting Signed Permutations by Inversions in O(n log n) Time RESEARCH IN COMPUTATIONAL MOLECULAR BIOLOGY, PROCEEDINGS, 2009, 5541 : 386 - +
- [49] Removal of NO in NO/N2, NO/N2/O2, NO/CH4/N2, and NO/CH4/O2/N2 systems by flowing microwave discharges JOURNAL OF PHYSICAL CHEMISTRY A, 2007, 111 (06): : 1057 - 1065