✦ LIBER ✦

A Tight Lower Bound for Online Monotonic List Labeling

✍ Scribed by Dietz, Paul F.; Seiferas, Joel I.; Zhang, Ju

Book ID: 118199510
Publisher: Society for Industrial and Applied Mathematics
Year: 2004
Tongue: English
Weight: 146 KB
Volume: 18
Category: Article
ISSN: 0895-4801
DOI: 10.1137/s0895480100315808

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound for monotone perceptrons

✍ F. Green 📂 Article 📅 1995 🏛 Springer 🌐 English ⚖ 802 KB

A tight lower bound for optimal bin pack

A tight lower bound for optimal bin packing

✍ Heng-Yi Chao; Mary P. Harper; Russell W. Quong 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A tight lower bound for restricted pir p

A tight lower bound for restricted pir protocols

✍ Richard Beigel; Lance Fortnow; William Gasarch 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 140 KB

A Lower Bound on List Size for List Deco

A Lower Bound on List Size for List Decoding

✍ Guruswami, V.; Vadhan, S. 📂 Article 📅 2010 🏛 IEEE 🌐 English ⚖ 233 KB

A lower bound for partial list colorings

✍ Chappell, Glenn G. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 188 KB 👁 2 views

Let G be an n-vertex graph with list-chromatic number χ . Suppose that each vertex of G is assigned a list of t colors. Albertson, Grossman, and Haas [1] conjecture that at least t n /χ vertices can be colored from these lists. We prove a lower bound for the number of colorable vertices. As a coroll

A tight lower bound for top-down skew he

A tight lower bound for top-down skew heaps

✍ Berry Schoenmakers 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 498 KB

Previously, it was shown in a paper by Kaldewaij and Schoenmakers that for top-down skew heaps the amortized number of comparisons required for meld and delmin is upper bounded by log+ R, where n is the total size of the inputs to these operations and r#~ = (& + 1) /2 denotes the golden ratio. In th