The SCEAS System
Navigation Menu

Conferences in DBLP

Symposium on the Theory of Computing (STOC) (stoc)
1979 (conf/stoc/STOC11)

  1. Jacobo Valdes, Robert Endre Tarjan, Eugene L. Lawler
    The recognition of Series Parallel digraphs [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:1-12 [Conf]
  2. Zvi Galil, Amnon Naamad
    Network Flow and Generalized Path Compression [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:13-26 [Conf]
  3. I. S. Filotti, Gary L. Miller, John H. Reif
    On Determining the Genus of a Graph in O(v^O(g)) Steps [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:27-37 [Conf]
  4. Bernard Chazelle, David P. Dobkin
    Decomposing a Polygon into its Convex Parts [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:38-48 [Conf]
  5. Philippe Flajolet, Jean Françon, Jean Vuillemin
    Computing Integrated Costs of Sequences of Operations with Application to Dictionaries [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:49-61 [Conf]
  6. Michael L. Fredman
    A Near Optimal Data Structure for a Type of Range Query Problem [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:62-66 [Conf]
  7. S. Rao Kosaraju
    On a Multidimensional Search Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:67-73 [Conf]
  8. Robert Sedgewick, Thomas G. Szymanski
    The Complexity of Finding Periods [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:74-80 [Conf]
  9. Clark D. Thompson
    Area-Time Complexity for VLSI [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:81-88 [Conf]
  10. Sam Toueg, Jeffrey D. Ullman
    Deadlock-Free Packet Switching Networks [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:89-98 [Conf]
  11. Arnold L. Rosenberg, Derick Wood, Zvi Galil
    Storage Representations for Tree-Like Data Structures [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:99-107 [Conf]
  12. J. Ian Munro, Hendra Suwanda
    Implicit Data Structures (Preliminary Draft) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:108-117 [Conf]
  13. Adi Shamir
    On the Cryptocomplexity of Knapsack Systems [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:118-129 [Conf]
  14. Dana Angluin
    Finding Patterns Common to a Set of Strings (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1979, pp:130-141 [Conf]
  15. Eitan M. Gurari, Oscar H. Ibarra
    The Complexity of the Equivalence Problem for Counter Machines, Semilinear Sets, and Simple Programs [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:142-152 [Conf]
  16. Richard A. DeMillo, Richard J. Lipton
    Some Connections between Mathematical Logic and Complexity Theory [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:153-159 [Conf]
  17. Francine Berman
    A Completeness Technique for D-Axiomatizable Semantics [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:160-166 [Conf]
  18. Albert R. Meyer, Karl Winklmann
    On the Expressive Power of Dynamic Logic (Preliminary Report) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:167-175 [Conf]
  19. Michael O'Donnell
    A Programming Language Theorem Which Is Independent of Peano Arithmetic [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:176-188 [Conf]
  20. Leslie G. Valiant
    Negation Can Be Exponentially Powerful [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:189-196 [Conf]
  21. Joseph JáJá
    On the Complexity of Bilinear Forms with Commutativity [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:197-208 [Conf]
  22. Andrew Chi-Chih Yao
    Some Complexity Questions Related to Distributive Computing (Preliminary Report) [Citation Graph (1, 0)][DBLP]
    STOC, 1979, pp:209-213 [Conf]
  23. Richard E. Ladner
    The Complexity of Problems in Systems of Communicating Sequential Processes (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:214-223 [Conf]
  24. Gary L. Peterson
    Time-Space Trade-Offs for Asynchronous Parallel Models: Reducibilities and Equivalences [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:224-230 [Conf]
  25. S. Rao Kosaraju
    Fast Parallel Processing Array Algorithms for some Graph Problems (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:231-236 [Conf]
  26. John R. Gilbert, Thomas Lengauer, Robert Endre Tarjan
    The Pebbling Problem is Complete in Polynomial Space [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:237-248 [Conf]
  27. Leslie G. Valiant
    Completeness Classes in Algebra [Citation Graph (1, 0)][DBLP]
    STOC, 1979, pp:249-261 [Conf]
  28. Thomas Lengauer, Robert Endre Tarjan
    Upper and Lower Bounds on Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:262-277 [Conf]
  29. Timothy J. Long
    On gamma-Reducibility versus Polynomial Time Many-One Reducibility (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:278-287 [Conf]
  30. John H. Reif
    Universal Games of Incomplete Information [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:288-308 [Conf]
  31. Ashok K. Chandra, David Harel
    Computable Queries for Relational Data Bases (Preliminary Report) [Citation Graph (5, 0)][DBLP]
    STOC, 1979, pp:309-318 [Conf]
  32. Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman
    Equivalence of Relational Database Schemes [Citation Graph (9, 0)][DBLP]
    STOC, 1979, pp:319-329 [Conf]
  33. David Maier
    Minimum Covers in the Relational Database Model (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1979, pp:330-337 [Conf]
  34. Stephen A. Cook
    Deterministic CFL's Are Accepted Simultaneously in Polynomial Time and Log Squared Space [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:338-345 [Conf]
  35. S. Rao Kosaraju
    Real-Time Simulation of Concatenable Double-Ended Queues by Double-Ended Queues (Preliminary Version) [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:346-351 [Conf]
  36. Walter L. Ruzzo
    Tree-Size Bounded Alternation [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:352-359 [Conf]
  37. Michael Sipser
    Lower Bounds on the Size of Sweeping Automata [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:360-364 [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