Y
HN Search
Hacker News Search
new
|
comments
|
top
|
jobs
nicknash
searching PlanetScale…
1.
▲
2.
▲
3.
▲
4.
▲
5.
▲
6.
▲
6 ms
·
1.
▲
I guess we live in the P = NP world after all
(nicknash.github.io)
2 points
by
nicknash
9d ago
|
0 comments
2.
▲
Intellectual Wastelands
(nicknash.github.io)
4 points
by
nicknash
1mo ago
|
0 comments
3.
▲
by
nicknash
1y ago
I wonder if you can clear up a memory of mine from IOI 2001. The first day results were delayed, and I seem to remember this is because a contestant encoded the search in one of the problems into a compile time c++ template metaprogram. On
4.
▲
by
nicknash
2y ago
How about this: What is the most efficient algorithm to generate an N x N array of the integers 0,1,2, … such that each entry is the smallest such integer not appearing either above in the same column, or to the left in the same row? Postin
5.
▲
by
nicknash
2y ago
A fun fact: Each point in the XOR texture is the smallest integer not appearing above it, or to its left (Ducking while posting my own blog: https://nicknash.me/2012/10/26/happy-halloween/ )
6.
▲
by
nicknash
2y ago
Asymptota.com (Sofia/Dubai) | ONSITE We are a next generation quant trading firm. We aim to be at the leading edge of automation and believe we have an excellent opportunity to challenge more established, larger, less automated incumbe
7.
▲
by
nicknash
3y ago
Asymptota.com (Sofia/Dubai) | ONSITE We are a next generation quant trading firm. We aim to be at the leading edge of automation and believe we have an excellent opportunity to challenge more established, larger, less automated incumbe
8.
▲
by
nicknash
3y ago
Asymptota.com ONSITE (Sofia/Dubai). Remote for truly exceptional candidates. We are a next generation quant trading firm, automating further up the chain than the competition. We are well capitalised, successful and looking for develop
9.
▲
by
nicknash
3y ago
Asymptota.com (Sofia/Dubai). Remote for truly exceptional candidates. We are a next generation quant trading firm. We automate further up the chain than our competition. We are well capitalised, successful and looking for developers, t
10.
▲
by
nicknash
3y ago
ASYMPTOTA.COM (Dubai, ON-SITE) Looking for exceptional quant-trader to join our highly successful HFT firm. You’ll be joining a small, fun, highly collaborative team with deep experience in the most competitive trades on the planet. Feel fr
11.
▲
by
nicknash
3y ago
Asymptota.com (Sofia/Dubai) | Hybrid We are a next generation quant trading firm. We are well capitalised, successful and looking for developers, traders and quants. It’s ok if you want to straddle those roles. We’re still less than 10
12.
▲
by
nicknash
3y ago
Asymptota.com (Sofia/Dubai). Remote for exceptional candidates. We are a next generation quant trading firm. We are well capitalised, successful and looking for developers, traders and quants. It’s ok if you want to straddle those role
13.
▲
by
nicknash
3y ago
Asymptota.com (Sofia/Dubai). Remote for exceptional candidates. We are a next generation quant trading firm. We are well capitalised, successful and looking for developers, traders and quants. It’s ok if you want to straddle those role
14.
▲
Speculating About Store Buffer Capacity
(nicknash.me)
2 points
by
nicknash
8y ago
|
0 comments
15.
▲
Show HN: RelaSharp: Lock and wait free C# with (a little more) confidence
(github.com)
1 points
by
nicknash
9y ago
|
0 comments
16.
▲
by
nicknash
9y ago
For lock-free data structures, how does this verification encode the memory model? E.g. high-quality model checkers for the C++11 memory model allow for outcomes inconsistent with the execution order of the code (in addition to outcomes tha
17.
▲
Graph Isomorphism in Quasi-polynomial time
(math.uchicago.edu)
6 points
by
nicknash
11y ago
|
1 comments
18.
▲
Is the hot hand fallacy a fallacy?
(rjlipton.wordpress.com)
12 points
by
nicknash
11y ago
|
2 comments
19.
▲
Is the hot hand fallacy a fallacy?
(rjlipton.wordpress.com)
2 points
by
nicknash
11y ago
|
1 comments
20.
▲
by
nicknash
11y ago
Sure. I didn't actually mean ssssort. Sometimes it's worth distinguishing between comparison based sorts, and those that make use of key structure, assume a fixed size key universe etc For that reason, I think considering sampling
21.
▲
by
nicknash
11y ago
Very cool. In my experience, using a skewed pivot doesn't actually help in practice. Outside of the case you mention (where the input is a random permutation), sampling must be used to choose a skewed pivot, which has a fairly signific
22.
▲
A Few Notes about HFT as a Business and the Virtu IPO
(mechanicalmarkets.wordpress.com)
2 points
by
nicknash
11y ago
|
0 comments
23.
▲
Bitcoin, in its own Universe?
(tr8dr.wordpress.com)
1 points
by
nicknash
12y ago
|
0 comments
24.
▲
Bitcoin Needs Cross Exchange Prime Brokerage
(tr8dr.wordpress.com)
2 points
by
nicknash
12y ago
|
0 comments
25.
▲
by
nicknash
12y ago
I think this blog post is also quite a nice write-up of this puzzle, and it includes generalizations: https://ocfnash.wordpress.com/2009/10/31/yet-another-prisone...
26.
▲
by
nicknash
12y ago
I find this article pretty void of content. The title is a bit of a give way - to people who work in the space the "Flash Boys" book is easy to see as atrociously inaccurate. I recommend considering the detailed rebuttal to this t
27.
▲
Dealing with Failure: The way of the M**ad
(nicknash.me)
2 points
by
nicknash
12y ago
|
0 comments
28.
▲
Bitcoin's microstructure is dangerous for sellers
(medium.com)
2 points
by
nicknash
12y ago
|
0 comments
29.
▲
by
nicknash
12y ago
One semi-interesting thing here is that the "killer adversary" described on that page requires knowing that the algorithm you're trying to exploit is quicksort. Long ago, I wrote adversaries that attempt to force _any_ algori
30.
▲
New App Lets You Play Top Trumps With Your 23andMe Data
(appsto.re)
2 points
by
nicknash
13y ago
|
0 comments
More ›