Conferences in DBLP
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 ] 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 ] Joachim von zur Gathen Parallel algorithms for algebraic problems [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:17-23 [Conf ] Quentin F. Stout Topological Matching [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:24-31 [Conf ] Péter Gács Reliable Computation with Cellular Automata [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:32-41 [Conf ] 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 ] 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 ] Michael Sipser Borel Sets and Circuit Complexity [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:61-69 [Conf ] 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 ] Michael Ben-Or Lower Bounds for Algebraic Computation Trees (Preliminary Report) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:80-86 [Conf ] 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 ] Ashok K. Chandra , Merrick L. Furst , Richard J. Lipton Multi-Party Protocols [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:94-99 [Conf ] Faith E. Fich New Bounds for Parallel Prefix Circuits [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:100-109 [Conf ] Leslie G. Valiant Exponential Lower Bounds for Restricted Monotone Circuits [Citation Graph (1, 0)][DBLP ] STOC, 1983, pp:110-117 [Conf ] Larry J. Stockmeyer The Complexity of Approximate Counting (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:118-126 [Conf ] 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 ] 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 ] Susan Landau , Gary L. Miller Solvability by Radicals is in Polynomial Time [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:140-151 [Conf ] James R. Driscoll , Merrick L. Furst On the Diameter of Permutation Groups [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:152-160 [Conf ] 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 ] László Babai , Eugene M. Luks Canonical Labeling of Graphs [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:171-183 [Conf ] Eric Bach How to Generate Random Integers with Known Factorization [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:184-188 [Conf ] Arjen K. Lenstra Factoring Multivariate Polynomials over Finite Fields (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:189-192 [Conf ] Ravi Kannan Improved Algorithms for Integer Programming and Related Lattice Problems [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:193-206 [Conf ] 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 ] 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 ] Daniel Dominic Sleator , Robert Endre Tarjan Self-Adjusting Binary Trees [Citation Graph (1, 0)][DBLP ] STOC, 1983, pp:235-245 [Conf ] 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 ] 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 ] F. Frances Yao A 3-Space Partition and Its Applications (Extended Abstract) [Citation Graph (1, 0)][DBLP ] STOC, 1983, pp:258-263 [Conf ] 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 ] Amir Pnueli On the Extremely Fair Treatment of Probabilistic Algorithms [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:278-290 [Conf ] Dexter Kozen A Probabilistic PDL [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:291-297 [Conf ] Yishai A. Feldman A Decidable Propositional Probabilistic Dynamic Logic [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:298-309 [Conf ] Joseph Y. Halpern , Michael O. Rabin A Logic to Reason about Likelihood [Citation Graph (1, 0)][DBLP ] STOC, 1983, pp:310-319 [Conf ] 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 ] Michael Sipser A Complexity Theoretic Approach to Randomness [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:330-335 [Conf ] Patrick W. Dymond , Martin Tompa Speedups of Deterministic Machines by Synchronous Parallel Machines [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:336-343 [Conf ] Ravi Kannan Alternation and the Power of Nondeterminism [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:344-346 [Conf ] Neil Immerman Languages Which Capture Complexity Classes (Preliminary Report) [Citation Graph (3, 0)][DBLP ] STOC, 1983, pp:347-354 [Conf ] Dale Myers The Random Access Hierarchy (Preliminary Report) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:355-364 [Conf ] Joost Engelfriet Iterated Pushdown Automata and Complexity Classes [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:365-373 [Conf ] 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 ] 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 ] Paul Young Some Structural Properties of Polynomial Reducibilities and Sets in NP [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:392-401 [Conf ] Leonard M. Adleman On Breaking Generalized Knapsack Public Key Cryptosystems (Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:402-412 [Conf ] Douglas L. Long , Avi Wigderson How Discreet is the Discrete Log? [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:413-420 [Conf ] 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 ] Shafi Goldwasser , Silvio Micali , Andrew Chi-Chih Yao Strong Signature Schemes [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:431-439 [Conf ] Manuel Blum How to Exchange (Secret) Keys (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:440-447 [Conf ] 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 ] Jeremy Spinrad Transitive Orientation in O(n²) Time [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:457-466 [Conf ] Jonathan S. Turner Probabilistic Analysis of Bandwidth Minimization Algorithms [Citation Graph (0, 0)][DBLP ] STOC, 1983, pp:467-476 [Conf ] 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 ]