Lecture Notes in Computer Science - Optimal Algorithms
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540518594, 9783540468318

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Optimal bounds on the dictionary problem

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_10 ◽

1989 ◽

pp. 106-114 ◽

Cited By ~ 3

Author(s):

Arne Andersson

Keyword(s):

Optimal Bounds

Download Full-text

Complexity of the parallel Givens factorization on shared memory architectures

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_9 ◽

1989 ◽

pp. 86-105 ◽

Cited By ~ 1

Author(s):

Michel Cosnard ◽

Mostafa Daoudi ◽

Yves Robert

Keyword(s):

Shared Memory ◽

Memory Architectures ◽

Shared Memory Architectures

Download Full-text

An upper bound on the order of locally testable deterministic finite automata

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_7 ◽

1989 ◽

pp. 48-65 ◽

Cited By ~ 5

Author(s):

Sam Kim ◽

Robert McNaughton ◽

Robert McCloskey

Keyword(s):

Upper Bound ◽

Finite Automata ◽

Deterministic Finite Automata

Download Full-text

A framework for parallel graph algorithm design

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_5 ◽

1989 ◽

pp. 33-40 ◽

Cited By ~ 1

Author(s):

Vijaya Ramachandran

Keyword(s):

Algorithm Design ◽

Graph Algorithm ◽

Parallel Graph

Download Full-text

Computing digitized voronoi diagrams on a systolic screen and applications to clustering

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_3 ◽

1989 ◽

pp. 14-24

Author(s):

Frank Dehne

Keyword(s):

Voronoi Diagrams

Download Full-text

The approximability of problems complete for P

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_16 ◽

1989 ◽

pp. 193-204 ◽

Cited By ~ 6

Author(s):

Maria Serna ◽

Paul Spirakis

Download Full-text

PRAM algorithms for identifying polygon similarity

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_4 ◽

1989 ◽

pp. 25-32

Author(s):

Costas S. Iliopoulos ◽

W. F. Smyth

Download Full-text

Optimal parallel algorithms for b-matchings in trees

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_22 ◽

1989 ◽

pp. 274-308 ◽

Cited By ~ 2

Author(s):

Constantine N. K. Osiakwan ◽

Selim G. Akl

Keyword(s):

Parallel Algorithms

Download Full-text

Local insertion sort revisited

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_19 ◽

1989 ◽

pp. 239-253 ◽

Cited By ~ 3

Author(s):

Jyrki Katajainen ◽

Christos Levcopoulos ◽

Ola Petersson

Download Full-text

Disassembling two-dimensional composite parts via translations

Lecture Notes in Computer Science - Optimal Algorithms ◽

10.1007/3-540-51859-2_14 ◽

1989 ◽

pp. 153-167 ◽

Cited By ~ 1

Author(s):

Doron Nussbaum ◽

Jörg-R. Sack

Keyword(s):

Two Dimensional

Download Full-text

Lecture Notes in Computer Science - Optimal AlgorithmsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Optimal bounds on the dictionary problem

Complexity of the parallel Givens factorization on shared memory architectures

An upper bound on the order of locally testable deterministic finite automata

A framework for parallel graph algorithm design

Computing digitized voronoi diagrams on a systolic screen and applications to clustering

The approximability of problems complete for P

PRAM algorithms for identifying polygon similarity

Optimal parallel algorithms for b-matchings in trees

Local insertion sort revisited

Disassembling two-dimensional composite parts via translations

Lecture Notes in Computer Science - Optimal Algorithms
Latest Publications