Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1973 (conf/focs/FOCS14)

1. Peter Weiner
   Linear Pattern Matching Algorithms [Citation Graph (5, 0)][DBLP]
   FOCS, 1973, pp:1-11 [Conf]
   
2. Tiko Kameda, S. Toida
   Efficient Algorithms for Determining an Extremal Tree of a Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:12-15 [Conf]
   
3. Ashok K. Chandra
   Efficient Compilation of Linear Recursive Programs [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:16-25 [Conf]
   
4. Emily P. Friedman
   Equivalence Problems in Monadic Recursion Schemes [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:26-33 [Conf]
   
5. J. M. Cadiou, Jean-Jacques Lévy
   Mechanizable Proofs about Parallel Processes [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:34-48 [Conf]
   
6. C. R. Baugh
   Chow Parameters in Pseudothreshold Logic [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:49-55 [Conf]
   
7. Jon G. Bredeson
   On Multiple Input Change Hazard-Free Combinatorial Switching Circuits without Feedback [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:56-63 [Conf]
   
8. Henry Y. H. Chuang, Santanu Das
   Multiple-Input Change Asynchronous Machines Using Controlled Excitation and Flip-Flops [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:64-69 [Conf]
   
9. Vaughan R. Pratt, Foong Frances Yao
   On Lower Bounds for Computing the i-th Largest Element [Citation Graph (0, 0)][DBLP]
   FOCS, 1973, pp:70-81 [Conf]
   
10. Philip M. Spira, A. Pan
    On Finding and Updating Shortest Paths and Spanning Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:82-84 [Conf]
    
11. Sam Savage
    Statistical Indicators of Optimality [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:85-91 [Conf]
    
12. David P. Dobkin
    On the Optimal Evaluation of a Set of n-Linear Forms [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:92-102 [Conf]
    
13. Matthew M. Geller, Michael A. Harrison
    Characterizations of LR(0) Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:103-108 [Conf]
    
14. M. Dennis Mickunas, Victor B. Schneider
    On the Ability to Cover LR(k) Grammars with LR(1), SLR(1), and (1,1) Bounded-Context Grammars [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:109-121 [Conf]
    
15. Thomas G. Szymanski, John H. Williams
    Non-Canonical Parsing [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:122-129 [Conf]
    
16. Joel I. Seiferas, Michael J. Fischer, Albert R. Meyer
    Refinements of the Nondeterministic Time and Space Hierarchies [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:130-137 [Conf]
    
17. Ivan Hal Sudborough
    On Tape-Bounded Complexity Classes and Multi-Head Finite Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:138-144 [Conf]
    
18. William C. Rounds
    Complexity of Recognition in Intermediate-Level Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:145-158 [Conf]
    
19. William H. Joyner Jr.
    Automatic Theorem-Proving and the Decision Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:159-166 [Conf]
    
20. Hartmut Ehrig, Michael Pfender, Hans Jürgen Schneider
    Graph-Grammars: An Algebraic Approach [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:167-180 [Conf]
    
21. Michael Machtey
    A Notion of Helping and Pseudo-Complementation in Lattices of Honest Subrecursive Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:181-189 [Conf]
    
22. Kurt Mehlhorn
    On the Size of Sets of Computable Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:190-196 [Conf]
    
23. Paul Young
    Optimization among Provably Equivalent Programs (Preliminary Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:197-199 [Conf]
    
24. Lenore Blum, Manuel Blum
    Inductive Inference: A Recursion Theoretic Approach [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:200-208 [Conf]
    
25. John C. Cherniavsky
    The Complexity of Some Non-Classical Logics [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:209-213 [Conf]