Session
Maximising Algorithm Performance in .NET: Levenshtein Distance
With performance tricks you may not know on an algorithm you may never have heard of before, be prepared to learn about my journey from different array structures to pointers, SIMD to threading, as we take the journey to maximum performance together.
Originally presented at .NET Conf 2020.
Preferred session duration: 30 minutes
Please note that Sessionize is not responsible for the accuracy or validity of the data provided by speakers. If you suspect this profile to be fake or spam, please let us know.
Jump to top