Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By ACM Press

0897911938

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

A linear-time algorithm for triangulating simple polygons

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12170 ◽

1986 ◽

Cited By ~ 18

Author(s):

R E Tarjan ◽

C J Van Wyk

Keyword(s):

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm ◽

Simple Polygons

Download Full-text

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12131 ◽

1986 ◽

Cited By ~ 87

Author(s):

D A Barrington

Keyword(s):

Branching Programs ◽

Polynomial Size ◽

Bounded Width

Download Full-text

New lower bounds for parallel computation

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12148 ◽

1986 ◽

Cited By ~ 7

Author(s):

M Li ◽

Y Yesha

Keyword(s):

Parallel Computation ◽

Lower Bounds

Download Full-text

Further applications of random sampling to computational geometry

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12173 ◽

1986 ◽

Cited By ~ 4

Author(s):

K L Clarkson

Keyword(s):

Computational Geometry ◽

Random Sampling

Download Full-text

Introducing efficient parallelism into approximate string matching and a new serial algorithm

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12152 ◽

1986 ◽

Cited By ~ 45

Author(s):

G M Landau ◽

U Vishkin

Keyword(s):

String Matching ◽

Approximate String Matching ◽

Serial Algorithm

Download Full-text

Linear programming with two variables per inequality in poly-log time

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12150 ◽

1986 ◽

Cited By ~ 1

Author(s):

G S Lueker ◽

N Megiddo ◽

V Ramachandran

Keyword(s):

Linear Programming

Download Full-text

Almost optimal lower bounds for small depth circuits

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12132 ◽

1986 ◽

Cited By ~ 173

Author(s):

J Hastad

Keyword(s):

Lower Bounds ◽

Small Depth

Download Full-text

The complexity of optimization problems

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12138 ◽

1986 ◽

Cited By ~ 24

Author(s):

M W Krentel

Keyword(s):

Optimization Problems

Download Full-text

Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12158 ◽

1986 ◽

Cited By ~ 57

Author(s):

A Blumer ◽

A Ehrenfeucht ◽

D Haussler ◽

M Warmuth

Keyword(s):

Geometric Concepts

Download Full-text

Rotation distance, triangulations, and hyperbolic geometry

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86 ◽

10.1145/12130.12143 ◽

1986 ◽

Cited By ~ 13

Author(s):

D D Sleator ◽

R E Tarjan ◽

W P Thurston

Keyword(s):

Hyperbolic Geometry

Download Full-text

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86Latest Publications

TOTAL DOCUMENTS

H-INDEX

Published By ACM Press

A linear-time algorithm for triangulating simple polygons

Bounded-width polynomial-size branching programs recognize exactly those languages in NC1

New lower bounds for parallel computation

Further applications of random sampling to computational geometry

Introducing efficient parallelism into approximate string matching and a new serial algorithm

Linear programming with two variables per inequality in poly-log time

Almost optimal lower bounds for small depth circuits

The complexity of optimization problems

Classifying learnable geometric concepts with the Vapnik-Chervonenkis dimension

Rotation distance, triangulations, and hyperbolic geometry

Proceedings of the eighteenth annual ACM symposium on Theory of computing - STOC '86
Latest Publications