Johan Sivertsen

Ph.D. student at the IT-University. Copenhagen.

[Johan Sivertsen @johanvts]

My colleague Thomas started blogging. https://t.co/g2O2e0o8w7 via @wordpressdotcom

[Johan Sivertsen @johanvts]

@hack4dk more battles at http://t.co/JkZy0H18Tt

[Johan Sivertsen @johanvts]

At #hack4dk today

[Johan Sivertsen @johanvts]

Google patents classification: http://t.co/qjM6Q98hyx

[Morten Østergaard @oestergaard]

Afgifter på engelske ord i reklamer? Joke? Computer og jazz? Grænsebom, engelsk-forbud på udd. Smil til Verden Tulle. http://t.co/OXoiwr8Pil

[Robin Neatherway @rneatherway]

#emacs mode for #fsharp 1.5.3 is out with multiple bugfixes for Windows. Any issues please report at http://t.co/bLg81hWJp9

[Johan Sivertsen @johanvts]

@isaac_abraham Thanks, yes I'm creating a whole bunch of them. I will look into tasks.

[Johan Sivertsen @johanvts]

#fsharp async tasks running in parallel inside async tasks running in parallel -> CPU utilization drops to ~1%. Any good ideas or sources?

[ITUScalableSimSearch @ERC_SSS]

@ERC_SSS is 1 year old!

[Johan Sivertsen @johanvts]

@dsyme Will you be able to split a module over multiple files in #fsharp 4.0?

[Johan Sivertsen @johanvts]

@SauropodStudio wow, this is great. Congratulations!

[Todd @toddanglin]

Forget startup name generators. This generates everything.

“A random startup generator"
http://t.co/egLIGOy6kH

[ITUScalableSimSearch @ERC_SSS]

Ilya Razenshteyn, MIT, visiting @ERC_SSS this week. Talk Tuesday 10.30, 3A08: Optimal Data-Dependent Hashing for Approximate Near Neighbors

[Johan Sivertsen @johanvts]

Razenshteyn speaks about Optimal Data-Dependent ANN next week: http://t.co/quGc08U4Ed

[Johan Sivertsen @johanvts]

@GregersP ingen kø ved lån og spar på Amagerbrogade.

[Johan Sivertsen @johanvts]

@jonharrop I'm a firm believer in that second last 'misconception'. Maybe not good as an IDE in many cases, but what can beat it for latex?

[Johan Sivertsen @johanvts]

@marten_range sounds interesting, open source?

[Johan Sivertsen @johanvts]

Construction time O(n log n), Storage O(n), Query O(log n)

[Johan Sivertsen @johanvts]

@sforkmann Yes, thanks. Really nice collection of collections, but I was interested in R/B tree specifically, just to see how it's done.

[Johan Sivertsen @johanvts]

@sforkmann Thanks. Set handles the task, but Okasaki sold me with his R/B impl, and then I fell down the rabbit hole trying to do delete.