Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

38

SODA
1993
ACM

favoriteEmaildiscussreport

81views Algorithms» more SODA 1993»

Lower Bounds for Set Intersection Queries

14 years 5 days ago

Lower Bounds for Set Intersection Queries

Download www.mpi-inf.mpg.de

Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christ

Real-time Traffic

Algorithms | SODA 1993 |

claim paper

Related Content

» Unconditional lower bounds for learning intersections of halfspaces

» On Intersection Sets in Desarguesian Affine Spaces

» NearOptimal Lower Bounds on the MultiParty Communication Complexity of Set Disjointness

» Randomized computations on large data sets tight lower bounds

» Minimum blocking sets of circles for a set of lines in the plane

» Lower Bounds for the Complexity of Learning HalfSpaces with Membership Queries

» Orthogonal range reporting query lower bounds optimal structures in 3d and higherdimension...

» Dynamic indexability and lower bounds for dynamic onedimensional range query indexes

» Online Algorithms for Disk Graphs

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1993
Where	SODA
Authors	Paul F. Dietz, Kurt Mehlhorn, Rajeev Raman, Christian Uhrig

Comments (0)