Money, Circuits, Mythic Figures, and More - Theory in the Allen School
Diverse theoretical computer science research: algorithms, data structures, complexity, combinatorics, and economics. Insights from UW Allen School's theory group on cutting-edge topics.
Great Ideas in Theoretical Computer Science: Deductive Systems
Explore deductive systems in theoretical computer science, covering topics like Hilbert's 10th problem, binary trees, propositional logic, and logical equivalence.
Fast Learning of Small Strategies - Jan Křetínský, Technical University of Munich
Discover fast learning techniques for small strategies in Markov decision processes, combining verification precision with machine learning scalability for ε-optimal strategies and concise representation.
Incremental View Maintenance- Beyond Worst-Case Analysis II
Explore advanced techniques in incremental view maintenance, focusing on fine-grained complexity analysis and its applications in logic and query evaluation.
Incremental View Maintenance: Beyond Worst-Case Analysis I
Explore advanced techniques in incremental view maintenance, focusing on fine-grained complexity analysis and its applications in logic and query evaluation.
Fine-Grained Complexity and Algorithm Design for Graph Reachability and Distance Problems
Explore advanced algorithms for graph reachability and distance problems, focusing on fine-grained complexity analysis and innovative design techniques.
Optimizing Relational Programs I
Explore fine-grained complexity, logic, and query evaluation techniques for optimizing relational programs in database systems and computational theory.
Massively Parallel Evaluation of Relational Queries II
Explore advanced techniques for parallel processing of relational database queries, focusing on fine-grained complexity and efficient evaluation strategies.
Massively Parallel Evaluation of Relational Queries I
Explore advanced techniques for parallel processing of relational database queries, focusing on fine-grained complexity and efficient evaluation strategies.
Approximating the TV Distance Between Two Product Distributions
Explore techniques for approximating total variation distance between high-dimensional product distributions, including randomized coupling and deterministic sparsification methods.
Marginal Determinism in Structured Decomposable Circuits
Explores marginal determinism in probabilistic circuits, introducing md-vtrees for structured decomposable PCs. Discusses tractability conditions, efficient algorithms, and applications to causal inference queries like backdoor adjustment.
The Rise of Tractable Circuits - From Cryptography to Continuous Generative Models
Exploring tractable circuits' applications in cryptography and continuous generative models, showcasing advancements in neuro-symbolic approaches and probabilistic inference for AI reasoning.
Combined Approximations for Probabilistic Query Evaluation - An Intensional Approach
Explore innovative techniques for probabilistic query evaluation using combined approximations, focusing on an intensional approach to enhance efficiency and accuracy.
First-Order Model Counting and Sampling
Explores recent developments in weighted first-order model counting and sampling, discussing applications in combinatorics, probability theory, and potential for declarative frameworks in sampling combinatorial structures.
Model Counting Meets Distinct Estimation
Exploring connections between model counting and F0 estimation, revealing shared techniques and developing new algorithms for both fields through cross-domain insights.
Theorem Proving and AI
Explore the intersection of theorem proving and artificial intelligence with Josef Urban, delving into cutting-edge research and potential applications in mathematics and computer science.
Accessing Answers to Unions of Conjunctive Queries with Ideal Time Guarantees - I
Explore efficient algorithms for accessing answers to unions of conjunctive queries, focusing on ideal time guarantees and fine-grained complexity in query evaluation.
Fine Grained Complexity
Explore fine-grained complexity theory, its applications in logic, and its role in query evaluation, offering insights into computational efficiency and algorithmic analysis.
Introduction to Relational Algorithms
Explore fine-grained complexity, logic, and query evaluation in relational algorithms, focusing on advanced concepts and their applications in database systems.
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.