论文列表及评分结果

An Algorithm for Constructing Gröbner Bases from Characteristic Sets and Its Application to Geometry.

电商所评分:3

点击查看评分详情!

Parallel Geometric Algorithms on a Mesh-Connected Computer.

电商所评分:7

点击查看评分详情!

Solving Some Combinatorial Problems on Arrays with One-Way Dataflow.

电商所评分:7

点击查看评分详情!

A Fast Algorithm for Computing Sparse Visibility Graphs.

电商所评分:10

点击查看评分详情!

Dynamic Fractional Cascading.

电商所评分:2

点击查看评分详情!

An Optimal Time Bound for Oblivious Routing.

电商所评分:9

点击查看评分详情!

Internal and External Algorithms for the Points-in-Regions Problem-the INSIDE Join of Geo-Relational Algebra.

电商所评分:8

点击查看评分详情!

Dynamic Detection of Subgraphs in Computer Networks.

电商所评分:2

点击查看评分详情!

Analysis of the Standard Deletion Algorithms in Exact Fit Domain Binary Search Trees.

电商所评分:5

点击查看评分详情!

A Linear-Time Algorithm for Finding Approximate Shortest Common Superstrings.

电商所评分:9

点击查看评分详情!

Asynchronous Distributed Termination-Parallel and Symmetric Solutions with Echo Algorithms.

电商所评分:8

点击查看评分详情!

An Optimal Approximation Algorithm for the Rectilinear m-Center Problem.

电商所评分:3

点击查看评分详情!

The Complexity of Planar Compliant Motion Planning Under Uncertainty.

电商所评分:3

点击查看评分详情!

An Efficient Distributed Algorithm for Maximum Matching in General Graphs.

电商所评分:3

点击查看评分详情!

Computing Euclidean Maximum Spanning Trees.

电商所评分:8

点击查看评分详情!

Computational Geometry in a Curved World.

电商所评分:10

点击查看评分详情!

A Better Performance Guarantee for Approximate Graph Coloring.

电商所评分:6

点击查看评分详情!

A Theory of Rectangular Dual Graphs.

电商所评分:8

点击查看评分详情!

Some Chain Visibility Problems in a Simple Polygon.

电商所评分:3

点击查看评分详情!

Dynamic Maintenance of Planar Digraphs, with Applications.

电商所评分:1

点击查看评分详情!

A New Scheme for the Deterministic Simulation of PRAMs in VLSI.

电商所评分:3

点击查看评分详情!

Efficient Parallel and Sequential Algorithms for 4-Coloring Perfect Planar Graphs.

电商所评分:1

点击查看评分详情!

Searching for Empty Convex Polygons.

电商所评分:8

点击查看评分详情!

An Optimal Algorithm for the Boundary of a Cell in a Union of Rays.

电商所评分:7

点击查看评分详情!

Comments on Bern's Probabilistic Results on Rectilinear Steiner Trees.

电商所评分:1

点击查看评分详情!

Discrete Logarithms in GF(p).

电商所评分:1

点击查看评分详情!

The Complexity of Hashing with Lazy Deletion.

电商所评分:3

点击查看评分详情!

Shortest Paths in Euclidean Graphs.

电商所评分:10

点击查看评分详情!

Visibility of Disjoint Polygons.

电商所评分:2

点击查看评分详情!

Area-Time Lower-Bound Techniques with Applications to Sorting.

电商所评分:10

点击查看评分详情!