Partition Arguments in Multiparty Communication Complexity

Partitionability to two trees is NP-complete

Passively Mobile Communicating Machines that Use Restricted Space

Pebbles and Branching Programs for Tree Evaluation

Pebbling and Branching Programs Solving the Tree Evaluation Problem

Perfect Phylogeny Haplotyping is Complete for Logspace

Phase transition and computational complexity in a stochastic prime number generator

Phase transition in the assignment problem for random matrices

Phase Transition in Unrestricted Random SAT

Phase Transitions and all that

Phutball Endgames are Hard

Physical portrayal of computational complexity

Planar Graphs: Logical Complexity and Parallel Isomorphism Tests

Planarity Testing Revisited

Playing Games with Algorithms: Algorithmic Combinatorial Game Theory

Points on Computable Curves

Polylog space compression, pushdown compression, and Lempel-Ziv are incomparable

Polynomial hierarchy, Betti numbers and a real analogue of Toda's theorem

Polynomial Kernelizations for MIN F^+Pi_1 and MAX NP

Polynomial Synthesis of Asynchronous Automata