51

A general construction for nonblocking crosstalk-free photonic switching networks

Year:
2003
Language:
english
File:
PDF, 130 KB
english, 2003
53

Equivalence of buddy networks with arbitrary number of stages

Year:
2005
Language:
english
File:
PDF, 116 KB
english, 2005
55

Localizing combinatorial properties of partitions

Year:
1996
Language:
english
File:
PDF, 1.20 MB
english, 1996
57

A new competitive algorithm for group testing

Year:
1994
Language:
english
File:
PDF, 582 KB
english, 1994
58

Constrained partitioning problems

Year:
1994
Language:
english
File:
PDF, 260 KB
english, 1994
60

Efficient algorithms for the reliabilities of replicated n-parallel-task graphs

Year:
1996
Language:
english
File:
PDF, 237 KB
english, 1996
61

Diameters of weighted double loop networks

Year:
1988
Language:
english
File:
PDF, 454 KB
english, 1988
64

Permutation polytopes corresponding to strongly supermodular functions

Year:
2004
Language:
english
File:
PDF, 273 KB
english, 2004
65

A competitive algorithm to find all defective edges in a graph

Year:
2005
Language:
english
File:
PDF, 147 KB
english, 2005
66

Sphere-separable partitions of multi-parameter elements

Year:
2008
Language:
english
File:
PDF, 169 KB
english, 2008
67

A competitive algorithm in searching for many edges in a hypergraph

Year:
2007
Language:
english
File:
PDF, 143 KB
english, 2007
68

Exploring the missing link among d-separable, -separable and d-disjunct matrices

Year:
2007
Language:
english
File:
PDF, 111 KB
english, 2007
70

Using transforming matrices to generate DNA clone grids

Year:
2003
Language:
english
File:
PDF, 130 KB
english, 2003
71

A d-move local permutation routing for the d-cube

Year:
1997
Language:
english
File:
PDF, 680 KB
english, 1997
72

Linear-shaped partition problems

Year:
2000
Language:
english
File:
PDF, 89 KB
english, 2000
73

Structure importance of consecutive-k-out-of-n systems

Year:
1999
Language:
english
File:
PDF, 115 KB
english, 1999
74

Reliabilities for (n,f,k) systems

Year:
1999
Language:
english
File:
PDF, 89 KB
english, 1999
75

An O(n log n) algorithm for the generalized birthday problem

Year:
1997
Language:
english
File:
PDF, 476 KB
english, 1997
76

Lower bounds for wide-sense nonblocking Clos network

Year:
2001
Language:
english
File:
PDF, 97 KB
english, 2001
77

Channel graphs of bit permutation networks

Year:
2001
Language:
english
File:
PDF, 106 KB
english, 2001
81

The rectilinear steiner arborescence problem

Year:
1992
Language:
english
File:
PDF, 627 KB
english, 1992
82

Monotone routing in multirate rearrangeable logd(N,m,p) network

Year:
2005
Language:
english
File:
PDF, 350 KB
english, 2005
84

Partition polytopes over 1-dimensional points

Year:
1999
Language:
english
File:
PDF, 234 KB
english, 1999
87

On the number of separable partitions

Year:
2011
Language:
english
File:
PDF, 436 KB
english, 2011
88

A new approach to solve open-partition problems

Year:
2012
Language:
english
File:
PDF, 592 KB
english, 2012
89

A Polytope Approach to the Optimal Assembly Problem

Year:
2006
Language:
english
File:
PDF, 155 KB
english, 2006
90

The Mean-Partition Problem

Year:
2006
Language:
english
File:
PDF, 165 KB
english, 2006
93

Assembly at system level versus component level

Year:
1995
Language:
english
File:
PDF, 344 KB
english, 1995
95

Rearrangeability of bit permutation networks

Year:
2006
Language:
english
File:
PDF, 354 KB
english, 2006
97

Super line-connectivity of consecutive-d digraphs

Year:
1998
Language:
english
File:
PDF, 652 KB
english, 1998