论文列表及评分结果
An Algorithm for Early Unlocking of Entities in Database Transactions.
电商所评分：2
Fast Approximation Algorithms for a Nonconvex Covering Problem.
电商所评分：10
Computational Complexities of Diophantine Equations with Parameters.
电商所评分：1
Better Expanders and Superconcentrators.
电商所评分：8
Space Searching for Intersecting Objects.
电商所评分：4
Finding Critical Sets.
电商所评分：5
On the Routability of a Convex Grid.
电商所评分：3
Problems Complete for Deterministic Logarithmic Space.
电商所评分：9
Universal Traversal Sequences for Paths and Cycles.
电商所评分：5
A Heuristic Triangulation Algorithm.
电商所评分：6
The NP-Completeness Column: An Ongoing Guide.
电商所评分：8
Dynamic Orthogonal Segment Intersection Search.
电商所评分：9
Shape from Probing.
电商所评分：3
Efficient Parallel Algorithms for Edge Coloring Problems.
电商所评分：6
A Lower Bound for Probabilistic Distributed Algorithms.
电商所评分：9
Convex Hulls of Piecewise-Smooth Jordan Curves.
电商所评分：7
Searching in 2-Dimensional Partial Orders.
电商所评分：6
O(n^(2.55)) Time Algorithms for the Subgraph Homeomorphism Problem on Trees.
电商所评分：9
An Improved Block-Interchange Algorithm.
电商所评分：9
The 1-Steiner Tree Problem.
电商所评分：7
A Noninductive GL(n, Z) Algorithm That Constructs Integral Linear Relations for n Z-Linearly Dependent Real Numbers.
电商所评分：6
Optimal Multiway Split Trees.
电商所评分：8
An Optimal Algorithm for Geometrical Congruence.
电商所评分：1
Computing pi(x): An Analytic Method.
电商所评分：10
An Efficient and Simple Motion Planning Algorithm for a Ladder Amidst Polygonal Barriers.
电商所评分：9
Linear-Time Computation of Optimal Subgraphs of Decomposable Graphs.
电商所评分：2
Linear Probing: The Probable Largest Search Time Grows Logarithmically with the Number of Records.
电商所评分：5
Multiple Optima in Local Search.
电商所评分：7
Efficient Algorithms for Finding Minimum Spanning Forests of Hierarchically Defined Graphs.
电商所评分：8
The NP-Completeness Column: An Ongoing Guide.
电商所评分：1