The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1972 (conf/focs/FOCS13)

  1. Barry K. Rosen
    Program Equivalence and Context-Free Grammars [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:7-18 [Conf]
  2. Denis J. Kfoury
    Effective Computability in Algebraic Structures (A Schematology Approach) [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:19-26 [Conf]
  3. John C. Cherniavsky, Robert L. Constable
    Representing Program Schemes in Logic [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:27-39 [Conf]
  4. George Tourlakis, John Mylopoulos
    Some Results in Computational Topology [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:40-51 [Conf]
  5. Joseph A. Goguen
    On Homomorphisms, Simulations, Correctness and Subroutines for Programs and Program Schemes [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:52-60 [Conf]
  6. Albert R. Meyer, Robert Moll
    Honest Bounds for Complexity Classes of Recursive Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:61-66 [Conf]
  7. Luigi Logrippo
    Renamings in Program Schemas (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:67-70 [Conf]
  8. John L. Bruno, Edward G. Coffman Jr., W. H. Hosken
    Consistency of Synchronization Nets using P and V Operations [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:71-77 [Conf]
  9. Robert M. Keller
    On the Decomposition of Asynchronous Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:78-89 [Conf]
  10. R. Moenck, Allan Borodin
    Fast Modular Transforms via Division [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:90-96 [Conf]
  11. Ellis Horowitz
    The Efficient Calculation of Powers of Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:97-104 [Conf]
  12. Mary Shaw, J. F. Traub
    On the Number of Multiplications for the Evaluation of a Polynomial and All Its Derivatives [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:105-107 [Conf]
  13. John Mylopoulos
    On the Relation of Graph Grammars and Graph Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:108-120 [Conf]
  14. R. Hossley, Charles Rackoff
    The Emptiness Problem for Automata on Infinite Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:121-124 [Conf]
  15. Albert R. Meyer, Larry J. Stockmeyer
    The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:125-129 [Conf]
  16. Sartaj Sahni
    Some Related Problems from Network Flows, Game Theory and Integer Programming [Citation Graph (1, 0)][DBLP]
    FOCS, 1972, pp:130-138 [Conf]
  17. Nathan Friedman
    Some Results on the Effect of Arithmetics on Comparison Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:139-143 [Conf]
  18. David S. Johnson
    Fast Allocation Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:144-154 [Conf]
  19. C. L. Liu
    Optimal Scheduling on Multi-Processor Computing Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:155-160 [Conf]
  20. Jeffrey D. Ullman
    A Fast Algorithm for the Elimination of Common Subexpressions [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:161-176 [Conf]
  21. Sheldon B. Akers Jr.
    Universal Test Sets for Logic Networks [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:177-184 [Conf]
  22. Kewal K. Saluja, Sudhakar M. Reddy
    Multiple Faults in Reed-Muller Canonic Networks [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:185-191 [Conf]
  23. C. C. Huang, Richard Y. Kain, Larry L. Kinney
    Output Sufficient Modules for Uniform Decomposition of Synchronous Sequential Circuits [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:192-199 [Conf]
  24. Jean Berstel
    On Sets of Numbers Recognized by Push-Down Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:200-206 [Conf]
  25. Brenda S. Baker, Ronald V. Book
    Reversal-Bounded Multi-Pushdown Machines: Extended Abstract [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:207-211 [Conf]
  26. J. Robert Jump, P. S. Thiagarajan
    On the Equivalence of Asynchronous Control Structures [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:212-223 [Conf]
  27. T. S. E. Maibaum
    The Characterization of the Derivation Trees of Context Free Sets of Terms as Regular Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1972, pp:224-230 [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