Cs-Cc
Modeling overland flow from local inflows in almost no-time, using Self Organizing Maps
On Computational Power of Quantum Read-Once Branching Programs
The vertex leafage of chordal graphs
Data Reduction for Graph Coloring Problems
Self-Assembly with Geometric Tiles
Symmetry-assisted adversaries for quantum state generation
Complexity Classifications for Propositional Abduction in Posts Framework
Duality Gap, Computational Complexity and NP Completeness: A Survey
Distributed XML Design
Classical and Quantum Annealing in the Median of Three Satisfiability
Symmetry of information and bounds on nonuniform randomness extraction via Kolmogorov extractors
A Survey of PPAD-Completeness for Computing Nash Equilibria
The tractability of CSP classes defined by forbidden patterns
Understanding Space in Proof Complexity: Separations and Trade-offs via Substitutions
Maximal Spectral Efficiency of OFDM with Index Modulation under Polynomial Space Complexity
Rounding Semidefinite Programming Hierarchies via Global Correlation
Enforcing efficient equilibria in network design games via subsidies
On the Weak Computability of Continuous Real Functions
Improved Inapproximability Results for Counting Independent Sets in the Hard-Core Model
On Minimal Constraint Networks
Solving the Closest Vector Problem with respect to l_p Norms
Evasiveness and the Distribution of Prime Numbers
