Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
32
click to vote
CPC
2000
favorite
Email
discuss
report
58
views
more
CPC 2000
»
Packing Ferrers Shapes
13 years 10 months ago
Download
www.cs.tau.ac.il
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
Noga Alon, Miklós Bóna, Joel Spencer
Real-time Traffic
CPC 2000
|
Distinct Ferrers
|
Rectangle
|
Sufficiently Large
|
claim paper
Related Content
»
Improving Dense Packings of Equal Disks in a Square
»
Application of a ModelFree Algorithm for the Packing of Irregular Shaped Objects in Semico...
»
Modelling Search Strategies in Rules2CP
»
A squeaky wheel optimisation methodology for twodimensional strip packing
»
Topology constrained rectilinear block packing for layout reuse
»
A Novel Delaunay Simplex Technique for Detection of Crystalline Nuclei in Dense Packings o...
»
Geometrical Characterization of Various Shaped 3DAggregates of Primary Spherical Particule...
»
High Quality Anisotropic Tetrahedral Mesh Generation Via Ellipsoidal Bubble Packing
»
Optimal Rectangle Packing Initial Results
more »
Post Info
More Details (n/a)
Added
17 Dec 2010
Updated
17 Dec 2010
Type
Journal
Year
2000
Where
CPC
Authors
Noga Alon, Miklós Bóna, Joel Spencer
Comments
(0)
Researcher Info
CPC 2010 Study Group
Computer Vision