☆
3.8
Proceedings Paper
Crossing the Logarithmic Barrier for Dynamic Boolean Data Structure Lower Bounds
STOC'18: PROCEEDINGS OF THE 50TH ANNUAL ACM SIGACT SYMPOSIUM ON THEORY OF COMPUTING (2018)
Export Citation
No citation available
Rate this paper
The primary rating indicates the level of overall quality for the paper. Secondary ratings independently reflect strengths or weaknesses of the paper.
Discover Peeref hubs
Discuss science. Find collaborators. Network.
Join a conversationFind the ideal target journal for your manuscript
Explore over 38,000 international journals covering a vast array of academic fields.
Search