论文列表及评分结果

Edge-Skeletons in Arrangements with Applications.

电商所评分:3

点击查看评分详情!

The Pairing Heap: A New Form of Self-Adjusting Heap.

电商所评分:5

点击查看评分详情!

Fractional Cascading: I. A Data Structuring Technique.

电商所评分:7

点击查看评分详情!

Fractional Cascading: II. Applications.

电商所评分:7

点击查看评分详情!

Complexity of Some Laction Problems.

电商所评分:3

点击查看评分详情!

Channel Routing in Knock-Knee Mode: Simplified Algorithms and Proofs.

电商所评分:2

点击查看评分详情!

Two-Layer Channel Routing with Vertical Uni-Length Overlap.

电商所评分:4

点击查看评分详情!

Optimal Book Embeddings of the FFT, Benes, and Barrel Shifter Networks.

电商所评分:1

点击查看评分详情!

An O(ND) Difference Algorithm and Its Variations.

电商所评分:3

点击查看评分详情!

On-the-Fly, Incremental, Consistent Reading of Entire Databases.

电商所评分:3

点击查看评分详情!

Bit Transposition for Very Large Scientific and Statistical Databases.

电商所评分:6

点击查看评分详情!

An Evaluation of Buffer Management Strategies for Relational Database Systems.

电商所评分:8

点击查看评分详情!

Understanding the Implications of View Update Policies.

电商所评分:1

点击查看评分详情!

A Time Bound on the Materialization of Some Recursively Defined Views.

电商所评分:10

点击查看评分详情!

Introduction: New Approaches to Linear Programming.

电商所评分:8

点击查看评分详情!

A Modification of Karmarkar's Linear Programming Algorithm.

电商所评分:10

点击查看评分详情!

An Extension of Karmarkar's Algorithm for Linear Programming Using Dual Variables.

电商所评分:4

点击查看评分详情!

A Polynomial Newton Method for Linear Programming.

电商所评分:8

点击查看评分详情!

A Multiplicative Barrier Function Method for Linear Programming.

电商所评分:9

点击查看评分详情!

A Monotonic Projective Algorithm for Fractional Linear Programming.

电商所评分:1

点击查看评分详情!

Determining Basic Variables of Optimal Solutions in Karmarkar's New LP Algorithm.

电商所评分:8

点击查看评分详情!

A Projective Method for Linear Programming with Box-Type Constraints.

电商所评分:5

点击查看评分详情!

Homotopy Techniques in Linear Programming.

电商所评分:10

点击查看评分详情!

The Iterative Step in the Linear Programming Algorithm of N. Karmarkar.

电商所评分:4

点击查看评分详情!

Probabilistic methods in graph theory.

电商所评分:10

点击查看评分详情!

Colouring random graphs.

电商所评分:6

点击查看评分详情!

When are NP-hard location problems easy?

电商所评分:1

点击查看评分详情!

Probabilistic analysis of geometric location problems.

电商所评分:6

点击查看评分详情!

A probabilistic analysis of some greedy cardinality matching algorithms.

电商所评分:7

点击查看评分详情!

A probabilistic analysis of the set covering problem.

电商所评分:6

点击查看评分详情!