A Turing Machine Resisting Isolated Bursts Of Faults
A type system for PSPACE derived from light linear logic
A Unified Algorithm for Accelerating Edit-Distance Computation via Text-Compression
A W[1]-Completeness Result for Generalized Permutation Pattern Matching
A zero-one SUBEXP-dimension law for BPP
About functions where function input describes inner working of the function
About set-theoretic properties of one-way functions
About the impossibility to prove P=NP or P!=NP and the pseudo-randomness in NP
Abstract Milling with Turn Costs
Accepting Hybrid Networks of Evolutionary Processors with Special Topologies and Small Communication
Active Virtual Network Management Prediction: Complexity as a Framework for Prediction, Optimization, and Assurance
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