✦ LIBER ✦

[Lecture Notes in Computer Science] Algorithms and Computation Volume 5878 || I/O-Efficient Contour Tree Simplification

✍ Scribed by Dong, Yingfei; Du, Ding-Zhu; Ibarra, Oscar

Book ID: 118155509
Publisher: Springer Berlin Heidelberg
Year: 2009
Weight: 241 KB
Category: Article
ISBN: 3642106315
DOI: 10.1007/978-3-642-10631-6_116

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 6506 || Approximate Periodicity

✍ Cheong, Otfried; Chwa, Kyung-Yong; Park, Kunsoo 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 216 KB

Annotation This Book Constitutes The Refereed Proceedings Of The 21st International Symposium On Algorithms And Computation, Isaac 2010, Held In Jeju, South Korea In December 2010.the 77 Revised Full Papers Presented Were Carefully Reviewed And Selected From 182 Submissions For Inclusion In The Book

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Algebra Volume 144 || The parallel Risch algorithm (I)

✍ Calmet, Jacques 📂 Article 📅 1982 🏛 Springer Berlin Heidelberg ⚖ 692 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computational Science – ICCS 2007 Volume 4487 || An Efficient Algorithm and Its Parallelization for Computing PageRank

✍ Shi, Yong; Albada, Geert Dick; Dongarra, Jack; Sloot, Peter M. A. 📂 Article 📅 2007 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 317 KB

Part of a four-volume set, this book constitutes the refereed proceedings of the 7th International Conference on Computational Science, ICCS 2007, held in Beijing, China in May 2007. The papers cover a large volume of topics in computational science and related areas, from multiscale physics to wire

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms in Modern Mathematics and Computer Science Volume 122 || Algorithms and algebra

✍ Ershov, Andrei P.; Knuth, Donald E. 📂 Article 📅 1981 🏛 Springer Berlin Heidelberg ⚖ 457 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computer Science Logic Volume 6247 || Exact Exploration and Hanging Algorithms

✍ Dawar, Anuj; Veith, Helmut 📂 Article 📅 2010 🏛 Springer Berlin Heidelberg ⚖ 223 KB

[Lecture Notes in Computer Science] Comp

[Lecture Notes in Computer Science] Computing and Combinatorics Volume 1276 || Tree structure genetic algorithm with a nourishment mechanism

✍ Jiang, Tao; Lee, D. T. 📂 Article 📅 1997 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 608 KB

This book constitutes the refereed proceedings of the Third Annual International Computing and Combinatorics Conference, COCOON'97, held in Shanghai, China, in August 1997. The volume presents 53 revised full papers selected from a total of 106 submissions. The papers are organized in sections on