The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1978 (conf/focs/FOCS19)

  1. Jean Françon, G. Viennot, Jean Vuillemin
    Description and Analysis of an Efficient Priority Queue Representation [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:1-7 [Conf]
  2. Leonidas J. Guibas, Robert Sedgewick
    A Dichromatic Framework for Balanced Trees [Citation Graph (23, 0)][DBLP]
    FOCS, 1978, pp:8-21 [Conf]
  3. Andrew Chi-Chih Yao
    Should Tables Be Sorted? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:22-27 [Conf]
  4. George S. Lueker
    A Data Structure for Orthogonal Range Queries [Citation Graph (1, 0)][DBLP]
    FOCS, 1978, pp:28-34 [Conf]
  5. Harry R. Lewis
    Complexity of Solvable Cases of the Decision Problem for the Predicate Calculus [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:35-47 [Conf]
  6. David Lichtenstein, Michael Sipser
    GO Is PSPACE Hard [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:48-54 [Conf]
  7. Aviezri S. Fraenkel, M. R. Garey, David S. Johnson, T. Schaefer, Yaacov Yesha
    The Complexity of Checkers on an N * N Board - Preliminary Report [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:55-64 [Conf]
  8. Juris Hartmanis, Neil Immerman, Stephen R. Mahaney
    One-Way Log-Tape Reductions [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:65-72 [Conf]
  9. Michael Sipser
    Halting Space-Bounded Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:73-74 [Conf]
  10. Leonard M. Adleman
    Two Theorems on Random Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:75-83 [Conf]
  11. Rüdiger Reischuk
    Improved Bounds on the Problem of Time-Space Trade-Off in the Pebble Game (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:84-91 [Conf]
  12. Richard E. Ladner, Richard J. Lipton, Larry J. Stockmeyer
    Alternating Pushdown Automata (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:92-106 [Conf]
  13. Janos Simon, John Gill, James Hunt
    On Tape-Bounded Probabilistic Turing Machine Transducers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:107-112 [Conf]
  14. Wolfgang J. Paul, Ernst J. Prauß, Rüdiger Reischuk
    On Alternation (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:113-122 [Conf]
  15. Joost Engelfriet, Grzegorz Rozenberg
    Equality Languages, Fixed Point Languages and Representations of Recursively Enumerable Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:123-126 [Conf]
  16. Ashok K. Chandra
    Computable Nondeterministic Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:127-131 [Conf]
  17. Manuel Blum, Dexter Kozen
    On the Power of the Compass (or, Why Mazes Are Easier to Search than Graphs) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:132-142 [Conf]
  18. Imre Simon
    Limited Subsets of a Free Monoid [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:143-150 [Conf]
  19. Harold Abelson
    Lower Bounds on Information Transfer in Distributed Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:151-158 [Conf]
  20. Jean-Paul Van de Wiele
    An Optimal Lower Bound on the Number of Total Operations to Compute 0-1 Polynomials over the Field of Complex Numbers [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:159-165 [Conf]
  21. Victor Y. Pan
    Strassen's Algorithm Is not Optimal: Trililnear Technique of Aggregating, Uniting and Canceling for Constructing Fast Algorithms for Matrix Operations [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:166-176 [Conf]
  22. Rohit Parikh
    A Decidability Result for a Second Order Process Logic [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:177-183 [Conf]
  23. Lawrence Flon, Norihisa Suzuki
    Consistent and Complete Proof Rules for the Total Correctness of Parallel Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:184-192 [Conf]
  24. Richard J. Lipton
    Model Theoretic Aspects of Computational Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:193-200 [Conf]
  25. Bruno Courcelle
    On Recursive Equations Having a Unique Solution [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:201-213 [Conf]
  26. Daniel J. Lehmann
    On the Algebra of Order (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:214-220 [Conf]
  27. Akira Kanda
    Data Types as Initial Algebras: A unification of Scottery and ADJery (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:221-230 [Conf]
  28. Zvi Galil
    A New Algorithm for the Maximal Flow Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:231-245 [Conf]
  29. Barbara Simons
    A Fast Algorithm for Single Processor Scheduling [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:246-252 [Conf]
  30. J. Ian Munro, Mike Paterson
    Selection and Sorting with Limited Storage [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:253-258 [Conf]
  31. C. Christen
    Improving the Bounds on Optimal Merging [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:259-266 [Conf]
  32. Chee-Keng Yap
    On Lifted Problems (Preliminary Reports) [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:267-279 [Conf]
  33. Andrew Chi-Chih Yao, F. Frances Yao
    On the Average-case Complexity of Selecting k-th Best [Citation Graph (0, 0)][DBLP]
    FOCS, 1978, pp:280-289 [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