Search results for "Dexter Kozen"
Items we need to order for you
Logic and Program Semantics
This Festschrift volume is published in honor of Dexter Kozen on the occasion of his 60th birthday. Dexter Kozen has been a leader in the development of Kleene Algebras (KAs). The contributions in this volume reflect the breadth of his work and influence. The volume includes 19 full papers related to Dexter Kozen's research. They deal with coalgebraic methods, congruence closure; the completeness of various programming logics; decision procedure for logics; alternation; algorithms and complexity; and programming languages and program analysis. The second part of this volume includes laudatios from several collaborators, students and friends, including the members of his current band.
R 2,185.06
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
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
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
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
R 935.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 306.00
R 478.00
Dexter
Based upon the successful Jeff Lindsay novel "Darkly Dreaming Dexter", Showtime's and FX's "Dexter" continues to raise the bar on television drama, as it chronicles the grisly exploits of a police blood spatter expert who moonlights as a serial killer (or vice versa). Unlike other serial killers, however, Dexter only kills the bad guys, a distinction that sets up one of the primary ethical conflicts of the show, for Dexter as well as for the viewer. Including a complete episode guide to the first three seasons, and an exclusive interview with "Darkly Dreaming Dexter" author Jeff Lindsay, "Dexter" brings together an international group of critics and scholars to offer the first lively investigation of this show's many issues, contexts, and complexities. It considers such topics as Dexter as a vigilante hero, Dexter and psychoanalysis, the Politics of "Dexter", and the intriguing international reception of the series.
R 793.00
R 455.00
R 336.00
R 244.00
R 1,360.00
R 576.25
R 458.00
R 413.47
R 887.70
R 489.00
R 244.00
Way Through the Woods
The Way Through the Woods is the tenth novel in Colin Dexter's Oxford-set detective series.Quietly, rather movingly, Strange was making his plea: 'Christ knows why, Lewis, but Morse will always put himself out for you.' As he put the phone down, Lewis knew that Strange had been right . . . in the case of the Swedish Maiden, the pair of them were in business again . . .They called her the Swedish Maiden – the beautiful young tourist who disappeared on a hot summer's day somewhere in North Oxford. Twelve months later the case remained unsolved – pending further developments.On holiday in Lyme Regis, Chief Inspector Morse is startled to read a tantalizing article in The Times about the missing woman. An article which lures him back to Wytham Woods near Oxford . . . and straight into the most extraordinary murder investigation of his career.The Way Through the Woods is followed by the eleventh Inspector Morse book, The Daughters of Cain.
R 340.00
R 519.92
R 458.00
Dexter Procter the 10-Year-Old Doctor
The highly-acclaimed, No. 1-bestselling children's fiction debut from Adam Kay - and soon to be a BBC TV special!It was clear from an early age that Dexter Procter was different.He started speaking at four seconds old. By the age of three, he had 87 A-levels, from Afrikaans to Zoology.And by ten, he was working as a paediatrician at Lilydale General Hospital.Despite a loving but annoying family and a couple of good friends (Rupi and Otto), Dexter’s always struggled to fit in. Add to this a mortal enemy (Dr Drake) and a major problem at his old school (all the teachers struck down with awful diarrhoea) – will Dexter be able to save his job, save the school and find his place in the world? (Spoiler alert: yes!)A laugh-out-loud new fiction series about the world's youngest doctor from the record-breaking Adam Kay and Henry Paker.'Original, very funny, ultra-informative - and children will love all the disgusting parts.’ Jacqueline Wilson'If laughter truly is the best medicine, book this hilarious appointment with Dr Procter immediately.' David BaddielAdam Kay, Sunday Times bestseller, November 2023
R 278.00
R 779.00
R 1,210.02
R 321.00
R 281.00
R 1,099.00
R 611.00
R 397.00
R 1,120.87
R 611.00
R 305.00
R 252.00
R 585.00
R 611.00
R 793.00
R 1,096.78
