Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/276698acmconferencesBook PagePublication PagesstocConference Proceedingsconference-collections
STOC '98: Proceedings of the thirtieth annual ACM symposium on Theory of computing
ACM1998 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
STOC98: The 30th Annual ACM Symposium on Theory of Computing Dallas Texas USA May 24 - 26, 1998
ISBN:
978-0-89791-962-3
Published:
23 May 1998
Sponsors:

Reflects downloads up to 04 Oct 2024Bibliometrics
Abstract

No abstract available.

Article
Free
Article
Free
Quantum circuits with mixed states
Article
Free
Exact sampling and approximate counting techniques
Article
Free
Article
Free
A framework for fast quantum mechanical algorithms
Article
Free
Article
Free
One help-bit doesn't help
Article
Free
Article
Free
On approximating arbitrary metrices by tree metrics
Article
Free
Trees and Euclidean metrics
Article
Free
Almost optimal dispersers
Article
Free
Article
Free
Article
Free
Randomized complexity lower bounds
Article
Free
Contributors
  • University of Mississippi

Recommendations

Acceptance Rates

STOC '98 Paper Acceptance Rate 75 of 169 submissions, 44%;
Overall Acceptance Rate 1,469 of 4,586 submissions, 32%
YearSubmittedAcceptedRate
STOC '153479327%
STOC '143199129%
STOC '1336010028%
STOC '113048428%
STOC '083258025%
STOC '032708030%
STOC '022879132%
STOC '012308336%
STOC '001828547%
STOC '981697544%
STOC '972117536%
STOC '962017437%
STOC '891965629%
STOC '881925328%
STOC '871655030%
STOC '801254738%
STOC '791113733%
STOC '781203832%
STOC '77873136%
STOC '76833036%
STOC '75873136%
STOC '74953537%
STOC '71502346%
STOC '70702739%
Overall4,5861,46932%