Sciweavers

696 search results - page 46 / 140
» A class of combinatorial identities
Sort
View
COMBINATORICS
2006
135views more  COMBINATORICS 2006»
15 years 6 months ago
Lyndon Words and Transition Matrices between Elementary, Homogeneous and Monomial Symmetric Functions
Let h, e, and m denote the homogeneous symmetric function, the elementary symmetric function and the monomial symmetric function associated with the partition respectively. We gi...
Andrius Kulikauskas, Jeffrey B. Remmel
CORR
2007
Springer
148views Education» more  CORR 2007»
15 years 6 months ago
Linear time algorithms for Clobber
We prove that the single-player game clobber is solvable in linear time when played on a line or on a cycle. For this purpose, we show that this game is equivalent to an optimizat...
Vincent D. Blondel, Julien M. Hendrickx, Raphael M...
JCT
2010
92views more  JCT 2010»
15 years 4 months ago
Enumeration by kernel positions for strongly Bernoulli type truncation games on words
We find the winning strategy for a class of truncation games played on words. As a consequence of the present author’s recent results on some of these games we obtain new formul...
Gábor Hetyei
JCO
2011
63views more  JCO 2011»
14 years 9 months ago
Robust multi-sensor scheduling for multi-site surveillance
This paper presents mathematical programming techniques for solving a class of multi-sensor scheduling problems. Robust optimization problems are formulated for both deterministic ...
Nikita Boyko, Timofey Turko, Vladimir Boginski, Da...
EUROCRYPT
2007
Springer
16 years 10 days ago
General Ad Hoc Encryption from Exponent Inversion IBE
Among the three broad classes of Identity-Based Encryption schemes built from pairings, the exponent inversion paradigm tends to be the most efficient, but also the least extensibl...
Xavier Boyen