论文列表及评分结果
Optimal Edge Ranking of Trees in Polynomial Time.
电商所评分：1
A Provably Fast Linear-Expected-Time Maxima-Finding Algorithm.
电商所评分：10
The k-Server Dual and Loose Competitiveness for Paging.
电商所评分：4
Competitive Randomized Algorithms for Nonuniform Problems.
电商所评分：2
A Deterministic O(k³)-Competitive k-Server Algorithm for the Circle.
电商所评分：7
Computing the Intersection-Depth of Polyhedra.
电商所评分：8
Constructing Strongly Convex Approximate Hulls with Inaccurate Primitives.
电商所评分：1
Weaving Patterns of Lines and Line Segments in Space.
电商所评分：7
Algorithms for Projecting Points To Give the Most Uniform Distribution with Applications to Hashing.
电商所评分：2
Finding Extrema with Unary Predicates.
电商所评分：8
Fast Algorithms for the Dominating Set Problem on Permutation Graphs.
电商所评分：5
Finding Least-Weight Subsequences with Fewer Processors.
电商所评分：8
Sublinear Merging and Natural Mergesort.
电商所评分：7
Splitting a Configuration in a Simplex.
电商所评分：10
On the computation of unipotent characters of finite classical groups.
电商所评分：8
CHEVIE - A system for computing and processing generic character tables.
电商所评分：8
The state of the art in the computation of Kazhdan-Lusztig polynomials.
电商所评分：6
On the computation of conjugacy classes of Chevalley groups.
电商所评分：6
On the Implementation of Standard Bases and Syzygies in SINGULAR.
电商所评分：10
Dynamic Expression Trees.
电商所评分：3
The Complexity of Induced Minors and Related Problems.
电商所评分：4
A Lower Bound on the Probability of Conflict Under Nonuniform Access in Database Systems.
电商所评分：1
Maintaining the Visibility Map of Spheres While Moving the Viewpoint on a Circle at Infinity.
电商所评分：3
The Joint Distribution of the Three Types of Nodes in Uniform Binary Trees.
电商所评分：9
Generalized Sufficient Conditions for Modular Termination of Rewriting.
电商所评分：7
A Declarative Approach for First-Order Built-in's of Prolog.
电商所评分：7
Refutational Theorem Proving for Hierarchic First-Order Theories.
电商所评分：3
Completeness Results for Basic Narrowing.
电商所评分：3
Squares, Cubes, and Time-Space Efficient String Searching.
电商所评分：7
All-Pairs Shortest Paths and the Essential Subgraph.
电商所评分：6