0x23

4 ms·

1.
Show HN: Agentic Algorithm Engineering(github.com)
1 points by 0x23 7mo ago|0 comments
2.
by 0x23 4y ago
There also has been a lot research lately in the field. For example, [1,2] has a lot of new methods on concurrent or space efficient hash tables. [1] http://algo2.iti.kit.edu/maier.php [2] https://github.com&#x2F
3.
by 0x23 5y ago
I use jump commands: export MARKPATH=$HOME/.marks function jump { cd -P $MARKPATH/$1 2>/dev/null || echo "No such mark: $1" } function ju { cd -P $MARKPATH/$1 2>/dev&#x
4.
by 0x23 6y ago
On that note, here is the currently fastest implementation for the problem https://arxiv.org/abs/1808.05458 and here on github https://github.com/viecut/viecut
5.
Show HN: KaHIP v3.00 is out now(github.com)
2 points by 0x23 6y ago|1 comments
6.
by 0x23 6y ago
We are proud to announce the release of a major update of our graph partitioning framework KaHiP (Karlsruhe High Quality Graph Partitioning). KaHiP is a family of high quality graph partitioning programs. It contains various graph partition
7.
KaMIS – Finding Large Independent Sets Fast(github.com)
1 points by 0x23 6y ago|0 comments
8.
Open Source Sharding(github.com)
2 points by 0x23 7y ago|0 comments
9.
Show HN: Communication-Free Distributed Graph Generators(github.com)
3 points by 0x23 7y ago|0 comments
10.
Do They Know Its Europe(dotheyknowitseurope.eu)
2 points by 0x23 7y ago|3 comments
11.
Ask HN: What was your best passive income in 2017?
3 points by 0x23 9y ago|0 comments
12.
Thrill: High-Performance Algorithmic Distributed Batch Data Processing with C++(arxiv.org)
4 points by 0x23 10y ago|0 comments