Search for Topics All Reviews
	Browse All Reviews > Theory Of Computation (F) > Analysis Of Algorithms And Problem Complexity (F.2) > Nonnumerical Algorithms And Problems (F.2.2) > Computations On Discrete Structures (F.2.2...)     Options: All Media Types Journals Proceedings Div Books Whole Books Other Date Reviewed Title Author Publisher Published Date Descending Ascending     1-10 of 61 Reviews about "Computations On Discrete Structures (F.2.2...)": Date Reviewed   Mathematics of discrete structures for computer science Pace G., Springer Publishing Company, Incorporated, New York, NY, 2012. 309 pp.  Type: Book (978-3-642298-39-4) I thought this would be a good discrete mathematics text for an undergraduate computer science course, but I was wrong! The standard topics--including propositional logic, predicate calculus, sets, relations, discrete structur... Dec 18 2012   Zen puzzle garden is NP-complete Houston R., White J., Amos M. Information Processing Letters 112(3): 106-108, 2012.  Type: Article A Zen puzzle garden (ZPG) is a grid of squares that fall in three groups: walkable squares, where a monk may move freely; rock squares, which cannot be entered; and sand squares, where the monk may move according to certain rules. The ... May 22 2012   Stable matching with couples: an empirical study Biró P., Irving R., Schlotter I. Journal of Experimental Algorithmics 161.1-1.27, 2011.  Type: Article The stable marriage problem is a well-known combinatorial problem with an equally well-known solution: the Gale-Shapley algorithm. This algorithm and its variants are used to solve similar problems, such as assigning teachers to classe... Feb 22 2012   Understanding Bloom filter intersection for lazy address-set disambiguation Jeffrey M., Steffan J.  SPAA 2011 (Proceedings of the 23rd ACM Symposium on Parallelism in Algorithms and Architectures, San Jose, CA, Jun 4-6, 2011) 345-354, 2011.  Type: Proceedings Bloom filters have recently received a significant amount of interest due to their many applications in the large data and analytics spaces. The original use of the Bloom filter (by Bloom and in the years that followed) was in the form... Aug 19 2011   Finding heaviest H-subgraphs in real weighted graphs, with applications Vassilevska V., Williams R., Yuster R. ACM Transactions on Algorithms 6(3): 1-23, 2010.  Type: Article This 23-page monograph is based on two preliminary papers published in the proceedings of relevant conferences. The H-subgraph problem starts with given graphs G and H, and asks ... Oct 14 2010   A sequence of one-point codes from a tower of function fields Hasegawa T., Kondo S., Kurusu H. Designs, Codes and Cryptography 41(3): 251-267, 2006.  Type: Article A linear (error-correcting) code is a subspace of a vector space defined over a finite field. The basic parameters are the length or dimension of the full space, the rate or dimension of the subspace, and the minimum distance, which is... Mar 7 2007   Subexponential parameterized algorithms on bounded-genus graphs and H-minor-free graphs Demaine E., Fomin F., Hajiaghayi M., Thilikos D. Journal of the ACM 52(6): 866-893, 2005.  Type: Article Over the last few years, the theory of parameterized complexity has developed into a useful framework for a refined analysis of hard algorithmic problems. Several researchers have obtained exponential speedups in fixed-parameter algori... Jun 1 2006   Why simulating evolutionary processes is just as interesting as applying them Lehmann K.  Genetic and evolutionary computation (Proceedings of the 2005 Workshops on Genetic and Evolutionary Computation, Washington, D.C., Jun 25-26, 2005) 370-373, 2005.  Type: Proceedings Biology has given us several new computing paradigms, and it has also provided us with many elegant solutions to difficult computing and communications problems. One such field is evolutionary computing, which is based on the principle... Mar 9 2006   Inside PageRank Bianchini M., Gori M., Scarselli F. ACM Transactions on Internet Technology 5(1): 92-128, 2005.  Type: Article Web searching continues to be a popular topic, of both commercial and academic interest. This paper presents an in-depth mathematical analysis of the properties of Google’s PageRank algorithm, which relies on the topological ... May 2 2005   Local ratio: A unified framework for approximation algorithms. In Memoriam: Shimon Even 19352004 Bar-Yehuda R., Bendel K., Freund A., Rawitz D. ACM Computing Surveys 36(4): 422-463, 2004.  Type: Article The authors describe this survey as a small textbook, and I agree wholeheartedly. But, it is a textbook summarizing about 80 related papers in 41 pages, so the interested reader is required to read it slowly, and with a lot of thought.... Mar 8 2005       Display 510152550100 per page
	Reproduction in whole or in part without permission is prohibited.   Copyright 1999-2024 ThinkLoud® Terms of Use | Privacy Policy