Conferences in DBLP
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 ] Daniel J. Lehmann , Michael B. Smyth Data Types (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:7-12 [Conf ] 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 ] Edmund M. Clarke Program Invariants as Fixed Points (Preliminary Reports) [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:18-29 [Conf ] 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 ] Amir Pnueli The Temporal Logic of Programs [Citation Graph (2, 0)][DBLP ] FOCS, 1977, pp:46-57 [Conf ] 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 ] Harry R. Lewis A New Decidable Problem, with Applications (Extended Abstract) [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:62-73 [Conf ] 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 ] Howard P. Katseff , Michael Sipser Several Results in Program Size Complexity [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:82-89 [Conf ] Richard Statman The Typed lambda-Calculus Is not Elementary Recursive [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:90-94 [Conf ] 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 ] Victor L. Bennison , Robert I. Soare Recursion Theoretic Characterizations of Complexity Theoretic Properties [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:100-106 [Conf ] 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 ] Greg Nelson , Derek C. Oppen Fast Decision Algorithms Based on Union and Find [Citation Graph (2, 0)][DBLP ] FOCS, 1977, pp:114-119 [Conf ] 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 ] 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 ] Lawrence Snyder On Uniquely Represented Data Structures (Extended Abstract) [Citation Graph (2, 0)][DBLP ] FOCS, 1977, pp:142-146 [Conf ] 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 ] Richard J. Lipton , Robert Endre Tarjan Application of a Planar Separator Theorem [Citation Graph (2, 0)][DBLP ] FOCS, 1977, pp:162-170 [Conf ] Laurent Hyafil The Power of Commutativity [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:171-174 [Conf ] 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 ] Zvi Galil , Joel I. Seiferas Saving Space in Fast String-Matching [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:179-188 [Conf ] 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 ] 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 ] Eugene L. Lawler Fast Approximation Algorithms for Knapsack Problems [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:206-213 [Conf ] 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 ] 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 ] Errol L. Lloyd On Triangulations of a Set of Points in the Plane [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:228-240 [Conf ] 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 ] Dexter Kozen Lower Bounds for Natural Proof Systems [Citation Graph (0, 0)][DBLP ] FOCS, 1977, pp:254-266 [Conf ]