Simulation Beats Richness: New Data-Structure Lower Bounds

AuthID
 P-00N-9SR
4
Author(s)
Chattopadhyay, A
·
Koucky, M
·
Mukhopadhyay, S
3
Editor(s)
Diakonikolas, I; Kempe, D; Henzinger, M
Document Type
Proceedings Paper
Year published
2018
Published
in STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING in STOC, ISSN: 0737-8017
Pages: 1013-1020 (8)
Conference
50Th Annual Acm Sigact Symposium on the Theory of Computing (Stoc), Date: JUN 25-29, 2018, Location: Los Angeles, CA, Sponsors: Assoc Comp Machinery, Assoc Comp Machinery Special Interest Grp Algorithms & Computat Theory
Indexing
Wos®
Scopus®
Dblp®/en/publications/view/698168
Crossref®7
Google Scholar®
Publication Identifiers
Dblp: conf/stoc/ChattopadhyayKL18
Scopus: 2-s2.0-85049876529
Wos: WOS:000458175600087
Source Identifiers
ISSN: 0737-8017
Export Publication Metadata
Marked List
 Add to Marked List
Info
At this moment we don't have any links to full text documens.

footer slogan

Useful Links

Get Help

© 2025 CRACS & Inesc TEC - All Rights Reserved Privacy Policy | Terms of Service