Analysis of Optimal Sets of Survivable Paths in Undirected Simple Graph Applicable for Optical Networks Fulltext Access 5 Pages 2005
Paired-domination of Cartesian products of graphs and rainbow domination Fulltext Access 5 Pages 2005
2-local distributed algorithms for generalized coloring of hexagonal graphs Fulltext Access 5 Pages 2005
Perfect codes in Cartesian products of hypercube and multidimensional grid Fulltext Access 5 Pages 2005
Read-Once Functions Revisited and the Readability Number of a Boolean Function Fulltext Access 5 Pages 2005
Codes with the identifiable parent property and the multiple-access channel Fulltext Access 5 Pages 2005
Transmission, identification and common randomness capacities for wire-tape channels with secure feedback from the decoder Fulltext Access 5 Pages 2005
Watermarking Identification Codes with Related Topics on Common Randomness Fulltext Access 5 Pages 2005
Universal Sets of Quantum Information Processing Primitives and their optimal use Fulltext Access 5 Pages 2005
On-line scheduling to minimize max flow time: an optimal preemptive algorithm Fulltext Access 6 Pages 2005
Estimating with randomized encoding the joint empirical distribution in a correlated source Fulltext Access 6 Pages 2005
Estimates of E-capacity and capacity regions for Multiple-access Channel With Random Parameter Fulltext Access 6 Pages 2005
Edge disjoint paths and max integral multiflow/min multicut theorems in planar graphs Fulltext Access 6 Pages 2005