« earlier | later » Page 1 of 2

"A qp trie is like a crit-bit trie (aka patricia trie) except each branch is indexed by a few bits at a time instead of one bit. The array of sub-tries at a branch node is compressed using the popcount trick to omit unused branches." I'm thinking about teaching crit-bit tries in CMP201 next year...

to cmp201 data-structures trie ... on 06 April 2017

A simplified version of the PATRICIA trie; allows the operations of a hash plus lexicographic lookup, with potentially better efficiency (although I guess you need to be careful about locality).

to associative data-structures djb hash tree ... on 17 December 2016

Exploring Binary - Binary Numbers, Binary Code, and Binary Logic edit / delete

A blog with infrequent posts, owing to its very specific subject. Posts include things like "How GLIBC’s strtod() Works". Actually very good, and probably of interest to students who're trying to remember those lectures I did about this kind of thing in the first year.

to ag0700 binary data-structures number numeric programming representation ... on 24 August 2014

A concrete illustration of practical running time vs big-O notation - The Old New Thing - Site Home - MSDN Blogs edit / delete

One for AG0803 students: why algorithmic complexity isn't everything in a world with complex memory architectures.

to ag0803 complexity data-structures memory optimisation performance ... on 13 August 2014

Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms edit / delete

"Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new two-lock queue algorithm in which one enqueue and one dequeue can proceed concurrently." From 1996.

to ag0803 concurrency data-structures nonblocking queue ... on 04 June 2014

Why Bloom filters work the way they do | DDI edit / delete

Good explanation of Bloom filters. (This'd be a nice example of a data structure to explain for FYP.)

to bloom data-structures fyp hash programming ... on 14 December 2013

High Scalability - High Scalability - Strategy: Stop Using Linked-Lists edit / delete

I keep making this point.

to ag0803 cache data-structures linked-list locality ... on 28 May 2013

andrewclegg/sketchy · GitHub edit / delete

Hashes with deliberate collisions for similar data in Python. This is the sort of thing I'm after for location-based hashing in a simulation framework.

to data-structures hash python simulation software ... on 27 May 2012

A Hash Function for Hash Table Lookup edit / delete

Actually quite a lot of them.

to data-structures hash maths programming ... on 27 February 2012

R-trees v6.pptx - Windows Live edit / delete

Using R-trees, with a view to efficient memory structure use on games consoles. (Eww at the link, but it does work OK in Firefox.)

to architecture data-structures games memory ... on 10 August 2010

« earlier | later » Page 1 of 2

- data-structures | |

1 | + ag0700 |

3 | + ag0803 |

1 | + architecture |

1 | + associative |

1 | + binary |

1 | + bloom |

1 | + cache |

1 | + cmp201 |

1 | + complexity |

1 | + concurrency |

1 | + djb |

1 | + fyp |

1 | + games |

4 | + hash |

1 | + linked-list |

1 | + locality |

1 | + maths |

2 | + memory |

1 | + nonblocking |

1 | + number |

1 | + numeric |

1 | + optimisation |

1 | + performance |

3 | + programming |

1 | + python |

1 | + queue |

1 | + representation |

1 | + simulation |

1 | + software |

1 | + tree |

1 | + trie |

tasty by Adam Sampson.