Vote for your favorite mineral in #MinCup25! - Carpathite vs. Leucite
Brace for oddness in a match between one of the very few hydrocarbon minerals carpathite and the temperature-flipping mineral leucite.
Log InRegister
Quick Links : The Mindat ManualThe Rock H. Currier Digital LibraryMindat Newsletter [Free Download]
Home PageAbout MindatThe Mindat ManualHistory of MindatCopyright StatusWho We AreContact UsAdvertise on Mindat
Donate to MindatCorporate SponsorshipSponsor a PageSponsored PagesMindat AdvertisersAdvertise on Mindat
Learning CenterWhat is a mineral?The most common minerals on earthInformation for EducatorsMindat ArticlesThe ElementsThe Rock H. Currier Digital LibraryGeologic Time
Minerals by PropertiesMinerals by ChemistryAdvanced Locality SearchRandom MineralRandom LocalitySearch by minIDLocalities Near MeSearch ArticlesSearch GlossaryMore Search Options
Search For:
Mineral Name:
Locality Name:
Keyword(s):
 
The Mindat ManualAdd a New PhotoRate PhotosLocality Edit ReportCoordinate Completion ReportAdd Glossary Item
Mining CompaniesStatisticsUsersMineral MuseumsClubs & OrganizationsMineral Shows & EventsThe Mindat DirectoryDevice SettingsThe Mineral Quiz
Photo SearchPhoto GalleriesSearch by ColorNew Photos TodayNew Photos YesterdayMembers' Photo GalleriesPast Photo of the Day GalleryPhotography

Chazelle, Bernard (1998) A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM Journal on Computing, 27 (2). 545-556 doi:10.1137/s0097539794275665

Advanced
   -   Only viewable:
Reference TypeJournal (article/letter/editorial)
TitleA Spectral Approach to Lower Bounds with Applications to Geometric Searching
JournalSIAM Journal on Computing
AuthorsChazelle, BernardAuthor
Year1998 (April)Volume27
Issue2
PublisherSociety for Industrial & Applied Mathematics (SIAM)
DOIdoi:10.1137/s0097539794275665Search in ResearchGate
Generate Citation Formats
Mindat Ref. ID11240184Long-form Identifiermindat:1:5:11240184:3
GUID0
Full ReferenceChazelle, Bernard (1998) A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM Journal on Computing, 27 (2). 545-556 doi:10.1137/s0097539794275665
Plain TextChazelle, Bernard (1998) A Spectral Approach to Lower Bounds with Applications to Geometric Searching. SIAM Journal on Computing, 27 (2). 545-556 doi:10.1137/s0097539794275665
In(1998, April) SIAM Journal on Computing Vol. 27 (2) Society for Industrial & Applied Mathematics (SIAM)

See Also

These are possibly similar items as determined by title/reference text matching only.

Chazelle, Bernard (1988) A Functional Approach to Data Structures and Its Use in Multidimensional Searching. SIAM Journal on Computing, 17 (3). 427-462 doi:10.1137/0217026
Chazelle, Bernard (1986) Filtering Search: A New Approach to Query-Answering. SIAM Journal on Computing, 15 (3). 703-724 doi:10.1137/0215051
Chazelle, Bernard, Liu, Ding, Magen, Avner (2005) Sublinear Geometric Algorithms. SIAM Journal on Computing, 35 (3). 627-646 doi:10.1137/s009753970444572x
Chazelle, Bernard (1984) Convex Partitions of Polyhedra: A Lower Bound and Worst-Case Optimal Algorithm. SIAM Journal on Computing, 13 (3). 488-507 doi:10.1137/0213031
McDiarmid, Colin (1988) Average-Case Lower Bounds for Searching. SIAM Journal on Computing, 17 (5). 1044-1060 doi:10.1137/0217066
Chazelle, Bernard (2015) Diffusive Influence Systems. SIAM Journal on Computing, 44 (5). 1403-1442 doi:10.1137/120882640
Ellen, Faith, Gelashvili, Rati, Zhu, Leqi (2024) Revisionist Simulations: A New Approach to Proving Space Lower Bounds. SIAM Journal on Computing, 53 (4) 1039-1084 doi:10.1137/20m1322923
Barnes, Greg, Edmonds, Jeff A. (1998) Time--Space Lower Bounds for Directed st-Connectivity on Graph Automata Models. SIAM Journal on Computing, 27 (4). 1190-1202 doi:10.1137/s0097539795294402
Kushilevitz, Eyal, Mansour, Yishay, Rabin, Michael O., Zuckerman, David (1998) Lower Bounds for Randomized Mutual Exclusion. SIAM Journal on Computing, 27 (6). 1550-1563 doi:10.1137/s009753979426513x
Chazelle, Bernard (1992) An Optimal Algorithm for Intersecting Three-Dimensional Convex Polyhedra. SIAM Journal on Computing, 21 (4). 671-696 doi:10.1137/0221041
Evans, William, Pippenger, Nicholas (1998) Average-Case Lower Bounds for Noisy Boolean Decision Trees. SIAM Journal on Computing, 28 (2). 433-446 doi:10.1137/s0097539796310102
 
and/or  
Mindat.org is an outreach project of the Hudson Institute of Mineralogy, a 501(c)(3) not-for-profit organization.
Copyright © mindat.org and the Hudson Institute of Mineralogy 1993-2025, except where stated. Most political location boundaries are Β© OpenStreetMap contributors. Mindat.org relies on the contributions of thousands of members and supporters. Founded in 2000 by Jolyon Ralph.
To cite: Ralph, J., Von Bargen, D., Martynov, P., Zhang, J., Que, X., Prabhu, A., Morrison, S. M., Li, W., Chen, W., & Ma, X. (2025). Mindat.org: The open access mineralogy database to accelerate data-intensive geoscience research. American Mineralogist, 110(6), 833–844. doi:10.2138/am-2024-9486.
Privacy Policy - Terms & Conditions - Contact Us / DMCA issues - Report a bug/vulnerability Current server date and time: September 6, 2025 12:12:30
Go to top of page