Conferences in DBLP
Albert R. Meyer , Rohit Parikh Definability in Dynamic Logic [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:1-7 [Conf ] John H. Reif Logics for Probabilistic Programming (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:8-13 [Conf ] Grazyna Mirkowska Complete Axiomatization of Algorithmic Properties of Program Schemes with Bounded Nondeterministic Interpretations [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:14-21 [Conf ] Vaughan R. Pratt Dynamic Algebras and the Nature of Induction [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:22-28 [Conf ] Esko Ukkonen A Decision Method for the Equivalence of some Non-Real-Time Deterministic Pushdown Automata [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:29-38 [Conf ] David A. Plaisted On the Distribution of Independent Formulae of Number Theory [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:39-44 [Conf ] Richard A. DeMillo , Richard J. Lipton The Consistency of ``P = NP'' and Related Problems with Fragments of Number Theory [Citation Graph (1, 0)][DBLP ] STOC, 1980, pp:45-57 [Conf ] Deborah Joseph , Paul Young Independence Results in Computer Science? (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:58-69 [Conf ] Nancy A. Lynch Fast Allocation of Nearby Resources in a Distributed System [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:70-81 [Conf ] Dana Angluin Local and Global Properties in Networks of Processors (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:82-93 [Conf ] Sam Toueg Deadlock- and Livelock-Free Packet Switching Networks [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:94-99 [Conf ] Donna J. Brown Kraft Storage and Access for List Implementations (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:100-107 [Conf ] H. Raymond Strong Vector Execution of Flow Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:108-116 [Conf ] Fereidoon Sadri , Jeffrey D. Ullman A Complete Axiomatization for a Large Class of Dependencies in Relational Databases [Citation Graph (10, 0)][DBLP ] STOC, 1980, pp:117-122 [Conf ] Ronald Fagin Horn Clauses and Database Dependencies (Extended Abstract) [Citation Graph (24, 0)][DBLP ] STOC, 1980, pp:123-134 [Conf ] Mark H. Overmars , Jan van Leeuwen Dynamically Maintaining Configurations in the Plane (Detailed Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:135-145 [Conf ] Bernard Chazelle , David P. Dobkin Detection is Easier than Computation (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:146-153 [Conf ] Leonidas J. Guibas , F. Frances Yao On Translating a Set of Rectangles [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:154-160 [Conf ] Martin Tompa An Optimal Solution to a Wire-Routing Problem (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:161-176 [Conf ] Michael J. Fischer , Mike Paterson Optimal Tree Layout (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:177-189 [Conf ] Richard P. Brent , H. T. Kung The Chip Complexity of Binary Arithmetic [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:190-200 [Conf ] James A. Storer The Node Cost Measure for Embedding Graphs on the Planar Grid (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:201-210 [Conf ] Allen Cypher An Approach to The k Paths Problem [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:211-217 [Conf ] David Lichtenstein Isomorphism for Graphs Embeddable on the Projective Plane [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:218-224 [Conf ] Gary L. Miller Isomorphism Testing for Graphs of Bounded Genus [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:225-235 [Conf ] I. S. Filotti , Jack N. Mayer A Polynomial-time Algorithm for Determining the Isomorphism of Graphs of Fixed Genus (Working Paper) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:236-243 [Conf ] Christoph M. Hoffmann Testing Isomorphism on Cone Graphs (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:244-251 [Conf ] Ravindran Kannan , Richard J. Lipton The Orbit Problem is Decidable [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:252-261 [Conf ] Joos Heintz , Claus-Peter Schnorr Testing Polynomials which Are Easy to Compute (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:262-272 [Conf ] Oscar H. Ibarra , Brian S. Leininger The Complexity of the Equivalence Problem for Straight-Line Programs [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:273-280 [Conf ] Hartmut Ehrig , Bernd Mahr Complexity of Implementations on the Level of Algebraic Specifications [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:281-293 [Conf ] Allan Borodin , Stephen A. Cook A Time-Space Tradeoff for Sorting on a General Sequential Model of Computation [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:294-301 [Conf ] Richard M. Karp , Richard J. Lipton Some Connections between Nonuniform and Uniform Complexity Classes [Citation Graph (1, 0)][DBLP ] STOC, 1980, pp:302-309 [Conf ] Jia-Wei Hong On Some Deterministic Space Complexity Problems [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:310-317 [Conf ] Chee-Keng Yap Space-time Tradeoffs and First Order Problems in a Model of Programs [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:318-325 [Conf ] David A. Carlson , John E. Savage Graph Pebbling with Many Free Pebbles can be Difficult [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:326-332 [Conf ] Martin Tompa Two Familiar Transitive Closure Algorithms which Admit No Polynomial Time, Sublinear Space Implementations [Citation Graph (1, 0)][DBLP ] STOC, 1980, pp:333-338 [Conf ] Joseph JáJá Time-Space Tradeoffs for some Algebraic Problems [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:339-350 [Conf ] Nicholas Pippenger Comparative Schematology and Pebbling with Auxiliary Pushdowns (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:351-356 [Conf ] Wolfgang J. Paul , Joel I. Seiferas , Janos Simon An Information-Theoretic Approach to Time Bounds for On-Line Computation (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:357-367 [Conf ] Richard M. Karp , Robert Endre Tarjan Linear Expected-Time Algorithms for Connectivity Problems (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:368-377 [Conf ] Peter A. Bloniarz A Shortest-Path Algorithm with Expected Time O(n^2 log n log ^* n) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:378-384 [Conf ] John H. Reif , Paul G. Spirakis Random Matroids [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:385-397 [Conf ] Kenneth J. Supowit , David A. Plaisted , Edward M. Reingold Heuristics for Weighted Perfect Matching [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:398-419 [Conf ] Greg N. Frederickson , Donald B. Johnson Generalized Selection and Ranking (Preliminary Version) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:420-428 [Conf ] F. Frances Yao Efficient Dynamic Programming Using Quadrangle Inequalities [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:429-435 [Conf ] Errol L. Lloyd Critical Path Scheduling of Task Systems with Resource and Processor Constraints (Extended Abstract) [Citation Graph (0, 0)][DBLP ] STOC, 1980, pp:436-446 [Conf ]