Sciweavers
Explore
Publications
Books
Software
Tutorials
Presentations
Lectures Notes
Datasets
Labs
Conferences
Community
Upcoming
Conferences
Top Ranked Papers
Most Viewed Conferences
Conferences by Acronym
Conferences by Subject
Conferences by Year
Tools
Sci2ools
International Keyboard
Graphical Social Symbols
CSS3 Style Generator
OCR
Web Page to Image
Web Page to PDF
Merge PDF
Split PDF
Latex Equation Editor
Extract Images from PDF
Convert JPEG to PS
Convert Latex to Word
Convert Word to PDF
Image Converter
PDF Converter
Community
Sciweavers
About
Terms of Use
Privacy Policy
Cookies
Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools
26
click to vote
FOCS
2003
IEEE
favorite
Email
discuss
report
95
views
Theoretical Computer Science
»
more
FOCS 2003
»
Tight Lower Bounds for the Distinct Elements Problem
14 years 1 months ago
Download
www.almaden.ibm.com
Piotr Indyk, David P. Woodruff
Real-time Traffic
FOCS 2003
|
Theoretical Computer Science
|
claim paper
Related Content
»
Strong Lower Bounds for Approximating Distribution Support Size and the Distinct Elements ...
»
Tight Bounds on the Complexity of Recognizing OddRanked Elements
»
Quantum Complexities of Ordered Searching Sorting and Element Distinctness
»
Quantum Algorithms for Element Distinctness
»
Tight Lower Bounds for Certain Parameterized NPHard Problems
»
The averagecase complexity of counting distinct elements
»
Tight bounds for the partialsums problem
»
A MultiRound Communication Lower Bound for Gap Hamming and Some Consequences
»
A Tight Lower Bound for the Steiner Point Removal Problem on Trees
more »
Post Info
More Details (n/a)
Added
04 Jul 2010
Updated
04 Jul 2010
Type
Conference
Year
2003
Where
FOCS
Authors
Piotr Indyk, David P. Woodruff
Comments
(0)
Researcher Info
Theoretical Computer Science Study Group
Computer Vision