danalec

6 ms·

1.
by danalec 7mo ago
- 9 months and I did not find any code about DMMSY's method - 7950X3D has 96MB L3 cache and the the graph is very sparse and tree-like - The code is opensource and everyone is welcome to contribute. Thanks for the idea.
2.
by danalec 7mo ago
I did not. The html was generated by Deepseek. Claude is far way too expensive for that. This is only an experimental code. I don't think it is worth to pay Claude to test a code which was already peer reviewed theoretically.
3.
by danalec 7mo ago
7950X3D has 96MB L3 cache and the the graph is very sparse and tree-like. It reaches 20.000x without fast-math against supposed alledged "custom dijkistras" in my specific setup. And you're free to test against your own dijks
4.
Show HN: C99 implementation of new O(m log^(2/3) n) shortest path algorithm(github.com)
111 points by danalec 7mo ago|28 comments
5.
by danalec 7mo ago
I implemented the STOC 2025 Best Paper Award winner in C99. The algorithm achieves O(m log^(2/3) n) complexity, breaking the 65-year-old sorting barrier for sparse directed SSSP that Dijkstra established at O(m + n log n). *Key impleme
6.
by danalec 7y ago
will this mute filtering the twitter connector for feedly?
7.
Creating a site-to-site VPN with dynamic internet IP addresses with OPNSense(nwildner.com)
3 points by danalec 7y ago|0 comments
8.
by danalec 7y ago
systemd versus windows
9.
Chrome OS exploit: one byte overflow and symlinks(googleprojectzero.blogspot.com)
3 points by danalec 10y ago|0 comments
10.
Interesting Discussion on Lithium Battery Fire Hazard(mathscinotes.wordpress.com)
1 points by danalec 12y ago|0 comments
11.
by danalec 12y ago
I'm a sublime text 3 user too and I've been trying out slap: https://github.com/slap-editor/slap