The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1982 (conf/focs/FOCS23)

  1. Ashok K. Chandra, Larry J. Stockmeyer, Uzi Vishkin
    A Complexity Theory for Unbounded Fan-In Parallelism [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:1-13 [Conf]
  2. Christos H. Papadimitriou
    On the Complexity of Unique Solutions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:14-20 [Conf]
  3. Thiet-Dung Huynh
    Deciding the Inequivalence of Context-Free Grammars with 1-Letter Terminal Alphabet is Sigma_2^P-Complete [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:21-31 [Conf]
  4. J. C. Lagarias
    The Computational Complexity of Simultaneous Diophantine Approximation Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:32-39 [Conf]
  5. Umesh V. Vazirani, Vijay V. Vazirani
    A Natural Encoding Scheme Proved Probabilistic Polynomial Complete [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:40-44 [Conf]
  6. Stefan Reisch, Georg Schnitger
    Three Applications of Kolmogorov-Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:45-52 [Conf]
  7. Wolfgang J. Paul
    On-Line Simulation of k+1 Tapes by k Tapes Requires Nonlinear Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:53-56 [Conf]
  8. Erich Kaltofen
    A Polynomial-Time Reduction from Bivariate to Univariate Integral Polynomial Factorization [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:57-64 [Conf]
  9. Allan Borodin, Joachim von zur Gathen, John E. Hopcroft
    Fast Parallel Matrix and GCD Computations [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:65-71 [Conf]
  10. Carl Sturtivant
    Generalised Symmetries of Polynomials in Algebraic Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:72-79 [Conf]
  11. Andrew Chi-Chih Yao
    Theory and Applications of Trapdoor Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:80-91 [Conf]
  12. Benny Chor, Charles E. Leiserson, Ronald L. Rivest
    An Application of Number Theory to the Organization of Raster-Graphics Memory (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:92-99 [Conf]
  13. Leonard M. Adleman, Robert McDonnell
    An Application of Higher Reciprocity to Computational Number Theory (Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:100-106 [Conf]
  14. Narendra Karmarkar
    Probabilistic Analysis of Some Bin-Packing Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:107-111 [Conf]
  15. Manuel Blum, Silvio Micali
    How to Generate Cryptographically Strong Sequences of Pseudo Random Bits [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:112-117 [Conf]
  16. Zvi Galil, Christoph M. Hoffmann, Eugene M. Luks, Claus-Peter Schnorr, Andreas Weber
    An O(n^3 log n) Deterministic and an O(n^3) Probabilistic Isomorphism Test for Trivalent Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:118-125 [Conf]
  17. Mark Jerrum
    A Compact Representation for Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:126-133 [Conf]
  18. Shafi Goldwasser, Silvio Micali, Po Tong
    Why and How to Establish a Private Code on a Public Network (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:134-144 [Conf]
  19. Adi Shamir
    A Polynomial Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:145-152 [Conf]
  20. Joan B. Plumstead
    Inferring a Sequence Generated by a Linear Congruence [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:153-159 [Conf]
  21. Andrew Chi-Chih Yao
    Protocols for Secure Computations (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:160-164 [Conf]
  22. Michael L. Fredman, János Komlós, Endre Szemerédi
    Storing a Sparse Table with O(1) Worst Case Access Time [Citation Graph (2, 0)][DBLP]
    FOCS, 1982, pp:165-169 [Conf]
  23. Kurt Mehlhorn
    On the Program Size of Perfect and Universal Hash Functions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:170-175 [Conf]
  24. Moshe Y. Vardi
    On Decomposition of Relational Databases [Citation Graph (8, 0)][DBLP]
    FOCS, 1982, pp:176-185 [Conf]
  25. Colm Ó'Dúnlaing, Chee-Keng Yap
    Generic Transformation of Data Structures [Citation Graph (2, 0)][DBLP]
    FOCS, 1982, pp:186-195 [Conf]
  26. Danny Dolev, Rüdiger Reischuk, H. Raymond Strong
    `Eventual' Is Earlier than `Immediate' [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:196-203 [Conf]
  27. Joseph Y. Halpern
    Deterministic Process Logic Is Elementary [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:204-216 [Conf]
  28. Jean-Pierre Queille, Joseph Sifakis
    A Temporal Logic to Deal with Fairness in Transition Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:217-225 [Conf]
  29. Kazuo Iwama
    On Equations Including String Variables [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:226-235 [Conf]
  30. Joffroy Beauquier, Michel Latteux
    Substitution of Bounded Rational Cone [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:236-243 [Conf]
  31. Donald B. Johnson, Shankar M. Venkatesan
    Parallel Algorithms for Minimum Cuts and Maximum Flows in Planar Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:244-254 [Conf]
  32. Zvi Galil, Silvio Micali, Harold N. Gabow
    Priority Queues with Variable Priority and an O(EV log V) Algorithm for Finding a Maximal Weighted Matching in General Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:255-261 [Conf]
  33. Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
    Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:262-271 [Conf]
  34. Quentin F. Stout
    Using Clerks in Parallel Processing [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:272-279 [Conf]
  35. John E. Hopcroft, Deborah Joseph, Sue Whitesides
    On the Movement of Robot Arms in 2-Dimensional Bounded Regions [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:280-289 [Conf]
  36. John H. Reif
    Parallel Time O(log N) Acceptance of Deterministic CFLs [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:290-296 [Conf]
  37. Frank Thomson Leighton, Charles E. Leiserson
    Wafer-Scale Integration of Systolic Arrays (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:297-311 [Conf]
  38. Narendra Karmarkar, Richard M. Karp
    An Efficient Approximation Scheme for the One-Dimensional Bin-Packing Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:312-320 [Conf]
  39. Silvio Ursic
    The Ellipsoid Algorithm for Linear Inequalities in Exact Arithmetic [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:321-326 [Conf]
  40. Boris Yamnitsky, Leonid A. Levin
    An Old Linear Programming Algorithm Runs in Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:327-328 [Conf]
  41. Nimrod Megiddo
    Linear-Time Algorithms for Linear Programming in R^3 and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:329-338 [Conf]
  42. Bernard Chazelle
    A Theorem on Polygon Cutting with Applications [Citation Graph (1, 0)][DBLP]
    FOCS, 1982, pp:339-349 [Conf]
  43. Franco P. Preparata, Witold Lipski Jr.
    Three Layers Are Enough [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:350-357 [Conf]
  44. Thomas Lengauer
    The Complexity of Compacting Hierarchically Specified Layouts of Integrated Circuits (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:358-368 [Conf]
  45. Vijaya Ramachandran
    On Driving Many Long Lines in a VLSI Layout [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:369-378 [Conf]
  46. Zvi M. Kedem
    Optimal Allocation of Computational Resources in VLSI [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:379-385 [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