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

TOTAL DOCUMENTS

43

(FIVE YEARS 0)

H-INDEX

10

(FIVE YEARS 0)

Published By Springer-Verlag

3540543430

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Sharing memory in asynchronous message passing systems

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028256 ◽

2005 ◽

pp. 129-140

Author(s):

Oscar R. Aguilar ◽

Ajoy Kumar Datta ◽

Sukumar Ghosh

Keyword(s):

Message Passing

Download Full-text

Geometric searching and link distance

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028268 ◽

2005 ◽

pp. 261-272 ◽

Author(s):

Gautam Das ◽

Giri Narasimhan

Keyword(s):

Download Full-text

A case study in comparison based complexity: Finding the nearest value(s)

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028244 ◽

2005 ◽

pp. 1-12

Author(s):

Walter Cunto ◽

J. Ian Munro ◽

Patricio V. Poblete

Download Full-text

On computing the voronoi diagram for restricted planar figures

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028250 ◽

2005 ◽

pp. 54-64 ◽

Author(s):

Hristo Djidjev ◽

Andrzej Lingas

Keyword(s):

Voronoi Diagram

Download Full-text

An optimal algorithm for computing visibility in the plane

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028282 ◽

2005 ◽

pp. 437-448 ◽

Author(s):

Paul J. Heffernan ◽

Joseph S. B. Mitchell

Keyword(s):

Optimal Algorithm

Download Full-text

A linear time algorithm for computing the shortest line segment from which a polygon is weakly externally visible

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028280 ◽

2005 ◽

pp. 412-424 ◽

Author(s):

Binary K. Bhattacharya ◽

Asish Mukhopadhyay ◽

Godfried T. Toussaint

Keyword(s):

Line Segment ◽

Linear Time ◽

Time Algorithm ◽

Linear Time Algorithm

Download Full-text

Farthest neighbors, maximum spanning trees and related problems in higher dimensions

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028254 ◽

2005 ◽

pp. 105-116 ◽

Author(s):

Pankaj K. Agarwal ◽

Jiří Matoušek ◽

Subhash Suri

Keyword(s):

Spanning Trees ◽

Higher Dimensions

Download Full-text

Memory access in models of parallel computation: From folklore to synergy and beyond

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028253 ◽

2005 ◽

pp. 92-104 ◽

Author(s):

Selim G. Akl

Keyword(s):

Parallel Computation ◽

Download Full-text

A fast derandomization scheme and its applications

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028260 ◽

2005 ◽

pp. 177-188

Author(s):

Yijie Han

Download Full-text

Unstructured path problems and the making of semirings

Lecture Notes in Computer Science - Algorithms and Data Structures ◽

10.1007/bfb0028261 ◽

2005 ◽

pp. 189-200 ◽

Author(s):

T. Lengauer ◽

D. Theune

Download Full-text