Cs-Cc
A new representation of Chaitin Omega number based on compressible strings
Entropy Measures vs. Algorithmic Information
From Low-Distortion Norm Embeddings to Explicit Uncertainty Relations and Efficient Information Locking
Optimal Interdiction of Unreactive Markovian Evaders
On the Power of Unambiguity in Logspace
Normalized Information Distance is Not Semicomputable
Claw Finding Algorithms Using Quantum Walk
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
