Lecture Notes in Computer Science - Algorithms and Data Structures
Latest Publications

TOTAL DOCUMENTS

57

(FIVE YEARS 0)

H-INDEX

9

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540571551, 9783540479185

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Detecting race conditions in parallel programs that use one semaphore

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_272 ◽

1993 ◽

pp. 471-482 ◽

Author(s):

Hsueh -I Lu ◽

Philip N. Klein ◽

Robert H. B. Netzer

Keyword(s):

Parallel Programs ◽

Race Conditions

Download Full-text

Repetitive hidden-surface-removal for polyhedral scenes

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_278 ◽

1993 ◽

pp. 541-552 ◽

Author(s):

Marco Pellegrini

Keyword(s):

Hidden Surface Removal ◽

Polyhedral Scenes ◽

Surface Removal

Download Full-text

Efficient approximate shortest-path queries among isothetic rectangular obstacles

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_276 ◽

1993 ◽

pp. 518-529 ◽

Author(s):

Pinaki Mitra ◽

Binay Bhattacharya

Keyword(s):

Shortest Path ◽

Approximate Shortest Path ◽

Download Full-text

The exhaustion of shared memory: Stochastic results

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_274 ◽

1993 ◽

pp. 494-505

Author(s):

Robert S. Maier ◽

René Schott

Keyword(s):

Download Full-text

An algorithm for finding predecessors in integer sets

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_273 ◽

1993 ◽

pp. 483-493

Author(s):

Bruce Maggs ◽

Monika Rauch

Download Full-text

Tree reconstruction from partial orders

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_265 ◽

1993 ◽

pp. 397-408

Author(s):

Sampath Kannan ◽

Tandy Warnow

Keyword(s):

Partial Orders ◽

Tree Reconstruction

Download Full-text

A complete and efficient algorithm for the intersection of a general and a convex polyhedron

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_258 ◽

1993 ◽

pp. 314-324 ◽

Author(s):

Katrin Dobrindt ◽

Kurt Mehlhorn ◽

Mariette Yvinec

Keyword(s):

Efficient Algorithm ◽

Convex Polyhedron

Download Full-text

Probing a set of hyperplanes by lines and related problems

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_237 ◽

1993 ◽

pp. 72-82 ◽

Author(s):

Yasukazu Aoki ◽

Hiroshi Imai ◽

Keiko Imai ◽

David Rappaport

Download Full-text

Tolerating faults in meshes and other networks

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_231 ◽

1993 ◽

pp. 26-26

Author(s):

Richard Cole

Download Full-text

Balanced search trees made simple

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/3-540-57155-8_236 ◽

1993 ◽

pp. 60-71 ◽

Author(s):

Arne Andersson

Keyword(s):

Download Full-text