The SCEAS System
Navigation Menu

Conferences in DBLP

Annual Symposium on Foundations of Computer Science (FOCS) (focs)
1986 (conf/focs/FOCS27)

  1. Zvi Galil, Éva Tardos
    An O(n^2 (m + n log n) log n) Min-Cost Flow Algorithm [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:1-9 [Conf]
  2. Prabhakar Raghavan
    Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs [Citation Graph (1, 0)][DBLP]
    FOCS, 1986, pp:10-18 [Conf]
  3. Richard M. Karp, Michael E. Saks, Avi Wigderson
    On a Search Problem Related to Branch-and-Bound Procedures [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:19-28 [Conf]
  4. Michael E. Saks, Avi Wigderson
    Probabilistic Boolean Decision Trees and the Complexity of Evaluating Game Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:29-38 [Conf]
  5. Nathan Linial, László Lovász, Avi Wigderson
    A Physical Interpretation of Graph Connectivity, and Its Algorithmic Applications [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:39-48 [Conf]
  6. Volker Strassen
    The Asymptotic Spectrum of Tensors and the Exponent of Matrix Multiplication [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:49-54 [Conf]
  7. Alfred V. Aho, David Lee
    Storing a Dynamic Sparse Table [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:55-60 [Conf]
  8. Robert E. Wilber
    Lower Bounds for Accessing Binary Search Trees With Rotations (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:61-70 [Conf]
  9. David Mutchler
    What search algorithm gives optimal average-case performance when search resources are highly limited? [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:71-76 [Conf]
  10. Micha Sharir, Richard Cole, Klara Kedem, Daniel Leven, Richard Pollack, Shmuel Sifrony
    Geometric Applications of Davenport-Schinzel Sequences [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:77-86 [Conf]
  11. Bernard Chazelle
    Lower Bounds on the Complexity of Multidimensional Searching (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    FOCS, 1986, pp:87-96 [Conf]
  12. Ady Wiernik
    Planar Realizations of Nonlinear Davenport-Schinzel Sequences by Segments [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:97-106 [Conf]
  13. Jiawei Hong
    Proving by Example and Gap Theorems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:107-116 [Conf]
  14. Pravin M. Vaidya
    An optimal algorithm for the All-Nearest-Neighbors Problem [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:117-122 [Conf]
  15. W. Harry Plantinga, Charles R. Dyer
    An Algorithm for Constructing the Aspect Graph [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:123-131 [Conf]
  16. B. K. Natarajan
    An Algorithmic Approach to the Automated Design of Parts Orienters [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:132-142 [Conf]
  17. Daniel H. Greene, F. Frances Yao
    Finite-Resolution Computational Geometry [Citation Graph (2, 0)][DBLP]
    FOCS, 1986, pp:143-152 [Conf]
  18. Joel Friedman
    On Newton's Method for Polynomials [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:153-161 [Conf]
  19. Andrew Chi-Chih Yao
    How to Generate and Exchange Secrets (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:162-167 [Conf]
  20. Gilles Brassard, Claude Crépeau, Jean-Marc Robert
    Information Theoretic Reductions among Disclosure Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:168-173 [Conf]
  21. Oded Goldreich, Silvio Micali, Avi Wigderson
    Proofs that Yield Nothing But their Validity and a Methodology of Cryptographic Protocol Design (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:174-187 [Conf]
  22. Gilles Brassard, Claude Crépeau
    Non-Transitive Transfer of Confidence: A Perfect Zero-Knowledge Interactive Protocol for SAT and Beyond [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:188-195 [Conf]
  23. Baruch Awerbuch, Silvio Micali
    Dynamic deadlock resolution protocols (Extended Abstract) [Citation Graph (3, 0)][DBLP]
    FOCS, 1986, pp:196-207 [Conf]
  24. Yoram Moses, Mark R. Tuttle
    Programming Simultaneous Actions Using Common Knowledge: Preliminary Version [Citation Graph (1, 0)][DBLP]
    FOCS, 1986, pp:208-221 [Conf]
  25. Cynthia Dwork, David B. Shmoys, Larry J. Stockmeyer
    Flipping Persuasively in Constant Expected Time (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:222-232 [Conf]
  26. Paul M. B. Vitányi, Baruch Awerbuch
    Atomic Shared Register Access by Asynchronous Hardware (Detailed Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:233-243 [Conf]
  27. Anna R. Karlin, Mark S. Manasse, Larry Rudolph, Daniel Dominic Sleator
    Competitive Snoopy Caching [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:244-254 [Conf]
  28. Yiming Ma, Sandeep Sen, Isaac D. Scherson
    The Distance Bound for Sorting on Mesh-Connected Processor Arrays Is Tight (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:255-263 [Conf]
  29. Quentin F. Stout
    Meshes with Multiple Buses [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:264-273 [Conf]
  30. Sandeep N. Bhatt, Fan R. K. Chung, Frank Thomson Leighton, Arnold L. Rosenberg
    Optimal Simulations of Tree Machines (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:274-282 [Conf]
  31. Bernd Becker, Hans-Ulrich Simon
    How Robust Is the n-Cube? (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:283-291 [Conf]
  32. Eugene M. Luks
    Parallel Algorithms for Permutation Groups and Graph Isomorphism [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:292-302 [Conf]
  33. László Babai
    A Las Vegas-NC Algorithm for isomorphism of graphs with bounded multiplicity of eigenvalues [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:303-312 [Conf]
  34. Max H. Garzon, Yechezkel Zalcstein
    The Complexity of Isomorphism Testing [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:313-321 [Conf]
  35. Sally Floyd, Richard M. Karp
    FFD Bin Packing for Item Sizes with Distributions on [0,1/2] [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:322-330 [Conf]
  36. Martin E. Dyer, Alan M. Frieze
    Fast Solution of Some Random NP-Hard Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:331-336 [Conf]
  37. László Babai, Peter Frankl, Janos Simon
    Complexity classes in communication complexity theory (preliminary version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:337-347 [Conf]
  38. H. Venkateswaran, Martin Tompa
    A New Pebble Game that Characterizes Parallel Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:348-360 [Conf]
  39. Marek Chrobak, Ming Li
    k+1 Heads Are Better than k for PDA's [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:361-367 [Conf]
  40. William Aiello, Shafi Goldwasser, Johan Håstad
    On the Power of Interaction [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:368-379 [Conf]
  41. Stuart A. Kurtz, Stephen R. Mahaney, James S. Royer
    Collapsing Degrees (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:380-389 [Conf]
  42. Judy Goldsmith, Deborah Joseph
    Three Results on the Polynomial Isomorphism of Complete Sets [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:390-397 [Conf]
  43. Joachim von zur Gathen
    Permanent and Determinant [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:398-401 [Conf]
  44. Karl R. Abrahamson
    Time-Space Tradeoffs for Branching Programs Contrasted with those for Straight-Line Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:402-409 [Conf]
  45. Noga Alon, Wolfgang Maass
    Meanders, Ramsey Theory and Lower Bounds for Branching Programs [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:410-417 [Conf]
  46. David Peleg, Eli Upfal
    The Token Distribution Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:418-427 [Conf]
  47. Greg N. Frederickson, Ravi Janardan
    Separator-Based Strategies for Efficient Message Routing (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:428-437 [Conf]
  48. Jeffrey D. Ullman, Allen Van Gelder
    Parallel Complexity of Logical Query Programs [Citation Graph (9, 0)][DBLP]
    FOCS, 1986, pp:438-454 [Conf]
  49. Jik H. Chang, Oscar H. Ibarra, Anastasios Vergis
    On the Power of One-Way Communication [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:455-464 [Conf]
  50. Philip N. Klein, John H. Reif
    An Efficient Parallel Algorithm for Planarity [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:465-477 [Conf]
  51. Richard Cole, Uzi Vishkin
    Approximate and Exact Parallel Scheduling with Applications to List, Tree and Graph Problems [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:478-491 [Conf]
  52. Hillel Gazit
    An Optimal Randomized Parallel Algorithm for Finding Connected Components in a Graph [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:492-501 [Conf]
  53. Noga Alon, Yossi Azar, Uzi Vishkin
    Tight Complexity Bounds for Parallel Comparison Sorting [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:502-510 [Conf]
  54. Richard Cole
    Parallel Merge Sort [Citation Graph (0, 0)][DBLP]
    FOCS, 1986, pp:511-516 [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