**P****P-completeness****p-tree****packaging****packaging applications****packing vs. covering****paging**,**pagoda****pairing heap**,**palindrome****paradigms of algorithms design****parallel algorithms**,**parallel algorithms - graphs****parallel algorithms - visualization****parallel lines****parallel processor scheduling****paranoia level****parenthesization****PARI**,**parse trees****parsing****partial key search****partial order**,**partitioning automata states****partitioning point sets****partitioning polygons into convex pieces****partitioning problems****partition problem****party affiliations****Pascal**, , , , , , , , , , , , , , , , , , , , , , , , , , , , ,**password**,**patented algorithms****path****path generation - backtracking****path planning****paths - counting**,**Patricia trie****pattern matching**, , ,**pattern recognition**,**pattern recognition - automata****patterns****Pat tree****PDF-417****penalty functions****perfect hashing****perfect matching****performance bottlenecks****performance guarantee****performance in practice****period****periodicities****perl****permanent****permutation**,**permutation comparisons****permutation generation****permutation generation - backtracking****perpendicular bisector****personality conflicts - avoiding****PERT/CPM****Petersen graph****PGP**, ,**phone company****PHYLIP****phylogenic tree**,**piano mover's problem****Picasso, P.**,**pieces of a graph****pilots****pink panther****pivoting rules**,**pixel geometry**,**pLab****planar drawings**,**planar drawings - related problems****planar graph**,**planar graph - clique****planar graph - coloring****planar graph - instances****planar graph - isomorphism****Planarity Detection and Embedding****planarity testing - related problems****planar separators****planar subdivisions****planar sweep algorithms****plumbing****point-spread function****point distributions****pointer manipulation****point in polygon****point location**,**point location - related problems**, , ,**point robots****points****point set clusters****Poisson distribution****Polka****polygonal data structure****Polygon Partitioning****polygon partitioning - related problems****polygons****polygon triangulation****polyhedral simplification****polyline graph drawings****polynomial-time approximation scheme****polynomial-time problems****polynomial evaluation****polynomial multiplication****poor thin people****popular keys****porting code****POSIT****positions****position tree****potential function****power diagrams****power set****powers of graphs****Prüfer codes**,**precedence-constrainted scheduling****precedence constraints**,**precision****preemptive scheduling****prefix - string****preflow-push methods****preprocessing - graph algorithms****presortedness measures****Pretty Good Privacy****previous subset****PRF****price-per-pound****Prim's algorithm**,**primality testing**,**prime number****prime number theorem****principle of optimality****printed circuit boards**,**printing a graph****priority queues**,**priority queues - applications**, , , ,**priority queues - arithmetic model****priority queues - related problems****problem - definition****problem-specific algorithms****problem descriptions****problem instance****problem solving techniques**,**procedure call overhead****producer/consumer sectors****profit maximization****Program Evaluation and Review Technique****program libraries****programming languages****programming time**,**program structure****Prolog****proof of correctness****propagating consequences****propositional logic****protocol****pruning - backtracking**, ,**pseudocode****pseudorandom numbers****psychic lotto prediction****public key cryptography**, ,

Tue Jun 3 11:59:42 EDT 1997