Differences
This shows you the differences between two versions of the page.
| Both sides previous revisionPrevious revisionNext revision | Previous revision | ||
| seminars [2025-08-13] – [XpLUTo: Modelling Bulk Parallel Processing in RAM via Lookup Tables] Martin Ziegler | seminars [2025-12-05] (current) – [Computing with the Millett-Ewing notation] Martin Ziegler | ||
|---|---|---|---|
| Line 14: | Line 14: | ||
| ===== 2025 ===== | ===== 2025 ===== | ||
| + | |||
| + | ====Computing with the Millett-Ewing notation==== | ||
| + | * December 12, time TBD | ||
| + | * N1 #422 or #110 | ||
| + | * Alexander Stoimenov (Dongguk U) | ||
| + | |||
| + | This talk gives some introduction about the notation of link diagrams developed by Millett-Ewing in the late 80s for calculating link polynomials. | ||
| + | I explain how this notation is used by Knotscape (for this see [[https:// | ||
| + | before giving some details on the Millett-Ewing algorithm and (my) several subsequent modifications and extensions. | ||
| ====XpLUTo: Modelling Bulk Parallel Processing in RAM via Lookup Tables==== | ====XpLUTo: Modelling Bulk Parallel Processing in RAM via Lookup Tables==== | ||