This is a simplified implementation of Ethereum's modified Merkle Patricia Trie based on the Ethereum's yellow paper. It's written in golang. This implementation is simple because it doesn't involve ...

In the Iterative with full matrix version of Levenshtein distance[5] we can avoid a lot of work if we can process the words in order, so we never need to repeat a row for the same prefix of letters[4] ...

I've had this assignment over my head for months. I didn't finish it on time for one of my classes, so I pretty much abandoned it- planning to come back to it after the semester and get things working ...

Abstract: This paper presents a non-blocking Patricia trie implementation for an asynchronous shared-memory system using Compare&Swap. The trie implements a linearizable set and supports three update ...