The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
1983 (conf/stoc/STOC15)

  1. Miklós Ajtai, János Komlós, Endre Szemerédi
    An O(n log n) Sorting Network [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:1-9 [Conf]
  2. John H. Reif, Leslie G. Valiant
    A Logarithmic Time Sort for Linear Size Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:10-16 [Conf]
  3. Joachim von zur Gathen
    Parallel algorithms for algebraic problems [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:17-23 [Conf]
  4. Quentin F. Stout
    Topological Matching [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:24-31 [Conf]
  5. Péter Gács
    Reliable Computation with Cellular Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:32-41 [Conf]
  6. Danny Dolev, Cynthia Dwork, Nicholas Pippenger, Avi Wigderson
    Superconcentrators, Generalizers and Generalized Connectors with Limited Depth (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:42-51 [Conf]
  7. Ashok K. Chandra, Steven Fortune, Richard J. Lipton
    Unbounded Fan-in Circuits and Associative Functions [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:52-60 [Conf]
  8. Michael Sipser
    Borel Sets and Circuit Complexity [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:61-69 [Conf]
  9. Friedhelm Meyer auf der Heide
    A Polynomial Linear Search Algorithm for the N-Dimensional Knapsack Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:70-79 [Conf]
  10. Michael Ben-Or
    Lower Bounds for Algebraic Computation Trees (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:80-86 [Conf]
  11. Allan Borodin, Danny Dolev, Faith E. Fich, Wolfgang J. Paul
    Bounds for Width Two Branching Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:87-93 [Conf]
  12. Ashok K. Chandra, Merrick L. Furst, Richard J. Lipton
    Multi-Party Protocols [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:94-99 [Conf]
  13. Faith E. Fich
    New Bounds for Parallel Prefix Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:100-109 [Conf]
  14. Leslie G. Valiant
    Exponential Lower Bounds for Restricted Monotone Circuits [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:110-117 [Conf]
  15. Larry J. Stockmeyer
    The Complexity of Approximate Counting (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:118-126 [Conf]
  16. Pavol Duris, Zvi Galil, Wolfgang J. Paul, Rüdiger Reischuk
    Two Nonlinear Lower Bounds [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:127-132 [Conf]
  17. Alfred V. Aho, Jeffrey D. Ullman, Mihalis Yannakakis
    On Notions of Information Transfer in VLSI Circuits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:133-139 [Conf]
  18. Susan Landau, Gary L. Miller
    Solvability by Radicals is in Polynomial Time [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:140-151 [Conf]
  19. James R. Driscoll, Merrick L. Furst
    On the Diameter of Permutation Groups [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:152-160 [Conf]
  20. Martin Fürer, Walter Schnyder, Ernst Specker
    Normal Forms for Trivalent Graphs and Graphs of Bounded Valence [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:161-170 [Conf]
  21. László Babai, Eugene M. Luks
    Canonical Labeling of Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:171-183 [Conf]
  22. Eric Bach
    How to Generate Random Integers with Known Factorization [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:184-188 [Conf]
  23. Arjen K. Lenstra
    Factoring Multivariate Polynomials over Finite Fields (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:189-192 [Conf]
  24. Ravi Kannan
    Improved Algorithms for Integer Programming and Related Lattice Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:193-206 [Conf]
  25. Colm Ó'Dúnlaing, Micha Sharir, Chee-Keng Yap
    Retraction: A New Approach to Motion-Planning (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:207-220 [Conf]
  26. Leonidas J. Guibas, Jorge Stolfi
    Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:221-234 [Conf]
  27. Daniel Dominic Sleator, Robert Endre Tarjan
    Self-Adjusting Binary Trees [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:235-245 [Conf]
  28. Harold N. Gabow, Robert Endre Tarjan
    A Linear-Time Algorithm for a Special Case of Disjoint Set Union [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:246-251 [Conf]
  29. Greg N. Frederickson
    Data Structures for On-Line Updating of Minimum Spanning Trees (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:252-257 [Conf]
  30. F. Frances Yao
    A 3-Space Partition and Its Applications (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:258-263 [Conf]
  31. Paris C. Kanellakis, Stavros S. Cosmadakis, Moshe Y. Vardi
    Unary Inclusion Dependencies have Polynomial Time Inference Problems (Extended Abstract) [Citation Graph (11, 0)][DBLP]
    STOC, 1983, pp:264-277 [Conf]
  32. Amir Pnueli
    On the Extremely Fair Treatment of Probabilistic Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:278-290 [Conf]
  33. Dexter Kozen
    A Probabilistic PDL [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:291-297 [Conf]
  34. Yishai A. Feldman
    A Decidable Propositional Probabilistic Dynamic Logic [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:298-309 [Conf]
  35. Joseph Y. Halpern, Michael O. Rabin
    A Logic to Reason about Likelihood [Citation Graph (1, 0)][DBLP]
    STOC, 1983, pp:310-319 [Conf]
  36. Ernst-Rüdiger Olderog
    A Characterization of Hoare's Logic for Programs with Pascal-like Procedures [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:320-329 [Conf]
  37. Michael Sipser
    A Complexity Theoretic Approach to Randomness [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:330-335 [Conf]
  38. Patrick W. Dymond, Martin Tompa
    Speedups of Deterministic Machines by Synchronous Parallel Machines [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:336-343 [Conf]
  39. Ravi Kannan
    Alternation and the Power of Nondeterminism [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:344-346 [Conf]
  40. Neil Immerman
    Languages Which Capture Complexity Classes (Preliminary Report) [Citation Graph (3, 0)][DBLP]
    STOC, 1983, pp:347-354 [Conf]
  41. Dale Myers
    The Random Access Hierarchy (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:355-364 [Conf]
  42. Joost Engelfriet
    Iterated Pushdown Automata and Complexity Classes [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:365-373 [Conf]
  43. Kazuo Iwama
    Unique Decomposability of Shuffled Strings: A Formal Treatment of Asynchronous Time-Multiplexed Communication [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:374-381 [Conf]
  44. Juris Hartmanis, Vivian Sewelson, Neil Immerman
    Sparse Sets in NP-P: EXPTIME versus NEXPTIME [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:382-391 [Conf]
  45. Paul Young
    Some Structural Properties of Polynomial Reducibilities and Sets in NP [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:392-401 [Conf]
  46. Leonard M. Adleman
    On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:402-412 [Conf]
  47. Douglas L. Long, Avi Wigderson
    How Discreet is the Discrete Log? [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:413-420 [Conf]
  48. Michael Ben-Or, Benny Chor, Adi Shamir
    On the Cryptographic Security of Single RSA Bits [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:421-430 [Conf]
  49. Shafi Goldwasser, Silvio Micali, Andrew Chi-Chih Yao
    Strong Signature Schemes [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:431-439 [Conf]
  50. Manuel Blum
    How to Exchange (Secret) Keys (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:440-447 [Conf]
  51. Harold N. Gabow
    An Efficient Reduction Technique for Degree-Constrained Subgraph and Bidirected Network Flow Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:448-456 [Conf]
  52. Jeremy Spinrad
    Transitive Orientation in O(n²) Time [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:457-466 [Conf]
  53. Jonathan S. Turner
    Probabilistic Analysis of Bandwidth Minimization Algorithms [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:467-476 [Conf]
  54. Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton
    An Approximation Algorithm for Manhattan Routing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1983, pp:477-486 [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