The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1988 (conf/focs/FOCS29)

  1. Noam Nisan, Avi Wigderson
    Hardness vs. Randomness (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:2-11 [Conf]
  2. Oded Goldreich, Hugo Krawczyk, Michael Luby
    On the Existence of Pseudorandom Generators (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:12-24 [Conf]
  3. Joe Kilian
    Zero-knowledge with Log-Space Verifiers [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:25-35 [Conf]
  4. Leonid A. Levin
    Homogeneous Measures and Polynomial Time Invariants [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:36-41 [Conf]
  5. Claude Crépeau, Joe Kilian
    Achieving Oblivious Transfer Using Weakened Security Assumptions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:42-52 [Conf]
  6. Yishay Mansour, Baruch Schieber, Prasoon Tiwari
    Lower Bounds for Integer Greatest Common Divisor Computations (Extended Summary) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:54-63 [Conf]
  7. Nader H. Bshouty
    A Lower Bound for Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:64-67 [Conf]
  8. Jeff Kahn, Gil Kalai, Nathan Linial
    The Influence of Variables on Boolean Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:68-80 [Conf]
  9. László Lovász, Michael E. Saks
    Lattices, Möbius Functions and Communication Complexity [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:81-90 [Conf]
  10. Andrew Chi-Chih Yao
    Near-Optimal Time-Space Tradeoff for Element Distinctness [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:91-97 [Conf]
  11. David Haussler, Nick Littlestone, Manfred K. Warmuth
    Predicting {0,1}-Functions on Randomly Drawn Points (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:100-109 [Conf]
  12. Alfredo De Santis, George Markowsky, Mark N. Wegman
    Learning Probabilistic Prediction Functions (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:110-119 [Conf]
  13. Nathan Linial, Yishay Mansour, Ronald L. Rivest
    Results on learnability and the Vapnik-Chervonenkis dimension (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:120-129 [Conf]
  14. William I. Gasarch, Carl H. Smith
    Learning via Queries [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:130-137 [Conf]
  15. János Komlós, Ramamohan Paturi
    Effect of Connectivity in Associative Memory Models (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:138-147 [Conf]
  16. Philip N. Klein
    Efficient Parallel Algorithms for Chordal Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:150-161 [Conf]
  17. Michael Luby
    Removing Randomness in Parallel Computation Without a Processor Penalty [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:162-173 [Conf]
  18. Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya
    Sublinear-Time Parallel Algorithms for Matching and Related Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:174-185 [Conf]
  19. Elias Dahlhaus, Péter Hajnal, Marek Karpinski
    Optimal Parallel Algorithm for the Hamiltonian Cycle Problem on Dense Graphs [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:186-193 [Conf]
  20. Noga Alon, Yossi Azar
    Parallel Comparison Algorithms for Approximation Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:194-203 [Conf]
  21. Baruch Awerbuch, Michael Sipser
    Dynamic Networks Are as Fast as Static Networks (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:206-220 [Conf]
  22. Richard A. Koch
    Increasing the Size of a Network by a Constant Factor Can Increase Performance by More Than a Constant Factor [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:221-230 [Conf]
  23. Baruch Awerbuch
    On the Effects of Feedback in Dynamic Network Protocols (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:231-245 [Conf]
  24. Yoram Moses, Orli Waarts
    Coordinated Traversal: (t + 1)-Round Byzantine Agreement in Polynomial Time [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:246-255 [Conf]
  25. Frank Thomson Leighton, Bruce M. Maggs, Satish Rao
    Universal Packet Routing Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:256-269 [Conf]
  26. László Babai, Eugene M. Luks, Ákos Seress
    Fast Management of Permutation Groups [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:272-282 [Conf]
  27. Victor Shoup
    New Algorithms for Finding Irreducible Polynomials over Finite Fields [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:283-290 [Conf]
  28. James Renegar
    A Faster PSPACE Algorithm for Deciding the Existential Theory of the Reals [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:291-295 [Conf]
  29. Erich Kaltofen, Barry M. Trager
    Computing with Polynomials Given By Black Boxes for Their Evaluation: Greatest Common Divisors, Factorization, Separation of Numerators and Denominators [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:296-305 [Conf]
  30. John F. Canny, Bruce Randall Donald, John H. Reif, Patrick G. Xavier
    On the Complexity of Kinodynamic Planning [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:306-316 [Conf]
  31. Shmuel Safra
    On the Complexity of omega-Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:319-327 [Conf]
  32. E. Allen Emerson, Charanjit S. Jutla
    The Complexity of Tree Automata and Logics of Programs (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    FOCS, 1988, pp:328-337 [Conf]
  33. Costas Courcoubetis, Mihalis Yannakakis
    Verifying Temporal Properties of Finite-State Probabilistic Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:338-345 [Conf]
  34. Miklós Ajtai
    The Complexity of the Pigeonhole Principle [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:346-355 [Conf]
  35. Miklós Ajtai, Ronald Fagin
    Reachability Is Harder for Directed than for Undirected Finite Graphs (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:358-367 [Conf]
  36. C.-H. Luke Ong
    Fully Abstract Models of the Lazy Lambda Calculus [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:368-376 [Conf]
  37. David A. McAllester, Prakash Panangaden, Vasant Shanbhogue
    Nonexpressibility of Fairness and Signaling [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:377-386 [Conf]
  38. Lenore Blum, Mike Shub, Steve Smale
    On a Theory of Computation over the Real Numbers; NP Completeness, Recursive Functions and Universal Machines (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:387-397 [Conf]
  39. Rajeev Motwani, Arvind Raghunathan, Huzur Saran
    Constructive Results from Graph Minors: Linkless Embeddings [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:398-409 [Conf]
  40. Paul Dagum, Michael Luby, Milena Mihail, Umesh V. Vazirani
    Polytopes, Permanents and Graphs with Large Factors [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:412-421 [Conf]
  41. Frank Thomson Leighton, Satish Rao
    An Approximate Max-Flow Min-Cut Theorem for Uniform Multicommodity Flow Problems with Applications to Approximation Algorithms [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:422-431 [Conf]
  42. Andrew V. Goldberg, Serge A. Plotkin, Éva Tardos
    Combinatorial Algorithms for the Generalized Circulation Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:432-443 [Conf]
  43. Olivier Goldschmidt, Dorit S. Hochbaum
    Polynomial Algorithm for the k-Cut Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:444-451 [Conf]
  44. Kenneth L. Clarkson
    A Las Vegas Algorithm for Linear Programming When the Dimension Is Small [Citation Graph (1, 0)][DBLP]
    FOCS, 1988, pp:452-456 [Conf]
  45. Seth M. Malitz
    Genus g Graphs have Pagenumber O(sqrt(g)) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:458-468 [Conf]
  46. Sandeep N. Bhatt, Jin-yi Cai
    Take a Walk, Grow a Tree (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:469-478 [Conf]
  47. Andrei Z. Broder, Anna R. Karlin
    Bounds on the Cover Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:479-487 [Conf]
  48. David Eppstein, Zvi Galil, Raffaele Giancarlo
    Speeding up Dynamic Programming [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:488-496 [Conf]
  49. Alok Aggarwal, James K. Park
    Notes on Searching in Multidimensional Monotone Arrays (Preliminary Version) [Citation Graph (1, 0)][DBLP]
    FOCS, 1988, pp:497-512 [Conf]
  50. Michael L. Fredman, Deborah L. Goldsmith
    Three Stacks [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:514-523 [Conf]
  51. Martin Dietzfelbinger, Anna R. Karlin, Kurt Mehlhorn, Friedhelm Meyer auf der Heide, Hans Rohnert, Robert Endre Tarjan
    Dynamic Perfect Hashing: Upper and Lower Bounds [Citation Graph (4, 0)][DBLP]
    FOCS, 1988, pp:524-531 [Conf]
  52. Amir M. Ben-Amram, Zvi Galil
    On Pointers versus Addresses (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:532-538 [Conf]
  53. Bernard Chazelle, Joel Friedman
    A Deterministic View of Random Sampling and its Use in Geometry [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:539-549 [Conf]
  54. Mark H. Overmars, Chee-Keng Yap
    New upper bounds in Klee's measure problem (extended abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:550-556 [Conf]
  55. Franco P. Preparata, Roberto Tamassia
    Fully Dynamic Techniques for Point Location and Transitive Closure in Planar Structures (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:558-567 [Conf]
  56. Kenneth L. Clarkson, Herbert Edelsbrunner, Leonidas J. Guibas, Micha Sharir, Emo Welzl
    Combinatorial Complexity Bounds for Arrangements of Curves and Surfaces [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:568-579 [Conf]
  57. Ketan Mulmuley
    A Fast Planar Partition Algorithm, I (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:580-589 [Conf]
  58. Bernard Chazelle, Herbert Edelsbrunner
    An Optimal Algorithm for Intersecting Line Segments in the Plane [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:590-600 [Conf]
  59. Joseph C. Culberson, Robert A. Reckhow
    Covering Polygons Is Hard (Preliminary Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1988, pp:601-611 [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