DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By American Mathematical Society

9780821802380, 9781470439798

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

Shuffled tree based fault-tolerant hierarchical interconnection networks

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/17 ◽

1995 ◽

pp. 251-265

Author(s):

O Karam ◽

Dharma Agrawal

Keyword(s):

Interconnection Networks ◽

Fault Tolerant

Download Full-text

Cayley digraphs of finite cyclic groups with minimal average distance

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/16 ◽

1995 ◽

pp. 229-250

Author(s):

Xing-De Jia

Keyword(s):

Average Distance ◽

Cyclic Groups

Download Full-text

Fault-tolerant Kautz networks

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/14 ◽

1995 ◽

pp. 201-210

Author(s):

Rabah Harbane

Keyword(s):

Fault Tolerant

Download Full-text

Routing in optical networks: The problem of contention

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/12 ◽

1995 ◽

pp. 173-180

Author(s):

Leslie Goldberg

Keyword(s):

Optical Networks

Download Full-text

Conflict-free access to constant-perimeter rectangular subarrays

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/09 ◽

1995 ◽

pp. 105-124 ◽

Cited By ~ 1

Author(s):

Doreen Erickson ◽

Charles Colbourn

Keyword(s):

Free Access

Download Full-text

Modification of consecutive-d digraphs

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/07 ◽

1995 ◽

pp. 75-85

Author(s):

Ding-Zhu Du ◽

D Hsu ◽

Daniel Kleitman

Download Full-text

Using helpful sets to improve graph bisections

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/06 ◽

1995 ◽

pp. 57-73 ◽

Cited By ~ 22

Author(s):

Ralf Diekmann ◽

B Monien ◽

R Preis

Download Full-text

On broadcasting schemes in restricted optical passive star systems

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/03 ◽

1995 ◽

pp. 19-29 ◽

Cited By ~ 1

Author(s):

Pascal Berthome ◽

Afonso Ferreira

Download Full-text

Ranking algorithms for Hamiltonian paths in hypercubic networks

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/01 ◽

1995 ◽

pp. 1-7 ◽

Cited By ~ 3

Author(s):

Fred Annexstein

Keyword(s):

Hamiltonian Paths ◽

Ranking Algorithms

Download Full-text

List of participants

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations ◽

10.1090/dimacs/021/22 ◽

1995 ◽

pp. 327-342

Author(s):

D Hsu

Download Full-text

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel ComputationsLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By American Mathematical Society

Shuffled tree based fault-tolerant hierarchical interconnection networks

Cayley digraphs of finite cyclic groups with minimal average distance

Fault-tolerant Kautz networks

Routing in optical networks: The problem of contention

Conflict-free access to constant-perimeter rectangular subarrays

Modification of consecutive-d digraphs

Using helpful sets to improve graph bisections

On broadcasting schemes in restricted optical passive star systems

Ranking algorithms for Hamiltonian paths in hypercubic networks

List of participants

DIMACS Series in Discrete Mathematics and Theoretical Computer Science - Interconnection Networks and Mapping and Scheduling Parallel Computations
Latest Publications