Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/237814acmconferencesBook PagePublication PagesstocConference Proceedingsconference-collections
STOC '96: Proceedings of the twenty-eighth annual ACM symposium on Theory of Computing
ACM1996 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
STOC96: ACM Symposium on Theory of Computing Philadelphia Pennsylvania USA May 22 - 24, 1996
ISBN:
978-0-89791-785-8
Published:
01 July 1996
Sponsors:

Bibliometrics
Abstract

No abstract available.

Article
Free
Testing of the long code and hardness for clique
Article
Free
Article
Free
Article
Free
Approximating s-t minimum cuts in Õ(n2) time
Article
Free
Minimum cuts in near-linear time
Article
Free
Article
Free
The PL hierarchy collapses
Article
Free
Generating hard instances of lattice problems (extended abstract)
Article
Free
Article
Free
Article
Free
Towards the learnability of DNF formulae
Article
Free
Article
Free
Sparsity considerations in Dixon resultants
Article
Free
Article
Free
Article
Free
A fast quantum mechanical algorithm for database search
Article
Free
Efficient algorithms for inverting evolution
Article
Free
Modular competitiveness for distributed algorithms
Article
Free

Cited By

Contributors

Recommendations

Acceptance Rates

STOC '96 Paper Acceptance Rate 74 of 201 submissions, 37%;
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%