Welcome to our book review site go-pdf.online!

You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.

Sign up

Random Graphs
  • Language: en
  • Pages: 350

Random Graphs

A unified, modern treatment of the theory of random graphs-including recent results and techniques Since its inception in the 1960s, the theory of random graphs has evolved into a dynamic branch of discrete mathematics. Yet despite the lively activity and important applications, the last comprehensive volume on the subject is Bollobas's well-known 1985 book. Poised to stimulate research for years to come, this new work covers developments of the last decade, providing a much-needed, modern overview of this fast-growing area of combinatorics. Written by three highly respected members of the discrete mathematics community, the book incorporates many disparate results from across the literature...

Algorithms and Data Structures
  • Language: en
  • Pages: 675

Algorithms and Data Structures

This book constitutes the refereed proceedings of the 10th International Workshop on Algorithms and Data Structures, WADS 2007, held in Halifax, Canada, in August 2007. The papers present original research on the theory and application of algorithms and data structures in all areas, including combinatorics, computational geometry, databases, graphics, parallel and distributed computing.

An Irregular Mind
  • Language: en
  • Pages: 749

An Irregular Mind

Szemerédi's influence on today's mathematics, especially in combinatorics, additive number theory, and theoretical computer science, is enormous. This volume is a celebration of Szemerédi's achievements and personality, on the occasion of his seventieth birthday. It exemplifies his extraordinary vision and unique way of thinking. A number of colleagues and friends, all top authorities in their fields, have contributed their latest research papers to this volume. The topics include extension and applications of the regularity lemma, the existence of k-term arithmetic progressions in various subsets of the integers, extremal problems in hypergraphs theory, and random graphs, all of them beautiful, Szemerédi type mathematics. It also contains published accounts of the first two, very original and highly successful Polymath projects, one led by Tim Gowers and the other by Terry Tao.

Experimental and Efficient Algorithms
  • Language: en
  • Pages: 637

Experimental and Efficient Algorithms

  • Type: Book
  • -
  • Published: 2005-05-03
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 4th International Workshop on Experimental and Efficient Algorithms, WEA 2005, held in Santorini Island, Greece in May 2005. The 47 revised full papers and 7 revised short papers presented together with extended abstracts of 3 invited talks were carefully reviewed and selected from 176 submissions. The book is devoted to the design, analysis, implementation, experimental evaluation, and engineering of efficient algorithms. Among the application areas addressed are most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, data mining, data analysis, etc.

LATIN'98: Theoretical Informatics
  • Language: en
  • Pages: 408

LATIN'98: Theoretical Informatics

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.

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques
  • Language: en
  • Pages: 314

Approximation, Randomization and Combinatorial Optimization: Algorithms and Techniques

  • Type: Book
  • -
  • Published: 2003-05-15
  • -
  • Publisher: Springer

This book constitutes the joint refereed proceedings of the 4th International Workshop on Approximation Algorithms for Optimization Problems, APPROX 2001 and of the 5th International Workshop on Ranomization and Approximation Techniques in Computer Science, RANDOM 2001, held in Berkeley, California, USA in August 2001. The 26 revised full papers presented were carefully reviewed and selected from a total of 54 submissions. Among the issues addressed are design and analysis of approximation algorithms, inapproximability results, on-line problems, randomization, de-randomization, average-case analysis, approximation classes, randomized complexity theory, scheduling, routing, coloring, partitioning, packing, covering, computational geometry, network design, and applications in various fields.

LATIN 2004: Theoretical Informatics
  • Language: en
  • Pages: 642

LATIN 2004: Theoretical Informatics

  • Type: Book
  • -
  • Published: 2004-02-20
  • -
  • Publisher: Springer

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,...

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms
  • Language: en
  • Pages: 1264

Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms

  • Type: Book
  • -
  • Published: 2006-01-01
  • -
  • Publisher: SIAM

Symposium held in Miami, Florida, January 22–24, 2006.This symposium is jointly sponsored by the ACM Special Interest Group on Algorithms and Computation Theory and the SIAM Activity Group on Discrete Mathematics.Contents Preface; Acknowledgments; Session 1A: Confronting Hardness Using a Hybrid Approach, Virginia Vassilevska, Ryan Williams, and Shan Leung Maverick Woo; A New Approach to Proving Upper Bounds for MAX-2-SAT, Arist Kojevnikov and Alexander S. Kulikov, Measure and Conquer: A Simple O(20.288n) Independent Set Algorithm, Fedor V. Fomin, Fabrizio Grandoni, and Dieter Kratsch; A Polynomial Algorithm to Find an Independent Set of Maximum Weight in a Fork-Free Graph, Vadim V. Lozin a...

Artificial Immune Systems
  • Language: en
  • Pages: 447

Artificial Immune Systems

  • Type: Book
  • -
  • Published: 2008-08-05
  • -
  • Publisher: Springer

This book constitutes the refereed proceedings of the 7th International Conference on Artificial Immune Systems, ICARIS 2008, held in Phuket, Thailand, in August 2008. The 40 revised full papers presented were carefully reviewed and selected from 67 submissions. The papers are organized in topical sections on computational immunology, applied AIS, and theoretical AIS. Position papers and conceptual papers are also included.

LATIN 2000: Theoretical Informatics
  • Language: en
  • Pages: 497

LATIN 2000: Theoretical Informatics

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.