yusuke1997/dblp-id-title huggingface dataset:
Degree Bounded Network Design with Metric Costs
On the Computation of Boolean Functions by Analog Circuits of Bounded Fan-in (Extended Abstract)
A New Characterization of Mehlhorn's Polynomial Time Functionals (Extended Abstract)
Multiparty Communication Complexity
A Tight Bound for Black and White Pebbles on the Pyramid
Decision Procedures for Time and Chance (Extended Abstract)
Parallel Reachability in Almost Linear Work and Square Root Depth
PAC = PAExact and Other Equivalent Models in Learning
Dot-Product Proofs and Their Applications
On the Impact of Combinatorial Structure on Congestion Games
Characterizing Average-Case Complexity of PH by Worst-Case Meta-Complexity
Effect of Connectivity in Associative Memory Models (Preliminary Version)
One-Way Functions and (Im)Perfect Obfuscation
Gapped Clique Homology on Weighted Graphs is QMA1-Hard and Contained in QMA
Buy-at-Bulk Network Design with Protection
The Influence of Variables on Boolean Functions (Extended Abstract)
On the time complexity of 2-tag systems and small universal Turing machines
Global Optimization Using Local Information with Applications to Flow Control
Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs
Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract)
Contention Resolution with Bounded Delay
An Exponential Separation between Randomized and Deterministic Complexity in the LOCAL Model
Approximating Graphic TSP by Matchings
Randomized Byzantine Generals
NP-Hardness of Reed-Solomon Decoding and the Prouhet-Tarry-Escott Problem
Probabilistic Algorithms in Finite Fields
Efficient Out-of-Core Algorithms for Linear Relaxation Using Blocking Covers (Extended Abstract)
Matrix Sparsification for Rank and Determinant Computations via Nested Dissection
Free Bits, PCPs and Non-Approximability - Towards Tight Results
Non-adaptive vs Adaptive Queries in the Dense Graph Testing Model
On the (In)security of the Fiat-Shamir Paradigm
The Lattice Reduction Algorithm of Gauss: An Average Case Analysis
Optimal Time-Space Trade-Offs for Sorting
On the Automorphism Group of a Reduced Automaton
An Approximate Max-Steiner-Tree-Packing Min-Steiner-Cut Theorem
Quantum 3-SAT Is QMA1-Complete
Factoring Sparse Multivariate Polynomials
Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version)
Inapproximability of Clustering in Lp Metrics
The Average Sensitivity of Bounded-Depth Formulas
Applications of a Poset Representation to Edge Connectivity and Graph Rigidity
Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm (Extended Abstract)
Storage Interference in Asynchronous Computations
How to Approximate a Set without Knowing Its Size in Advance
Approximate Nearest Neighbor Algorithms for Hausdorff Metrics via Embeddings
Hopsets with Constant Hopbound, and Applications to Approximate Shortest Paths
Flows in Undirected Unit Capacity Networks
Dynamic Transitive Closure via Dynamic Matrix Inverse (Extended Abstract)
Priority Encoding Transmission
Approximation Via Cost-Sharing: A Simple Approximation Algorithm for the Multicommodity Rent-or-Buy Problem
Log Depth Circuits for Division and Related Problems
Path Coloring on the Mesh
On Kinetic Delaunay Triangulations: A Near Quadratic Bound for Unit Speed Motions
Storing Secrets on Continually Leaky Devices
Lower Bounds on the Bounded Coefficient Complexity of Bilinear Maps
Independent Unbiased Coin Flips From a Correlated Biased Source: a Finite State Markov Chain
CS Proofs (Extended Abstracts)
Community Detection in General Stochastic Block models: Fundamental Limits and Efficient Algorithms for Recovery
Reducibility among Fractional Stability Problems
Hardness Self-Amplification from Feasible Hard-Core Sets
"Tapeless" Bounded Action Machines
Bivariate Polynomial Multiplication
Approximating Edit Distance Efficiently
On the Evaluation of Powers and Related Problems (Preliminary Version)
Some Tools for Approximate 3-Coloring (Extended Abstract)
Computational complexity of recursive sequences
Fully-Dynamic Submodular Cover with Bounded Recourse
Hashing-Based-Estimators for Kernel Density in High Dimensions
Algorithms and Barriers in the Symmetric Binary Perceptron Model
FOCS 2021 Preface
Graph Sparsification, Spectral Sketches, and Faster Resistance Computation, via Short Cycle Decompositions
On the Impossibility of Dimension Reduction in l 1
Eigenvalues, Expanders and Superconcentrators (Extended Abstract)
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Graph Partitioning and Quadratic Integer Programming with PSD Objectives
Learning via Queries
Universal Base Functions and Modules for Realizing Arbitrary Switching Functions
Structure of Protocols for XOR Functions
Subdirect Decompositions of Transformation Graphs
Fast Algorithms for the All Nearest Neighbors Problem
Approximating Fractional Multicommodity Flow Independent of the Number of Commodities
A note on the Theta number of Lovász and the generalized Delsarte bound
Multiple Faults in Reed-Muller Canonic Networks
The Effectiveness of Lloyd-Type Methods for the k-Means Problem
Stochastic Weighted Matching: (Stochastic Weighted Matching: (1-ε) Approximation -\varepsilon$) Approximation
On the Decomposability of Monadic Algebras and Automata
On a Measure of Complexity for Stochastic Sequential Machines
Optimal anytime regret for two experts
Private Computations Over the Integers (Extended Abstract)
The Partition Technique for Overlays of Envelopes
Small Induced-Universal Graphs and Compact Implicit Graph Representations
On Levels in Arrangements of Curves
Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs
A Time-Space Lower Bound for a Large Class of Learning Problems
Random Edge Can Be Exponential on Abstract Cubes
Hardness of Nearest Neighbor under L-infinity
A Time-Space Tradeoff for Sorting on Non-Oblivious Machines
Expander-Based Constructions of Efficiently Decodable Codes
Maximum Matchings via Gaussian Elimination
Smoothed Analysis with Adaptive Adversaries
Near Linear Lower Bound for Dimension Reduction in L1
Lower Bound on Hilbert's Nullstellensatz and propositional proofs
Cut-Equivalent Trees are Optimal for Min-Cut Queries
Variations of a New Machine Model
Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM
Self-Organizing Binary Search Trees
Complexity of Counting Subgraphs: Only the Boundedness of the Vertex-Cover Number Counts
Local Conflict Coloring
A Light Metric Spanner
A General Class of Resource Tradeoffs (Extended Abstract)
Concurrent Non-Malleable Commitments
∏ 2 P vs PSpace Dichotomy for the Quantified Constraint Satisfaction Problem
Non-Existence of One-Dimensional Expanding Graphs
Are Wait-Free Algorithms Fast? (Extended Abstract)
Error Correction via Linear Programming
The Boolean Isomorphism Problem
Efficient and Near-Optimal Noise Generation for Streaming Differential Privacy
Very Fast Parallel Matrix and Polynomial Arithmetic
Building Low-Diameter P2P Networks
A Dichotomy Theorem for Nonuniform CSPs
Approximating Edit Distance within Constant Factor in Truly Sub-Quadratic Time
Should Tables Be Sorted? (Extended Abstract)
An Algorithm for Komlós Conjecture Matching Banaszczyk's Bound
Average Case Lower Bounds for Monotone Switching Networks
Improved Lower Bounds for Shellsort
The Polynomial Method in Quantum and Classical Computing
Sparse P-Hard Sets Yield Space-Efficient Algorithms
Dynamic Approximate All-Pairs Shortest Paths: Breaking the O(mn) Barrier and Derandomization
A Unified Superfast Algorithm for Boundary Rational Tangential Interpolation Problems and for Inversion and Factorization of Dense Structured Matrices
Online Stochastic Matching: Beating 1-1/e
One method for designing speed independent logic for a control
Simple Extractors for All Min-Entropies and a New Pseudo-Random Generator
Finding an Even Hole in a Graph
A Dichromatic Framework for Balanced Trees
Statistical Zero-Knowledge Arguments for NP from Any One-Way Function
An Augmenting Path Algorithm for the Parity Problem on Linear Matroids
Direct Products in Communication Complexity
Quantum Computation and Lattice Problems
On the Hardness of Graph Isomorphism
Orderings for Term-Rewriting Systems
A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm
Zaps and Their Applications
Active Classification with Comparison Queries
Tolls for Heterogeneous Selfish Users in Multicommodity Networks and Generalized Congestion Games
Learning-Graph-Based Quantum Algorithm for k-Distinctness
Size-Depth Tradeoffs for Algebraic Formulae
Single stage threshold logic
Indistinguishability Obfuscation via Mathematical Proofs of Equivalence
On the Power of Adaptivity in Sparse Recovery
Lower Bounds for Noisy Wireless Networks using Sampling Algorithms
On the Maximum Satisfiability of Random Formulas
A 2-Approximation Algorithm for the Directed Multiway Cut Problem
The Bit Vector Intersection Problem (Preliminary Version)
Three Results on the Polynomial Isomorphism of Complete Sets
The Minimization Problem for Boolean Formulas
Constant Degree Direct Product Testers with Small Soundness
Proof Verification and Hardness of Approximation Problems
Bounds on Tradeoffs between Randomness and Communication Complexity
Algebras with Polynomial Identities and Computing the Determinant
Near-Tight Bounds for 3-Query Locally Correctable Binary Linear Codes via Rainbow Cycles
Symmetries, Graph Properties, and Quantum Speedups
Circuit Complexity, Proof Complexity, and Polynomial Identity Testing
Space-efficient Static Trees and Graphs
Mixing Time of Exponential Random Graphs
Improved Hardness Results for Approximating the Chromatic Number
Near-Optimal Approximate Decremental All Pairs Shortest Paths
Constant Approximation of Min-Distances in Near-Linear Time
Covering Polygons Is Hard (Preliminary Abstract)
The Johnson-Lindenstrauss Transform Itself Preserves Differential Privacy
Cellular Automata and Formal Languages
Maximum Agreement Subtree in a Set of Evolutionary Trees-Metrics and Efficient Algorithms
New Lower Bound Techniques for Robot Motion Planning Problems
Improved Bounds for Geometric Permutations
Learning in Auctions: Regret is Hard, Envy is Easy
A Linear Time Approximation Scheme for Euclidean TSP
Symbolic Integration and the Complexity of Computing Averages
A Lower Bound for Testing 3-Colorability in Bounded-Degree Graphs
Strong Spatial Mixing for Colorings on Trees and its Algorithmic Applications
Constant-Round Concurrent Zero Knowledge from P-Certificates
A Theory of Wormhole Routing in Parallel Computers (Extended Abstract)
Triangulating a Simple Polygon in Linear Time
Which Networks are Least Susceptible to Cascading Failures?
Compressing CFI Graphs and Lower Bounds for the Weisfeiler-Leman Refinements
Short Paths in Expander Graphs
Extractors from Reed-Muller Codes
How Robust Is the n-Cube? (Extended Abstract)
Sharp Thresholds in Random Simple Temporal Graphs
On Learning Discretized Geometric Concepts (Extended Abstract)
A Compact Representation for Permutation Groups
Almost Ramanujan Expanders from Arbitrary Expanders via Operator Amplification
Census Functions: an Approach to VLSI Upper Bounds (Preliminary Version)
Algorithmic Number Theory-The Complexity Contribution
Reductions that Lie
Minor-Free Graphs Have Light Spanners
Use of Multiple Index Matrices in Generalized Automata Theory
Sublinear Algorithms for Gap Edit Distance
A "Paradoxical" Solution to the Signature Problem (Extended Abstract)
Markov Paging (Extended Abstract)
Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary)
Real-Time Computation by n-Dimensional Iterative Arrays of Finite-State Machines
Fast Learning Requires Good Memory: A Time-Space Lower Bound for Parity Learning
Signal Propagation, with Application to a Lower Bound on the Depth of Noisy Formulas
Beck's Three Permutations Conjecture: A Counterexample and Some Consequences
Mathematical models of neurone interaction
Parameterized Problems Complete for Nondeterministic FPT time and Logarithmic Space
Max-Information, Differential Privacy, and Post-selection Hypothesis Testing
Two Theorems on Random Polynomial Time
Complexity of the Mover's Problem and Generalizations (Extended Abstract)
Lower Bounds for Polynomial Calculus: Non-Binomial Case
Improved Approximations for Vector Bin Packing via Iterative Randomized Rounding
Instance-Optimality in I/O-Efficient Sampling and Sequential Estimation
Online Algorithms for Covering and Packing Problems with Convex Objectives
The Geometry of Scheduling
Robust recovery for stochastic block models
Approximating Clique is Almost NP-Complete (Preliminary Version)
Tape Reversal Complexity Hierarchies
Concave Generalized Flows with Applications to Market Equilibria
Universal Simulation of Directed Systems in the Abstract Tile Assembly Model Requires Undirectedness
A Tight Bound for Set Disjointness in the Message-Passing Model
Propositional Dynamic Logic of Context-Free Programs
Polar Codes: Speed of Polarization and Polynomial Gap to Capacity
Strassen's Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations
Linear-Time and Efficient Distributed Algorithms for List Coloring Graphs on Surfaces
Index Coding with Side Information
Clock Synchronization with Bounded Global and Local Skew
An FPTAS for #Knapsack and Related Counting Problems
Quadratic Conditional Lower Bounds for String Problems and Dynamic Time Warping
A Polynomial Time Algorithm for Computing the Arrow-Debreu Market Equilibrium for Linear Utilities
One Tree to Rule Them All: Poly-Logarithmic Universal Steiner Tree
Graph Connectivity and Monadic NP
Simple Languages and Free Schemes
O(log log Rank) Competitive Ratio for the Matroid Secretary Problem
Quantum Circuit Complexity
Lower bounds for circuits with MOD_m gates
Simple Hard Instances for Low-Depth Algebraic Proofs
Evolutionary Trees can be Learned in Polynomial Time in the Two-State General Markov Model
Stochastic Online Correlated Selection
Recursion Theoretic Characterizations of Complexity Theoretic Properties
High-Temperature Gibbs States are Unentangled and Efficiently Preparable
A Deterministic Almost-Linear Time Algorithm for Minimum-Cost Flow
Directed Isoperimetry and Monotonicity Testing: A Dynamical Approach
The Token Distribution Problem (Preliminary Version)
A Cellular Structure for Sequential Networks
An Omega(n^4/3) Lower Bound on the Monotone Network Complexity of n-th Degree Convolution
Near-Quadratic Bounds for the Motion Planning Problem for a Polygon in a Polygonal Environment
Near Optimal Linear Algebra in the Online and Sliding Window Models
Distributed BFS Algorithms
General Weak Random Sources
The Complexity of Parallel Computation on Matroids
Faster Algorithms for the Construction of Parameterized Suffix Trees (Preliminary Version)
Inferring the Structure of a Markov Chain from its Output
On the boundary complexity of the union of fat triangles
An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem
Partial Polymorphic Type Inference Is Undecidable
On the Average Number of Registers Required for Evaluating Arithmetic Expressions
A proof that Reed-Muller codes achieve Shannon capacity on symmetric channels
Tight Bounds for the Zig-Zag Product
The Linearity of Sequential Machines: A Critical Review
Properly learning monotone functions via local correction
Near Log-Convexity of Measured Heat in (Discrete) Time and Consequences
Two Lower Bounds in Asynchronous Distributed Computation (Preliminary Version)
Gambling in a Rigged Casino: The Adversarial Multi-Arm Bandit Problem
An Equivalence Between Private Classification and Online Prediction
Set Covering with our Eyes Closed
A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems
The Salesman's Improved Paths: A 3/2+1/34 Approximation
Strongly History-Independent Hashing with Applications
Strong Bounds for 3-Progressions
Optimal Stochastic Planarization
Multi-Layer Grid Embeddings
Learning sums of powers of low-degree polynomials in the non-degenerate case
The Complexity of Searching an Ordered Random Table (Extended Abstract)
Unsatisfiable Systems of Equations, Over a Finite Field
Computationally Hard Algebraic Problems (extended abstract)
Noisy Population Recovery in Polynomial Time
Computing Vertex Connectivity: New Bounds from Old Techniques
On Monotonicity Testing and Boolean Isoperimetric Type Theorems
Combinatorial Coloring of 3-Colorable Graphs
The Organization of Permutation Architectures with Bussed Interconnections (Extended Abstract)
Dispersers, Deterministic Amplification, and Weak Random Sources (Extended Abstract)
Three Applications of Kolmogorov-Complexity
Separation of the Monotone NC Hierarchy
Computationally-Secure and Composable Remote State Preparation
Tight Lower Bounds for Differentially Private Selection
A Divide-and-Conquer Algorithm for Min-Cost Perfect Matching in the Plane
On Rank vs. Communication Complexity
Constructing Arrangements of Lines and Hyperplanes with Applications
Locally Stationary Distributions: A Framework for Analyzing Slow-Mixing Markov Chains
A Complexity Theory Based on Boolean Algebra
Folklore Sampling is Optimal for Exact Hopsets: Confirming the √n Barrier
Bloom Filters, Adaptivity, and the Dictionary Problem
Decodable quantum LDPC codes beyond the square root distance barrier using high dimensional expanders
Towards a Computational Theory of Statistical Tests (Extended Abstract)
Orchestrating Quartets: Approximation and Data Correction
Simply Exponential Approximation of the Permanent of Positive Semidefinite Matrices
Distributions on Level-Sets with Applications to Approximation Algorithms
Linear Equations Modulo 2 and the L1 Diameter of Convex Bodies
SelfishMigrate: A Scalable Algorithm for Non-clairvoyantly Scheduling Heterogeneous Processors
Sample Efficient Estimation and Recovery in Sparse FFT via Isolation on Average
Subspace Polynomials and List Decoding of Reed-Solomon Codes
The Sample Complexity of Smooth Boosting and the Tightness of the Hardcore Theorem
The Optimal Path-Matching Problem
Reliable Cellular Automata with Self-Organization
On Decreasing the Computing Time for Modular Arithmetic
Better Lower Bounds for Halfspace Emptiness
Correction to "A Linear-Time Algorithm for Triangulating Simple Polygons"
A Unified Framework for Testing Linear-Invariant Properties
Generalized State Identification Problems
A Ramsy-type Theorem for Metric Spaces and its Applications for Metrical Task Systems and Related Problems
Correlation Clustering with Sherali-Adams
28th Annual Symposium on Foundations of Computer Science, Los Angeles, California, USA, 27-29 October 1987
Efficient Access to Optical Bandwidth - Wavelength Routing on Directed Fiber Trees, Rings, and Trees of Rings
Bases for Chain-Complete Posets
Switching function canonical forms based on commutative and associative binary operations
Approximability of Flow Shop Scheduling
Deterministic Search for CNF Satisfying Assignments in Almost Polynomial Time
Fast Similarity Sketching
A Two Prover One Round Game with Strong Soundness
The synthesis of TANT networks
Hardness of Approximation in PSPACE and Separation Results for Pebble Games
The Quantum Communication Complexity of Sampling
Survivable Network Design Revisited: Group-Connectivity
Slowing Down Sorting Networks to Obtain Faster Sorting Algorithms
A General Approach to Dynamic Packet Routing with Bounded Buffers (extended abstract)
Superpolynomial Lower Bounds Against Low-Depth Algebraic Circuits
New Algorithms for Finding Irreducible Polynomials over Finite Fields
Glauber Dynamics on Trees and Hyperbolic Graphs
Pseudorandomness via the Discrete Fourier Transform
Minor Sparsifiers and the Distributed Laplacian Paradigm
Lower Bounds for Maximal Matchings and Maximal Independent Sets
Testing Random Variables for Independence and Identity
A Non-Markovian Coupling for Randomly Sampling Colorings
The Complexity of Approximating the Square Root (Extended Summary)
Clock Construction in Fully Asynchronous Parallel Systems and PRAM Simulation (Extended Abstract)
Embedding Planar Graphs in Seven Pages
The Natural Work-Stealing Algorithm is Stable
Programs and Types
Approximability of Combinatorial Problems with Multi-agent Submodular Cost Functions
Efficient Algorithms for Universal Portfolios
Hardness of Finding Independent Sets in Almost q-Colorable Graphs
Interactive Data Comparison
Using Upper Confidence Bounds for Online Learning
29th Annual Symposium on Foundations of Computer Science, White Plains, New York, USA, 24-26 October 1988
Ensemble Motion Planning in Trees
New Results on Dynamic Planar Point Location
Sum-of-Squares Lower Bounds for Sherrington-Kirkpatrick via Planted Affine Planes
Two-Way Counter Machines and Diophantine Equations
Truly Optimal Euclidean Spanners
Sharper bounds on the Fourier concentration of DNFs
Writing Stack Acceptors
Toward Self-Organizing Linear Search (Preliminary Draught)
Spectral Independence via Stability and Applications to Holant-Type Problems
Finite automata and badly timed elements
Sorting and Selection with Structured Costs
A Combinatorial Approach to Planar Non-colliding Robot Arm Motion Planning
Fast and Efficient Algorithms for Sequential and Parallel Evaluation of Polynomial Zeros and of Matrix Polynomials
The Complexity of General-Valued CSPs Seen from the Other Side
Exploring Binary Trees and Other Simple Trees
An Input Sensitive Online Algorithm for the Metric Bipartite Matching Problem
Solving Low-Density Subset Sum Problems
On the Fault Tolerance of Some Popular Bounded-Degree Networks
How to emulate shared memory (Preliminary Version)
The Reachability Problem for Petri Nets is Not Primitive Recursive
A Simple Algorithmic Characterization of Uniform Solvability
Two-Way Balloon Automata and AFL
The Sub-exponential Upper Bound for On-Line Chain Partitioning
On shift register realizations for sequential machines
Fast List Decoding of Univariate Multiplicity and Folded Reed-Solomon Codes
Efficient Parallel Solution of Sparse Eigenvalue and Eigenvector Problems
Map Graphs in Polynomial Time
1-Factorizations of Pseudorandom Graphs
Efficient Approximate and Dynamic Matching of Patterns Using a Labeling Paradigm (extended abstract)
The Coin Problem and Pseudorandomness for Branching Programs
Toward a Weakly Invariant Complexity Theory
Planar Graph Perfect Matching Is in NC
Optimal PAC Bounds without Uniform Convergence
On Fully Dynamic Graph Sparsifiers
Equivalence of Deterministic Top-Down Tree-to-String Transducers is Decidable
Deterministic Left Corner Parsing (Extended Abstract)
At most 3.55 n stable matchings
Solving Linear Systems through Nested Dissection
The Privacy of the Analyst and the Power of the State
On Counting Independent Sets in Sparse Graphs
Finding Double Euler Trails of Planar Graphs in Linear Time
Efficient Algorithms for Semirandom Planted CSPs at the Refutation Threshold
Computing with Polynomials Given by Straight-Line Programs II: Sparse Factorization
Computational Complexity of Decision Procedures for Polynomials (Extended Abstract)
On Computing Boolean Functions by Sparse Real Polynomials
Optimal Synthesis of Arbitrary Switching Functions with Regular Arrays of 2-Input, 1-Output Switching Elements
Shortest Paths in Euclidean Graphs (Extended Abstract)
Mick Gets Some (the Odds Are on His Side)
Threshold Logic: A Simplified Synthesis by a Recursive Method
Algorithms on negatively curved spaces
Hardness Amplification for Errorless Heuristics
Beyond Trace Reconstruction: Population Recovery from the Deletion Channel
On the Integrality Ratio for Asymmetric TSP
The Effect of Basis on Size of Boolean Expressions
Delaunay Triangulations in O(sort(n)) Time and More
An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio
Testing of Functions that have small width Branching Programs
Routing on Butterfly Networks with Random Faults
Nonlinearity of Davenport-Schinzel Sequences and of a Generalized Path Compression Scheme
The Resolution Complexity of Random Constraint Satisfaction Problems
Spectral Subspace Sparsification
Network Decomposition and Locality in Distributed Computation
Quantum Log-Approximate-Rank Conjecture is Also False
Authentication of Quantum Messages