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.

Develop more productive habits in dealing with your manager. As a professional in the business world, you care about doing your job the right way. The quality of your work matters to you, both as a professional and as a person. The company you work for cares about making money and your boss is evaluated on that basis. Sometimes those goals overlap, but the different priorities mean conflict is inevitable. Take concrete steps to build a relationship with your manager that helps both sides succeed. Guide your manager to treat you as a vital member of the team who should be kept as happy and productive as possible. When your manager insists on a course of action you don't like, most employees feel they have only two options: you can swallow your objections, or you can leave. Neither option gets you what you want, which is for your manager to consider your interests when making decisions. Challenging your boss directly is risky, but if you understand what really matters to your manager, you can build a balanced relationship that works for both sides. Provide timely "good enough" answers that satisfy the immediate need of the boss to move forward. Use a productive solution to the Iterated Prisoner's Dilemma to structure your interactions with management, going along when necessary and pushing back where appropriate, without threatening the loyalty relationship. Send the two most important messages to your boss: "I got this" and "I got your back," to prove your value to the boss and the organization. Analyze your manager's communication preferences so you can express your arguments in a way most likely to be heard and understood. Avoid key traps, like thinking of the boss as your friend or violating the chain of command unnecessarily.

The aim of this textbook is to provide undergraduate students with an introduction to the basic theoretical models of computability, and to develop some of the model's rich and varied structure. Students who have already some experience with elementary discrete mathematics will find this a well-paced first course, and a number of supplementary chapters introduce more advanced concepts. 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 discussions of effective computability, decidability, and Gödel's incompleteness theorems. Plenty of exercises are provided, ranging from the easy to the challenging. As a result, this text will make an ideal first course for students of computer science.

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.

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.

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, respecti

The introduction of functional programming concepts in Java SE 8 was a drastic change for this venerable object-oriented language. Lambda expressions, method references, and streams fundamentally changed the idioms of the language, and many developers have been trying to catch up ever since. This cookbook will help. With more than 70 detailed recipes, author Ken Kousen shows you how to use the newest features of Java to solve a wide range of problems. For developers comfortable with previous Java versions, this guide covers nearly all of Java SE 8, and includes a chapter focused on changes coming in Java 9. Need to understand how functional idioms will change the way you write code? This cookbook—chock full of use cases—is for you. Recipes cover: The basics of lambda expressions and method references Interfaces in the java.util.function package Stream operations for transforming and filtering data Comparators and Collectors for sorting and converting streaming data Combining lambdas, method references, and streams Creating instances and extract values from Java’s Optional type New I/O capabilities that support functional streams The Date-Time API that replaces the legacy Date and Calendar classes Mechanisms for experimenting with concurrency and parallelism

Use Kotlin to build Android apps, web applications, and more-while you learn the nuances of this popular language. With this unique cookbook, developers will learn how to apply this Java-based language to their own projects. Both experienced programmers and those new to Kotlin will benefit from the practical recipes in this book. Author Ken Kousen (Modern Java Recipes) shows you how to solve problems with Kotlin by concentrating on your own use cases rather than on basic syntax. You provide the context and this book supplies the answers. Already big in Android development, Kotlin can be used anywhere Java is applied, as well as for iOS development, native applications, JavaScript generation, and more. Jump in and build meaningful projects with Kotlin today. Apply functional programming concepts, including lambdas, sequences, and concurrency See how to use delegates, late initialization, and scope functions Explore Java interoperability and access Java libraries using Kotlin Add your own extension functions Use helpful libraries such as JUnit 5 Get practical advice for working with specific frameworks, like Android and Spring

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 Goedel'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.

Android adopted Gradle as the preferred build automation system a few years ago, but many Android developers are still unfamiliar with this open source tool. This hands-on guide provides a collection of Gradle recipes to help you quickly and easily accomplish the most common build tasks for your Android apps. You'll learn how to customize project layouts, add dependencies, and generate many different versions of your app. Gradle is based on Groovy, yet very little knowledge of the JVM language is required for you to get started. Code examples use Android SDK version 23, with emulators from Marshmallow (Android 6) or Lollipop (Android 5). If you're comfortable with Java and Android, you're ready. Understand Gradle's generated build files for Android apps Run Gradle from the command line or inside Android Studio Add more Java libraries to your Android app Import and export Eclipse ADT projects Digitally sign a Release APK for the Google Play store Use product flavors to build many versions of the same app Add custom tasks to the Gradle build process Test both your app's Android and non-Android components Improve the performance of your Gradle build

This book provides the first comprehensive introduction to Dynamic Logic. Among the many approaches to formal reasoning about programs, Dynamic Logic enjoys the singular advantage of being strongly related to classical logic. Its variants constitute natural generalizations and extensions of classical formalisms. For example, Propositional Dynamic Logic (PDL) can be described as a blend of three complementary classical ingredients: propositional calculus, modal logic, and the algebra of regular events. In First-Order Dynamic Logic (DL), the propositional calculus is replaced by classical first-order predicate calculus. Dynamic Logic is a system of remarkable unity that is theoretically rich as well as of practical value. It can be used for formalizing correctness specifications and proving rigorously that those specifications are met by a particular program. Other uses include determining the equivalence of programs, comparing the expressive power of various programming constructs, and synthesizing programs from specifications. This book provides the first comprehensive introduction to Dynamic Logic. It is divided into three parts. The first part reviews the appropriate fundamental concepts of logic and computability theory and can stand alone as an introduction to these topics. The second part discusses PDL and its variants, and the third part discusses DL and its variants. Examples are provided throughout, and exercises and a short historical section are included at the end of each chapter.