Searched for keywords.author.keyword:"discrete mathematics" OR acmdlCCS:"discrete mathematics"  [new search]  [edit/save query]  [advanced search]
Searched The ACM Full-Text Collection: 472,292 records   [Expand your search to The ACM Guide to Computing Literature: 2,693,142 records] Help: ACM vs. Guide
12,374 results found
Export Results: bibtexendnoteacmrefcsv

Refine by People
Names show/hide
Institutions show/hide
Authors show/hide
Editors show/hide
Reviewers show/hide
Refine by Publications
Publication Names show/hide
ACM Publications show/hide
All Publications show/hide
Content Formats show/hide
Publishers show/hide
Refine by Conferences
Sponsors show/hide
Events show/hide
Proceeding Series show/hide
Refine by Publication Year
1952
Result 1 – 20 of 12,374
Result page: 1 2 3 4 5 6 7 8 9 10 >>

Sort by:

1 published by ACM
March 2009 ACM-SE 47: Proceedings of the 47th Annual Southeast Regional Conference
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 39,   Downloads (Overall): 258

Full text available: PDFPDF
We describe a mathematics course designed for Computer Science majors in which they investigate large scale examples based in discrete mathematics. This course was developed in response to the need to strengthen the theoretical content of the Computer Science curriculum. The design of this course supports better learning and using ...
Keywords: discrete mathematics
[result highlights]

2 published by ACM
October 2011 OOPSLA '11: Proceedings of the ACM international conference companion on Object oriented programming systems languages and applications companion
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 4,   Downloads (12 Months): 29,   Downloads (Overall): 148

Full text available: PDFPDF
Functional programming is losing its place in undergraduate computer science curricula, in part because of the attention given to many new ideas in the field. Nevertheless, undergraduates benefit from an early experience in a second programming paradigm, especially functional programming. The solution, advocated here, is to weave functional programming into ...
Keywords: functional programming, discrete mathematics
[result highlights]

3 published by ACM
March 2004 ACM SIGCSE Bulletin: Volume 36 Issue 1, March 2004
Publisher: ACM
Bibliometrics:
Citation Count: 5
Downloads (6 Weeks): 1,   Downloads (12 Months): 13,   Downloads (Overall): 503

Full text available: PDFPDF
We have recently launched a reorganized discrete structures course being taught in the computer science department for computer science majors. The main idea of the reorganization is to make the course relevant and productive for the computer science students. During the Spring of 2003, students who were taking both discrete ...
Keywords: discrete mathematics curriculum
Also published in:
March 2004  SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education
[result highlights]

4 published by ACM
March 2011 SIGCSE '11: Proceedings of the 42nd ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 12,   Downloads (Overall): 117

Full text available: PDFPDF
Many students find that proof by induction is one of the most difficult topics in discrete mathematics. Even students who are able to write inductive proofs in a Discrete Mathematics course often find it difficult to write inductive proofs in Data Structures, Algorithms, Theory of Computation, and other computer science ...
Keywords: proof by induction, pedagogy, discrete mathematics
[result highlights]

5 published by ACM
March 2011 SIGCSE '11: Proceedings of the 42nd ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 3,   Downloads (12 Months): 36,   Downloads (Overall): 207

Full text available: PDFPDF
This survey paper reviews a large sample of publications on the teaching of discrete structures and discrete mathematics in computer science curricula. The approach is systematic, in that a structured search of electronic resources has been conducted, and the results are presented and quantitatively analyzed. A number of broad themes ...
Keywords: computing curriculum, discrete mathematics, discrete structures
[result highlights]

6
April 2008 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 5 Issue 2, April 2008
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 0,   Downloads (12 Months): 2,   Downloads (Overall): 173

Full text available: PDFPDF
We consider a combinatorial problem derived from haplotyping a population with respect to a genetic disease, either recessive or dominant. Given a set of individuals, partitioned into healthy and diseased, and the corresponding sets of genotypes, we want to infer ``bad'' and ``good'' haplotypes to account for these genotypes and ...
Keywords: Combinatorics, Discrete Mathematics, Biology and genetics
[result highlights]

7 published by ACM
March 2014 SIGCSE '14: Proceedings of the 45th ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 0

Induction is a notoriously difficult topic for beginning computer science students to understand. Even if they can produce an inductive proof of some mathematical fact, many students never see the relevance of inductive reasoning outside of the classroom for anything beyond the natural numbers. This is unfortunate because inductive reasoning ...
Keywords: functional programming, induction, computer science education, discrete mathematics
[result highlights]

8 published by ACM
March 2009 SIGCSE '09: Proceedings of the 40th ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 9,   Downloads (Overall): 109

Full text available: PDFPDF
Keywords: algorithms, discrete mathematics, assignments, historical sources, projects, pedagogy
Also published in:
March 2009  ACM SIGCSE Bulletin - SIGCSE '09: Volume 41 Issue 1, March 2009
[result highlights]

9 published by ACM
March 2010 SIGCSE '10: Proceedings of the 41st ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 1,   Downloads (12 Months): 10,   Downloads (Overall): 175

Full text available: PDFPDF
The "2007 SIGCSE Report On the Implementation of a Discrete Mathematics Course" recommends relocating some discrete structures topic areas to other courses, for the sake of coherency. Our implementation of the one semester course also relocates topics, but additionally features a focus on a significant computer science problem: regular language ...
Keywords: course models, cc2001, computing curriculum, discrete mathematics, discrete structures
[result highlights]

10 published by ACM
June 2006 ACM SIGCSE Bulletin: Volume 38 Issue 4, December 2006
Publisher: ACM
Bibliometrics:
Citation Count: 19
Downloads (6 Weeks): 3,   Downloads (12 Months): 40,   Downloads (Overall): 809

Full text available: PDFPDF
This report describes concept inventories, specialized assessment instruments that enable educational researchers to investigate student (mis)understandings of concepts in a particular domain. While students experience a concept inventory as a set of multiple-choice items taken as a test, this belies its purpose, its careful development, and its validation. A concept ...
Keywords: discrete mathematics, assessment, concept inventory, misconceptions, assessment tools, distractors
Also published in:
June 2006  ITiCSE-WGR '06: Working group reports on ITiCSE on Innovation and technology in computer science education
[result highlights]

11 published by ACM
Jonas B. Weber, Ulf Lorenz
July 2017 GECCO '17: Proceedings of the Genetic and Evolutionary Computation Conference Companion
Publisher: ACM
Bibliometrics:
Citation Count: 0

Booster stations are fluid systems consisting of interconnected components such as pumps, pipes, valves and fittings. One of their main applications is to supply whole buildings or higher floors with drinking water if the supply pressure of the water company is not high enough to guarantee a continuous supply for ...
Keywords: application of discrete mathematics, booster station, technical operations research, system synthesis, pressure booster system
[result highlights]

12 published by ACM
June 2007 ITiCSE '07: Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 0
Downloads (6 Weeks): 2,   Downloads (12 Months): 4,   Downloads (Overall): 169

Full text available: PDFPDF
In this poster, some tools for graph algorithms active learning are presented. These tools pursue a new goal on computer assisted educational resources, so as to acting as authentic virtual trainers extending teacher's hand through the Web. In other words, they are on line self assessment tools that help students ...
Keywords: discrete mathematics learning, java applets, visualization, e-learning, education, interactive learning
Also published in:
June 2007  ACM SIGCSE Bulletin - Proceedings of the 12th annual SIGCSE conference on Innovation and technology in computer science education (ITiCSE'07): Volume 39 Issue 3, September 2007
[result highlights]

13
July 2009 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 6 Issue 3, July 2009
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 4
Downloads (6 Weeks): 1,   Downloads (12 Months): 6,   Downloads (Overall): 185

Full text available: PDFPDF
The Robinson-Foulds (RF) distance is by far the most widely used measure of dissimilarity between trees. Although the distribution of these distances has been investigated for 20 years, an algorithm that is explicitly polynomial time has yet to be described for computing the distribution for trees around a given tree. ...
Keywords: Biology and genetics, discrete mathematics applications, trees, phylogenetics, Robinson-Foulds distance, Poisson approximation, normalization constant.
[result highlights]

14 published by ACM
March 2004 ACM SIGCSE Bulletin: Volume 36 Issue 1, March 2004
Publisher: ACM
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 4,   Downloads (12 Months): 14,   Downloads (Overall): 264

Full text available: PDFPDF
There are a wide variety of ways to present information at the front of a classroom. These include chalk on a blackboard, markers on a whiteboard, pens on transparencies, and computer projection systems. While computer-based presentation systems provide many opportunities both in and out of the classroom, there may also ...
Keywords: classroom presentations, discrete mathematics
Also published in:
March 2004  SIGCSE '04: Proceedings of the 35th SIGCSE technical symposium on Computer science education
[result highlights]

15 published by ACM
January 1969 Communications of the ACM: Volume 12 Issue 1, Jan. 1969
Publisher: ACM
Bibliometrics:
Citation Count: 6
Downloads (6 Weeks): 2,   Downloads (12 Months): 19,   Downloads (Overall): 757

Full text available: PDFPDF
Computers are being applied to an increasingly diverse range of problems in group theory. The most important areas of application at present are coset enumeration, sub-group lattices, automorphism groups of finite groups, character tables, and commutator calculus. Group theory programs range from simple combinatorial or numerical programs to large symbol ...
Keywords: commutator calculus, discrete mathematics, subgroup lattices, topology, Abelian groups, coset enumeration, group theory, nonnumerical programming, symbol manipulation, crystallography, automorphism groups, character tables, permutation groups, survey
[result highlights]

16 published by ACM
December 1995 ACM Computing Surveys (CSUR): Volume 27 Issue 4, Dec. 1995
Publisher: ACM
Bibliometrics:
Citation Count: 15
Downloads (6 Weeks): 3,   Downloads (12 Months): 37,   Downloads (Overall): 1,425

Full text available: PDFPDF
Keywords: NP-completeness, discrete mathematics, graph theory, matching, P-completeness, coloring, complexity theory, cubic graphs, planar graphs, regular graphs
[result highlights]

17
October 2008 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 5 Issue 4, October 2008
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 9
Downloads (6 Weeks): 2,   Downloads (12 Months): 3,   Downloads (Overall): 259

Full text available: PDFPDF
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computational biology. Here we introduce a constrained form of this problem in which a partial mapping of a set of nodes (the "seeds") in one ...
Keywords: Graph algorithms, Graph Theory, Discrete Mathematics, Mathematics of Computing, Trees, Biology and genetics, Life and Medical Sciences, Computer Applications
[result highlights]

18 published by ACM
June 2007 ACM SIGCSE Bulletin: Volume 39 Issue 2, June 2007
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 2,   Downloads (12 Months): 12,   Downloads (Overall): 533

Full text available: PDFPDF
Teaching a class for the first time is always a challenge. Add to the new experience a team-teaching approach and a professor teaching outside of his comfort zone, and things get even more complicated. In this article we evaluate our team-teaching of Discrete Math to computer science majors at the ...
Keywords: discrete mathematics, team-teaching, teaching
[result highlights]

19
July 2010 IEEE/ACM Transactions on Computational Biology and Bioinformatics (TCBB): Volume 7 Issue 3, July 2010
Publisher: IEEE Computer Society Press
Bibliometrics:
Citation Count: 2
Downloads (6 Weeks): 1,   Downloads (12 Months): 1,   Downloads (Overall): 78

Full text available: PDFPDF
Haplotype data play a relevant role in several genetic studies, e.g., mapping of complex disease genes, drug design, and evolutionary studies on populations. However, the experimental determination of haplotypes is expensive and time-consuming. This motivates the increasing interest in techniques for inferring haplotype data from genotypes, which can instead be ...
Keywords: Biology and genetics, heuristic methods, discrete mathematics.
[result highlights]

20 published by ACM
March 2011 SIGCSE '11: Proceedings of the 42nd ACM technical symposium on Computer science education
Publisher: ACM
Bibliometrics:
Citation Count: 1
Downloads (6 Weeks): 4,   Downloads (12 Months): 27,   Downloads (Overall): 187

Full text available: PDFPDF
During the past 20 years, probability theory has become a critical element in the development of many areas in computer science. Commensurately, in this paper, we argue for expanding the coverage of probability in the computing curriculum. Specifically, we present details of a new course we have developed on Probability ...
Keywords: computing curricula, probability theory, discrete mathematics
[result highlights]

Result 1 – 20 of 12,374
Result page: 1 2 3 4 5 6 7 8 9 10 >>



The ACM Digital Library is published by the Association for Computing Machinery. Copyright © 2017 ACM, Inc.
Terms of Usage   Privacy Policy   Code of Ethics   Contact Us
 
Export Formats