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.
Mathematical Foundations of Computer Science 1995
This book presents the proceedings of the 20th International Symposium on Mathematical Foundations of Computer Science, MFCS'95, held in Prague, Czech Republic in August/September 1995. The book contains eight invited papers and two abstracts of invited talks by outstanding scientists as well as 44 revised full research papers selected from a total of 104 submissions. All relevant aspects of theoretical computer science are addressed, particularly the mathematical foundations; the papers are organized in sections on structural complexity, algorithms, complexity theory, graphs in models of computation, lower bounds, formal languages, unification, rewriting and type theory, distributed computation, concurrency, semantics, model checking, and formal calculi.
Automata, Languages and Programming
In subvolume 27C1 magnetic and related properties of binary lanthanide oxides have been compiled. This subvolume covers data obtained since 1980 and can therefore be regarded as supplement to volume III/12c. While in the previous volume the majority of magnetic data was obtained either from magnetometric measurements or from neutron diffraction, for the present data the main emphasis is devoted to 'related' properties without which, however, the understanding of classical magnetic properties is impossible. A second part 27C2 will deal with binary oxides of the actinide elements.
ACRI ’96
ACRI'96 is the second conference on Cellular Automata for Research and Industry; the first one was held in Rende (Cosenza), on September 29-30, 1994. This second edition confirms the growing interest in Cellular Automata currently present both in the scientific community and within the industrial applications world. Cellular Automata-based computational models, besides capturing the attention of scientists working in different fields, open new perspectives of intersection between different and historically distant areas of scientific knowledge, from Physics to Biology, to Computer Science. ACRI'96 aims at providing a forum both for researchers working in the Cellular Automata field, and for ...
Aspects and Prospects of Theoretical Computer Science
This volume contains the texts of the tutorial lecture, five invited lectures and twenty short communications contributed for presentation at the Sixth International Meeting of Young Computer Scientists, IMYCS '90. The aim of these meetings is threefold: (1) to inform on newest trends, results, and problems in theoretical computer science and related fields through a tutorial and invited lectures delivered by internationally distinguished speakers, (2) to provide a possibility for beginners in scientific work to present and discuss their results, and (3) to create an adequate opportunity for establishing first professional relations among the participants.
An Invitation to Analytic Combinatorics
This book uses new mathematical tools to examine broad computability and complexity questions in enumerative combinatorics, with applications to other areas of mathematics, theoretical computer science, and physics. A focus on effective algorithms leads to the development of computer algebra software of use to researchers in these domains. After a survey of current results and open problems on decidability in enumerative combinatorics, the text shows how the cutting edge of this research is the new domain of Analytic Combinatorics in Several Variables (ACSV). The remaining chapters of the text alternate between a pedagogical development of the theory, applications (including the resolution by this author of conjectures in lattice path enumeration which resisted several other approaches), and the development of algorithms. The final chapters in the text show, through examples and general theory, how results from stratified Morse theory can help refine some of these computability questions. Complementing the written presentation are over 50 worksheets for the SageMath and Maple computer algebra systems working through examples in the text.
Fundamentals of Artificial Intelligence Research
This volume contains 6 invited lectures and 13 submitted contributions to the scientific programme of the international workshop Fundamentals of Artificial Intelligence Research, FAIR '91, held at Smolenice Castle, Czechoslovakia, September 8-12, 1991, under the sponsorship of the European Coordinating Committee for Artificial Intelligence, ECCAI. FAIR'91, the first of an intended series of international workshops, addresses issues which belong to the theoretical foundations of artificial intelligence considered as a discipline focused on concise theoretical description of some aspects of intelligence by toolsand methods adopted from mathematics, logic, and theoretical computer science. The intended goal of the FAIR workshops is to provide a forum for the exchange of ideas and results in a domain where theoretical models play an essential role. It is felt that such theoretical studies, their development and their relations to AI experiments and applications have to be promoted in the AI research community.
Automata, Languages and Programming
This book constitutes the refereed proceedings of the 26th International Colloquium on Automata, Languages and Programming, ICALP'99, held in Prague, Czech Republic, in July 1999. The 56 revised full papers presented were carefully reviewed and selected from a total of 126 submissions; also included are 11 inivited contributions. Among the topics addressed are approximation algorithms, algebra and circuits, concurrency, semantics and rewriting, process algebras, graphs, distributed computing, logic of programs, sorting and searching, automata, nonstandard computing, regular languages, combinatorial optimization, automata and logics, string algorithms, and applied logics.
