You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Introduction -- Array-based lists -- Linked lists -- Skiplists -- Hash tables -- Binary trees -- Random binary search trees -- Scapegoat trees -- Red-black trees -- Heaps -- Sorting algorithms -- Graphs -- Data structures for integers -- External memory searching.
This work brings together the essential writings that every student of journalism should know. It presents 40 of the most important works about journalism arranged thematically to enable students to think deeply and broadly about journalism - its social impact, its history, key individuals and institutions, its practice and its future.
This book constitutes the refereed proceedings of the 11th Algorithms and Data Structures Symposium, WADS 2009, held in Banff, Canada, in August 2009. The Algorithms and Data Structures Symposium - WADS (formerly "Workshop on Algorithms and Data Structures") is intended as a forum for researchers in the area of design and analysis of algorithms and data structures. The 49 revised full papers presented in this volume were carefully reviewed and selected from 126 submissions. The papers present original research on algorithms and data structures in all areas, including bioinformatics, combinatorics, computational geometry, databases, graphics, and parallel and distributed computing.
This book constitutes the thoroughly refereed post-proceedings of the 12th International Symposium on Graph Drawing, GD 2004, held in New York, NY, USA in September/October 2004. The 39 revised full papers and 12 revised short papers presented together with 4 posters and a report on the graph drawing context were carefully selected during two rounds of reviewing and improvement. All current aspects in graph drawing are addressed ranging from foundational and methodological issues to applications for various classes of graphs in a variety of fields.
The 8th International Conference on Principles of Distributed Systems (OPODIS 2004) was held during December 15 –17, 2004 at Grenoble, France.
The 11th International Symposium on Graph Drawing (GD 2003) was held on September 21–24, 2003, at the Universit` a degli Studi di Perugia, Perugia, Italy. GD 2003 attracted 93 participants from academic and industrial institutions in 17 countries. In response to the call for papers, the program committee received 88 re- larsubmissionsdescribingoriginalresearchand/orsystemdemonstrations.Each submission was reviewed by at least 4 program committee members and c- ments were returned to the authors. Following extensive e-mail discussions, the program committee accepted 34 long papers (12 pages each in the proceedings) and 11 short papers (6 pages each in the proceedings). Also, 6 posters (2 pa...
This book contains Volume 8 of the Journal of Graph Algorithms and Applications (JGAA). JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommunications networks, user interfaces and visualization, and VLSI circuit design.Graph Algorithms and Applications 5 presents contributions from prominent authors and includes selected papers from the Tenth International Symposium on Graph Drawing (GD 2002). All papers in the book have extensive diagrams and offer a unique treatment of graph algorithms focusing on the important applications.
This two-volume set LNCS 14465-14466 constitutes the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, GD 2023, held in Isola delle Femmine, Palermo, Italy, in September 2023. The 31 full papers, 7 short papers, presented together with 2 invited talks, and one contest report, were thoroughly reviewed and selected from the 100 submissions. The abstracts of 11 posters presented at the conference can be found in the back matter of the volume. The contributions were organized in topical sections as follows: beyond planarity; crossing numbers; linear layouts; geometric aspects; visualization challenges; graph representations; graph decompositions; topological aspects; parameterized complexity for drawings; planar graphs; frameworks; algorithmics.
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,...