Seems you have not registered as a member of localhost.saystem.shop!
You may have to register before you can download all our books and magazines, click the sign up button below to create a free account.
Algorithm Theory - SWAT 2002
This book constitutes the refereed proceedings of the 8th Scandinavian Workshop on Algorithm Theory, SWAT 2002, held in Turku, Finland, in July 2002. The 43 revised full papers presented together with two invited contributions were carefully reviewed and selected from 103 submissions. The papers are organized in topical sections on scheduling, computational geometry, graph algorithms, robotics, approximation algorithms, data communication, computational biology, and data storage and manipulation.
Experimental Algorithmics
Experimental algorithmics, as its name indicates, combines algorithmic work and experimentation: algorithms are not just designed, but also implemented and tested on a variety of instances. Perhaps the most important lesson in this process is that designing an algorithm is but the first step in the process of developing robust and efficient software for applications. Based on a seminar held at Dagstuhl Castle, Germany in September 2000, this state-of-the-art survey presents a coherent survey of the work done in the area so far. The 11 carefully reviewed chapters provide complete coverage of all current topics in experimental algorithmics.
Algorithms and Data Structures
The papers in this volume were presented at the Third Workshop on Algorithmsand Data Structures (WADS '93), held in Montreal, Canada, August 1993. The volume opens with five invited presentations: "Computing the all-pairs longest chains in the plane" by M.J. Atallah and D.Z. Chen, "Towards a better understanding of pure packet routing" by A. Borodin, "Tolerating faults in meshes and other networks" (abstract) by R. Cole, "A generalization of binary search" by R.M. Karp, and "Groups and algebraic complexity" (abstract) by A.C. Yao. The volume continues with 52 regular presentations selected from 165 submissions, each of which was evaluated by at least three program committee members, many of whom called upon additional reviewers.
Santorini
When the Greek island of Santorini, classically known as Thera, erupted dramatically in 1613 BC (+/- 13 years), it produced one of the largest explosions ever witnessed, thereby possibly giving rise to the legend of Atlantis. This so-called 'Minoan' eruption triggered tsunamis that devastated coastal settlements in the region, and on Santorini it left behind a Bronze Age Pompeii, which is currently being excavated. Thriving Bronze Age settlements on the island - rich in colorful wall paintings and highly sophisticated pottery - were buried under thick layers of volcanic ash. The ejection of an immense volume of dust into the atmosphere also altered global climate for several years. The autho...
Time's Up! Dating the Minoan Eruption of Santorini
Papers by natural scientists, archaeologists, egyptologists and classicists discussing the newest evidence of the Santorini eruption. The papers fall into two sections. I: Evidence, geology, archaeology & chronology; II: Debate: typology, chronology, methodology. Contributors include: Walter L. Friedrich & Jan Heinemeier, Philip P. Betancourt, Max Bichler, Thomas M. Brogan, Peter M. Fischer, Karen Polinger Foster, Hermann Hunger, Felix Hoflmayer,Rolf Krauss, Bernd Kromer, Alexander R. McBirney, Floyd W. McCoy, J. Alexander MacGillivray, Sturt W. Manning, Robert Merrillees, Raimund Muscheler, Christopher Bronk Ramsey, Nikolaos Sigalas, Chrysa Sofianou, Jeffrey S. Soles, Georg Steinhauser, Johannes H. Sterba, Annette Hen Sensen,Peter Warren, Malcolm H. Wiener.
Algorithms - ESA 2001
This book constitutes the refereed proceedings of the 9th Annual European Symposium on Algorithms, ESA 2001, held in Aarhus, Denmark, in August 2001. The 41 revised full papers presented together with three invited contributions were carefully reviewed and selected from 102 submissions. The papers are organized in topical sections on caching and prefetching, online algorithms, data structures, optimization and approximation, sequences, scheduling, shortest paths, geometry, distributed algorithms, graph algorithms, pricing, broadcasting and multicasting, graph labeling and graph drawing, and graphs.
Foundations of Software Technology and Theoretical Computer Science
This book constitutes the refereed proceedings of the 18th Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS'98, held in Chennai, India, in December 1998. The 28 revised full papers presented were carefully selected from a total of 93 submissions; also included are six invited contributions. The papers deal with theoretical topics ranging from discrete mathematics and algorithmic aspects to software engineering, program semantics and mathematical logic.
Algorithms in Bioinformatics
This book constitutes the refereed proceedings of the First International Workshop on Algorithms in Bioinformatics, WABI 2001, held in Aarhus, Denmark, in August 2001. The 23 revised full papers presented were carefully reviewed and selected from more than 50 submissions. Among the issues addressed are exact and approximate algorithms for genomics, sequence analysis, gene and signal recognition, alignment, molecular evolution, structure determination or prediction, gene expression and gene networks, proteomics, functional genomics, and drug design; methodological topics from algorithmics; high-performance approaches to hard computational problems in bioinformatics.
Foundations of Algebraic Specification and Formal Software Development
This book provides foundations for software specification and formal software development from the perspective of work on algebraic specification, concentrating on developing basic concepts and studying their fundamental properties. These foundations are built on a solid mathematical basis, using elements of universal algebra, category theory and logic, and this mathematical toolbox provides a convenient language for precisely formulating the concepts involved in software specification and development. Once formally defined, these notions become subject to mathematical investigation, and this interplay between mathematics and software engineering yields results that are mathematically intere...
