The Stony Brook Algorithm Repository
This WWW page is intended to serve as a comprehensive collection of algorithm implementations for over seventy of the most fundamental problems in combinatorial algorithms. The problem taxonomy, implementations, and supporting material are all drawn from my book The Algorithm Design Manual. Since the practical person is more often looking for a program than an algorithm, we provide pointers to sol
Nonblocking Algorithms and Scalable Multicore Programming - ACM Queue
June 11, 2013 Volume 11, issue 5 PDF Nonblocking Algorithms and Scalable Multicore Programming Exploring some alternatives to lock-based synchronization Samy Al Bahra, AppNexus Real-world systems with complicated quality-of-service guarantees may require a delicate balance between throughput and latency to meet operating requirements in a cost-efficient manner. The increasing availability and decr
Robin Hood Hashing should be your default Hash Table implementation
A Random Walk Through Geek-Space Brain dumps and other ramblings from Sebastian Sylvan Robin Hood Hashing should be your default Hash Table implementation 8/May 2013 There’s a neat variation on open-addressing based hash tables called Robin Hood hashing. This technique isn’t very well-known, but it makes a huge practical difference because it both improves performance and space utilization compare
Proof of work - Wikipedia
Proof of work (also written as proof-of-work, an abbreviated PoW) is a form of cryptographic proof in which one party (the prover) proves to others (the verifiers) that a certain amount of a specific computational effort has been expended.[1] Verifiers can subsequently confirm this expenditure with minimal effort on their part. The concept was first implemented in Hashcash by Moni Naor and Cynthia
Non-blocking algorithm - Wikipedia
In computer science, an algorithm is called non-blocking if failure or suspension of any thread cannot cause failure or suspension of another thread;[1] for some operations, these algorithms provide a useful alternative to traditional blocking implementations. A non-blocking algorithm is lock-free if there is guaranteed system-wide progress, and wait-free if there is also guaranteed per-thread pro
Quick Post: Should you ever use Linked-Lists? | Future Chips
This question has been bugging me for the last few days. Why would anyone use a linked-list instead of arrays? I argue that linked lists have become irrelevant in the context of a modern computer system. I have asked around a few colleagues and I include their counter arguments and my rebuttal for your reference. Please point out if I am missing something. Lists have several disadvantages that did
Dictionary of Algorithms and Data Structures
absolute performance guarantee abstract data type (a,b)-tree accepting state Ackermann's function active data structure acyclic directed graph: see directed acyclic graph acyclic graph adaptive heap sort adaptive Huffman coding adaptive k-d tree adaptive sort address-calculation sort adjacency-list representation adjacency-matrix representation adjacent admissible vertex ADT: see abstract data typ
Erasure code - Wikipedia
In coding theory, an erasure code is a forward error correction (FEC) code under the assumption of bit erasures (rather than bit errors), which transforms a message of k symbols into a longer message (code word) with n symbols such that the original message can be recovered from a subset of the n symbols. The fraction r = k/n is called the code rate. The fraction k’/k, where k’ denotes the number
2–3 tree - Wikipedia
In computer science, a 2–3 tree is a tree data structure, where every node with children (internal node) has either two children (2-node) and one data element or three children (3-node) and two data elements. A 2–3 tree is a B-tree of order 3.[1] Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements.[2][3] 2–3 trees were invented by John Hopcroft in 1970.[4] 2
Big Data Counting: How to count a billion distinct objects using only 1.5KB of Memory - High Scalability -
The table shows that we can count the words with a 3% error rate using only 512 bytes of space. Compare that to a perfect count using a HashMap that requires nearly 10 megabytes of space and you can easily see why cardinality estimators are useful. In applications where accuracy is not paramount, which is true for most web scale and network counting scenarios, using a probabilistic count
How to implement an algorithm from a scientific paper | Code Capsule
Hi, I’m Emmanuel! I’m the author of this blog. I am a Senior Director of Software Engineering at mambu.com, and I’m based in Amsterdam, Netherlands. This article is a short guide to implementing an algorithm from a scientific paper. I have implemented many complex algorithms from books and scientific publications, and this article sums up what I have learned while searching, reading, coding and de
リリース、障害情報などのサービスのお知らせ
最新の人気エントリーの配信
j次のブックマーク
k前のブックマーク
lあとで読む
eコメント一覧を開く
oページを開く
CSE214 Help / FAQ
Introducing Mintomic: A Small, Portable Lock-Free API
What are the most known database disk storage layout algorithms?
Binary Indexed Tree.
Geo-replication - Wikipedia
ReiserFS
Lock-Free Algorithms For Ultimate Performance
DataScienceCentral.com - Big Data News and Analysis
Algorithms and Techniques Menu