Tags: algorithm*

0 bookmark(s) - Sort by: Date ↓ / Title /

  1. A young computer scientist at Rutgers University, along with his former professor and a colleague from Carnegie Mellon University, has disproved a 40-year-old conjecture in data science related to hash tables, showing that a new type can achieve faster search times than previously thought possible.

    Andrew Krapivin, an undergraduate student at Rutgers University, along with his colleagues Martín Farach-Colton and William Kuszmaul, has challenged a 40-year-old conjecture by demonstrating that a new type of hash table can perform searches and insertions faster than previously thought possible. Their invention, inspired by "tiny pointers," contradicts a long-standing assumption that the time complexity for these operations would be proportional to the table's fullness (measured as x). Instead, they found that the time complexity for their new hash table is proportional to (log x)^2, which is significantly faster. Additionally, their study also refutes another conjecture regarding the average time taken for queries in non-greedy hash tables, showing that a constant average query time is achievable regardless of the table's fullness.

  2. A method called location arithmetic, first described by John Napier in 1617, uses a checkerboard to perform various mathematical calculations, including multiplication, division, and taking the square root, by breaking numbers into their binary equivalents and moving markers around the board.

    2025-01-04 Tags: , , , by klotz
  3. 2016-04-30 Tags: , , by klotz
  4. 2015-08-19 Tags: , , by klotz

Top of the page

First / Previous / Next / Last / Page 1 of 0 SemanticScuttle - klotz.me: tagged with "algorithm"

About - Propulsed by SemanticScuttle