Group-based Cryptography - Advances and Applications
Explore cutting-edge developments in group-based cryptography at this TCC 2023 session, featuring expert insights and discussions on advanced cryptographic techniques.
Homomorphic Encryption and Encrypted Search - Asiacrypt 2021
Explore advanced cryptographic techniques including balanced non-adjacent forms, encrypted data search, homomorphic encryption for finite fields, and improved bootstrapping for TFHE.
Arbitrary Tensor Network Algorithm: Theory, Methods and Applications
Explore arbitrary tensor network algorithms for complex systems modeling, covering theory, methods, and applications in probabilistic graphical models and quantum circuit simulations.
Geometry of Tensor Networks and Tensor Invariants
Explore geometric aspects of tensor networks and invariants, focusing on their applications in mathematics and theoretical physics.
Few-Shot Classification Using Tensor Completion
Explore tensor-based modeling for enhanced classification performance, especially with limited training data, outperforming traditional methods.
Faster Parallel Algorithms for Basic Linear Algebra Problems
Explore advanced parallel algorithms for fundamental linear algebra, enhancing computational efficiency in mathematical problem-solving.
Sparsity and Privacy in Distributed Matrix Multiplication
Explore advanced techniques for distributed matrix multiplication, focusing on sparsity and privacy considerations in large-scale computations.
Coded Matrix Computation: Numerical Stability, Partial Stragglers, and Sparse Input Matrices
Explore advanced techniques for high-dimensional matrix computations in distributed systems, addressing numerical stability, partial stragglers, and sparse input matrices.
Polar Codes for IDS Channels
Explore polar codes for IDS channels, addressing numerical instability, partial stragglers, and worker computation time in sparse matrix scenarios. Learn recent contributions to overcome these challenges.
Construction and Decoding of Short Codes
Explore advanced techniques for constructing and decoding short-length codes, including staircase matrix codes, ordered statistic decoding, and innovative algorithms for polar codes.
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.
Fast List-Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes
Explore advanced techniques for efficient list-decoding of Reed-Solomon codes, focusing on univariate multiplicity and folded variants in error-correcting code theory.
Codes with the Multiplication Property - Advances in Error-Correcting Codes Theory
Explore error-correcting codes with multiplication properties, focusing on recent advancements and theoretical implications in coding theory.
Dual of Evaluation Codes in Error-Correcting Theory
Explore the mathematical concept of dual codes in error correction, focusing on evaluation codes and their properties in coding theory.
Structure-preserving Cryptography
Explore cutting-edge advancements in structure-preserving cryptography, focusing on innovative techniques and applications in secure communication and data protection.
Scalable MatMul-free Language Modeling - Paper Explained
Explore innovative MatMul-free language modeling techniques using quantization and recurrence, achieving comparable performance to traditional models while significantly reducing computational costs and memory usage.
Higher Order MDS Codes - Advances in Error-Correcting Code Theory
Explore advanced concepts in error-correcting codes, focusing on Higher Order MDS Codes and their applications in data integrity and communication systems.
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Explores advanced bounds for 3-query locally correctable binary linear codes, improving previous results using rainbow cycles in edge-colored graphs and covering radius of dual codes.
Logic and Algebras for Distributed Computing - Applications and Open Questions
Exploring connections between distributed computing and formal program representations, unifying logic and algebra-based approaches for practical language design and theoretical proofs.
Direct Access for Conjunctive Queries with Aggregation
Explore efficient algorithms for simulating sorted query answers with aggregation, examining tractability for various aggregate functions and lexicographic ordering scenarios.
Approximating Certain and Possible Answers Beyond Sets
Explore techniques for modeling uncertainty in databases using semiring-annotated relations, enabling efficient approximations of certain and possible answers for complex queries.