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)
 
  Combinatorics (G.2.1) See Reviews  
 
Subject Descriptors:
Combinatorial Algorithms (140)
Counting Problems (26)
Generating Functions (23)
Permutations And Combinations (59)
Recurrences And Difference Equations (23)
 
Proper Nouns:
There are no proper nouns with reviews under G.2.1.
 
 
Reviews limited to:
 
 

Reviews about "Combinatorics (G.2.1)":
Simulating independence: new constructions of condensers, Ramsey graphs, dispersers, and extractors
Barak B., Kindler G., Shaltiel R., Sudakov B., Wigderson A.  Journal of the ACM 57(4): 1-52, 2010. Type: Article
Applied combinatorics (2nd ed.)
Roberts F., Tesman B.,  Chapman&Hall/CRC, Boca Raton, FL, 2009. 848 pp. Type: Book
Games of no chance 3
Albert M., Nowakowski R.,  Cambridge University Press, New York, NY, 2009. 576 pp. Type: Book
Combinatorics: the Rota way
Kung J., Rota G., Yan C.,  Cambridge University Press, New York, NY, 2009. 408 pp. Type: Book
A constraint on the biembedding of Latin squares
Lefevre J., Donovan D., Grannell M., Griggs T.  European Journal of Combinatorics 30(2): 380-386, 2009. Type: Article
Analytic combinatorics
Flajolet P., Sedgewick R.,  Cambridge University Press, New York, NY, 2009. 824 pp. Type: Book
A palindromization map for the free group
Kassel C., Reutenauer C.  Theoretical Computer Science 409(3): 461-470, 2008. Type: Article
more...
Related Topics
G.2.1 Combinatorics
  - Nonnumerical Algorithms And Problems
   
 
Send Your Comments
Contact Us
Reproduction in whole or in part without permission is prohibited.   Copyright © 2000-2010 Reviews.com
Terms of Use
| Privacy Policy