论文列表及评分结果
A New Memoryless Algorithm for De Bruijn Sequences.
电商所评分：5
Segments, Rectangles, Contours.
电商所评分：2
The Spanning Bound as a Measure of Range Query Complexity.
电商所评分：4
Finding the Maximum, Merging, and Sorting in a Parallel Computation Model.
电商所评分：4
Problems.
电商所评分：9
Fast Canonization of Circular Strings.
电商所评分：10
An O(n) Algorithm to Find a Near-Optimum Partition of a Convex Polygon.
电商所评分：1
A Time/Space Tradeoff for In-Place Array Permutation.
电商所评分：8
The Bit-Complexity of Arithmetic Algorithms.
电商所评分：4
A Space-Efficient On-Line Method of Computing Quantile Estimates.
电商所评分：6
Stacks in a Two-Level Store.
电商所评分：9
A Linear Algorithm for Computing the Visibility Polygon from a Point.
电商所评分：7
A Linear-Time Approximation Algorithm for the Weighted Vertex Cover Problem.
电商所评分：5
The Uniform Selection of Free Trees.
电商所评分：4
Problems.
电商所评分：6
A Fast Algorithm for Testing for Safety and Detecting Deadlocks in Locked Transaction Systems.
电商所评分：7
Generating Coset Representatives for Permutation Groups.
电商所评分：5
Dynamization of Order Decomposable Set Problems.
电商所评分：3
On Systems of Bilinear Forms Whose Minimal Division-Free Algorithms Are All Bilinear.
电商所评分：2
The Measure Problem for Rectangular Ranges in d-Space.
电商所评分：10
A Unified Approach to the Analysis of Bilinear Algorithms.
电商所评分：4
The Minimum-Length Generator Sequence Problem is NP-Hard.
电商所评分：1
Problems.
电商所评分：10
A Linear 5-Coloring Algorithm of Planar Graphs.
电商所评分：8
A Weighted Matroid Intersection Algorithm.
电商所评分：8
Finding Intersection of Rectangles by Range Search.
电商所评分：7
A 5/4 Algorithm for Two-Dimensional Packing.
电商所评分：1
On Optimal Trees.
电商所评分：1
Irreducible Polynomials with Integral Coefficients Have Succinct Certificates.
电商所评分：5
The NP-Completeness Column: An Ongoing Guide.
电商所评分：9