Search results for "Dexter C. Kozen"
Items we need to order for you
Design and Analysis of Algorithms
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
R 3,043.48
Design and Analysis of Algorithms
These are my lecture notes from CS681: Design and Analysis of Algo rithms, a one-semester graduate course I taught at Cornell for three consec utive fall semesters from '88 to '90. The course serves a dual purpose: to cover core material in algorithms for graduate students in computer science preparing for their PhD qualifying exams, and to introduce theory students to some advanced topics in the design and analysis of algorithms. The material is thus a mixture of core and advanced topics. At first I meant these notes to supplement and not supplant a textbook, but over the three years they gradually took on a life of their own. In addition to the notes, I depended heavily on the texts • A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The Design and Analysis of Computer Algorithms. Addison-Wesley, 1975. • M. R. Garey and D. S. Johnson, Computers and Intractibility: A Guide to the Theory of NP-Completeness. w. H. Freeman, 1979. • R. E. Tarjan, Data Structures and Network Algorithms. SIAM Regional Conference Series in Applied Mathematics 44, 1983. and still recommend them as excellent references.
R 2,504.84
Theory of Computation
This textbook is uniquely written with dual purpose. It cover cores material in the foundations of computing for graduate students in computer science and also provides an introduction to some more advanced topics for those intending further study in the area. This innovative text focuses primarily on computational complexity theory: the classification of computational problems in terms of their inherent complexity. The book contains an invaluable collection of lectures for first-year graduates on the theory of computation. Topics and features include more than 40 lectures for first year graduate students, and a dozen homework sets and exercises.
R 3,067.90
Mathematics of Program Construction
This volume contains the proceedings of MPC 2004, the Seventh International Conference on the Mathematics of Program Construction. This series of c- ferences aims to promote the development of mathematical principles and te- niquesthataredemonstrablyusefulinthe processofconstructingcomputerp- grams,whether implementedinhardwareorsoftware.Thefocus isontechniques that combine precision with conciseness, enabling programs to be constructed by formal calculation. Within this theme, the scope of the series is very diverse, including programmingmethodology,programspeci?cation and transformation, programming paradigms, programming calculi, and programming language - mantics. The quality of the papers submitted to the conference was in general very high, and the number of submissions was comparable to that for the previous conference. Each paper was refereed by at least four, and often more, committee members. This volume contains 19 papers selected for presentation by the program committee from 37 submissions, as well as the abstract of one invited talk: - tended Static Checking for Java by Greg Nelson, Imaging Systems Department, HP Labs, Palo Alto, California.The conference took place in Stirling, Scotland. The previous six conferences wereheld in1989inTwente,TheNetherlands;in1992inOxford,UK;in 1995in KlosterIrsee,Germany;in 1998in Marstrandnear Got .. eborg,Sweden;in2000in Pontede Lima,Portugal;and in 2002in Dagstuhl, Germany.The proceedingsof these conferences were published as LNCS 375, 669, 947, 1422, 1837, and 2386, respectively.
R 2,015.00
Automata and Computability
This textbook provides undergraduate students with an introduction to the basic theoretical models of computability, and develops some of the model's rich and varied structure. The first part of the book is devoted to finite automata and their properties. Pushdown automata provide a broader class of models and enable the analysis of context-free languages. In the remaining chapters, Turing machines are introduced and the book culminates in analyses of effective computability, decidability, and Gödel's incompleteness theorems. Students who already have some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts.
R 1,575.76
R 478.00
Logic, Language, Information, and Computation
Edited in collaboration with FoLLI, the Association of Logic, Language and Information this book constitutes the refereed proceedings of the 31st International Workshop on Logic, Language, Information, and Computation, WoLLIC 2025, in Porto, Portugal, during July 2025. The 21 full papers included in this book were carefully reviewed and selected from 57 submissions. The WoLLIC conference aim of fostering interdisciplinary research in pure and applied logic.
R 2,950.70
R 935.00
R 519.00
R 306.00
R 305.00
R 557.00
R 451.00
R 413.47
R 458.00
R 502.00
R 336.00
R 306.00
Dexter and Philosophy
What explains the huge popular following for Dexter, currently the most-watched show on cable, which sympathetically depicts a serial killer driven by a cruel compulsion to brutally slay one victim after another? Although Dexter Morgan kills only killers, he is not a vigilante animated by a sense of justice but a charming psychopath animated by a lust to kill, ritualistically and bloodily. However his gory appetite is controlled by "Harry's Code," which limits his victims to those who have gotten away with murder, and his job as a blood spatter expert for the Miami police department gives him the inside track on just who those legitimate targets may be. In Dexter and Philosophy, an elite team of philosophers don their rubber gloves and put Dexter's deeds under the microscope. Since Dexter is driven to ritual murder by his "Dark Passenger," can he be blamed for killing, especially as he only murders other murderers? Does Dexter fit the profile of the familiar fictional type of the superhero? What part does luck play in making Dexter who he is? How and why are horror and disgust turned into aesthetic pleasure for the TV viewer?How essential is Dexter's emotional coldness to his lust for slicing people up? Are Dexter's lies and deceptions any worse than the lies and deceptions of the non-criminals around him? Why does Dexter long to be a normal human being and why can't he accomplish this apparently simple goal?
R 729.00
R 1,120.87
R 834.61
Dexter In The Dark
No rest for the wicked - the serial killer with a heart is back . . .As seen on TV - DEXTER: NEW BLOOD - major new dramaDexter Morgan is busy planning his wedding to Rita to complete his nice-guy disguise.But when a student is found burnt, molested and headless - seemingly sacrificed to an ancient god - and Dex is brought in as forensic analyst to help investigate, he realises he could be dealing with someone a whole lot more sinister than he is. Soon it seems the dark passenger in Dexter's head has gone into hiding. And when something creeps out your friendly neighbourhood serial killer, you know it's serious . . . As Halpern and Dexter are stalked by death, it looks like it's getting personal - especially as Dex now has a family to protect. Gradually, Dexter realises his stepchildren might share his extracurricular interest in death. Could he help them target their bloodlust, just as he steers his own? But to do that, Dex must cope with a certain mutilated sergeant from his past, and more importantly . . . stay alive . . .
R 340.00
R 793.00
