The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1990 (conf/focs/FOCS31a)

  1. Carsten Lund, Lance Fortnow, Howard J. Karloff, Noam Nisan
    Algebraic Methods for Interactive Proof Systems [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:2-10 [Conf]
  2. Adi Shamir
    IP=PSPACE [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:11-15 [Conf]
  3. László Babai, Lance Fortnow, Carsten Lund
    Non-Deterministic Exponential Time Has Two-Prover Interactive Protocols [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:16-25 [Conf]
  4. László Babai, Lance Fortnow
    A Characterization of \sharp P Arithmetic Straight Line Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:26-34 [Conf]
  5. Danny Dolev, Cynthia Dwork, Orli Waarts, Moti Yung
    Perfectly Secure Message Transmission [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:36-45 [Conf]
  6. Noga Alon, Moni Naor
    Coin-Flipping Games Immune against Linear-Sized Coalitions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:46-54 [Conf]
  7. Hagit Attiya, Nancy A. Lynch, Nir Shavit
    Are Wait-Free Algorithms Fast? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:55-64 [Conf]
  8. Baruch Awerbuch, Michael E. Saks
    A Dining Philosophers Algorithm with Polynomial Response Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:65-74 [Conf]
  9. Ding-Zhu Du, Frank K. Hwang
    An Approach for Proving Lower Bounds: Solution of Gilbert-Pollak's Conjecture on Steiner Ratio [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:76-85 [Conf]
  10. Michael Formann, Torben Hagerup, James Haralambides, Michael Kaufmann, Frank Thomson Leighton, Antonios Symvonis, Emo Welzl, Gerhard J. Woeginger
    Drawing Graphs in the Plane with High Resolution [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:86-95 [Conf]
  11. Siu-Wing Cheng, Ravi Janardan
    New Results on Dynamic Planar Point Location [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:96-105 [Conf]
  12. John H. Reif, J. D. Tygar, Akitoshi Yoshida
    The Computability and Complexity of Optical Beam Tracing [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:106-114 [Conf]
  13. William I. Chang, Eugene L. Lawler
    Approximate String Matching in Sublinear Expected Time [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:116-124 [Conf]
  14. Ming Li
    Towards a DNA Sequencing Theory (Learning a String) (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:125-134 [Conf]
  15. Livio Colussi, Zvi Galil, Raffaele Giancarlo
    On the Exact Complexity of String Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:135-144 [Conf]
  16. Moshe Dubiner, Zvi Galil, Edith Magen
    Faster Tree Pattern Matching [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:145-150 [Conf]
  17. C. Andrew Neff
    Specified Precision Polynomial Root Isolation is in NC [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:152-162 [Conf]
  18. S. Rao Kosaraju, Arthur L. Delcher
    A Tree-Partitioning Technique with Applications to Expression Evaluation and Term Matching (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:163-172 [Conf]
  19. Jens Lagergren
    Efficient Parallel Algorithms for Tree-Decomposition and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:173-182 [Conf]
  20. Dana Angluin, Michael Frazier, Leonard Pitt
    Learning Conjunctions of Horn Clauses (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1990, pp:186-192 [Conf]
  21. Sally A. Goldman, Michael J. Kearns, Robert E. Schapire
    Exact Identification of Circuits Using Fixed Points of Amplification Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:193-202 [Conf]
  22. Wolfgang Maass, György Turán
    On the Complexity of Learning from Counterexamples and Membership Queries [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:203-210 [Conf]
  23. Avrim Blum
    Separating Distribution-Free and Mistake-Bound Learning Models over the Boolean Domain [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:211-218 [Conf]
  24. Bernard Chazelle
    Triangulating a Simple Polygon in Linear Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:220-230 [Conf]
  25. Marshall W. Bern, David Eppstein, John R. Gilbert
    Provably Good Mesh Generation [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:231-241 [Conf]
  26. Bernard Chazelle, Herbert Edelsbrunner, Leonidas J. Guibas, Richard Pollack, Raimund Seidel, Micha Sharir, Jack Snoeyink
    Counting and Cutting Cycles of Lines and Rods in Space [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:242-251 [Conf]
  27. Mark de Berg, Mark H. Overmars
    Hidden Surface Removal for Axis-Parallel Polyhedra (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:252-261 [Conf]
  28. Frank Thomson Leighton, C. Greg Plaxton
    A (fairly) Simple Circuit that (usually) Sorts [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:264-274 [Conf]
  29. Shay Assaf, Eli Upfal
    Fault Tolerant Sorting Network [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:275-284 [Conf]
  30. Christos Kaklamanis, Anna R. Karlin, Frank Thomson Leighton, Victor Milenkovic, Prabhakar Raghavan, Satish Rao, Clark D. Thomborson, A. Tsantilas
    Asymptotically Tight Bounds for Computing with Faulty Arrays of Processors (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:285-296 [Conf]
  31. Paul Bay, Gianfranco Bilardi
    Deterministic On-Line Routing on Area-Universal Networks (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:297-306 [Conf]
  32. Uriel Feige, Dror Lapidot, Adi Shamir
    Multiple Non-Interactive Zero Knowledge Proofs Based on a Single Random String (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:308-317 [Conf]
  33. Oded Goldreich, Russell Impagliazzo, Leonid A. Levin, Ramarathnam Venkatesan, David Zuckerman
    Security Preserving Amplification of Hardness [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:318-326 [Conf]
  34. Carl Sturtivant, Zhi-Li Zhang
    Efficiently Inverting Bijections Given by Straight Line Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:327-334 [Conf]
  35. Benny Chor, Mihály Geréb-Graus, Eyal Kushilevitz
    Private Computations Over the Integers (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:335-344 [Conf]
  36. László Lovász, Miklós Simonovits
    The Mixing Rate of Markov Chains, an Isoperimetric Inequality, and Computing the Volume [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:346-354 [Conf]
  37. Xiaotie Deng, Christos H. Papadimitriou
    Exploring an Unknown Graph (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:355-361 [Conf]
  38. Sampath Kannan, Tandy Warnow
    Inferring Evolutionary History from DNA Sequences (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:362-371 [Conf]
  39. Faith E. Fich, J. Ian Munro, Patricio V. Poblete
    Permuting [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:372-379 [Conf]
  40. Michael J. Kearns, Robert E. Schapire
    Efficient Distribution-free Learning of Probabilistic Concepts (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:382-391 [Conf]
  41. David Aldous, Umesh V. Vazirani
    A Markovian Extension of Valiant's Learning Model (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:392-396 [Conf]
  42. Ramamohan Paturi, Michael E. Saks
    On Threshold Circuits for Parity [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:397-404 [Conf]
  43. Mark A. Fulk
    Robust Separations in Inductive Inference [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:405-410 [Conf]
  44. Karl R. Abrahamson
    A Time-Space Tradeoff for Boolean Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:412-419 [Conf]
  45. Paul Beame, Martin Tompa, Peiyuan Yan
    Communication-Space Tradeoffs for Unrestricted Protocols [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:420-428 [Conf]
  46. Paul Beame, Allan Borodin, Prabhakar Raghavan, Walter L. Ruzzo, Martin Tompa
    Time-Space Tradeoffs for Undirected Graph Traversal [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:429-438 [Conf]
  47. Sorin Istrail
    Constructing Generalized Universal Traversing Sequences of Polynomial Size for Graphs with Small Diameter (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:439-448 [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