Sciweavers

7796 search results - page 153 / 1560
» On Generalized Schur Numbers
Sort
View
CORR
2010
Springer
141views Education» more  CORR 2010»
15 years 6 months ago
FIFO anomaly is unbounded
Abstract. Virtual memory of computers is usually implemented by demand paging. For some page replacement algorithms the number of page faults may increase as the number of page fra...
Peter Fornai, Antal Iványi
CORR
2010
Springer
86views Education» more  CORR 2010»
15 years 6 months ago
Matching with Couples Revisited
It is well known that a stable matching in a many-to-one matching market with couples need not exist. We introduce a new matching algorithm for such markets and show that for a ge...
Itai Ashlagi, Mark Braverman, Avinatan Hassidim
FFA
2008
76views more  FFA 2008»
15 years 6 months ago
On the subset sum problem over finite fields
Abstract. The subset sum problem over finite fields is a well known NPcomplete problem. It arises naturally from decoding generalized Reed-Solomon codes. In this paper, we study th...
Jiyou Li, Daqing Wan
COMBINATORICS
2006
116views more  COMBINATORICS 2006»
15 years 6 months ago
Classifying Descents According to Equivalence mod k
In [5] the authors refine the well-known permutation statistic "descent" by fixing parity of one of the descent's numbers. In this paper, we generalize the results o...
Sergey Kitaev, Jeffrey B. Remmel
COMGEO
2006
ACM
15 years 6 months ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy