✦ LIBER ✦

Improved Data Structures for Fully Dynamic Biconnectivity

✍ Scribed by Henzinger, Monika R.

Book ID: 118177376
Publisher: Society for Industrial and Applied Mathematics
Year: 2000
Tongue: English
Weight: 463 KB
Volume: 29
Category: Article
ISSN: 0097-5397
DOI: 10.1137/s0097539794263907

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dynamic adaptive data structures for mon

Dynamic adaptive data structures for monitoring data streams

✍ J. Aguilar-Saborit; P. Trancoso; V. Muntes-Mulero; J.L. Larriba-Pey 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 605 KB

An improved fully stressed design algori

An improved fully stressed design algorithm for plate/shell structures

✍ H. Miura 📂 Article 📅 1990 🏛 Springer-Verlag 🌐 English ⚖ 285 KB

Dynamic Data Structures for a Direct Sea

Dynamic Data Structures for a Direct Search Algorithm

✍ Jian He; Layne T. Watson; Naren Ramakrishnan; Clifford A. Shaffer; Alex Verstak; 📂 Article 📅 2002 🏛 Springer US 🌐 English ⚖ 170 KB

Improved data structures for the orthogo

Improved data structures for the orthogonal range successor problem

✍ Chih-Chiang Yu; Wing-Kai Hon; Biing-Feng Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 368 KB

Dynamic recreation of kernel data struct

Dynamic recreation of kernel data structures for live forensics

✍ Andrew Case; Lodovico Marziale; Golden G. Richard III 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 155 KB

Randomized Data Structures for the Dynam

Randomized Data Structures for the Dynamic Closest-Pair Problem

✍ Golin, Mordecai; Raman, Rajeev; Schwarz, Christian; Smid, Michiel 📂 Article 📅 1998 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 544 KB