Streams - The Data Structure We Need
Explore streams, a powerful data structure, with history, real-world demos, and JavaScript examples. Learn about IO streams, ES6 generators, and current developments to enhance your programming skills.
Visualizing Persistent Data Structures
Explore persistent data structures through interactive animations, developing intuition for complex structures and their evolution over time while examining various properties and use cases.
Waterpark - Distributed Actors vs the Pandemic
Explore how HCA Healthcare's Waterpark platform, built with ErlangVM and Elixir, revolutionized healthcare integration during COVID-19. Learn about actor models, continuous availability, and innovative tech solutions in a Fortune 100 company.
Babel - An Untyped, Stack-based HLL
Explore Babel, an untyped stack-based language with unique features for containerization, code execution policies, and data visualization. Learn its philosophy and capabilities for efficient programming and cloud computing.
Advanced Techniques for Real Time Detection of Polymorphic Malware
Explore advanced techniques for detecting polymorphic malware in real-time, including approximation matching algorithms and bloom filters. Compare efficiency and performance of various methods for fast identification and classification.
Optimizations for Bitcoin Key Cracking
Explore optimizations for Bitcoin key cracking, covering cryptographic concepts, algorithms, and techniques to enhance security and efficiency in cryptocurrency systems.
ATGP - radBIOS - Wireless Networking with Audio
Explore wireless networking using audio signals, covering PSK31 encoding, Fourier transforms, and data structures. Learn innovative techniques for airgap communication and content-addressable storage.
SyScan360'16 Singapore - Key Value Injections Here
Explore key value injections, their impact on serialization, and implications for React and CouchDB in this technical deep dive.
Abusing Normality - Data Exfiltration in Plain Site
Explore stealthy data exfiltration techniques using everyday system objects and processes. Learn to identify and defend against sophisticated attacks that leverage normal-looking channels for malicious purposes.
Adjacency Labelling for Planar Graphs - and Beyond
Explore adjacency labelling for planar graphs, covering universal graphs, labeling schemes, and the Strong Graph Product. Learn about binary search trees and their applications in graph theory.
Polynomial Data Structure Lower Bounds in the Group Model
Explore polynomial data structure lower bounds in the group model, covering static structures, lower bounds, models, and efficiency concepts. Insights on k-wise independence and derandomization.
Lazy Search Tree
Explore lazy search trees, a novel data structure for efficient sorted dictionaries. Learn about its design, complexity analysis, and potential applications in computer science.
2D Fractional Cascading on Axis-Aligned Planar Subdivisions
Explore advanced data structures for efficient querying in planar subdivisions, focusing on 2D fractional cascading techniques and their applications in computational geometry.
The Coin Problem with Applications to Data Streams
Explore the Coin Problem's applications to data streams, covering previous works, counting techniques, information cost, and proof overview.
Breaking and Protecting Linux Kernel Stack
Explore Linux kernel stack vulnerabilities, existing protections, and potential improvements like RANDOMIZE_KSTACK_OFFSET. Gain insights into security measures and performance implications.
Future of FoundationDB Storage Engines
Explore FoundationDB's storage engine, its distributed architecture requirements, and a new design offering higher write throughput, smaller space footprint, and configurable long-running read transactions.
Kernel Hardening - Protecting the Protection Mechanisms
Explore kernel hardening techniques to protect critical Linux subsystems. Learn about read-only and rare-write memory allocation, and how to integrate these features into popular data structures for enhanced security.
The Linux Maple Tree
Explore the Maple Tree, a new Linux data structure optimized for modern CPUs, offering efficient index range storage and outperforming existing solutions.
The Shadow Nemesis - Inference Attacks on Efficiently Deployable, Efficiently Searchable Encryption
Explore inference attacks on searchable encryption, focusing on Bloom filters and graph matching techniques to compromise data confidentiality in encrypted databases.
Edit Distance in Near-Linear Time - It’s a Constant Factor
Explore efficient algorithms for computing edit distance, focusing on near-linear time solutions and constant factor improvements in computational complexity.
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Explore cut-equivalent trees and their optimality for min-cut queries, covering algorithms, data structures, and approximation techniques in graph theory.