The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1975 (conf/focs/FOCS16)

  1. Shmuel Winograd
    The Effect of the Field of Constants on the Number of Multiplication [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:1-2 [Conf]
  2. Robert W. Floyd
    The Exact Time Required to Perform Generalized Addition [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:3-5 [Conf]
  3. Richard J. Lipton
    Polynomials with 0-1 Coefficients that Are Hard to Evaluate [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:6-10 [Conf]
  4. L. Csanky
    Fast Parallel Matrix Inversion Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:11-12 [Conf]
  5. Eshrat Arjomandi, Derek G. Corneil
    Parallel Computations in Graph Theory [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:13-18 [Conf]
  6. Richard J. Lipton, Raymond E. Miller, Lawrence Snyder
    Synchronization and Computing Capabilities of Linear Asynchronous Structures [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:19-28 [Conf]
  7. J. W. de Bakker
    Flow of Control in the Proof Theory of Structured Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:29-33 [Conf]
  8. George Markowsky, Barry K. Rosen
    Bases for Chain-Complete Posets [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:34-47 [Conf]
  9. Peter J. Downey, Ravi Sethi
    Correct Computation Rules for Recursive Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:48-56 [Conf]
  10. John E. Hopcroft, Wolfgang J. Paul, Leslie G. Valiant
    On Time versus Space and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:57-64 [Conf]
  11. Juris Hartmanis, Leonard Berman
    A Note on Tape Bounds for SLA Language Processing [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:65-70 [Conf]
  12. Ira Pohl
    Minimean Optimality in Sorting Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:71-74 [Conf]
  13. Peter van Emde Boas
    Preserving Order in a Forest in less than Logarithmic Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:75-84 [Conf]
  14. Andrew Chi-Chih Yao
    On the Complexity of Comparison Problems using Linear Functions (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:85-89 [Conf]
  15. Thomas G. Szymanski, Jeffrey D. Ullman
    Evaluating Relational Expressions with Dense and Sparse Arguments [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:90-97 [Conf]
  16. Michael L. Fredman
    On the Decision Tree Complexity of the Shortest Path Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:98-99 [Conf]
  17. Shimon Even, Oded Kariv
    An O(n^2.5) Algorithm for Maximum Matching in General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:100-112 [Conf]
  18. Nicholas Pippenger
    Information Theory and the Complexity of Switching Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:113-118 [Conf]
  19. Vaughan R. Pratt
    The Effect of Basis on Size of Boolean Expressions [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:119-121 [Conf]
  20. Matthew M. Geller, Harry B. Hunt III, Thomas G. Szymanski, Jeffrey D. Ullman
    Economy of Descriptions by Parsers, DPDA's, and PDA's [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:122-127 [Conf]
  21. Catriel Beeri
    An Improvement of Valiant's Decision Procedure for Equivalence of Deterministic Finite-Turn Pushdown Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:128-134 [Conf]
  22. William C. Rounds
    A Grammatical Characterization of Exponential-Time Languages [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:135-143 [Conf]
  23. Harry B. Hunt III, J. L. Rangel
    Decidability of Equivalence, Containment, Intersection, and Separability of Context-Free Languages (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:144-150 [Conf]
  24. Michael Ian Shamos, Dan Hoey
    Closest-Point Problems [Citation Graph (2, 0)][DBLP]
    FOCS, 1975, pp:151-162 [Conf]
  25. Daniel J. Kleitman, Michael M. Krieger
    An Optimal Bound for Two Dimensional Bin Packing [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:163-168 [Conf]
  26. Leonard M. Adleman, Kenneth L. Manders
    Computational Complexity of Decision Procedures for Polynomials (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:169-177 [Conf]
  27. M. R. Garey, David S. Johnson, H. C. So
    An Application of Graph Coloring to Printed Circuit Testing (Working Paper) [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:178-183 [Conf]
  28. Shimon Even, Alon Itai, Adi Shamir
    On the Complexity of Timetable and Multi-Commodity Flow Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1975, pp:184-193 [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