Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540580782, 9783540484356

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Fault-tolerant linear broadcasting

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_18 ◽

1994 ◽

pp. 207-217

Author(s):

Krzysztof Diks ◽

Andrzej Pelc

Keyword(s):

Fault Tolerant

Download Full-text

Deepness analysis: Bringing optimal fronts to triangular finite element method

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_16 ◽

1994 ◽

pp. 181-196

Author(s):

Jérôme Galtier

Keyword(s):

Finite Element Method ◽

Finite Element ◽

Triangular Finite Element ◽

Element Method

Download Full-text

Scalable parallel computational geometry

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_11 ◽

1994 ◽

pp. 115-119

Author(s):

Frank Dehne

Keyword(s):

Computational Geometry

Download Full-text

Embedding 3-dimensional grids into optimal hypercubes

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_8 ◽

1994 ◽

pp. 81-94 ◽

Cited By ~ 1

Author(s):

Markus Röttger ◽

Ulf -Peter Schroeder ◽

Walter Unger

Keyword(s):

3 Dimensional

Download Full-text

Optimal parallel verification of minimum spanning trees in logarithmic time

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_2 ◽

1994 ◽

pp. 13-22 ◽

Cited By ~ 2

Author(s):

Brandon Dixon ◽

Robert E. Tkrjan

Keyword(s):

Spanning Trees ◽

Minimum Spanning Trees ◽

Parallel Verification

Download Full-text

Communications in bus networks

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_17 ◽

1994 ◽

pp. 197-206 ◽

Cited By ~ 5

Author(s):

André Hily ◽

Dominique Sotteau

Keyword(s):

Bus Networks

Download Full-text

Constant-time convexity problems on reconfigurable meshes

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_15 ◽

1994 ◽

pp. 169-180

Author(s):

V. Bokka ◽

H. Gurla ◽

S. Olariu ◽

J. L. Schwing

Keyword(s):

Constant Time ◽

Reconfigurable Meshes

Download Full-text

Work-Optimal thinning algorithm on SIMD machines

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_13 ◽

1994 ◽

pp. 137-152

Author(s):

Ubéda Stéphane

Keyword(s):

Thinning Algorithm

Download Full-text

Sorting and selection on arrays with diagonal connections

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_12 ◽

1994 ◽

pp. 121-136 ◽

Cited By ~ 2

Author(s):

Danny Krizanc ◽

Lata Narayanan

Download Full-text

Efficient reconstruction of the causal relationship in distributed systems

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice ◽

10.1007/3-540-58078-6_10 ◽

1994 ◽

pp. 101-113 ◽

Cited By ~ 1

Author(s):

P. Baldy ◽

H. Dicky ◽

R. Medina ◽

M. Morvan ◽

J. F. Vilarem

Keyword(s):

Distributed Systems ◽

Causal Relationship

Download Full-text

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and PracticeLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Fault-tolerant linear broadcasting

Deepness analysis: Bringing optimal fronts to triangular finite element method

Scalable parallel computational geometry

Embedding 3-dimensional grids into optimal hypercubes

Optimal parallel verification of minimum spanning trees in logarithmic time

Communications in bus networks

Constant-time convexity problems on reconfigurable meshes

Work-Optimal thinning algorithm on SIMD machines

Sorting and selection on arrays with diagonal connections

Efficient reconstruction of the causal relationship in distributed systems

Lecture Notes in Computer Science - Parallel and Distributed Computing Theory and Practice
Latest Publications