Perfect Hashing for Data Management Applications

Perfect Matchings in O(n \log n) Time in Regular Bipartite Graphs

Perfect Matchings in Õ(n^{1.5}) Time in Regular Bipartite Graphs

Perfect Matchings via Uniform Sampling in Regular Bipartite Graphs

Perfectly Balanced Allocation With Estimated Average Using Expected Constant Retries

Permutation Generation: Two New Permutation Algorithms

Phase Synchronization in Railway Timetables

Phase transition for Local Search on planted SAT

PHORMA: Perfectly Hashable Order Restricted Multidimensional Arrays

Physarum Can Compute Shortest Paths

Physical expander in Virtual Tree Overlay

Picking up the Pieces: Self-Healing in Reconfigurable Networks

Picture-Hanging Puzzles

Planar F-Deletion: Approximation and Optimal FPT Algorithms

Planar Subgraph Isomorphism Revisited

Plane Decompositions as Tools for Approximation

Playing Mastermind With Constant-Size Memory

Polylogarithmic Approximation for Edit Distance and the Asymmetric Query Complexity

Polynomial algorithms for protein similarity search for restricted mRNA structures

Polynomial Estimators for High Frequency Moments