论文列表及评分结果

Problems.

电商所评分:1

点击查看评分详情!

The NP-Completeness Column: An Ongoing Guide.

电商所评分:10

点击查看评分详情!

The Analysis of Linear Probing Sort by the Use of a New Mathematical Transform.

电商所评分:8

点击查看评分详情!

Multiplying Schur functions.

电商所评分:9

点击查看评分详情!

Sequential and Distributed Graph Coloring Algorithms with Performance Analysis in Random Graph Spaces.

电商所评分:10

点击查看评分详情!

On a Dual Version of the One-Dimensional Bin Packing Problem.

电商所评分:3

点击查看评分详情!

An Adaptive Algorithm for System Level Diagnosis.

电商所评分:2

点击查看评分详情!

Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem.

电商所评分:2

点击查看评分详情!

A Probabilistic Analysis of the Next-Fit Bin Packing Algorithm.

电商所评分:5

点击查看评分详情!

New Algorithms for Selection.

电商所评分:10

点击查看评分详情!

Problems.

电商所评分:1

点击查看评分详情!

The NP-Completeness Column: An Ongoing Guide.

电商所评分:5

点击查看评分详情!

An Optimal Contour Algorithm for Iso-Oriented Rectangles.

电商所评分:4

点击查看评分详情!

On Symmetric Algorithms for Bilinear Forms over Finite Fields.

电商所评分:2

点击查看评分详情!

A Non-Factorial Algorithm for Canonical Numbering of a Graph.

电商所评分:7

点击查看评分详情!

Short Monotone Formulae for the Majority Function.

电商所评分:9

点击查看评分详情!

Optimum Split Trees.

电商所评分:2

点击查看评分详情!

Gauss Codes, Planar Hamiltonian Graphs, and Stack-Sortable Permutations.

电商所评分:6

点击查看评分详情!

A Separator Theorem for Graphs of Bounded Genus.

电商所评分:10

点击查看评分详情!

On the Solution of Inequality Systems Relevant to IC-Layout.

电商所评分:3

点击查看评分详情!

An O(n log n) Algorithm for Finding All Repetitions in a String.

电商所评分:5

点击查看评分详情!

The NP-Completeness Column: An Ongoing Guide.

电商所评分:6

点击查看评分详情!

Heuristic Matching for Graphs Satisfying the Triangle Inequality.

电商所评分:2

点击查看评分详情!

Finding the Number of Factors of a Polynomial.

电商所评分:3

点击查看评分详情!

A Linear Algorithm for Nonhomogeneous Spectra of Numbers.

电商所评分:9

点击查看评分详情!

Optimal Algorithms to Compute the Closure of a Set of Iso-Rectangles.

电商所评分:6

点击查看评分详情!

Characterizations of Totally Balanced Matrices.

电商所评分:1

点击查看评分详情!

On Two Geometric Problems Related to the Traveling Salesman Problem.

电商所评分:8

点击查看评分详情!

Generating Random Regular Graphs.

电商所评分:6

点击查看评分详情!

An Efficient Algorithm for Generating All k-Subsets (1 <= k <= m <= n) of the Set { 1, 2, ..., n } in Lexicographical Order.

电商所评分:7

点击查看评分详情!