The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
1973 (conf/stoc/STOC5)

  1. Larry J. Stockmeyer, Albert R. Meyer
    Word Problems Requiring Exponential Time: Preliminary Report [Citation Graph (5, 0)][DBLP]
    STOC, 1973, pp:1-9 [Conf]
  2. Harry B. Hunt III
    On the Time and Tape Complexity of Languages I [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:10-19 [Conf]
  3. Sheila A. Greibach
    Jump PDA's, Deterministic Context-Free Languages Principal AFDLs and Polynomial Time Recognition-Extended Abstract [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:20-28 [Conf]
  4. Stephen A. Cook
    An Observation on Time-Storage Trade Off [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:29-33 [Conf]
  5. Derek C. Oppen
    Elementary Bounds for Presburger Arithmetic [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:34-37 [Conf]
  6. David S. Johnson
    Approximation Algorithms for Combinatorial Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:38-49 [Conf]
  7. Webb Miller
    Toward Mechanical Verification of Properties of Roundoff Error Propagation [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:50-58 [Conf]
  8. Mitchell Wand
    An Unusual Application of Program-Proving [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:59-66 [Conf]
  9. Michael J. Fischer, Larry J. Stockmeyer
    Fast On-Line Integer Multiplication [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:67-72 [Conf]
  10. John E. Hopcroft, J. Musinski
    Duality Applied to the Complexity of Matrix Multiplications and other Bilinear Forms [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:73-87 [Conf]
  11. Roger W. Brockett, David P. Dobkin
    On the Optimal Evaluation of a Set of Bilinear Forms [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:88-95 [Conf]
  12. Robert Endre Tarjan
    Testing Flow Graph Reducibility [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:96-107 [Conf]
  13. Robert L. Constable
    Type Two Computational Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:108-121 [Conf]
  14. Richard E. Ladner
    Polynomial Time Reducibility [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:122-129 [Conf]
  15. Nancy A. Lynch, Albert R. Meyer, Michael J. Fischer
    Sets that Don't Help [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:130-134 [Conf]
  16. W. Morven Gentleman, Stephen C. Johnson
    Analysis of Algorithms, a Case Study: Determinants of Polynomials [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:135-141 [Conf]
  17. Robert T. Moenck
    Fast Computation of GCDs [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:142-151 [Conf]
  18. H. T. Kung
    The Computational Complexity of Algebraic Numbers [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:152-159 [Conf]
  19. Philip M. Lewis II, Daniel J. Rosenkrantz, Richard Edwin Stearns
    Attributed Translations [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:160-171 [Conf]
  20. David Pager
    The Lane Tracing Algorithm for Constructing LR(k) Parsers [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:172-181 [Conf]
  21. Ravi Sethi
    Complete Register Allocation Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:182-195 [Conf]
  22. Ray Teitelbaum
    Context-Free Error Analysis by Evaluation of Algebraic Power Series [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:196-199 [Conf]
  23. Brenda S. Baker
    Tree Transductions and Families of Tree Languges [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:200-206 [Conf]
  24. Peter Weiner, S. L. Savage, A. Bagchi
    Neighborhood Search Algorithms for Finding Optimal Traveling Salesman Tours Must Be Inefficient [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:207-213 [Conf]
  25. Eric G. Wagner
    From Algebras to Programming Languages [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:214-223 [Conf]
  26. Jean Vuillemin
    Correct and Optimal Implementations of Recursion in a Simple Programming Language [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:224-239 [Conf]
  27. S. Rao Kosaraju
    Analysis of Structured Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:240-252 [Conf]
  28. Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman
    On Finding Lowest Common Ancestors in Trees [Citation Graph (1, 0)][DBLP]
    STOC, 1973, pp:253-265 [Conf]
  29. Samuel Eilenberg
    Classes of Semigroups and Classes of Sets [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:266-267 [Conf]
  30. Vaughan R. Pratt
    Computing Permutations with Double-Ended Queues, Parallel Stacks and Parallel Queues [Citation Graph (0, 0)][DBLP]
    STOC, 1973, pp:268-277 [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