skip to main content
10.1145/103418acmconferencesBook PagePublication PagesstocConference Proceedingsconference-collections
STOC '91: Proceedings of the twenty-third annual ACM symposium on Theory of Computing
ACM1991 Proceeding
Publisher:
  • Association for Computing Machinery
  • New York
  • NY
  • United States
Conference:
STOC91: 23rd Annual ACM Symposium on Theory of Computing New Orleans Louisiana USA May 5 - 8, 1991
ISBN:
978-0-89791-397-3
Published:
03 January 1991
Sponsors:
Next Conference
June 24 - 28, 2024
Vancouver , BC , Canada
Bibliometrics
Abstract

No abstract available.

Article
Free
Article
Free
Article
Free
Factoring numbers using singular integers
Article
Free
Article
Free
Article
Free
Article
Free
Counting linear extensions is #P-complete
Article
Free
Article
Free
Probabilistic recurrence relations
Article
Free
Article
Free
Generic Computation and its complexity
Article
Free
Hamiltonian paths in infinite graphs
Article
Free
The harmonic online K-server algorithm is competitive
Contributors
  • Southeastern Louisiana University
  • University of Mississippi

Index Terms

  1. Proceedings of the twenty-third annual ACM symposium on Theory of Computing

    Recommendations

    Acceptance Rates

    Overall Acceptance Rate1,469of4,586submissions,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%