A Strong Direct Product Theorem for Disjointness
A strong direct product theorem for two-way public coin communication complexity
A Stronger LP Bound for Formula Size Lower Bounds via Clique Constraints
A Superpolynomial Lower Bound on the Size of Uniform Non-constant-depth Threshold Circuits for the Permanent
A Survey on Continuous Time Computations
A SWAR Approach to Counting Ones
A Theory for Valiant's Matchcircuits (Extended Abstract)
A Thermodynamic Turing Machine: Artificial Molecular Computing Using Classical Reversible Logic Switching Networks
A Time Lower Bound for Multiple Nucleation on a Surface
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