Adaptive Concurrent Non-Malleability with Bare Public-Keys

Adding a referee to an interconnection network: What can(not) be computed in one round

Adversarial Satisfiability Problem

Adversary lower bounds for nonadaptive quantum algorithms

Agnostic Learning of Monomials by Halfspaces is Hard

Alan Turing and the Origins of Complexity

Alchemistry of the P versus NP question

Algebraic Independence and Blackbox Identity Testing

Algebraic Independence in Positive Characteristic -- A p-Adic Calculus

Algebraic Proofs over Noncommutative Formulas

Algebraic Properties for Selector Functions

Algorithm that Solves 3-SAT in Polynomial Time

Algorithmic complexity and randomness in elastic solids

Algorithmic complexity of pair cleaning method for k-satisfiability problem. (draft version)

Algorithmic Problem Complexity

Algorithms for Boolean Function Query Properties

Algorithms for Estimating Information Distance with Application to Bioinformatics and Linguistics

Algorithms for Quantum Branching Programs Based on Fingerprinting

Algorithms for Testing Monomials in Multivariate Polynomials

All Superlinear Inverse Schemes are coNP-Hard