Conferences in DBLP
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 ] Zvi Galil , Amnon Naamad Network Flow and Generalized Path Compression [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:13-26 [Conf ] 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 ] Bernard Chazelle , David P. Dobkin Decomposing a Polygon into its Convex Parts [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:38-48 [Conf ] 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 ] 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 ] S. Rao Kosaraju On a Multidimensional Search Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:67-73 [Conf ] Robert Sedgewick , Thomas G. Szymanski The Complexity of Finding Periods [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:74-80 [Conf ] Clark D. Thompson Area-Time Complexity for VLSI [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:81-88 [Conf ] Sam Toueg , Jeffrey D. Ullman Deadlock-Free Packet Switching Networks [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:89-98 [Conf ] 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 ] J. Ian Munro , Hendra Suwanda Implicit Data Structures (Preliminary Draft) [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:108-117 [Conf ] Adi Shamir On the Cryptocomplexity of Knapsack Systems [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:118-129 [Conf ] Dana Angluin Finding Patterns Common to a Set of Strings (Extended Abstract) [Citation Graph (1, 0)][DBLP ] STOC, 1979, pp:130-141 [Conf ] 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 ] 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 ] Francine Berman A Completeness Technique for D-Axiomatizable Semantics [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:160-166 [Conf ] 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 ] Michael O'Donnell A Programming Language Theorem Which Is Independent of Peano Arithmetic [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:176-188 [Conf ] Leslie G. Valiant Negation Can Be Exponentially Powerful [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:189-196 [Conf ] Joseph JáJá On the Complexity of Bilinear Forms with Commutativity [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:197-208 [Conf ] Andrew Chi-Chih Yao Some Complexity Questions Related to Distributive Computing (Preliminary Report) [Citation Graph (1, 0)][DBLP ] STOC, 1979, pp:209-213 [Conf ] 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 ] 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 ] 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 ] 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 ] Leslie G. Valiant Completeness Classes in Algebra [Citation Graph (1, 0)][DBLP ] STOC, 1979, pp:249-261 [Conf ] Thomas Lengauer , Robert Endre Tarjan Upper and Lower Bounds on Time-Space Tradeoffs [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:262-277 [Conf ] 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 ] John H. Reif Universal Games of Incomplete Information [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:288-308 [Conf ] Ashok K. Chandra , David Harel Computable Queries for Relational Data Bases (Preliminary Report) [Citation Graph (5, 0)][DBLP ] STOC, 1979, pp:309-318 [Conf ] 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 ] David Maier Minimum Covers in the Relational Database Model (Extended Abstract) [Citation Graph (1, 0)][DBLP ] STOC, 1979, pp:330-337 [Conf ] 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 ] 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 ] Walter L. Ruzzo Tree-Size Bounded Alternation [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:352-359 [Conf ] Michael Sipser Lower Bounds on the Size of Sweeping Automata [Citation Graph (0, 0)][DBLP ] STOC, 1979, pp:360-364 [Conf ]