The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1977 (conf/focs/FOCS18)

  1. Richard J. Lipton
    A Necessary and Sufficient Condition for the Existence of Hoare Logics [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:1-6 [Conf]
  2. Daniel J. Lehmann, Michael B. Smyth
    Data Types (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:7-12 [Conf]
  3. Michael B. Smyth, Gordon D. Plotkin
    The Category-Theoretic Solution of Recursive Domain Equations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:13-17 [Conf]
  4. Edmund M. Clarke
    Program Invariants as Fixed Points (Preliminary Reports) [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:18-29 [Conf]
  5. Gérard P. Huet
    Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:30-45 [Conf]
  6. Amir Pnueli
    The Temporal Logic of Programs [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:46-57 [Conf]
  7. Ronald V. Book
    Language Representation Theorems: How to Generate the R. E. Sets from the Regular Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:58-61 [Conf]
  8. Harry R. Lewis
    A New Decidable Problem, with Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:62-73 [Conf]
  9. Oscar H. Ibarra
    The Unsolvability of the Equivalence Problem for epsilon-free NGSM's with Unary Input (Output) Alphabet and Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:74-81 [Conf]
  10. Howard P. Katseff, Michael Sipser
    Several Results in Program Size Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:82-89 [Conf]
  11. Richard Statman
    The Typed lambda-Calculus Is not Elementary Recursive [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:90-94 [Conf]
  12. Leonard Berman
    Precise Bounds for Presburger Arithmetic and the Reals with Addition: Preliminary Report [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:95-99 [Conf]
  13. Victor L. Bennison, Robert I. Soare
    Recursion Theoretic Characterizations of Complexity Theoretic Properties [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:100-106 [Conf]
  14. Alfred V. Aho, Catriel Beeri, Jeffrey D. Ullman
    The Theory of Joins in Relational Data Bases (Extended Abstract) [Citation Graph (18, 0)][DBLP]
    FOCS, 1977, pp:107-113 [Conf]
  15. Greg Nelson, Derek C. Oppen
    Fast Decision Algorithms Based on Union and Find [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:114-119 [Conf]
  16. H. T. Kung, S. W. Song
    An Efficient Parallel Garbage Collection System and Its Correctness Proof [Citation Graph (5, 0)][DBLP]
    FOCS, 1977, pp:120-131 [Conf]
  17. David Maier
    A Space Efficient Method for the Lowest Common Ancestor Problem and an Application to Finding Negative Cycles [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:132-141 [Conf]
  18. Lawrence Snyder
    On Uniquely Represented Data Structures (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:142-146 [Conf]
  19. Manuel Blum, William J. Sakoda
    On the Capability of Finite Automata in 2 and 3 Dimensional Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:147-161 [Conf]
  20. Richard J. Lipton, Robert Endre Tarjan
    Application of a Planar Separator Theorem [Citation Graph (2, 0)][DBLP]
    FOCS, 1977, pp:162-170 [Conf]
  21. Laurent Hyafil
    The Power of Commutativity [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:171-174 [Conf]
  22. Leonard M. Adleman, Kenneth L. Manders, Gary L. Miller
    On Taking Roots in Finite Fields [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:175-178 [Conf]
  23. Zvi Galil, Joel I. Seiferas
    Saving Space in Fast String-Matching [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:179-188 [Conf]
  24. Leonidas J. Guibas, Andrew M. Odlyzko
    A New Proof of the Linearity of the Boyer-Moore String Searching Algorithm [Citation Graph (1, 0)][DBLP]
    FOCS, 1977, pp:189-195 [Conf]
  25. Philippe Flajolet, Jean-Claude Raoult, Jean Vuillemin
    On the Average Number of Registers Required for Evaluating Arithmetic Expressions [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:196-205 [Conf]
  26. Eugene L. Lawler
    Fast Approximation Algorithms for Knapsack Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:206-213 [Conf]
  27. Edward G. Coffman Jr., Joseph Y.-T. Leung
    Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:214-221 [Conf]
  28. Andrew Chi-Chih Yao
    Probabilistic Computations: Toward a Unified Measure of Complexity (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:222-227 [Conf]
  29. Errol L. Lloyd
    On Triangulations of a Set of Points in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:228-240 [Conf]
  30. David A. Plaisted
    New NP-Hard and NP-Complete Polynomial and Integer Divisibility Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:241-253 [Conf]
  31. Dexter Kozen
    Lower Bounds for Natural Proof Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1977, pp:254-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