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
2
search results - page 1 / 1
»
An Answer to a Question by Wilf on Packing Distinct Patterns...
Sort
relevance
views
votes
recent
update
View
thumb
title
5
click to vote
COMBINATORICS
2004
105
views
more
COMBINATORICS 2004
»
An Answer to a Question by Wilf on Packing Distinct Patterns in a Permutation
13 years 4 months ago
Download
www.combinatorics.org
We present a class of permutations for which the number of distinctly ordered subsequences of each permutation approaches an almost optimal value as the length of the permutation ...
Micah Coleman
claim paper
Read More »
11
click to vote
CPC
2000
58
views
more
CPC 2000
»
Packing Ferrers Shapes
13 years 4 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
claim paper
Read More »
« Prev
« First
page 1 / 1
Last »
Next »