Bannalia: trivial notes on themes diverse
Wednesday, April 2, 2014
Complexity of lexicographical comparison: part II
›
Let S N,L the equiprobable sample space of strings of length L ≥ 1 over an alphabet A of N ≥ 2 symbols. For instance, S 2,3 with A = ...
Monday, March 31, 2014
Already/still
›
"Already" refers to some condition C that has begun in the past and is still in effect, in practical terms or with regard to its...
Friday, March 28, 2014
Complexity of lexicographical comparison
›
Given two strings s , s' , determining whether s < s' under a lexicographical order takes a number of steps 1 ≤ C ≤ 1 + mi...
2 comments:
Saturday, March 15, 2014
Monads and slots
›
Monadic lifting and slot-based programming can be combined in pleasant ways. The key idea is: if T is a type with a slot-based interface...
Sunday, March 9, 2014
Monadic lifting in C++
›
Monadic lifting is the process of transforming a ( curryed ) n -ary function f : T 1 → T 2 → ··· → T n → R into a function lift M...
Saturday, January 18, 2014
A better hash table: Clang
›
After Microsoft Visual Studio 2012 and GCC 4.8.2 , we now provide the results of our performance test suite for C++ unordered associative ...
3 comments:
Friday, January 17, 2014
A better hash table: GCC
›
As a continuation of our previous entry in the performance of various implementations of C++ unordered associative containers, Thomas Goyn...
‹
›
Home
View web version