Geometry.Net - the online learning center
Home  - Pure_And_Applied_Math - Discrete Math Bookstore
Page 6     101-116 of 116    Back | 1  | 2  | 3  | 4  | 5  | 6 

         Discrete Math:     more books (100)
  1. Electronics Math (6th Edition) by Bill R. Deem, 1999-06-11
  2. Developmental Mathematics (paperback edition) (Martin-Gay Developmental Math Series) by K. Elayn Martin-Gay, 2006-03-27
  3. Concepts in Discrete Mathematics by Sartaj Sahni, 1981
  4. Math Basics for the Healthcare Professional (2nd Edition) by Michele Benjamin Lesmeister, 2004-01-10
  5. Math for Computer Science by A. Arnold, Irene Guessarian, 1996-06-19
  6. Advanced Mathematical Concepts: Precalculus with Applications, Student Edition by McGraw-Hill, 2005-01-05
  7. Maths for the Building Trades by James Kidd, Ian Bell, 1997-03
  8. Basic Math With a Calculator by William R. Pasewark, 1993-06
  9. Computer Mathematics: Structured Basic With Math Applications by Cynthia L. Nahrgang, Dale R. Walivaara, et all 1989-04
  10. Sets, Logic and Maths for Computing (Undergraduate Topics in Computer Science) by David Makinson, 2008-07
  11. Practical Problems in Mathematics for Drafting and CAD (MB-Business/Vocational Math) by John Larkin, 1995-10-11
  12. Excursions in Modern Math by Peter Tannenbaum, 1998-10
  13. Prentice Hall's Reference to Mathematics: A Guide for Everyday Math by Cheryl Cleaves, Margie Hobbs, 2002-08-06
  14. Contemporary's Number Power 3 : Algebra A Real World Approach to Math by Robert Mitchell, 2000-01-01

101. Discrete Math Home Page
eschool homepage. Welcome! This is where you will find many resources for your discrete math online class. Here is what we currently have to offer
This is where you will find many resources for your Discrete Math online class. Here is what we currently have to offer:
  • A file to help you with installing Microsoft Active Agent Technology, so you may get the full benefit from the online presentations. Links to presentations and handout files about each section in each chapter we plan on covering. A listing of homework sets for you to complete. Contact information for your teachers.
Last Modified: 23 December 1999
By: Nini Arnold

102. Discrete Math University Of South Carolina
Gallery, Research interests include extremal set theory, extremal graph theory, graph coloring, operations research, and applications of discrete math to biology
Gallery Research interests include extremal set theory, extremal graph theory, graph coloring, operations research, and applications of discrete math to biology, number theory, analysis of algorithms, and communications Main research interests include claw-free graphs, matchings, Ramsey theory, Hamiltonian graph theory, and the domination number. Combinatorics and graph theory, and their applications to computer science and biology. In particular: extremal problems (graphs and set systems), combinatorial geometry, discrete probability, design and analysis of algorithms, phylogeny reconstruction, graph drawing, and combinatorial optimization. Other faculty with significant discrete connections include Michael Filaseta Ralph Howard Menu document.write('SIDEMENU')

103. MATH510 Discrete Math - 16501 (Chris Pinner)
discrete math Info. MATH 510. 16501 Chris Pinner. General Information. Course Outline. Homeworks. HW1. 1.8 14,17,18,26,27. (Due Friday Aug 29). HW Questions HW2.
Discrete Math Info
MATH 510
16501 Chris Pinner
General Information
Homeworks (Due Friday Aug 29). HW Questions
(Due Friday Sep 5).
20,22 (first part). 1,4b,5b,13. (Due Friday Sep 12). Extra Credit Problem:
(Due Friday Sep 19).
2. (Due Friday Sep 26).
5,8,10,11,12,18,20. (Due Friday Oct 3).
25,34,35,37,38. (Due Friday Oct 10).
2,5,6,9. (Due Friday Oct 17).
13,14,16,21,24ac. (Due Friday Oct 24). 1d,2,3c,6. (Due Friday Oct 31). 7,11,12,14,15b,21. (Due Friday Nov 7). 23b,24bd,25cd,27,30. (Due Friday Nov 14). 2,4,5,6,9,12. (Due Friday Nov 21). 13,15,29,30,35,37,39. (Due Wednesday Dec 3). Extra Credit 1,2,10,11,26 (Due Wed Dec 10). Exams Exam 1 is now scheduled for Wednesday October 1. Exam 2 i s currently planned for Wednesday November 12. Final Exam Wednesday December 17, 4:10-6:00pm, LS112. Spring 2003 Exam 1 Solutions) Fall 2003 Exam 1 Solutions: Actual exam will probably have more parts but will cover similar material. The exam will be based on examples covered in class or from the homework.

104. Powell's Books - Finite And Discrete Math: A Complete Solution Guide To Any Text
Finite and discrete math A Complete Solution Guide to Any Textbook by Rea. Available at Beaverton, Quimby Warehouse, Technical. Free Shipping!

105. Discrete Math Faculty
The discrete mathematics Faculty Interests. Please send comments to Last updated January 23, 2003
Bill Cherowitzo
- Finite Geometries, Design Theory, Combinatorics, Coding Theory and Cryptology.
Kathy Fraughnaugh
- Graph Theory, Mathematical Foundations of Artificial Intelligence and Heuristic Search, Applied Abstract Algebra
Rich Lundgren
- Applied Graph Theory, Combinatorics, Qualitative Matrix Theory
Stan Payne
- Finite Geometries, Generalized Quadrangles, Algebra, Combinatorics, Number Theory
Main Page - Math Dept. Discrete Math Group Page Please send comments to . Last updated: January 23, 2003

106. Discrete And Statistical Sciences
discrete and Statistical Sciences. Auburn University Library. mathSciNet. Online Manuals. Thesis Sample Files. math and Stat Links. Auburn University Graduate School. Alabama SuperComputer Network .
Discrete and Statistical Sciences
Auburn University Library


Online Manuals

Thesis Sample Files
... Contacting us
Mail and FAX addresses for undergraduate and graduate information in the Department People and Activities
Faculty, staff, GTAs, and visitors Courses and Programs
Information on courses and programs of study Statistics Home Page
and the Applied Statistics Consulting Lab Research
Areas of interest, seminars, conferences, books, and summer programs June 2004. Send comments concerning this site to

107. Graph Theory And Discrete Geometry Manila 2001
A Conference in Honor of Frank Harary on his 80th Year. Ateneo de Manila University, Quezon City, the Philippines; 1517 October 2001.
  • Ateneo de Manila University Commission on Higher Education (CHED, Phils.) Fujitsu, Philippines Manulife Financial Mathematical Society of the Philippines Software Ventures International Corporation Tokai University UNESCO
since April 27, 2001 PHOTO GALLERY
Selected pictures taken during the conference are now posted. CONFERENCE PROCEEDINGS
The proceedings of the conference will be published as a volume of Graphs and Combinatorics. Papers will be refereed in keeping with the standards of the journal. The paper should be 8 pages or less and should follow the format which you can find in the website of the journal Graphs and Combinatorics . Deadline for submission of the full paper: October 17, 2001. Please submit 3 copies of the paper. ORGANIZING COMMITTEE Jin Akiyama
Research Institute of Educational Development
Tokai University Mikio Kano
Department of Computer and Information Science
Ibaraki University Agnes D. Garciano

108. Alex Suciu
Northeastern University, Boston. Topology and combinatorics hyperplane arrangements, the topology and geometry of manifolds, the homology of discrete groups, the homotopy theory of highdimensional knots.

I hail from Bucharest, Romania. I did my undergraduate studies in Mathematics at the University of Bucharest ; here is a picture from those days. For my graduate studies, I went to Columbia University, in New York City; here is a picture from that time (taken in Cambridge, UK). After a J.W. Gibbs Instructorship at Yale University , in New Haven, I came to Northeastern University, in Boston, where I've been ever since.
Math publications
Other publications Citations Meetings organized ... Talks My research interests are in Topology , and how it relates to Algebra, Geometry, and Combinatorics. I mainly study the topology and combinatorics of hyperplane arrangements. I also study various problems concerning the topology and geometry of knots, links, and manifolds, and the homology and lower central series of discrete groups. Some recent papers and preprints: Torsion in Milnor fiber homology (with Dan Cohen and Graham Denham Algebraic and Geometric Topology Chen Lie algebras (with Stefan Papadima International Math. Research Notices

109. Alternative PK/PD Modelling - Deal
Open source package for the technical computing language R, developed by Aalborg University and Novo Nordisk A/S analysis and structure learning of Bayesian networks with discrete and/or continuous variables
Front Research / Deal ]
Deal: Learning Bayesian Networks in R
Deal is a software package freely available (under the terms of the GNU General Public License ) for use with R . It includes several methods for the analysis of Bayesian networks with variables of both discrete and/or continuous types. We restrict ourselves to conditionally Gaussian networks. Construction of priors for network parameters is supported and these parameters can be learned from data. The network score is used as a metric to compare different networks and forms the basis of a heuristic search strategy to learn the structure of the network. In addition, methods for simulation of datasets with a given dependency structure is implemented. Deal has the possibility to read and save .net files (readnet, savenet), which can be used by eg. Hugin Deal has been developed by Susanne G. Bøttcher and Claus Dethlefsen , supported by Novo Nordisk A/S. Deal is part of the gR project.
You should study the paper: Susanne G. Bøttcher and Claus Dethlefsen. deal: A Package for Learning Bayesian Networks.

110. Peter Benner - Software
SLICOT Subroutine Library in Control Theory, Parallel Library in Control (PLiC) for largescale time-invariant linear control systems in state-space form on parallel distributed computers, eigenvalues of Hamiltonian Matrices, subroutines for compressing a symmetric or triangular matrix to packed storage mode or to unpack a packed array to full storage mode, benchmark examples of discrete-time algebraic Riccati equations, benchmark examples of continuous-time algebraic Riccati equations.
Peter Benner - Software
The software retrievable from this page is usually archived in tar files that are compressed with gzip . If you have any problems downloading or uncompressing the files, please click here
Fortran 77
The Subroutine Library in Control Theory (SLICOT) is developed and maintained by the Working Group on Software (WGS) and is currently further extended within the EU funded thematic network NICONET (Numerics In COntrol NETwork). Click here to see a list of all its members. SLICOT provides Fortran 77 implementations of numerical algorithms for computations in systems and control theory. Based on numerical linear algebra routines from the BLAS and LAPACK libraries, SLICOT provides methods for the design and analysis of control systems. At present, SLICOT contains 175 user-callable subroutines and 80 low-level subroutines. SLICOT is organized in the following chapters: The documentation of SLICOT is available on-line. It contains complete descriptions of each available subroutine. To see a sample documentation of a routine (AB01MD.f), click

111. CCCG 2001: Canadian Conference On Computational Geometry
CCCG focuses on the mathematics of discrete geometry from a computational point of view. Despite its international following, CCCG maintains the informality of a smaller workshop (7085 attendees) and attracts a large number of students. August 13-15, 2001; Waterloo, Canada.
13th Canadian Conference on Computational Geometry
University of Waterloo, August 13-15, 2001


FOR AUTHORS Call for papers

Accepted papers

Submit final version

Invited speakers

Conference program
Proceedings PARTICIPANTS Call for participation Local information Travel Accommodation ... Registration OTHER Past CCCG conferences What does CCCG mean? Printable version
Canadian Conference on Computational Geometry
CCCG 2001 is over! Look at for the information on current CCCG conference. The Canadian Conference on Computational Geometry (CCCG) focuses on the mathematics of discrete geometry from a computational point of view. Abstracting and studying the geometry problems that underly important applications of computing (such as geographic information systems, computer-aided design, simulation, robotics, solid modeling, databases, and graphics) leads not only to new mathematical results, but also to improvements in these applications. Despite its international following, CCCG maintains the informality of a smaller workshop (70-85 attendees) and attracts a large number of students. The CCCG 2001 conference is sponsored by: Webmaster:

112. Paul Garrett: Crypto And Number Theory
Introduction to cryptology, numbertheory, and algorithms. Protocols. Symmetric versus asymmetric systems. Stream, block ciphers. One-way functions, signatures. Key management. (Pseudo-) random number generation. Permutation groups. Primes, Euclidean algorithm. Finite fields. Quadratic reciprocity. discrete logs, RSA. Pseudoprimes, rho method. Elliptic curve methods.
Crypto and Number Theory
my homepage updated 14:50, 17 May 04] [this page is] (No, I will not be teaching Crypto in 2004-05.) Some overheads from Fall '03 class:

Dedicated to the memory of Istvan Vincze. Athens, Greece; 57 June 2002.

114. CADCOM-Applications
Hwang, AT T Bell Laboratories, USA. The discrete Logarithm Problem in Cryptography , Alfred J. Menezes, Auburn University, USA.

115. Colorful Mathematics/Background
Please use electronic mail to or write to LAF Software 5904 Silver Ridge Dr. NW Calgary, Alberta Canada T3B 3R9.
The goal of these coloring games is to help students experience a mathematics problem, and understand its difficulties while achieving partial solutions. This process is at the root of mathematical and scientific reasoning, and the aim of this software is to help develop this skill. Concrete mathematical and computer science problems from graph theory. have been chosen and transformed into coloring games. The computer offers appealing tools for drawing and coloring, and is also used to provide immediate feedback to individual students reflecting their particular level of achievement. Throughout the course of each game, the computer checks for mistakes and simple algorithms have been programmed to challenge the students to improve on their results.
  • Comments and suggestions are most welcome!
    Please use electronic mail to or write to:
    LAF Software
    5904 Silver Ridge Dr. N.W.
    Calgary, Alberta
    Canada T3B 3R9

116. REU: Research Experience For Undergraduates - Summer 2004
Research Experiences for Undergraduates Summer 2004. DIMACS REU, DIMACS/DIMATIA REU. June 7 - July 30, 2004. DIMACS/DIMATIA participants
Research Experiences for Undergraduates - Summer 2004 DIMACS REU DIMACS/DIMATIA REU
June 7 - July 30, 2004
DIMACS/DIMATIA participants in Prague, Czech Republic: July 24 - August 11, 2004.
Application Deadline: January 31, 2004.
DIMACS, with National Science Foundation sponsorship, has offered an REU program since 1992. There are two REU programs associated with this program:
  • The DIMACS REU program offers projects mentored by DIMACS members.
  • The DIMACS/DIMATIA REU program offers projects mentored by DIMACS members, the program is extended by two weeks, and the last two and a half weeks of the program are spent at our sister site DIMATIA at Charles University in Prague, Czech Republic. Students selected to participate in this program generally exhibit strong interests in combinatorics.
Both programs offer the same stipend, housing and office accommodations. These REU pages have information on:

Page 6     101-116 of 116    Back | 1  | 2  | 3  | 4  | 5  | 6 

free hit counter