Computing Reviews
Today's Issue Hot Topics Search Browse Recommended My Account Log In
Browse by topic Browse by titles Authors Reviewers Browse by issue Browse Help
Search
  Browse All Reviews > Mathematics Of Computing (G) > Discrete Mathematics (G.2) > Combinatorics (G.2.1) > Generating Functions (G.2.1...)  
 
Options:
 
  1-10 of 24 Reviews about "Generating Functions (G.2.1...)": Date Reviewed
  The algebra of set functions I: the product theorem and duality
Lass B.  European Journal of Combinatorics 33(2): 227-236, 2012. Type: Article

This is the first of a sequence of research reports that attempt to approach the topic of the algebra of set functions in a complete way, and to illustrate its practicality in (re-)defining and (re-)proving results that we might have missed in the...

May 24 2012
  A palindromization map for the free group
Kassel C., Reutenauer C.  Theoretical Computer Science 409(3): 461-470, 2008. Type: Article

This paper is in the area of discrete mathematics. It describes a self map of a free group, referred to as a palindromization map (Pal). Various properties of Pal are proved: braid groups, profinite topology, and cohomological interpretations....

Apr 13 2009
  The practical subtleties of biometric key generation
Ballard L., Kamara S., Reiter M.  SS 2008 (Proceedings of the 17th Security Symposium, San Jose, CA,  Jul 28-Aug 1, 2008) 61-74, 2008. Type: Proceedings

A biometric key generation system is a system where a biometric--for example, a fingerprint or an iris code--is coded and stored as a template, at an enrollment stage. When a user presents himself again, the biometric is again coded and ...

Mar 18 2009
  Kwyjibo: automatic domain name generation
Crawford H., Aycock J.  Software--Practice & Experience 38(14): 1561-1567, 2008. Type: Article

In some situations, it is useful to be able to generate random sequences of letters in such a way that the result can be pronounced. The application presented in this paper is a set of domain names for a simulated Web population. Crawford and Ayco...

Feb 11 2009
  On the lexicographical generation of compressed codes
Nebel M.  Information Processing Letters 104(3): 95-100, 2007. Type: Article

Nebel creates trees to facilitate the lexicographical generation of combinatorial objects in this paper. The strength of this approach is that the lexicographic successor of an object can be easily found by a tree traversal. Compression can be add...

Jan 30 2008
  Harmonic and gold Sturmian words
Carpi A., de Luca A.  European Journal of Combinatorics 25(5): 685-705, 2004. Type: Article

In this tour de force, the authors introduce two easily-defined proper subsets of the set PER of all finite words w on {a, b} having two relatively prime periods p and
Sep 23 2004
  Key distribution patterns using tangent circle structures
Rinaldi G.  Designs, Codes and Cryptography 31(3): 289-300, 2004. Type: Article

Consider a network where the users of the nodes may communicate privately and securely among themselves, via encrypted messages. Then, the network servers may act as encryption key distribution centers. The storage needed on the servers, for the k...

Jul 8 2004
  Forbidden subgraphs in connected graphs
Ravelomanana V., Thimonier L.  Theoretical Computer Science 314(1): 121-171, 2004. Type: Article

This is a long and technical paper on graphical enumeration for connected graphs (and multigraphs) with n vertices and n+k edges. Let Gn,k denote such a graph. The technique used ...

Jun 30 2004
  Greedy sums of distinct squares
Montgomery H., Vorhauer U.  Mathematics of Computation 73(245): 493-513, 2004. Type: Article

In this mathematical tour de force, the authors prove distribution properties of greedy sums of distinct squares (GSDSs), a subject that would seem to have received scant attention in the literature. A positive integer is a GSDS if there are no du...

Apr 14 2004
  Regexpcount, a symbolic package for counting problems on regular expressions and words
Nicodème P.  Fundamenta Informaticae 56(1,2): 71-88, 2003. Type: Article

This paper draws on an interplay of three disciplines: the classical theory of regular languages and finite automata; their generating series treated by analysis; and statistical quantities that can be obtained from these series. The paper discuss...

Jan 28 2004
 
 
 
Display per page
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2022 ThinkLoud, Inc.
Terms of Use
| Privacy Policy