Extendible hashing is a type of hash system which treats a hash as a bit string and uses a trie for bucket lookup. Because of the hierarchical nature of the system, re-hashing is an incremental operation (done one bucket at a time, as needed). This means that time-sensitive applications are less affected by table growth than by standard full-table rehashes. Extendible hashing was described by Ronald Fagin in 1979. Practically all modern filesystems use either extendible hashing or B-trees. In particular, the Global File System, ZFS, and the SpadFS filesystem use extendible hashing. (Wikipedia).
An informal introduction to cryptography. Part of a larger series teaching programming at http://codeschool.org
From playlist Cryptography
Learn how to read key-value pairs from a text file into a HashMap.
From playlist Intermediate Java
Cryptographic Hash Function - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Double Hash Solution - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Compute E Solution - Applied Cryptography
This video is part of an online course, Applied Cryptography. Check out the course here: https://www.udacity.com/course/cs387.
From playlist Applied Cryptography
Cryptographic Hash Functions: Part 1
Cryptographic Hash Functions Applications of Crypto Hash Functions Birthday Problem Secure Hash Algorithm (SHA)
From playlist Network Security
12_2_1 Taylor Polynomials of Multivariable Functions
Now we expand the creation of a Taylor Polynomial to multivariable functions.
From playlist Advanced Calculus / Multivariable Calculus
RubyConf 2022: Don't @ me! Faster Instance Variables with Object Shapes by Aaron Patterson
Instance variables are a popular feature of the Ruby programming language, and many people enjoy using them. They are so popular that the Ruby core team has done lots of work to speed them up. But we can do even better to speed them up by using a technique called "Object Shapes". In this p
From playlist RubyConf 2022: Mini and Houston
Lecture 19: Bitcoin MIT 6.824: Distributed Systems (Spring 2020) https://pdos.csail.mit.edu/6.824/
From playlist MIT 6.824 Distributed Systems (Spring 2020)
Lecture 19 | Programming Methodology (Stanford)
Lecture by Professor Mehran Sahami for the Stanford Computer Science Department (CS106A). Professor Sahami reintroduces interfaces and elaborates on the topic. CS106A is an Introduction to the engineering of computer applications emphasizing modern software engineering principles: objec
From playlist Course | Programming Methodology
DEFCON 15: Security by Politics - Why it will never work
Speaker: Lukas Grunwald CTO of DN-Systems Enterprise Internet Solutions GmbH This talk will show what happens if security is driven by politics and compromise, also I will cover additional security risks by the new generation of electronic passports. It will show why it could be possib
From playlist DEFCON 15
DeepSec 2007: Audit of the RFID ePassport and the concept
Thanks to the DeepSec organisation for making these videos available and let me share the videos on YouTube. Speaker: Lukas Grunwald, Neo Catena Networks Inc. After some introduction to the RFID technology and security risks, a deep technical overview of the risks and audit methodology w
From playlist DeepSec 2007
UHCL 36a Graduate Database Course - Linear Hashing - Part 1
This video corresponds to the unit 7 notes for a graduate database (DBMS) course taught by Dr. Gary D. Boetticher at the University of Houston - Clear Lake (UHCL). The focus is on physical database design. This video looks at linear hashing. This is part 1 of 2.
From playlist UHCL Graduate Database Course
RubyConf 2010 - Each: A Brief History of Iteration by: Rein Henrichs
You know that Ruby has powerful tools for iteration, but do you know from whence they came? Do you know how to take advantage of them for strike world domination /strike your own uses? Take a journey through languages of yore. Slay dragons and save the... Ok, there won't be dragons. But
From playlist RubyConf 2010
ShmooCon 2013: DIY: Using Trust To Secure Embedded Projects
For more information and to download the video visit: http://bit.ly/shmoocon2013 Playlist ShmooCon 2013: http://bit.ly/Shmoo13 Speakers: Teddy Reed and David Anthony This presentation and paper provides a DIY guide to using Trusted Computing on embedded devices. This is NOT an introducti
From playlist ShmooCon 2013
Ruby Conf 12 - Ruby 2.0 on Rails by Akira Matsuda
Ruby 2.0 is coming very soon. The specification is fixed, and the first stable release will be in production in several months. Now is the time to get prepared for 2.0 What new features are available in 2.0? How can our code, and lives be improved by these new features? Where are the exa
From playlist Ruby Conference 2012
Get the Code Here: http://goo.gl/srwIf Welcome to my Java Hash Table tutorial. A Hash Table is a data structure offers fast insertion and searching capabilities. The negative is that they are limited in size because they are based on arrays. They are also hard to order. People get confus
From playlist Java Algorithms
MountainWest RubyConf 2008 - Ruby Internals by: Patrick Farley
Ruby Internals by: Patrick Farley
From playlist MountainWest RubyConf 2008