The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
1971 (conf/stoc/STOC3)

  1. Donald F. Stanat
    Formal Languages and Power Series [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:1-11 [Conf]
  2. Eric G. Wagner
    An Algebraic Theory of Recursive Definitions and Recursive Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:12-23 [Conf]
  3. Robert L. Constable
    Loop Schemata [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:24-39 [Conf]
  4. J. Ian Munro
    Some Results Concerning Efficient and Optimal Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:40-44 [Conf]
  5. Charles M. Fiduccia
    Fast Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:45-49 [Conf]
  6. W. J. Meyers
    Linear Representation of Tree Structure: A Mathematical Theory of Parenthesis-Free Notations [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:50-62 [Conf]
  7. H. W. Buttelmann
    On Generalized Finite Automata and Unrestricted Generative Grammars [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:63-77 [Conf]
  8. Leon S. Levy, Aravind K. Joshi
    Some Results in Tree Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:78-85 [Conf]
  9. Daniel M. Berry
    Block Structure: Retention or Deletion? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:86-100 [Conf]
  10. Shi-Kuo Chang
    On the Parallel Computation of Local Operations [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:101-115 [Conf]
  11. Luc Boasson
    An Iteration Theorem for One-Counter Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:116-120 [Conf]
  12. Seymour Ginsburg, Jonathan Goldstine
    Intersection-Closed full AFL and the Recursively Enumerable Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:121-131 [Conf]
  13. Vaclav Rajlich
    Absolutely Parallel Grammars and Two-Way Deterministic Finite-State Transducers [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:132-137 [Conf]
  14. Arnold L. Rosenberg
    Addressable Data Graphs: Extended Abstract [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:138-150 [Conf]
  15. Stephen A. Cook
    The Complexity of Theorem-Proving Procedures [Citation Graph (19, 0)][DBLP]
    STOC, 1971, pp:151-158 [Conf]
  16. Alfred V. Aho, Jeffrey D. Ullman
    The Care and Feeding of LR(k) Grammars [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:159-170 [Conf]
  17. David S. Wise
    Domolki's Algorithm Applied to Generalized Overlap Resolvable Grammars [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:171-184 [Conf]
  18. Gérrine Terrine
    An Algorithm Generating the Decision Table of a Deterministic Bottom Up Parser for a Subset of Context Free Grammars [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:185-205 [Conf]
  19. Robert McNaughton
    A Decision Procedure for Generalized Sequential Mapability-onto of Regular Sets [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:206-218 [Conf]
  20. Eugene S. Santos
    Algebraic Structure Theory of Stochastic Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:219-243 [Conf]
  21. Robert L. Constable, Juris Hartmanis
    Complexity of Formal Translations and Speed-Up Results [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:244-250 [Conf]
  22. Michael Machtey
    Classification of Computable Functions by Primitive Recursive Classes [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:251-257 [Conf]
  23. Edward L. Robertson
    Complexity Classes of Partial Recursive Functions (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1971, pp:258-266 [Conf]
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002