Sciweavers

JCT
2011
97views more  JCT 2011»
13 years 6 months ago
The method of combinatorial telescoping
We present a method for proving q-series identities by combinatorial telescoping in the sense that one can transform a bijection or classification of combinatorial objects into a ...
William Y. C. Chen, Qing-Hu Hou, Lisa H. Sun
INFORMATICALT
2010
148views more  INFORMATICALT 2010»
13 years 8 months ago
A Novel Combinatorial Public Key Cryptosystem
Combinatorial problems serve as an important resource for developing practical public key cryptosystems and several combinatorial cryptosystems have been proposed in the cryptograp...
Baocang Wang, Yupu Hu
GBRPR
2009
Springer
13 years 9 months ago
A First Step toward Combinatorial Pyramids in n-D Spaces
Abstract. Combinatorial maps define a general framework which allows to encode any subdivision of an nD orientable quasi-manifold with or without boundaries. Combinatorial pyramids...
Sébastien Fourey, Luc Brun
TCS
2010
13 years 10 months ago
A combinatorial approach to the analysis of bucket recursive trees
In this work we provide a combinatorial analysis of bucket recursive trees, which have been introduced previously as a natural generalization of the growth model of recursive trees...
Markus Kuba, Alois Panholzer
RSA
2008
85views more  RSA 2008»
13 years 11 months ago
Quasi-random graphs with given degree sequences
It is now known that many properties of the objects in certain combinatorial structures are equivalent, in the sense that any object possessing any of the properties must of neces...
Fan Chung Graham, Ronald L. Graham
ANOR
2004
116views more  ANOR 2004»
13 years 11 months ago
Approximations and Randomization to Boost CSP Techniques
Abstract. In recent years we have seen an increasing interest in combining constraint satisfaction problem (CSP) formulations and linear programming (LP) based techniques for solvi...
Carla P. Gomes, David B. Shmoys
AMAI
2004
Springer
13 years 11 months ago
Logical Preference Representation and Combinatorial Vote
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...
Jérôme Lang
JCT
2007
90views more  JCT 2007»
13 years 11 months ago
Overpartitions, lattice paths, and Rogers-Ramanujan identities
We define the notions of successive ranks and generalized Durfee squares for overpartitions. We show how these combinatorial statistics give extensions to overpartitions of combin...
Sylvie Corteel, Olivier Mallet
ANOR
2005
89views more  ANOR 2005»
13 years 11 months ago
A Tutorial on the Cross-Entropy Method
The cross-entropy (CE) method is a new generic approach to combinatorial and multi-extremal
Pieter-Tjerk de Boer, Dirk P. Kroese, Shie Mannor,...
JQL
2006
75views more  JQL 2006»
13 years 11 months ago
Improving calculations of the number of distinct alignments of two strings
In a recent work, M. Covington discusses the enumeration of two different sets of alignments of two strings of symbols using elementary combinatorial techniques. He defines two fu...
Øystein J. Rødseth, James A. Sellers