Parameterized Inapproximability of the Minimum Distance Problem over All Fields
Explores inapproximability of Minimum Distance Problem for linear codes over finite fields, proving W[1]-hardness. Extends results to Shortest Vector Problem on integer lattices.
Coding Theory in Almost Linear Time and Sublinear Space
Explore efficient error-correcting codes with near-linear time and sub-linear space encoding/decoding algorithms. Learn about innovative techniques in hashing, locally correctable codes, and derandomization.
Asymptotically-Good RLCCs with (log n)^{2+o(1)} Queries
Explore asymptotically good relaxed locally correctable codes with improved query complexity, advancing error-correcting code theory through novel techniques and insights.
Constant Query Local Decoding Against Deletions Is Impossible
Explores impossibility of constant query locally decodable codes in deletion settings, contrasting with substitution errors. Proves non-existence, impacting error-correcting code theory.
Gilbert and Varshamov Meet Johnson - List Decoding Nearly-Optimal Binary Codes
Explore advanced error-correcting codes, focusing on Ta-Shma's breakthrough and improved list-decoding algorithms that approach the Johnson bound for binary codes with optimal distance and rate.
List Decoding of Tanner and Expander Amplified Codes
Explore advanced error-correcting code techniques, focusing on list decoding for Tanner and expander amplified codes, with insights from Shashank Srivastava's research.
An Efficient Quantum Factoring Algorithm - Quantum Colloquium
Explore a groundbreaking quantum factoring algorithm that outperforms Shor's algorithm, using fewer quantum gates and classical post-processing to factorize large integers more efficiently.
Zero Knowledge and Advanced Cryptography - Sessions from PKC 2024
Explore cutting-edge cryptography topics in Zero Knowledge and Advanced Crypto sessions from PKC 2024, featuring expert presentations on latest research and innovations.
Quantum Constraint Satisfaction - Richard M. Karp Distinguished Lecture
Explore quantum Hamiltonian complexity, comparing it to classical constraint satisfaction. Learn about QMA-completeness, search-to-decision, dichotomy theorems, and coping with QMA-hardness in quantum applications.
Proving an Execution of an Algorithm Correct - Ad Hoc UNSAT Verification
Explore algorithm correctness verification, focusing on cases where no solution exists. Learn about "ad hoc UNSAT verification" and its application in theorem proving.
SNARKs - Advances in Zero-Knowledge Proofs
Explore cutting-edge developments in SNARKs (Succinct Non-Interactive Arguments of Knowledge) at this Eurocrypt 2024 session, chaired by Aggelos Kiayias.
Community Keynote - Polinho Mota
Explore the intersection of technology, ethics, and society with insights from Polinho Mota in this thought-provoking keynote address at FAccT '24.
C Language Tutorial for Beginners
Comprehensive C programming tutorial with hands-on practice, projects, and supplementary materials. Learn from basics to advanced concepts through structured chapters and practical exercises.
Extremely Simple Single Server PIR with Sublinear Server Computation - Lecture 220
Explore an innovative approach to Private Information Retrieval (PIR) that achieves sublinear server computation, enhancing efficiency and privacy in data retrieval systems.
Efficient Design and Implementation of Polynomial Hash Functions over Prime Fields
Explore efficient design and implementation techniques for polynomial hash functions in prime fields, enhancing cryptographic security and performance.
A High-Performance Design, Implementation, Deployment, and Evaluation of The Slim Fly Network
Explore the first real-world Slim Fly network installation, offering cost and power advantages over traditional topologies. Learn about deployment, management, and performance analysis of this innovative low-diameter network.
Finding Adversarial Inputs for Heuristics Using Multi-level Optimization
Discover MetaOpt: a system for analyzing heuristics in production systems, finding performance gaps, and generating adversarial inputs to improve efficiency in traffic engineering and more.
Traveling Salesman Problem Using Branch and Bound - Least Cost Method
Learn to solve the Traveling Salesman Problem using Branch and Bound method, focusing on the Least Cost approach. Explore efficient algorithms for optimizing routes in complex networks.
Seraph: Scalable and Efficient Fully-External Graph Computation via On-Demand Processing
Explores Seraph, a novel fully-external graph computation system that balances scalability and efficiency through on-demand processing, hybrid data formats, and selective pre-computation.
Kosmo: Efficient Online Miss Ratio Curve Generation for Eviction Policy Evaluation
Efficient algorithm for generating miss ratio curves to evaluate cache eviction policies, reducing memory overhead and improving throughput compared to existing methods.
Automated Cryptanalysis in Cryptography - Session 2
Explore cutting-edge techniques in automated cryptanalysis, focusing on advanced methods for breaking encryption systems and enhancing cybersecurity defenses.