✦ LIBER ✦

Lower bounds for set intersection queries

✍ Scribed by P. Dietz; K. Mehlhorn; R. Raman; C. Uhrig

Publisher: Springer
Year: 1995
Tongue: English
Weight: 830 KB
Volume: 14
Category: Article
ISSN: 0178-4617
DOI: 10.1007/bf01293666

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Intersection queries in sets of disks

✍ Marc van Kreveld; Mark Overmars; Pankaj K. Agarwal 📂 Article 📅 1992 🏛 Springer Netherlands 🌐 English ⚖ 803 KB

Constructive Upper Bounds for Intersecti

Constructive Upper Bounds for Intersecting Set Systems

✍ Vince Grolmusz 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 245 KB

Unconditional lower bounds for learning

Unconditional lower bounds for learning intersections of halfspaces

✍ Adam R. Klivans; Alexander A. Sherstov 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 444 KB

Lower bound on the profile of degree pai

Lower bound on the profile of degree pairs in cross-intersecting set systems

✍ Zsuzsanna Szaniszló; Zsolt Tuza 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 141 KB

Lower bounds for constant degree indepen

Lower bounds for constant degree independent sets

✍ Michael O. Albertson; Debra L. Boutin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 340 KB

Let c(\* denote the maximum number of independent vertices all of which have the same degree. We provide lower bounds for G(\* for graphs that are planar, maximal planar, of bounded degree, or trees.

Lower Bounds for Nodal Sets of Eigenfunc

Lower Bounds for Nodal Sets of Eigenfunctions

✍ Tobias H. Colding; William P. Minicozzi 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 159 KB