This is my solo project for the course CS163 of HCMUS's APCS. The application can visualize hash table, binary tree, AVL tree, 2-3 tree, 2-3-4 tree, heap, trie, and graph.

Abstract: This paper considers the basic question of how strong of a probabilistic guarantee can a hash table, storing $n(1+\Theta(1))\log n$-bit key/value pairs ...

Main memory compression has re-emerged as a viable solution to DRAM cost challenges, enabled by CXL memory devices that support hardware-managed, coarse-grained compression. This shift decouples ...

MOSCOW, Feb 4 (Reuters) - Russia's foreign ministry said on Wednesday that a proposal to remove uranium from Iran as part of a deal to ease U.S. concerns was still on the table, but that it was for ...