A General Notion of Useful Information
A Generalization of Nemhauser and Trotter's Local Optimization Theorem
A Generalized Quantifier Concept in Computational Complexity Theory
A generating function method for the average-case analysis of DPLL
A hitting set construction, with application to arithmetic circuit lower bounds
A Local to Global Principle for the Complexity of Riemann Mappings (Extended Abstract)
A Log-space Algorithm for Canonization of Planar Graphs
A Market for Air Traffic Flow Management
A Measure of Space for Computing over the Reals
A Moment of Perfect Clarity I: The Parallel Census Technique
A Moment of Perfect Clarity II: Consequences of Sparse Sets Hard for NP with Respect to Weak Reductions
A Multi-Round Communication Lower Bound for Gap Hamming and Some Consequences
A New Approach to Count Pattern Motifs Using Combinatorial Techniches
A New Approach to Formal Language Theory by Kolmogorov Complexity
A new function algebra of EXPTIME functions by safe nested recursion
A New Look at Survey Propagation and its Generalizations
A New Multilayered PCP and the Hardness of Hypergraph Vertex Cover
A New Order-theoretic Characterisation of the Polytime Computable Functions
A new point of NP-hardness for 2-to-1 Label Cover
A New Reduction from Search SVP to Optimization SVP