Topology of Complexes Arising in Models for Distributed Computing
Explore simplicial models in distributed computing, focusing on chromatic subdivisions and their applications to problems like Weak Symmetry Breaking, leading to new mathematical questions.
NIST Lightweight Standardisation II
Explore NIST's lightweight cryptography standardization, focusing on WAGE, Estate, Spook, and Jambu algorithms, with insights on quantum attacks and mixed-fit permutations.
Mind the Composition - Birthday Bound Attacks on EWCDMD and SoKAC21
Explore birthday bound attacks on cryptographic constructions, focusing on EWCDMD and SoKAC21. Learn about composition techniques, permutations, and distribution attacks in this advanced cryptography talk.
PLONK - Permutations Over Lagrange-Bases for Oecumenical Noninteractive Arguments of Knowledge
Explore PLONK, a cryptographic protocol for zero-knowledge proofs, covering permutation checks, polynomial protocols, and applications in blockchain technology.
Differential Trail Search and Bounds in Cryptography - Session 2
Explore differential trail search and bounds in cryptography, covering basic notions, permutations, score functions, and recent advancements in the field.
Indexing and Iterating Design Space Permutations
Explore mathematical techniques for indexing and iterating design space permutations, focusing on perfect hash functions for efficient game state conversion and representation.
Algebraic Structures on Polytopes
Explore algebraic structures on polytopes, delving into combinatorics, Hopf monoids, and generalized permutahedra. Gain insights into mathematical applications and current research directions.
Explicit Non-Malleable Codes Against Bitwise Tampering and Permutations
Explore non-malleable codes' resistance to bit-wise tampering and permutations, covering definitions, realizability, results, and explicit constructions like Reed-Solomon and balanced unary encoding.
STL Algorithms in Less Than an Hour
Comprehensive overview of STL algorithms, their groupings, and applications in C++, enhancing code expressiveness and robustness through practical examples and patterns.
Introduction to Subfactorials and Derangements in Combinatorics
Explore the fascinating concept of subfactorials and derangements through an engaging mathematical journey, using real-world examples of men, hats, and probability calculations.
Introduction to Combinations and the Binomial Theorem - From Counting Candies to Pascal's Triangle
Master combinations, permutations, and the binomial theorem through a fun candy-counting problem, exploring Pascal's triangle and practical applications in mathematical calculations.
Applications of Game Theory to Computational Social Science
Explore game theory applications in computational social science, focusing on algorithmic ranking, social welfare, and the monoculture paradox in digital systems.
Fault Tolerant Routing Protocols on High-Dimensional Expanders
Delve into fault-tolerant routing protocols on high-dimensional expanders, exploring efficient message transmission systems that maintain reliability even with corrupted network edges and enable advanced distributed computing applications.
Probability and Statistics: Set Rules and Basic Probability Concepts - Lecture 2
Master fundamental probability concepts, set rules, and sample spaces through practical examples of repeated trials and permutations, building a strong foundation in statistical analysis.
Linearity of Expectations in Combinatorics - Applications to Permutations and Hamilton Paths
Master probabilistic combinatorics through practical applications, exploring random permutations and Hamilton paths in tournaments while learning key concepts of linearity of expectations.
Improved Covering Results and Intersection Theorems in Symmetric Groups via Hypercontractivity
Delve into advanced mathematical concepts exploring covering results and intersection theorems in symmetric groups, featuring hypercontractivity and independent sets in Cayley graphs.