✦ LIBER ✦

[Lecture Notes in Computer Science] Graphtheoretic Concepts in Computer Science Volume 100 || A new data structure for representing sorted lists

✍ Scribed by Noltemeier, Hartmut

Book ID: 115504003
Publisher: Springer Berlin Heidelberg
Year: 1981
Weight: 800 KB
Category: Article
ISBN: 3540384359
DOI: 10.1007/3-540-10291-4_8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graphtheoretic Concepts in Computer Science Volume 100 || On a generalization of heaps

✍ Noltemeier, Hartmut 📂 Article 📅 1981 🏛 Springer Berlin Heidelberg ⚖ 279 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graphtheoretic Concepts in Computer Science Volume 100 || Investigating programs in terms of partial graphs

✍ Noltemeier, Hartmut 📂 Article 📅 1981 🏛 Springer Berlin Heidelberg ⚖ 100 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A compact data structure and parallel algorithms for permutation graphs

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 383 KB

[Lecture Notes in Computer Science] Grap

[Lecture Notes in Computer Science] Graph-Theoretic Concepts in Computer Science Volume 1017 || A dynamic algorithm for line graph recognition

✍ Nagl, Manfred 📂 Article 📅 1995 🏛 Springer Berlin Heidelberg ⚖ 518 KB

[Lecture Notes in Computer Science] Foun

[Lecture Notes in Computer Science] Foundations of Software Science and Computation Structures Volume 2303 || Verification for Java’s Reentrant Multithreading Concept

✍ Nielsen, Mogens; Engberg, Uffe 📂 Article 📅 2002 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 308 KB

This book constitutes the refereed proceedings of the 5th International Conference on Foundations of Software Science and Computation Structures, FOSSACS 2002, held in Grenoble, France, in April 2002. The 28 revised full papers presented together with an extended abstract of an invited paper were

[Lecture Notes in Computer Science] Algo

[Lecture Notes in Computer Science] Algorithms and Computation Volume 2906 || Succinct Data Structures for Searchable Partial Sums

✍ Ibaraki, Toshihide; Katoh, Naoki; Ono, Hirotaka 📂 Article 📅 2003 🏛 Springer Berlin Heidelberg 🌐 English ⚖ 180 KB

This volume contains the proceedings of the 14th Annual International S- posium on Algorithms and Computation (ISAAC 2003), held in Kyoto, Japan, 15–17 December 2003. In the past, it was held in Tokyo (1990), Taipei (1991), Nagoya (1992), Hong Kong (1993), Beijing (1994), Cairns (1995), Osaka (1996)