论文列表及评分结果
A "Retraction" Method for Planning the Motion of a Disc.
电商所评分：5
An Algorithmic Proof of Tutte's f-Factor Theorem.
电商所评分：9
Finding Approximate Patterns in Strings.
电商所评分：1
Two Levels are as Good as Any.
电商所评分：4
The NP-Completeness Column: An Ongoing Guide.
电商所评分：7
Efficient Uses of the Past.
电商所评分：1
Repeated Random Insertion into a Priority Queue.
电商所评分：6
Polynomial-Time Algorithms for Finding Elements of Prime Order and Sylow Subgroups.
电商所评分：8
Batched Dynamic Solutions to Decomposable Searching Problems.
电商所评分：9
The Complexity of Dehn's Algorithm for Word Problems in Groups.
电商所评分：2
Weighted Heuristic Search in Networks.
电商所评分：1
An Efficient Algorithm for the "Stable Roommates" Problem.
电商所评分：8
Dynamic Huffman Coding.
电商所评分：9
An Analysis of Optimum Caching.
电商所评分：9
Pyramid Computer Solutions of the Closest Pair Problem.
电商所评分：6
Computing the Extreme Distances Between Two Convex Polygons.
电商所评分：3
Binary Tree Gray Codes.
电商所评分：6
Constructing Trees with Prescribed Cardinalities for the Components of Their Vertex Deleted Subgraphs.
电商所评分：10
On Optimal Arrangements of Keys with Double Hashing.
电商所评分：4
An Optimal Algorithm for Finding all the Jumps of a Monotone Step-Function.
电商所评分：10
A Theoretical Analysis of Backtracking in the Graph Coloring Problem.
电商所评分：7
Problems.
电商所评分：4
The NP-Completeness Column: An Ongoing Guide.
电商所评分：10
A New Upper Bound for Shellsort.
电商所评分：6
Planar 3DM is NP-Complete.
电商所评分：9
Depth-Size Trade-Offs for Parallel Prefix Computation.
电商所评分：8
Searching and Storing Similar Lists.
电商所评分：2
Polygon Triangulation: Efficiency and Minimality.
电商所评分：7
Single Bend Wiring.
电商所评分：6
An Optimal Algorithm for Finding Minimal Enclosing Triangles.
电商所评分：9