The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1979 (conf/focs/FOCS20)

  1. Yechiam Yemini
    Some Theoretical Aspects of Position-Location Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:1-8 [Conf]
  2. David P. Dobkin, Lawrence Snyder
    On a General Method for Maximizing and Minimizing among Certain Geometric Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:9-17 [Conf]
  3. David G. Kirkpatrick
    Efficient Computation of Continuous Skeletons [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:18-27 [Conf]
  4. Victor Y. Pan
    Field Extension and Triangular Aggregating, Uniting and Canceling for the Acceleration of Matrix Multiplications [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:28-38 [Conf]
  5. László Babai, Ludek Kucera
    Canonical Labelling of Graphs in Linear Average Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:39-46 [Conf]
  6. J. C. Lagarias
    Succinct Certificates for the Solvability of Binary Quadratic Diophantine Equations [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:47-54 [Conf]
  7. Leonard M. Adleman
    A Subexponential Algorithm for the Discrete Logarithm Problem with Applications to Cryptography (Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:55-60 [Conf]
  8. Nicholas Pippenger
    Computational Complexity in Algebraic Function Fields (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:61-65 [Conf]
  9. Sheila A. Greibach
    Formal Languages: Origins and Directions [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:66-90 [Conf]
  10. Meera Blattner
    The Decidability of the Equivalence of Context-Free Grammar Forms [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:91-96 [Conf]
  11. Hermann A. Maurer, Maurice Nivat
    Bijective A-Transducers [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:97-100 [Conf]
  12. Dexter Kozen
    Semantics of Probabilistic Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:101-114 [Conf]
  13. Vaughan R. Pratt
    Models of Program Logics [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:115-122 [Conf]
  14. Nachum Dershowitz
    Orderings for Term-Rewriting Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:123-131 [Conf]
  15. Karl J. Lieberherr, Ernst Specker
    Complexity of Partial Satisfaction [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:132-139 [Conf]
  16. Franco P. Preparata, Jean Vuillemin
    The Cube-Connected-Cycles: A Versatile Network for Parallel Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:140-147 [Conf]
  17. James B. Saxe, Jon Louis Bentley
    Transforming Static Data Structures to Dynamic Structures (Abridged Version) [Citation Graph (1, 0)][DBLP]
    FOCS, 1979, pp:148-168 [Conf]
  18. Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda
    Toward Self-Organizing Linear Search (Preliminary Draught) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:169-174 [Conf]
  19. Mark N. Wegman, Larry Carter
    New Classes and Applications of Hash Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:175-182 [Conf]
  20. Philippe Flajolet, Jean Françon, Jean Vuillemin
    Towards Analysing Sequences of Operations for Dynamic Data Structures (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:183-195 [Conf]
  21. Harold N. Gabow, Robert Endre Tarjan
    Efficient Algorithms for Simple Matroid Intersection Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:196-204 [Conf]
  22. Bengt Aspvall, Yossi Shiloach
    A Polynomial Time Algorithm for Solving Systems of Linear Inequalities with Two Variables per Inequality [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:205-217 [Conf]
  23. Romas Aleliunas, Richard M. Karp, Richard J. Lipton, László Lovász, Charles Rackoff
    Random Walks, Universal Traversal Sequences, and the Complexity of Maze Problems [Citation Graph (1, 0)][DBLP]
    FOCS, 1979, pp:218-223 [Conf]
  24. Juris Hartmanis
    Observations about the Development of Theoretical Computer Science [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:224-233 [Conf]
  25. Michael J. Fischer, Nancy A. Lynch, James E. Burns, Allan Borodin
    Resource Allocation with Immunity to Limited Process Failure (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:234-254 [Conf]
  26. Edmund M. Clarke, Lishing Liu
    Approximate Algorithms for Optimization of Busy Waiting in Parallel Programs (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:255-266 [Conf]
  27. Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
    Modeling Communications Protocols by Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:267-273 [Conf]
  28. Zvi M. Kedem, Abraham Silberschatz
    Controlling Concurrency Using Locking Protocols (Preliminary Report) [Citation Graph (10, 0)][DBLP]
    FOCS, 1979, pp:274-285 [Conf]
  29. Mihalis Yannakakis, Christos H. Papadimitriou, H. T. Kung
    Locking Policies: Safety and Freedom from Deadlock [Citation Graph (19, 0)][DBLP]
    FOCS, 1979, pp:286-297 [Conf]
  30. Wolfgang J. Paul, Rüdiger Reischuk
    On Time versus Space II [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:298-306 [Conf]
  31. Nicholas Pippenger
    On Simultaneous Resource Bounds (Preliminary Version) [Citation Graph (4, 0)][DBLP]
    FOCS, 1979, pp:307-311 [Conf]
  32. Walter L. Ruzzo
    On Uniform Circuit Complexity (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:312-318 [Conf]
  33. Allan Borodin, Michael J. Fischer, David G. Kirkpatrick, Nancy A. Lynch, Martin Tompa
    A Time-Space Tradeoff for Sorting on Non-Oblivious Machines [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:319-327 [Conf]
  34. Richard Schroeppel, Adi Shamir
    A T S^2 = O(2^n) Time/Space Tradeoff for Certain NP-Complete Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:328-336 [Conf]
  35. Neil Immerman
    Length of Predicate Calculus Formulas as a New Complexity Measure [Citation Graph (1, 0)][DBLP]
    FOCS, 1979, pp:337-347 [Conf]
  36. Gary L. Peterson, John H. Reif
    Multiple-Person Alternation [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:348-363 [Conf]
  37. Ofer Gabber, Zvi Galil
    Explicit Constructions of Linear Size Superconcentrators [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:364-370 [Conf]
  38. Stephen Cole Kleene
    Origins of Recursive Function Theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:371-382 [Conf]
  39. Gilles Brassard
    Relativized Cryptography [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:383-391 [Conf]
  40. Theodore P. Baker, Juris Hartmanis
    Succinctness, Verifiability and Determinism in Representations of Polynomial-Time Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:392-396 [Conf]
  41. Leonard M. Adleman, Kenneth L. Manders
    Reductions that Lie [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:397-410 [Conf]
  42. Janos Simon
    Division Is Good [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:411-420 [Conf]
  43. John H. Reif
    Complexity of the Mover's Problem and Generalizations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1979, pp:421-427 [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