[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By IEEE Comput. Soc. Press

0818624450

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Dynamic maintenance of geometric structures made easy

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185369 ◽

2002 ◽

Cited By ~ 12

Author(s):

O. Schwarzkopf

Keyword(s):

Geometric Structures ◽

Dynamic Maintenance

Download Full-text

The art gallery theorem for polygons with holes

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185346 ◽

2002 ◽

Cited By ~ 27

Author(s):

F. Hoffmann ◽

M. Kaufmann ◽

K. Kriegel

Keyword(s):

Art Gallery ◽

Art Gallery Theorem

Download Full-text

Fault-tolerant computation in the full information model

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185405 ◽

2002 ◽

Cited By ~ 6

Author(s):

O. Goldreich ◽

S. Goldwasser ◽

N. Linial

Keyword(s):

Fault Tolerant ◽

Information Model ◽

Full Information

Download Full-text

Better expansion for Ramanujan graphs

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185397 ◽

2002 ◽

Cited By ~ 7

Author(s):

N. Kahale

Keyword(s):

Ramanujan Graphs

Download Full-text

A parallel algorithmic version of the local lemma

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185423 ◽

2002 ◽

Cited By ~ 3

Author(s):

N. Alon

Keyword(s):

Local Lemma

Download Full-text

A theory of using history for equational systems with applications

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185390 ◽

2002 ◽

Author(s):

R.M. Verma

Download Full-text

Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185429 ◽

2002 ◽

Cited By ~ 24

Author(s):

G.N. Frederickson

Keyword(s):

Data Structures ◽

Spanning Trees ◽

Edge Connectivity

Download Full-text

Adaptive dictionary matching

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185445 ◽

2002 ◽

Cited By ~ 18

Author(s):

A. Amir ◽

M. Farach

Keyword(s):

Dictionary Matching

Download Full-text

Faster uniquely represented dictionaries

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185430 ◽

2002 ◽

Cited By ~ 6

Author(s):

A. Andersson ◽

T. Ottmann

Download Full-text

Low contention linearizable counting

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science ◽

10.1109/sfcs.1991.185415 ◽

2002 ◽

Cited By ~ 7

Author(s):

M. Herlihy ◽

N. Shavit ◽

O. Waarts

Download Full-text

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By IEEE Comput. Soc. Press

Dynamic maintenance of geometric structures made easy

The art gallery theorem for polygons with holes

Fault-tolerant computation in the full information model

Better expansion for Ramanujan graphs

A parallel algorithmic version of the local lemma

A theory of using history for equational systems with applications

Ambivalent data structures for dynamic 2-edge-connectivity and k smallest spanning trees

Adaptive dictionary matching

Faster uniquely represented dictionaries

Low contention linearizable counting

[1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science
Latest Publications