论文列表及评分结果

How Much is that DAWG in the Window? A Moving Window Algorithm for the Directed Acyclic Word Graph.

电商所评分:8

点击查看评分详情!

Coloring Planar Graphs in Parallel.

电商所评分:8

点击查看评分详情!

On Bipartite Matchings of Minimum Density.

电商所评分:4

点击查看评分详情!

The Rotation Graph of Binary Trees is Hamiltonian.

电商所评分:4

点击查看评分详情!

The Virtues of Locking by Symbolic Names.

电商所评分:10

点击查看评分详情!

Simplified Stable Merging Tasks.

电商所评分:8

点击查看评分详情!

Improved Constants for Some Separator Theorems.

电商所评分:8

点击查看评分详情!

A Subquadratic Algorithm for Constructing Approximately Optimal Binary Search Trees.

电商所评分:6

点击查看评分详情!

Generating the Maximum Spanning Trees of a Weighted Graph.

电商所评分:6

点击查看评分详情!

Polynomial-Time Versions of Sylow's Theorem.

电商所评分:10

点击查看评分详情!

An O(n²) Shortest Path Algorithm for a Non-Rotating Convex Body.

电商所评分:2

点击查看评分详情!

A More Efficient Algorithm for Lattice Basis Reduction.

电商所评分:8

点击查看评分详情!

Almost All k-Colorable Graphs are Easy to Color.

电商所评分:3

点击查看评分详情!

A Fast Parallel Algorithm to Color a Graph with Delta Colors.

电商所评分:3

点击查看评分详情!

Binary Tree Algebraic Computation and Parallel Algorithms for Simple Graphs.

电商所评分:4

点击查看评分详情!

A Mixed-Integer Linear Programming Problem which is Efficiently Solvable.

电商所评分:1

点击查看评分详情!

A New Proof of the Garsia-Wachs Algorithm.

电商所评分:4

点击查看评分详情!

An Algorithm for Polynomial Multiplication that Does Not Depend on the Ring Constants.

电商所评分:6

点击查看评分详情!

Solving the Two-Dimensional Findpath Problem Using a Line-Triangle Representation of the Robot.

电商所评分:7

点击查看评分详情!

A Contraction Algorithm for Finding Small Cycle Cutsets.

电商所评分:6

点击查看评分详情!

Zero Divisors in Quaternion Algebras.

电商所评分:8

点击查看评分详情!

Finding Nonseparating Induced Cycles and Independent Spanning Trees in 3-Connected Graphs.

电商所评分:4

点击查看评分详情!

On the Complexity of Searching Game Trees and Other Recursion Trees.

电商所评分:5

点击查看评分详情!

Fault Tolerant Distributed Majority Commitment.

电商所评分:1

点击查看评分详情!

An Algorithm for the Lorenz Measure in Locational Decisions on Trees.

电商所评分:10

点击查看评分详情!

On a Conjecture by Plaisted and Hong.

电商所评分:8

点击查看评分详情!

Finding a Minimum Feedback Arc Set in Reducible Flow Graphs.

电商所评分:10

点击查看评分详情!

Stability in Circular Arc Graphs.

电商所评分:7

点击查看评分详情!

A Tighter Upper Bound on the Worst Case Behavior of Conway's Parallel Sorting Algorithm.

电商所评分:1

点击查看评分详情!

Solution to a Linear Diophantine Equation for Nonnegative Integers.

电商所评分:3

点击查看评分详情!