Sciweavers

STOC
2010
ACM
199views Algorithms» more  STOC 2010»
14 years 5 months ago
Zero-One Frequency Laws
Data streams emerged as a critical model for multiple applications that handle vast amounts of data. One of the most influential and celebrated papers in streaming is the “AMSâ...
Vladimir Braverman and Rafail Ostrovsky
STACS
2007
Springer
14 years 6 months ago
The Complexity of Unions of Disjoint Sets
This paper is motivated by the open question whether the union of two disjoint NPcomplete sets always is NP-complete. We discover that such unions retain much of the complexity of...
Christian Glaßer, Alan L. Selman, Stephen D....