https://cp-algorithms.com/geometry/point-location.html
Point location in O(log n) - Algorithms for Competitive Programming
The goal of this project is to translate the wonderful resource http://e-maxx.ru/algo which provides descriptions of many algorithms and data structures...
log npointlocationalgorithmscompetitive
https://eprints.lancs.ac.uk/id/eprint/236153/
Distributed MIS in O (log log n ) Awake Complexity - Lancaster EPrints
log ndistributedmisawakecomplexity
https://www.educative.io/courses/decode-coding-interview-python/diy-single-element-in-a-sorted-array
Find Single Element in Sorted Array Using O(log n) Solution
Learn to find the unique single element in a sorted array where all other elements appear twice, using an efficient O(log n) time complexity algorithm.
log nfindsingleelementsorted
https://nps.nikonimaging.com/technical_info/technical_solutions/z7_2_z6_2_tips/filming_n-log_footage/
Z 7II/Z 6II TIPS - Filming N-Log Footage | Technical Solutions | Nikon Professional Services
https://downloadcenter.nikonimglib.com/bg/download/sw/274.html
Nikon | Download center | RWG/Log3g10 to Rec2020/N-Log LUT
download centernikonrwgloglut
https://asu.elsevierpure.com/en/publications/on-log-n-average-time-algorithm-for-shortest-network-under-a-give/
O(n log n)-average-time algorithm for shortest network under a given topology - Arizona State...