Viewing profile — nicknash

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 th…

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 abov…

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-ha…

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 cha…

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 cha…

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 a…

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 wel…

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 expe…

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…

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…

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…

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 …

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…

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 use…

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...

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 rec…