154 search results - page 17 / 31 » cpc 2008 |
CPC
2004
13 years 7 months ago
2004
We provide a probabilistic analysis of the output of Quicksort when comparisons can err.
CPC
2004
13 years 7 months ago
2004
Using representation theory, we obtain a necessary and sufficient condition for a discrete
CPC
2000
13 years 7 months ago
2000
Answering a question of Wilf, we show that if n is sufficiently large, then one cannot cover an n
CPC
2000
13 years 7 months ago
2000
We prove that if an involution is an automorphism of a connected binary matroid M, then there is a hyperplane of M that is invariant under . We also consider extensions of this re...
CPC
1998
13 years 7 months ago
1998
We give a characterization for isoperimetric invariants, including the Cheeger constant and the isoperimetric number of a graph. This leads to an isoperimetric inequality for the ...