Page 3
Page 3
Mathematical Foundations of Computer Science 2008 ; 33rd International Symposium, MFCS 2008, Toru´n, Poland, August 25-29, 2008. Proceedings
Constitutes the refereed proceedings of the 33rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2008, held in Torun, Poland, in August 2008.The 45 revised full papers presented together with 5 invited lectures were carefully reviewed and selected from 119 submissions. All current aspects in theoretical computer science and its mathematical foundations are addressed, ranging from algorithmic game theory, algorithms and data structures, artificial intelligence, automata and formal languages, bioinformatics, complexity, concurrency and petrinets, cryptography and security, logic and formal specifications, models of computations, parallel and distributed computing, semantics and verification.
LATIN 2008 : Theoretical Informatics ; 8th Latin American Symposium, Búzios, Brazil, April 7-11, 2008. Proceedings
The Latin American Theoretical INformatics Symposium (LATIN) is becoming a traditional and high-quality conference on the Theory of Computing. Previous conferences havebeen organized twiceinBrazil: SaoPaulo (1992) and Campinas (1998); twice in Chile: Valpara so (1995) and Valdivia (2006); once in Uruguay: Punta del Este (2000); once in Mexico: Cancun (2002); and once in Argentina: Buenos Aires (2004). This volume contains the proceedings of the 8th Latin American Theore- cal INformatics Symposium (LATIN 2008), which was held in Buzio s, Rio de Janeiro, Brazil, April 7 11, 2008.
LATIN 2006 : Theoretical Informatics ; 7th Latin American Symposium, Valdivia, Chile, March 20-24, 2006, Proceedings
This book constitutes the refereed proceedings of the 7th International Symposium, Latin American Theoretical Informatics, LATIN 2006, held in March 2006. The 66 revised full papers presented together with seven invited papers were carefully reviewed and selected from 224 submissions. The papers presented are devoted to a broad range of topics in theoretical computer science with a focus on algorithmics and computations related to discrete mathematics as well as on cryptography, data compression and Web applications.
Knowledge Processing with Interval and Soft Computing
In particular, these chapters cover computing techniques for interval linear systems of equations, interval matrix singular-value decomposition, interval function approximation, and decision making with statistical and graph-based data processing. To enable these applications, the book presents a standards-based object-oriented interval computing environment in C++.
Complexity of Constraints : An Overview of Current Research Themes
This state-of-the-art survey contains the papers that were invited by the organizers after conclusion of an International Dagstuhl-Seminar on Complexity of Constraints, held in Dagstuhl Castle, Germany, in October 2006.
Automorphic forms and even unimodular lattices : Kneser neighbors of niemeier lattices
This book includes a self-contained approach of the general theory of quadratic forms and integral Euclidean lattices.It explains how the new advances in the Langlands program mentioned above pave the way for a solution. This study proves to be very rich, leading us to classical themes such as theta series, Siegel modular forms, the triality principle, L-functions and congruences between Galois representations.
Automata, languages and programming ; 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part II
The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008.
Automata, Languages and Programming ; 35th International Colloquium, ICALP 2008, Reykjavik, Iceland, July 7-11, 2008, Proceedings, Part I
The two-volume set LNCS 5125 and LNCS 5126 constitutes the refereed proceedings of the 35th International Colloquium on Automata, Languages and Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008.
Arithmetic of finite fields ; 2nd International Workshop, WAIFI 2008 Siena, Italy, July 6-9, 2008 Proceedings
This book constitutes the refereed proceedings of the Second International Workshop on the Arithmetic of Finite Fields, WAIFI 2008, held in Siena, Italy, in July 2008.
Approximation, randomization and combinatorial optimization. algorithms and techniques ; 11th International Workshop, APPROX 2008, and 12th International Workshop, RANDOM 2008, Boston, MA, USA, August 25-27, 2008. Proceedings
This book constitutes the joint refereed proceedings of the 11th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2008.
Approximation and Online Algorithms ; Vol.3879 : 3rd International Workshop, WAOA 2005, Palma de Mallorca, Spain, October 6-7, 2005, Revised Selected Papers
The third Workshop on Approximation and Online Algorithms (WAOA 2005) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications from a variety of ?elds. WAOA 2005 took place in Palma de Mallorca, Spain, on 6–7 October 2005. The workshop was part of the ALGO 2005 event that also hosted ESA, WABI, and ATMOS. The two previous WAOA workshops were held in Budapest (2003) and Rome (2004).
Approximation and online algorithms ; Vol.3351 ; 2nd international workshop, WAOA 2004, Bergen, Norway, September 14-16, 2004, Revised Selected Papers
The 2nd Workshop on Approximation and Online Algorithms (WAOA 2004) focused on the design and analysis of algorithms for online and computationally hard problems. Both kinds of problems have a large number of applications arising from a variety of fields. The workshop was part of the ALGO 2004 event which also hosted ESA, WABI, IWPEC, and ATMOS. Topics of interests for WAOA2004 were : applications to game theory, appr- imation classes, coloring and partitioning, competitive analysis, computational finance, cuts and connectivity, geometric problems, in approximability results, mechanism design, network design, routing, packing and covering, paradigms, randomization techniques, and scheduling problems. on the reviews, This volume contains the 21 selected papers
Approximation and Online Algorithms ; 5th International Workshop, WAOA 2007, Eilat, Israel, October 11-12, 2007. Revised Papers
The Fifth Workshop on Approximation and Online Algorithms (WAOA 2007) focused on the design and analysis of algorithms for online and computationally hard problems.
Applications and Theory of Petri Nets ; 29th International Conference, PETRI NETS 2008, Xi’an, China, June 23-27, 2008. Proceedings
This book constitutes the refereed proceedings of the 29th International Conference on Applications and Theory of Petri Nets and Other Models of Concurrency, PETRI NETS 2008, held in Xi'an, China, in June 2008.
Algorithms on Trees and Graphs : With Python Code
Introduces graph algorithms on an intuitive basis followed by a detailed exposition using structured pseudocode, with correctness proofs as well as worst-case analyses. Centered around the fundamental issue of graph isomorphism, the content goes beyond classical graph problems of shortest paths, spanning trees, flows in networks, and matchings in bipartite graphs. Advanced algorithmic results and techniques of practical relevance are presented in a coherent and consolidated way. Numerous illustrations, examples, problems, exercises, and a comprehensive bibliography support students and professionals in using the book as a text and source of reference. Furthermore, Python code for all algorithms presented is given in an appendix. Topics and features: Algorithms are first presented on an intuitive basis, followed by a detailed exposition using structured pseudocode / Correctness proofs are given, together with a worst-case analysis of the algorithms / Full implementation of all the algorithms in Python / An extensive chapter is devoted to the algorithmic techniques used in the book / Solutions to all the problems
Algorithms in Bioinformatics ; Vol. 3692 ; 5th international workshop, WABI 2005, Mallorca, Spain, October 3-6, 2005, Proceedings
this book present the proceedings of the 5th Workshop on Algorithmsin Bioinformatics (WABI 2005) which took place in Spain, 2005. The Workshop on Algorithms in Bioinformatics highlights research workspecifically developed to address algorithmic problems in biosequence analysis. The emphasis is therefore on statistical and probabilistic algorithms that addressimportant problems in the field of molecular and structural biology. the workshop aims to present recent research results, includingsignificant work in progress, and to identify and explore directions of futureresearch.Original research papers (including significant work in progress) or state-of-the-art surveys were solicited on all aspects of algorithms in bioinformatics,including, but not limited to: exact and approximate algorithms for genomics,genetics, sequence analysis, gene and signal recognition, alignment, molecularevolution, phylogenetics, structure determination or prediction, gene expressionand gene networks, proteomics, functional genomics, and drug design.
Algorithms in Bioinformatics ; 8th International Workshop, WABI 2008, Karlsruhe, Germany, September 15-19, 2008. Proceedings
This book constitutes the refereed proceedings of the 8th International Workshop on Algorithms in Bioinformatics, WABI 2008, held in Karlsruhe, Germany, in September 2008 as part of the ALGO 2008 meeting.
Algorithms and data structures ; 9th international workshop, WADS 2005, Waterloo, Canada, August 15-17, 2005, Proceedings
The papers in this volume were presented at the 9th Workshop on Algorithmsand Data Structures (WADS 2005). at the University of Waterloo, Waterloo, Canada. The workshopalternates with the Scandinavian Workshop on Algorithm Theory (SWAT), con-tinuing the tradition of SWAT and WADS starting with SWAT 1988 and WADS1989. From 90 submissions, the Program Committee selected 37 papers for pre-sentation at the workshop. includ Algorithm Analysis and Problem Complexity Data Structures Discrete Mathematics in Computer Science Computer Graphics Numeric Computing
Algorithms and computation ; 19th International symposium, ISAAC 2008, Gold Coast, Australia, December 15-17, 2008. Proceedings
This book constitutes the refereed proceedings of the 19th International Symposium on Algorithms and Computation, ISAAC 2008, held in Gold Coast, Australia in December 2008.
Algorithms and computation ; 15th international symposium, ISAAC 2004, Hong Kong, China, December 20-22, 2004, Proceedings
This volume contains the proceedings of the 15th Annual International Sym- sium on Algorithms and Computation (ISAAC 2004), held in Hong Kong, 2004. ISAAC is an annual international symposium that covers a wide range of topics,namelyalgorithmsandcomputation. aftar review process the committee selected 76 papers, the decisions being based on originality and relevance to the ?eld of algorithms and computation.
