Set theory, logic, discrete mathematics, and fundamental algorithms (along with their correctness and complexity analysis) will always remain useful for computing professionals and need to be understood by students who want to succeed. This textbook explains a number of those fundamental algorithms to programming students in a concise, yet precise, manner. The book includes the background material needed to understand the explanations and to develop such explanations for other algorithms. The author demonstrates that clarity and simplicity are achieved not by avoiding formalism, but by using it properly.

The book is self-contained, assuming only a background in high school mathematics and elementary program writing skills. It does not assume familiarity with any specific programming language. Starting with basic concepts of sets, functions, relations, logic, and proof techniques including induction, the necessary mathematical framework for reasoning about the correctness, termination and efficiency of programs is introduced with examples at each stage. The book contains the systematic development, from appropriate theories, of a variety of fundamental algorithms related to search, sorting, matching, graph-related problems, recursive programming methodology and dynamic programming techniques, culminating in parallel recursive structures.

�ber die Autorin bzw. den Autor

Jayadev Misra is the Schlumberger Centennial Chair Emeritus in computer science and a University Distinguished Teaching Professor Emeritus at the University of Texas at Austin. Professionally he is known for his contributions to the formal aspects of concurrent programming and for jointly spearheading, with Sir Tony Hoare, the project on Verified Software Initiative (VSI). Jayadev Misra in collaboration with K. Mani Chandy has made a number of important contributions in the area of concurrent computing, among them a programming notation and a logic, called UNITY, to describe concurrent computations, a conservative algorithm for distributed discrete-event simulation, a number of fundamental algorithms for resource allocation (the drinking philosopher's problem, deadlock detection, distributed graph algorithms), and a theory of knowledge transmission in distributed systems. In collaboration with David Gries, Jayadev proposed the first algorithm for the heavy-hitters problem. He has also proposed a set of axioms for concurrent memory access that underlie the theory of linearizability. His most recent research project, called Orc, attempts to develop an algebra of concurrent computing that will help integrate different pieces of software for concurrent execution. Jayadev is a member of the National Academy of Engineering. He has been awarded: the Harry H. Goode Memorial Award, IEEE, 2017, jointly with K. Mani Chandy; Doctor Honoris Causa, from �cole normale sup�rieure Paris-Saclay, Cachan, France, 2010 and a Guggenheim Fellowship, 1988. He is an ACM Fellow (1995), an IEEE Fellow (1992), and a Distinguished alumnus of IIT Kanpur, India.

��ber diesen Titel� kann sich auf eine andere Ausgabe dieses Titels beziehen.

Anbieterinformationen

Account dedicated to Print on Demand titles. Brook Bookstore offers a wide selection of books with a continuously updated catalog and fast shipments all over the world. We hold distribution rights with all of the publishers we promote and are in continuous search of new interesting titles to propose to our customers. We are part of Brandon Group SRL (an Italian company) and all of the orders are shipped from Europe. Depending on availability orders will be picked from our different warehouses. CONTACT US If you have any questions please do not hesitate to contact us sending a message to our store. We have a well prepared customer service team who will be happy to assist you. Our working hours are from Monday to Friday from 9:30 to 18:30 (CET, UTC +1) so messages received during the weekends might be responded with a slight delay but we guarantee you will get back to you as soon as possible. RETURNS If you want to return your order, please submit your request through Abebooks platform. Returns requests are managed case by case by our team and always in line with Abebooks policies: AbeBooks? Return Policy guarantees that you can return any book for a refund within 30 days, when the return is due to an error on the bookseller?s part. When the motive of the return is not due to an error of the seller it is up to Brook Bookstore to accept the return or else after studying the case. CANCELLATION You can send a cancellation request to our customer service team while the package has not yet been shipped. After that we cannot ensure we can retrieve the parcel but we suggest you to get in touch with us in order to verify the case. INVOICE You can request the invoice to be issued together with the shipment of the order or, at the latest, in the same month of the shipment.

Zur Homepage des Verk�ufers

Unternehmensdaten des Verk�ufers

Brandon Group S.R.L.
Via Vannella Gaetani 27, Brandon Group, Napoli, NA, 80121, Italy

Gesch�ftsbedingungen und Versandinformationen

Verkaufsbedingungen

Konto f�r Print-on-Demand-Titel.

KONTAKT
Wenn Sie irgendwelche Fragen haben, z�gern Sie bitte nicht, uns �ber die Option "Kontaktieren Sie diesen Verk�ufer/ Stellen Sie eine Frage" zu kontaktieren. Wir haben ein gut vorbereitetes Kundendienstteam, das Ihnen gerne weiterhelfen wird. Unsere Arbeitszeiten sind von Montag bis Freitag von 9:30 bis 18:30 Uhr (CET, UTC +1), so dass Nachrichten, die an den Wochenenden eingehen, m�glicherweise mit einer leichten Verz�gerung beantwortet werden, aber wir g...

Mehr Information