Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Plaisted, David A. - Department of Computer Science, University of North Carolina at Chapel Hill
Course Syllabus COMP 550-001 (old 122) Algorithms and Analysis
Models of Languages and Computation Spring 2011
A Hierarchical Situation Calculus David A. Plaisted
Course Syllabus COMP 202 --Algorithm Analysis
Models of Languages and Computation Spring 2011
Sorting in Linear Time? Arne Andersson* Torben Hagerupt
Selecting the median Dorit Dor Uri Zwick
Models of Languages and Computation Spring 2011
COMP 455, Models of Languages and Computation, Spring 2011 An Incompleteness Theorem
COMP 455, Models of Languages and Computation, Spring 2011 Generating a Theorem that is True but Unprovable
Models of Languages and Computation Spring 2001
The world of TuringKara Control TuringKara
Course Syllabus COMP 455-001 Models of Languages and Computation
An Abstract Programming System David A. Plaisted
Models of Languages and Computation Spring 2011
Models of Languages and Computation Spring 2011
Course Syllabus COMP 202 -Algorithm Analysis
Course Syllabus COMP 750 Algorithm Analysis
Course Syllabus COMP 550-001 Algorithms and Analysis
Course Syllabus COMP 455-001 Models of Languages and Computation
Models of Languages and Computation Spring 2012
Models of Languages and Computation Spring 2012
COMP 455 (old 181) Models of Languages and Computation
