LATIN'98: Theoretical Informatics PDF Download

Author: Claudio L. Lucchesi
Publisher: Springer Science & Business Media
ISBN: 9783540642756
Category : Computers
Languages : en
Pages : 408

View

Book Description
This book constitutes the refereed proceedings of the Third Latin American Symposium on Theoretical Informatics, LATIN'98, held in Campinas, Brazil, in April 1998. The 28 revised full papers presented together with five invited surveys were carefully selected from a total of 53 submissions based on 160 referees' reports. The papers are organized in sections on algorithms and complexity; automata, transition systems and combinatorics on words; computational geometry and graph drawing; cryptography; graph theory and algorithms on graphs; packet routing; parallel algorithms; and pattern matching and browsing.

Author: Martin Farach-Colton
Publisher: Springer Science & Business Media
ISBN: 3540212582
Category : Computers
Languages : en
Pages : 642

View

Book Description
This volume contains the proceedings of the Latin American Theoretical Inf- matics (LATIN) conference that was held in Buenos Aires, Argentina, April 5–8, 2004. The LATIN series of symposia was launched in 1992 to foster interactions between the Latin American community and computer scientists around the world. This was the sixth event in the series, following S ̃ ao Paulo, Brazil (1992), Valparaiso, Chile (1995), Campinas, Brazil (1998), Punta del Este, Uruguay (2000), and Cancun, Mexico (2002). The proceedings of these conferences were also published by Springer-Verlag in the Lecture Notes in Computer Science series: Volumes 583, 911, 1380, 1776, and 2286, respectively. Also, as before, we published a selection of the papers in a special issue of a prestigious journal. We received 178 submissions. Each paper was assigned to four program c- mittee members, and 59 papers were selected. This was 80% more than the previous record for the number of submissions. We feel lucky to have been able to build on the solid foundation provided by the increasingly successful previous LATINs. And we are very grateful for the tireless work of Pablo Mart ́ ?nez L ́ opez, the Local Arrangements Chair. Finally, we thank Springer-Verlag for publishing these proceedings in its LNCS series.

Author: Rusins Freivalds
Publisher: Springer
ISBN: 3540446699
Category : Computers
Languages : en
Pages : 554

View

Book Description
This book constitutes the refereed proceedings of the 13th International Symposium Fundamentals of Computation Theory, FCT 2001, as well as of the International Workshop on Efficient Algorithms, WEA 2001, held in Riga, Latvia, in August 2001. The 28 revised full FCT papers and 15 short papers presented together with six invited contributions and 8 revised full WEA papers as well as three invited WEA contributions have been carefully reviewed and selected. Among the topics addressed are a broad variety of topics from theoretical computer science, algorithmics and programming theory. The WEA papers deal with graph and network algorithms, flow and routing problems, scheduling and approximation algorithms, etc.

Author: Jonathan L. Gross
Publisher: CRC Press
ISBN: 1439880190
Category : Computers
Languages : en
Pages : 1606

View

Book Description
In the ten years since the publication of the best-selling first edition, more than 1,000 graph theory papers have been published each year. Reflecting these advances, Handbook of Graph Theory, Second Edition provides comprehensive coverage of the main topics in pure and applied graph theory. This second edition-over 400 pages longer than its prede

Author: Clelia De Felice
Publisher: Springer Science & Business Media
ISBN: 3540265465
Category : Computers
Languages : en
Pages : 419

View

Book Description
This book constitutes the refereed proceedings of the 9th International Conference on Developments in Language Theory, DLT 2005, held in Palermo, Italy in July 2005. The 29 revised full papers presented together with 5 invited papers were carefully reviewed and selected from 73 submissions. All important issues in language theory are addressed including grammars, acceptors, and transducers for strings frees, graphs, and arrays; efficient text algorithms; algebraic theories for automata and languages; variable-length codes; symbolic dynamics; decision problems; relations to complexity theory and logic; picture description and analysis; cryptography; concurrency; DNA computing; and quantum computing.

Author: Gaston H. Gonnet
Publisher: Springer
ISBN: 3540464158
Category : Computers
Languages : en
Pages : 497

View

Book Description
This book constitutes the refereed proceedings of the 4th International Conference, Latin American Theoretical Informatics, LATIN 2000, held in Punta del Est, Uruguay, in April 2000. The 42 revised papers presented were carefully reviewed and selected from a total of 87 submissions from 26 countries. Also included are abstracts or full papers of several invited talks. The papers are organized in topical sections on random structures and algorithms, complexity, computational number theory and cryptography, algebraic algorithms, computability, automata and formal languages, and logic and programming theory.

Author: Dominique Perrin
Publisher: Academic Press
ISBN: 9780125321112
Category : Computers
Languages : en
Pages : 560

View

Book Description
Infinite Words is an important theory in both Mathematics and Computer Sciences. Many new developments have been made in the field, encouraged by its application to problems in computer science. Infinite Words is the first manual devoted to this topic. Infinite Words explores all aspects of the theory, including Automata, Semigroups, Topology, Games, Logic, Bi-infinite Words, Infinite Trees and Finite Words. The book also looks at the early pioneering work of Büchi, McNaughton and Schützenberger. Serves as both an introduction to the field and as a reference book. Contains numerous exercises desgined to aid students and readers. Self-contained chapters provide helpful guidance for lectures.

Author: Saeed Salehi
Publisher: VDM Verlag Dr. Muller
ISBN: 3639230558
Category :
Languages : en
Pages : 35

View

Book Description
Trees are among the most fundamental and ubiquitous structures in mathematics and computer science. The notion of "tree" appears in many seemingly different areas from graph theory to universal algebra to logic. Tree languages and automata on trees have been studied extensively since the 1960s from both a purely mathematical and application point of view. Though the theory of tree automata and tree languages may have come into existence by generalizing string automata and languages, but it could not have stayed alive for long as a mere generalization. Apart from its intrinsic interest, this theory has found several applications and offers new perspectives to various parts of mathematical linguistics. It has been applied to the study of databases and XML schema languages, and provides tools for syntactic pattern recognition. When trees are defined as terms, universal algebra becomes directly applicable to tree automata and tree languages and, on the other hand, the theory of tree automata and tree languages suggests new notions and problems to universal algebra. In this book, the theory has been studied from the algebraic viewpoint.

Author: Werner Kuich
Publisher: Springer
ISBN: 354046011X
Category : Computers
Languages : en
Pages : 397

View

Book Description
This book constitutes the thoroughly refereed post-proceedings of the 5th International Conference on Developments in Language Theory, DLT 2001, held in Vienna, Austria, in July 2001. The 24 revised full papers presented together with 10 revised invited papers were carefully selected during two rounds of reviewing and revision from a total of 64 papers submitted. Among the topics covered are grammars and acceptors, efficient algorithms for languages, combinatorial and algebraic properties, decision problems, relations to complexity theory, logic, picture description and analysis, DNA computing, cryptography, and concurrency.

Author: Ricardo Baeza-Yates
Publisher: Springer
ISBN: 0387356088
Category : Computers
Languages : en
Pages : 624

View

Book Description
Foundations of Information Technology in the Era of Network and Mobile Computing is presented in two distinct but interrelated tracks: -Algorithms, Complexity and Models of Computation; -Logic, Semantics, Specification and Verification. This volume contains 45 original and significant contributions addressing these foundational questions, as well as 4 papers by outstanding invited speakers. These papers were presented at the 2nd IFIP International Conference on Theoretical Computer Science (TCS 2002), which was held in conjunction with the 17th World Computer Congress, sponsored by the International Federation for Information Processing (IFIP), and which convened in Montréal, Québec, Canada in August 2002.