✦ LIBER ✦

A tight lower bound for restricted pir protocols

✍ Scribed by Richard Beigel; Lance Fortnow; William Gasarch

Publisher: Springer
Year: 2006
Tongue: English
Weight: 140 KB
Volume: 15
Category: Article
ISSN: 1016-3328
DOI: 10.1007/s00037-006-0208-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight lower bounds for Shellsort

✍ Mark Allen Weiss; Robert Sedgewick 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 541 KB

A tight lower bound for the train revers

A tight lower bound for the train reversal problem

✍ Alok Aggarwal; Tom Leighton 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 319 KB

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

A tight lower bound for the completion t

A tight lower bound for the completion time variance problem

✍ C.T. Ng; X. Cai; T.C.E. Cheng 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 216 KB

Tight lower bounds for minimum weight tr

Tight lower bounds for minimum weight triangulation heuristics

✍ Christos Levcopoulos; Drago Krznaric 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 643 KB

A tight lower bound for the Steiner rati

A tight lower bound for the Steiner ratio in Minkowski planes

✍ Biao Gao; Ding-Zhu Du; Ronald L. Graham 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 804 KB

A minimum Steiner tree for a given set X of points is a network interconnecting the points of X having minimum possible total length. The Steiner ratio for a metric space is the largest lower bound for the ratio of lengths between a minimum Steiner tree and a minimum spanning tree on the same set of