Cs-Cc
A Lower Bound for Succinct Rank Queries
Weakening Assumptions for Deterministic Subexponential Time Non-Singular Matrix Completion
On the Geometry of Differential Privacy
Improved Direct Product Theorems for Randomized Query Complexity
Normalized Range Voting Broadly Resists Control
Geometric Complexity Theory VII: Nonstandard quantum group for the plethysm problem
Multi-Objective Model Checking of Markov Decision Processes
How close can we come to a parity function when there isnt one?
On the Complexity of Edge Packing and Vertex Packing
Some Quantitative Aspects of Fractional Computability
The space complexity of recognizing well-parenthesized expressions in the streaming model: the Index function revisited
On the Optimality of a Class of LP-based Algorithms
Approximate Counting for Complex-Weighted Boolean Constraint Satisfaction Problems
Computing voting power in easy weighted voting games
Independent sets in random graphs from the weighted second moment method
A Factor 3/2 Approximation for Generalized Steiner Tree Problem with Distances One and Two
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
Bounded Independence Fools Degree-2 Threshold Functions
Computing Equilibria in Anonymous Games
Faster Real Feasibility via Circuit Discriminants
Finding Paths and Cycles in Graphs
Geometric Complexity Theory VIII: On canonical bases for the nonstandard quantum groups
