Optimal Streaming Approximations for All Boolean Max 2-CSPs and Max k-SAT
Explore streaming approximations for Boolean Max 2-CSPs and Max k-SAT, covering algorithms, lower bounds, and communication complexity in constraint satisfaction problems.
Deterministic Distributed Expander Decomposition Routing with Applications in Distributed Derandomization
Explore deterministic distributed algorithms for expander decompositions and routing, with applications in derandomization. Learn about balanced sparse cut algorithms and recursive techniques.
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.
Lifting with Simple Gadgets and Applications to Circuit and Proof Complexity
Explore lifting techniques in circuit and proof complexity, focusing on Cutting Planes measures, communication complexity, and applications to monotone circuits and formulas.
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.
Tight Quantum Time-Space Tradeoffs for Function Inversion
Explore quantum time-space tradeoffs for function inversion, examining classical tradeoffs, circuit complexity, and a generic framework. Delve into proof overviews and multi-instance gains.
The Constant Depth Formula and Partial Function Versions of MCSP are Hard
Explore the complexity of MCSP variants, including partial function and constant depth formula versions, and their implications for circuit lower bounds and computational hardness.
A New Minimax Theorem for Randomized Algorithms
Explore a novel minimax theorem for randomized algorithms, comparing it with Yao's minimax and discussing its implications for algorithm analysis and design.
Edge-Weighted Online Bipartite Matching
Learn techniques for edge-weighted online bipartite matching, including competitive ratio analysis, greedy algorithms, and online correlated selection. Explore primal-dual methods and factor-revealing linear programs.
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.
Laconic Conditional Disclosure of Secrets and Applications
Explore innovative cryptographic techniques for secure information sharing, including probabilistically checkable proofs and garbled circuits, with applications in malicious laconic oblivious transfer.
Automating Resolution is NP-Hard
Explore the complexity of automating resolution in proof systems, including key developments, positive and negative results, and implications for computational theory.
Optimization of the Sherrington-Kirkpatrick Hamiltonian
Explore the optimization of the Sherrington-Kirkpatrick Hamiltonian, covering stochastic block models, random graphs, and algorithmic insights for solving complex optimization problems.
Balancing Straight-Line Programs
Explore efficient algorithms for grammar-based compression, focusing on size, depth, and random access in straight-line programs and their applications to trees and circuits.
Online Matching with General Arrivals
Explore advanced online bipartite matching algorithms, focusing on general arrivals and key challenges in this optimization problem.
Secure Stable Matching at Scale
Explore secure stable matching algorithms for large-scale applications, focusing on privacy preservation and efficient computation in scenarios like medical residency matching.
A Framework for Prototyping Applications Using Multilinear Maps and Matrix Branching Programs
Explore a novel framework for prototyping applications using multilinear maps and matrix branching programs, focusing on optimizations, cryptographic techniques, and performance improvements in program obfuscation.
Optimizing Semi-Honest Secure Multiparty Computation for the Internet
Optimizing secure multiparty computation for internet use, focusing on efficiency improvements in BMR protocol and OT-based methods for honest-minority settings.
Photo-Chromeleon - Re-Programmable Multi-Color Textures Using Photochromic Dyes
Innovative method for creating re-programmable multi-color textures using photochromic dyes, enabling single-material fabrication techniques to produce high-resolution, customizable designs on physical objects.
Twin-width I - Tractable FO Model Checking
Explore tractable FO model checking using twin-width, covering trigraphs, contraction sequences, and dynamic programming for efficient graph analysis.
Smoothed Complexity of 2-player Nash Equilibria
Explore smoothed complexity in 2-player Nash equilibria, covering algorithmic hardness, approximation challenges, and novel approaches to finding equilibria in perturbed games.