Book Description
Symposium held Jan. 22-24, 1990, San Francisco, Calif.
Author :
Publisher : Society for Industrial and Applied Mathematics (SIAM)
Page : 546 pages
File Size : 42,14 MB
Release : 1990
Category : Computers
ISBN :
Symposium held Jan. 22-24, 1990, San Francisco, Calif.
Author : Rolf Karlsson
Publisher : Springer Science & Business Media
Page : 274 pages
File Size : 15,94 MB
Release : 1988-06-22
Category : Computers
ISBN : 9783540194873
The papers in this volume were presented at the 1st Scandinavian Workshop on Algorithm Theory held July 5-8, 1988 in Halmstad, Sweden. The contributions present original research in areas related to algorithm theory, including data structures, computational geometry, and computational complexity. In addition to the selected papers the proceedings include invited papers from I. Munro, K. Mehlhorn, M. Overmars, and D. Wood.
Author : Symposium on Foundations of Computer Science
Publisher :
Page : 664 pages
File Size : 11,87 MB
Release : 1989
Category :
ISBN : 9780818619823
The symposium was held Oct.-Nov. 1989, Research Triangle Park, North Carolina. One hundred papers in theoretical computer science treat dispersers, deterministic amplification, and weak random sources; efficient NC algorithms for set cover with applications to learning and geometry; the inverse of automorphism in polynomial time; and speeding-up linear programming using fast matrix multiplication. Acidic paper; no subject index. Annotation copyrighted by Book News, Inc., Portland, OR.
Author : Gottfried Tinhofer
Publisher : Springer Science & Business Media
Page : 282 pages
File Size : 34,31 MB
Release : 2012-12-06
Category : Computers
ISBN : 3709190762
One ofthe most important aspects in research fields where mathematics is "applied is the construction of a formal model of a real system. As for structural relations, graphs have turned out to provide the most appropriate tool for setting up the mathematical model. This is certainly one of the reasons for the rapid expansion in graph theory during the last decades. Furthermore, in recent years it also became clear that the two disciplines of graph theory and computer science have very much in common, and that each one has been capable of assisting significantly in the development of the other. On one hand, graph theorists have found that many of their problems can be solved by the use of com puting techniques, and on the other hand, computer scientists have realized that many of their concepts, with which they have to deal, may be conveniently expressed in the lan guage of graph theory, and that standard results in graph theory are often very relevant to the solution of problems concerning them. As a consequence, a tremendous number of publications has appeared, dealing with graphtheoretical problems from a computational point of view or treating computational problems using graph theoretical concepts.
Author : Alan George
Publisher : Springer Science & Business Media
Page : 254 pages
File Size : 39,42 MB
Release : 2012-12-06
Category : Mathematics
ISBN : 1461383692
When reality is modeled by computation, matrices are often the connection between the continuous physical world and the finite algorithmic one. Usually, the more detailed the model, the bigger the matrix, the better the answer, however, efficiency demands that every possible advantage be exploited. The articles in this volume are based on recent research on sparse matrix computations. This volume looks at graph theory as it connects to linear algebra, parallel computing, data structures, geometry, and both numerical and discrete algorithms. The articles are grouped into three general categories: graph models of symmetric matrices and factorizations, graph models of algorithms on nonsymmetric matrices, and parallel sparse matrix algorithms. This book will be a resource for the researcher or advanced student of either graphs or sparse matrices; it will be useful to mathematicians, numerical analysts and theoretical computer scientists alike.
Author : Raymond Greenlaw
Publisher : Oxford University Press, USA
Page : 328 pages
File Size : 34,61 MB
Release : 1995
Category : Computational complexity
ISBN : 0195085914
This book provides a comprehensive analysis of the most important topics in parallel computation. It is written so that it may be used as a self-study guide to the field, and researchers in parallel computing will find it a useful reference for many years to come. The first half of the book consists of an introduction to many fundamental issues in parallel computing. The second half provides lists of P-complete- and open problems. These lists will have lasting value to researchers in both industry and academia. The lists of problems, with their corresponding remarks, the thorough index, and the hundreds of references add to the exceptional value of this resource. While the exciting field of parallel computation continues to expand rapidly, this book serves as a guide to research done through 1994 and also describes the fundamental concepts that new workers will need to know in coming years. It is intended for anyone interested in parallel computing, including senior level undergraduate students, graduate students, faculty, and people in industry. As an essential reference, the book will be needed in all academic libraries.
Author :
Publisher :
Page : 276 pages
File Size : 31,16 MB
Release : 1988
Category : Algorithms
ISBN :
Author :
Publisher :
Page : 284 pages
File Size : 24,52 MB
Release : 1999
Category : Computer algorithms
ISBN :
Author : Ugo Montanari
Publisher : Springer
Page : 964 pages
File Size : 19,21 MB
Release : 2003-08-06
Category : Computers
ISBN : 354045022X
This book constitutes the refereed proceedings of the 27th International Colloquium on Automata, Languages and Programming, ICALP 2000, held in Geneva, Switzerland in July 2000. The 69 revised full papers presented together with nine invited contributions were carefully reviewed and selected from a total of 196 extended abstracts submitted for the two tracks on algorithms, automata, complexity, and games and on logic, semantics, and programming theory. All in all, the volume presents an unique snapshot of the state-of-the-art in theoretical computer science.
Author : Andreas Brandstädt
Publisher : Springer Science & Business Media
Page : 351 pages
File Size : 47,19 MB
Release : 2007-12-12
Category : Computers
ISBN : 3540748385
This book constitutes the thoroughly refereed post-proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2007, held in Dornburg, Germany, in June 2007. The 30 revised full papers presented together with one invited paper were carefully selected from 99 submissions. The papers feature original results on all aspects of graph-theoretic concepts in Computer Science, including structural graph theory, graph-based modeling, and graph-drawing.