Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540633570, 9783540695226

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Can large fanin circuits perform reliable computations in the presence of noise?

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045074 ◽

1997 ◽

pp. 72-81 ◽

Cited By ~ 2

Author(s):

Rüdiger Reischuk

Keyword(s):

Reliable Computations

Conflict-free access to templates of trees and hypercubes in parallel memory systems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045066 ◽

1997 ◽

pp. 1-10 ◽

Cited By ~ 3

Author(s):

Sajal K. Das ◽

M. Cristina Pinotti

Keyword(s):

Memory Systems ◽

Free Access ◽

Parallel Memory

Limited acceleration mechanism for cell loss free flow control in ATM networks

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045117 ◽

1997 ◽

pp. 502-511 ◽

Cited By ~ 1

Author(s):

Hong Liu ◽

Enmin Song ◽

Reza Sotudeh

Keyword(s):

Flow Control ◽

Cell Loss ◽

Free Flow ◽

Atm Networks ◽

Acceleration Mechanism

An approach to scalability of parallel matrix multiplication algorithms

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045116 ◽

1997 ◽

pp. 492-501 ◽

Cited By ~ 2

Author(s):

Xingfu Wu

Keyword(s):

Matrix Multiplication

The shapes of trees

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045108 ◽

1997 ◽

pp. 412-421 ◽

Cited By ~ 3

Author(s):

Ulrich Hertrampf

Optimal multiresolution polygonal approximation

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045070 ◽

1997 ◽

pp. 32-41

Author(s):

K. W. Chan ◽

Francis Y. L. Chin

Keyword(s):

Polygonal Approximation

On modularity of completeness in order-sorted term rewriting systems

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045100 ◽

1997 ◽

pp. 331-342

Author(s):

Yoshinobu Kawabe ◽

Naohiro Ishii

Keyword(s):

Term Rewriting ◽

Term Rewriting Systems ◽

Rewriting Systems

Tree structure genetic algorithm with a nourishment mechanism

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045115 ◽

1997 ◽

pp. 482-491

Author(s):

Zhangang Han ◽

Ruqian Lu

Keyword(s):

Genetic Algorithm ◽

Tree Structure

On physical mapping algorithms: An error-tolerant test for the consecutive ones property

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045091 ◽

1997 ◽

pp. 242-250 ◽

Cited By ~ 2

Author(s):

Wen-Liar Hsu

Keyword(s):

Physical Mapping ◽

Mapping Algorithms ◽

Consecutive Ones Property

Resolution of Hartmanis' conjecture for NL-hard sparse sets

Lecture Notes in Computer Science - Computing and Combinatorics ◽

10.1007/bfb0045073 ◽

1997 ◽

pp. 62-71 ◽

Cited By ~ 1

Author(s):

Jin-Yi Cai ◽

D. Sivakumar

Lecture Notes in Computer Science - Computing and CombinatoricsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

Can large fanin circuits perform reliable computations in the presence of noise?

Conflict-free access to templates of trees and hypercubes in parallel memory systems

Limited acceleration mechanism for cell loss free flow control in ATM networks

An approach to scalability of parallel matrix multiplication algorithms

The shapes of trees

Optimal multiresolution polygonal approximation

On modularity of completeness in order-sorted term rewriting systems

Tree structure genetic algorithm with a nourishment mechanism

On physical mapping algorithms: An error-tolerant test for the consecutive ones property

Resolution of Hartmanis' conjecture for NL-hard sparse sets

Lecture Notes in Computer Science - Computing and Combinatorics
Latest Publications