论文列表及评分结果
Addition Requirements for Matrix and Transposed Matrix Products.
电商所评分：3
Probabilistic Computation of Integer Polynomial GCDs.
电商所评分：4
On Rectangular Visibility.
电商所评分：2
Factoring Polynomials Over Finite Fields.
电商所评分：7
Diameters of Weighted Double Loop Networks.
电商所评分：7
Algorithms for Two Bottleneck Optimization Problems.
电商所评分：5
The Concave Least-Weight Subsequence Problem Revisited.
电商所评分：5
The NP-Completeness Column: An Ongoing Guide.
电商所评分：9
Improved Algorithms for Discs and Balls Using Power Diagrams.
电商所评分：10
Adjacent Interchange Generation of Combinations.
电商所评分：2
An Algorithm for Finding Hamilton Cycles in Random Directed Graphs.
电商所评分：10
Fast Parallel Strong Orientation of Mixed Graphs and Related Augmentation Problems.
电商所评分：2
Some Results on V-ary Asymmetric Tries.
电商所评分：10
Construction of Optimal Binary Split Trees in the Presence of Bounded Access Probabilities.
电商所评分：2
Efficient Data Structures for Range Searching on a Grid.
电商所评分：9
Fast Parallel Algorithms for Finding Hamiltonian Paths and Cycles in a Tournament.
电商所评分：10
On a Special Case of Uniform Processor Scheduling.
电商所评分：1
The Solution of Some Random NP-Hard Problems in Polynomial Expected Time.
电商所评分：5
Linear Broadcast Routing.
电商所评分：3
On an Efficient Dynamic Programming Technique of F. F. Yao.
电商所评分：9
On the Distribution of Running Times of Certain Integer Factoring Algorithms.
电商所评分：4
Maximum Matchings in General Graphs Through Randomization.
电商所评分：3
The Graph Genus Problem is NP-Complete.
电商所评分：1
Gray Code Sequences of Partitions.
电商所评分：8
Fast Parallel and Serial Approximate String Matching.
电商所评分：7
Fast Algorithms for Direct Enclosures and Direct Dominances.
电商所评分：8
The Hamiltonian Cycle Problem is Linear-Time Solvable for 4-Connected Planar Graphs.
电商所评分：1
On Separable Clusterings.
电商所评分：1
Last-Come-First-Served Hashing.
电商所评分：1
The Parallel Complexity of TSP Heuristics.
电商所评分：9