Viewing profile — tbingmann
tbingmann
HN member- Joined
- Sat, Mar 15, 2014, 6:41 PM UTC
- HN karma
- 91
- Public activity
- 12 items
- HN profile
- View on Hacker News ↗
About tbingmann
No profile information was provided.
Recent public activity
-
comment
Comment #15027470
KPI #1: actually know something about your technology
-
comment
Comment #13227392
Interesting. I have a theory that most historic shifts are mainly due to some technological advancement or invention, and not mainly due to politics. For example, Nazi Germany may …
-
comment
Comment #12215514
There is (at least) one important missing: the Simplex Algorithm, or more generally algorithms for solving linear programs (LPs). These are used every day to optimize highly comple…
-
comment
Comment #10385780
Sorry, but this is another really bad comparison to Venice. These cities have nowhere near the history of Venice as a medieval trade metropolis, nor are they actually built on isla…
-
comment
Comment #10297043
Whenever I read something like this I have a bad feeling about it. They are trying to get "C/C++" performance in Java by bypassing all the JVM's management and garbage collection. …
-
comment
Comment #10280450
Best ask them first via email.
-
comment
Comment #10280155
Slack, Zulip, this feels like we are back in 1999, when the internet was divided by ICQ, AOL Instant Messanger, Windows Live Messanger, and Yahoo Messanger. (Instant/Live was a plu…
-
comment
Comment #8442042
Looks like a list of familiar titles. I already read 19 of the 32, do I have to worry? They were very good books, though.
-
comment
Comment #8272814
It has electrolytes!
-
comment
Comment #8252582
The article is completely by side the point. He's basically ranting about how they can't test systemd on all distros, because every distro does things differently. How to fix it? V…
-
comment
Comment #7406473
I made a video of how the algorithm works: http://youtu.be/NjcSyD7p660 To make it I needed a C++ version with iterators, which I though would be faster. But it is still about 20% s…
-
comment
Comment #7405694
In a nutshell: to keep an index into an array of size n requires log_2(n) bits. Thus any algorithm, which keeps even just one index into the input takes Omega(log n) space. Yay for…