- Overlap Number of Graphs Douglas B. West
- More Undecidable Problems We prove questions are undecidable by
- A Rudimentary Intro to C programming Wayne Goddard
- Turing Machines Our most powerful model of a computer is
- The 22nd Clemson Mini-Conference on Discrete Mathematics and Algorithms
- ODU Sensor Network Research Group 11 Information assuranceInformation assurance
- The Existence of Domino Magic Squares and Michael Springfield, Wayne Goddard
- The Monotone Column Permanent Conjecture and Multivariate Eulerian Polynomials
- Finite Automata A finite automaton has a finite set of states with
- Crossing Families Boris Aronov1
- Multipartitions Classical Results for p(n)
- Corrections to first printing of: Introducing the Theory of Computation
- Covering Chessboard with Dominoes Need: A ChessBoard and Dominoes each able to cover most of two
- Rings and Flows Related Problems
- Some New Research Directions in Domination S. Arumugam
- Threshold and Complexity Results for the Cover Pebbling Game
- The global attractivity and periodic character of some rational difference equations of arbitrary order
- CpSc212 Goddard Notes Chapter 10 Linked Lists
- CpSc212 Goddard Notes Chapter 21 21.1 Graphs
- CpSc212 Goddard Notes Chapter 2 Arrays, Pointers and Functions
- CpSc212 Goddard Notes Chapter 7 More on Classes
- Recent Results in Secure Domination Kieka Mynhardt
- Recursive Algorithms Polynomial Approach
- From Max Dehn to Mikhael Gromov, the Geometry of Infinite Groups.
- The Chomsky Hierarchy There are other types of grammars.
- Delannoy numbers and a combinatorial proof of the orthogonality of the
- A Rudimentary Intro to C programming Wayne Goddard
- The Theory and Application of Complex Orthogonal Designs
- CpSc212 Goddard Notes Chapter 17 17.1 Priority Queue
- Context-Free Grammars A grammar is a set of rules for putting strings
- Building the ShiftReduce Table We show how to construct the table for
- Time Complexity The time complexity of a decision problem is how
- OPTIMAL RANDOMIZED ALGORITHMS FOR LOCAL SORTING AND SET-MAXIMA
- Bottom-Up Parsing We can use bottom-up parsing to find the
- Maximal Chains and Antichains in Finite Partially Ordered Sets
- Recursive Functions Recursive functions are built up from basic
- Conversions Among FAs and REs We describe algorithms that convert among
- Approximation algorithms for covering edges
- On the Square Dependence Ernie Croot
- Properties of Regular Languages There are severe limits to the recognition
- Pascal's Triangle Pascal's triangle is created as follows. The first two rows are 1 and 1 1. Each
- Introduction to Algorithms Part 2: Greedy Algorithms
- NP-Completeness We consider the hardest problems in NP.
- The Subtraction Game Need: A supply of counters.
- Domination and Packing in Graph Products
- CpSc212 Goddard Notes Chapter 3 Algorithm Analysis
- CpSc212 Goddard Notes Chapter 20 20.1 Five Sorting Algorithms
- CpSc212 Goddard Notes Chapter 9 Often in solving a problem one breaks up the problem into subtasks. Recursion
- the problem Solving the
- A Second Course in Java Brief Notes for Computer Science 102
- Thanks Steve and Renu! On H-Linked Graphs
- Experimental Mathematics Sequences of Bernoulli, Euler and Strodt
- Combinatorics of RNA Secondary Structures
- Research Articles A Computer/Human Mastermind Player using Grids
- Properties of Context-free Languages We give the Pumping Lemma.
- Decidable Problems and Recursive Languages
- Non-vanishing of the partition function modulo
- Revolutionaries and Spies Daniel W. Cranston
- Guaranteed Parsing The CYK algorithm for parsing works with
- The Complexity of the Evolution of Graph Labelings
- Derivation Trees and Regular Languages
- Mistilings with Dominoes Wayne Goddard, University of Pennsylvania
- Isodiametric Problems for Polygons
- Thinking Outside Terry McKee
- PSD and SOS polynomials Bernstein and Polya theorems How to write a polynomial as a sum of squares Certificates of positi Certificates of Positivity
- The Class NP NP is the problems that can be solved in
- Proving NP-Completeness We show problems are NP-complete by reducing
- The Murty/Simon Conjecture Total Domination Edge Critical Graphs
- CpSc212 Goddard Notes Chapter 1 Basics of C++
- CpSc212 Goddard Notes Chapter 19 Advance C++ Topics
- Finding matchings in Sarah Holliday
- Symmetric Chains of Subsets and Necklaces Carla D. Savage
- Combinatorics of Perfect Codes Combinatorics of Perfect Codes
- Nondeterministic Finite Automata Nondeterminism gives a machine multiple
- Counting pairs of lattice paths by intersections Ira Gessel1, Brandeis University, Waltham, MA 02254-9110, USA
- Diagonalization and the Halting Problem
- CpSc212 Goddard Notes Chapter 22 Paths & Searches
- CpSc212 Goddard Notes Chapter 11 A linear data structure is one which is ordered. There are two special types with
- Social Choice Majority Vote Graphs
- Overlap Number of Graphs Douglas B. West
- A Rudimentary Intro to C programming Wayne Goddard
- Applications of Finite Automata Applications of finite automata include string
- CpSc212 Goddard Notes Chapter 8 Collections
- CpSc212 Goddard Notes Chapter 4 Program Development
- Random Graphs Alan Frieze
- Clemson University, Conference October 2004 Linear Dependency and the Quadratic Sieve
- On 1, 2, 3-conjecture Michal Karonski
- Ways of shattering Properties of osh Algebra and osh Applications Linear Algebraic Methods and Grobner Bases
- Introduction to Algorithms Part 3: P, NP
- SOME RECENT RESULTS ON RESTRAINED Johannes H. Hattingh
- Chomsky Normal Form We introduce Chomsky Normal Form, which is
- Introduction to Algorithms Part 1: Divide and Conquer
- A Rudimentary Intro to C programming Wayne Goddard
- The Pairing Game Need: Paper and writing implement.
- Chaotic Behavior in a Deterministic Model of Manufacturing
- Explicit Construction of Small Folkman Graphs
- Packing Degree Sequences Stephen G. Hartke
- A Rudimentary Intro to C programming Wayne Goddard
- Independence polynomials of path-like graphs
- CFGs and PDAs are Equivalent We provide algorithms to convert
- First-Fit is Linear on (r + s)-free Posets Kevin G. Milans (milans@math.sc.edu)
- Introduction problems Ideas Light Spanners Approximation Schemes Summary Faster Approximations for TSP and 2-ECSS
- CpSc212 Goddard Notes Chapter 13 13.1 Binary Trees
- CpSc212 Goddard Notes Chapter 5 Basics of Classes
- Space Complexity The space complexity of a program is
- CpSc212 Goddard Notes Chapter 16 Inheritance
- Conflict and Tolerance Representations of Graphs
- Introduction General Results
- Distributing medicine using PageRank Department of Mathematics and Computer Science
- Codes designed via algebraic lifts of graphs Clemson Mini-Conference on Discrete Mathematics
- Static Mastermind Wayne Goddard
- Automated Bounds on Recursive Structures Wayne Goddard
- Wagering in Final Jeopardy At the end of the television quiz program Jeopardy! comes Final Jeopardy!.
- CpSc212 Goddard Notes Chapter 6 6.1 Header Files
- Forcing Disjoint Segments in the Plane Wayne Goddard
- Regular Expressions A regular expression describes a language using
- CpSc212 Goddard Notes Chapter 15 More Search Trees
- CpSc212 Goddard Notes Chapter 14 Binary Search Trees
- Variations of Turing Machines We show that changing the model,
- CpSc212 Goddard Notes Chapter 18 Hash Tables
- Mastermind Revisited Wayne Goddard
- Ideal Composition in Quadratic Fields: from Bhargava to Gauss
- 25th Clemson Mini-Conference on Discrete Math and Algorithms
- Independent Domination Revisited Wayne Goddard, Clemson University
- Pushdown Automata A PDA is an FA together with a stack.
- CpSc212 Goddard Notes Chapter 12 A queue is a linear data structure that allows items to be added only to the rear of
