论文列表及评分结果

Conway's Parallel Sorting Algorithm.

电商所评分:6

点击查看评分详情!

Bipartite Graph Matching for Points on a Line or a Circle.

电商所评分:4

点击查看评分详情!

Computing the Convex Hull of Line Intersections.

电商所评分:10

点击查看评分详情!

The NP-Completeness Column: An Ongoing Guide.

电商所评分:8

点击查看评分详情!

On the Number of Queries Necessary to Identify a Permutation.

电商所评分:9

点击查看评分详情!

The Complexity of Generating an Exponentially Distributed Variate.

电商所评分:1

点击查看评分详情!

A Stochastic Analysis of the NFD Bin-Packing Algorithm.

电商所评分:6

点击查看评分详情!

Routing Through a Generalized Switchbox.

电商所评分:6

点击查看评分详情!

Polygon Containment under Translation.

电商所评分:5

点击查看评分详情!

Generalized Steiner Problem in Series-Parallel Networks.

电商所评分:3

点击查看评分详情!

A Fast and Simple Randomized Parallel Algorithm for the Maximal Independent Set Problem.

电商所评分:1

点击查看评分详情!

The NP-Completeness Column: An Ongoing Guide.

电商所评分:7

点击查看评分详情!

Graph Minors. II. Algorithmic Aspects of Tree-Width.

电商所评分:9

点击查看评分详情!

An Algorithmic Proof of a Generalization of the Birkhoff-Von Neumann Theorem.

电商所评分:5

点击查看评分详情!

An Algorithm for Constructing m-ary de Bruijn Sequences.

电商所评分:5

点击查看评分详情!

Optimal Expected-Time Algorithms for Merging.

电商所评分:3

点击查看评分详情!

An O(n log n) Randomizing Algorithm for the Weighted Euclidean 1-Center Problem.

电商所评分:8

点击查看评分详情!

Fast Computation of the Modality of Polygons.

电商所评分:10

点击查看评分详情!

Finding Short Cycles in Planar Graphs Using Separators.

电商所评分:7

点击查看评分详情!

On Deletion in Threaded Binary Trees.

电商所评分:5

点击查看评分详情!

Faster Construction of Optimal Binary Split Trees.

电商所评分:4

点击查看评分详情!

Algorithms for Maximum Independent Sets.

电商所评分:4

点击查看评分详情!

Point Retrieval for Polygons.

电商所评分:5

点击查看评分详情!

The Optimal Representation of Disjoint Iso-Oriented Rectangles in Two-Dimensional Trees.

电商所评分:5

点击查看评分详情!

Evaluation of a MULTIFIT-Based Scheduling Algorithm.

电商所评分:9

点击查看评分详情!

A Compact Representation for Permutation Groups.

电商所评分:1

点击查看评分详情!

A Better than "Best Possible" Algorithm to Edge Color Multigraphs.

电商所评分:8

点击查看评分详情!

An Efficient Parallel Algorithm for Shifting the Root of a Depth First Spanning Tree.

电商所评分:3

点击查看评分详情!

An Algorithmic Characterization of Total Digraphs.

电商所评分:3

点击查看评分详情!

On the Complexity of Circulations.

电商所评分:7

点击查看评分详情!