Current Trends in Theoretical Computer Science

Current Trends in Theoretical Computer Science PDF Author: Gheorghe P?un
Publisher: World Scientific
ISBN: 9810244738
Category : Computers
Languages : en
Pages : 881

Get Book Here

Book Description
The scientific developments at the end of the past millennium were dominated by the huge increase and diversity of disciplines with the common label "computer science". The theoretical foundations of such disciplines have become known as theoretical computer science. This book highlights some key issues of theoretical computer science as they seem to us now, at the beginning of the new millennium. The text is based on columns and tutorials published in the Bulletin of the European Association for Theoretical Computer Science in the period 1995 -- 2000. The columnists themselves selected the material they wanted for the book, and the editors had a chance to update their work. Indeed, much of the material presented here appears in a form quite different from the original. Since the presentation of most of the articles is reader-friendly and does not presuppose much knowledge of the area, the book constitutes suitable supplementary reading material for various courses in computer science.

Spectral Algorithms

Spectral Algorithms PDF Author: Ravindran Kannan
Publisher: Now Publishers Inc
ISBN: 1601982747
Category : Computers
Languages : en
Pages : 153

Get Book Here

Book Description
Spectral methods refer to the use of eigenvalues, eigenvectors, singular values and singular vectors. They are widely used in Engineering, Applied Mathematics and Statistics. More recently, spectral methods have found numerous applications in Computer Science to "discrete" as well as "continuous" problems. Spectral Algorithms describes modern applications of spectral methods, and novel algorithms for estimating spectral parameters. The first part of the book presents applications of spectral methods to problems from a variety of topics including combinatorial optimization, learning and clustering. The second part of the book is motivated by efficiency considerations. A feature of many modern applications is the massive amount of input data. While sophisticated algorithms for matrix computations have been developed over a century, a more recent development is algorithms based on "sampling on the fly" from massive matrices. Good estimates of singular values and low rank approximations of the whole matrix can be provably derived from a sample. The main emphasis in the second part of the book is to present these sampling methods with rigorous error bounds. It also presents recent extensions of spectral methods from matrices to tensors and their applications to some combinatorial optimization problems.

MFDBS 89

MFDBS 89 PDF Author: Janos Demetrovics
Publisher: Springer Science & Business Media
ISBN: 9783540512516
Category : Computers
Languages : en
Pages : 438

Get Book Here

Book Description
This volume is a collection of the most important contributions presented at the second MFDBS conference held in Visegrád, Hungary, June 26-30, 1989. The papers selected from more than one hundred submissions, originating from 23 countries in 4 continents, can be roughly divided into the following sections: theoretical fundamentals of relational databases, logical foundations and databases, data modelling, database design, deductive databases, transaction management and security, concurrency control and distributed databases. The volume reflects the current state of knowledge and is a guide to further development in database theory.

CAAP '88

CAAP '88 PDF Author: Max Dauchet
Publisher: Springer Science & Business Media
ISBN: 9783540190219
Category : Computers
Languages : en
Pages : 320

Get Book Here

Book Description
This volume contains the proceedings of the 13th Colloquium on Trees in Algebra and Programming (CAAP '88), held in Nancy, March 21-24, 1988. The preceding 12 colloquia were held in France, Italy and Germany. CAAP '85 and CAAP '87 were integrated into the International Joint Conference on Theory and Practice of Software Development, TAPSOFT (see Lecture Notes in Computer Science volumes 185 and 249). As another effort to link theory and practice in computer science, CAAP '88 was held in conjunction with the European Symposium on Programming, ESOP '88 (see volume 300 of this Lecture Notes series). CAAP '88 is a conference in the area of program development and programming concepts but, following the tradition, is devoted to theoretical aspects, and especially to Trees, a basic structure of computer science. A wider range of topics in theoretical computer science is also covered. The papers are on word, tree or graph languages, with algorithmic or complexity studies, on abstract data types (another classical topic of CAAP) and/or term rewriting systems and on non-standard logics, and parallelism and concurrency.

MFDBS 87

MFDBS 87 PDF Author: Joachim Biskup
Publisher: Springer Science & Business Media
ISBN: 9783540191216
Category : Computers
Languages : en
Pages : 260

Get Book Here

Book Description
This volume contains the 13 best of the 18 papers presented at the first MFDBS conference held in Dresden, GDR, January 19-23, 1987. A short summary of the two panel discussions is also included. The volume is intended to be a reflection of the current state of knowledge and a guide to further development in database theory. The main topics covered are: theoretical fundaments of the relational data model (dependency theory, design theory, null values, query processing, complexity theory), and of its extensions (graphical representations, NF2-models), conceptual modelling of distributed database management systems and the relationship between logic and databases.

EUROCAL '87

EUROCAL '87 PDF Author: James H. Davenport
Publisher: Springer Science & Business Media
ISBN: 9783540515173
Category : Computers
Languages : en
Pages : 516

Get Book Here

Book Description
This is the sixth in a series of conference proceedings of international conferences on computer algebra held in Europe. All the preceding ones have also been published as Lecture Notes in Computer Science. They contain original research material not published elsewhere, and a few invited lectures summarising the state of the art. Computer algebra is the science of using computers to do algebraic calculations, rather than the purely arithmetic calculations which we all know computers can do. These calculations may be polynomial-like calculations - one thread of the conference was devoted to polynomial algorithms - or may relate to other areas of mathematics such as integration, the solution of differential equations, or geometry - a second thread was devoted to those topics. The calculations can be applied in a wide range of scientific and engineering subjects, and in branches of mathematics. Physics has benefitted especially from these calculations, and the proceedings contain many papers on this, and also papers on applications in computer aided design and robotics, to name but a few other applications. The third thread of the proceedings was devoted to these applications and to the computer algebra systems which perform these calculations.

Mathematical Foundations of Computer Science 1988

Mathematical Foundations of Computer Science 1988 PDF Author: Michal P. Chytil
Publisher: Springer Science & Business Media
ISBN: 9783540501107
Category : Computers
Languages : en
Pages : 582

Get Book Here

Book Description
This volume contains 11 invited lectures and 42 communications presented at the 13th Conference on Mathematical Foundations of Computer Science, MFCS '88, held at Carlsbad, Czechoslovakia, August 29 - September 2, 1988. Most of the papers present material from the following four fields: - complexity theory, in particular structural complexity, - concurrency and parellelism, - formal language theory, - semantics. Other areas treated in the proceedings include functional programming, inductive syntactical synthesis, unification algorithms, relational databases and incremental attribute evaluation.

Database Machines

Database Machines PDF Author: Haran Boral
Publisher: Springer Science & Business Media
ISBN: 9783540513247
Category : Computers
Languages : en
Pages : 404

Get Book Here

Book Description
This volume contains 24 papers presented at the Sixth International Workshop on Database Machines. The papers cover a wide spectrum of topics including: system architectures, storage structures, associative memory architectures, memory resident systems, deduction and retrospectives on maturing projects. The nature of the papers is highly technical and presumes knowledge of database management systems and familiarity with database machines. The book is representative of the dual trend in the field towards (1) search for new functionability and (2) attention to detail, completeness and performance of prototype implementations.

Graph Grammars and Their Application to Computer Science

Graph Grammars and Their Application to Computer Science PDF Author: Janice Cuny
Publisher: Springer Science & Business Media
ISBN: 9783540612285
Category : Computers
Languages : en
Pages : 582

Get Book Here

Book Description
This book describes the functional properties and the structural organization of the members of the thrombospondin gene family. These proteins comprise a family of extracellular calcium binding proteins that modulate cellular adhesion, migration and proliferation. Thrombospondin-1 has been shown to function during angiogenesis, wound healing and tumor cell metastasis.

Logic at Botik '89

Logic at Botik '89 PDF Author: Albert R. Meyer
Publisher: Springer Science & Business Media
ISBN: 9783540512370
Category : Computers
Languages : en
Pages : 310

Get Book Here

Book Description
The present volume contains the proceedings of Logic at Botik '89, a symposium on logical foundations of computer science organized by the Program Systems Institute of the USSR Academy of Sciences and held at Pereslavl-Zalessky, USSR, July 3-8, 1989. The scope of the symposium was very broad; the topics of interest were: complexity of formal systems, constructive mathematics in computer science, denotational and operational semantics of programs, descriptive complexity, dynamic and algorithmic logics and schematology, formal tools to describe concurrent computations, lambda calculus and related topics, foundations of logic programming, logical foundations of database theory, logics for knowledge representation, modal and temporal logics, type theory in programming, and verification of programs. Thus, the papers in this volume represent many interesting trends in logical foundations of Computer Science, ranging from purely theoretical research to practical applications of theory.

Jumping Computation

Jumping Computation PDF Author: Alexander Meduna
Publisher: CRC Press
ISBN: 1003852548
Category : Computers
Languages : en
Pages : 294

Get Book Here

Book Description
Jumping Computation: Updating Automata and Grammars for Discontinuous Information Processing is primarily a theoretically oriented treatment of jumping automata and grammars, covering all essential theoretical topics concerning them, including their power, properties, and transformations. From a practical viewpoint, it describes various concepts, methods, algorithms, techniques, case studies and applications based upon these automata and grammars. In today’s computerized world, the scientific development and study of computation, referred to as the theory of computation, plays a crucial role. One important branch, language theory, investigates how to define and study languages and their models, which formalize algorithms according to which their computation is executed. These language-defining models are classified into two basic categories: automata, which define languages by recognizing their words, and grammars, which generate them. Introduced many decades ago, these rules reflect classical sequential computation. However, today’s computational methods frequently process information in a fundamentally different way, frequently “jumping” over large portions of the information as a whole. This book adapts classical models to formalize and study this kind of computation properly. Simply put, during their language-defining process, these adapted versions, called jumping automata and grammars, jump across the words they work on. The book selects important models and summarizes key results about them in a compact and uniform way. It relates each model to a particular form of modern computation, such as sequential, semi-parallel and totally parallel computation, and explains how the model in question properly reflects and formalizes the corresponding form of computation, thus allowing us to obtain a systematized body of mathematically precise knowledge concerning the jumping computation. The book pays a special attention to power, closure properties, and transformations, and also describes many algorithms that modify jumping grammars and automata so they satisfy some prescribed properties without changing the defined language. The book will be of great interest to anyone researching the theory of computation across the fields of computer science, mathematics, engineering, logic and linguistics.