Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

69

DMCCG
2001
Springer

123views Combinatorics» more DMCCG 2001»

New Bounds for Hypercube Slicing Numbers

15 years 7 months ago

New Bounds for Hypercube Slicing Numbers

Download www.emis.de

M. Reza Emamy-Khansary, Martin Ziegler

Real-time Traffic

Combinatorics | DMCCG 2001 |

claim paper

Related Content

» An optimal algorithm for area minimization of slicing floorplans

» Bounds on the Greedy Routing Algorithm for Array Networks

» The PyramidTechnique Towards Breaking the Curse of Dimensionality

» On the Fault Tolerance of Some Popular BoundedDegree Networks

» A DistanceBased Packing Method for High Dimensional Data

» DepthLatency Tradeoffs in Multicast Tree Algorithms

Post Info
More Details (n/a)

Added	28 Jul 2010
Updated	28 Jul 2010
Type	Conference
Year	2001
Where	DMCCG
Authors	M. Reza Emamy-Khansary, Martin Ziegler

Comments (0)