default search action
SIAM Journal on Computing, Volume 10
Volume 10, Number 1, February 1981
- Michael L. Fredman:
Lower Bounds on the Complexity of Some Optimal Data Structures. 1-10 - Anna Lubiw:
Some NP-Complete Problems Similar to Graph Isomorphism. 11-21 - Oscar H. Ibarra, Brian S. Leininger:
Characterizations of Presburger Functions. 22-39 - Andrzej Ehrenfeucht, Grzegorz Rozenberg, Dirk Vermeir:
On ET0L Systems with Finite Tree-Rank. 40-58 - John H. Rowland, Philip J. Davis:
On the Selection of Test Data for Recursive Mathematical Subroutines. 59-72 - D. T. Lee, Robert L. (Scot) Drysdale III:
Generalization of Voronoi Diagrams in the Plane. 73-87 - Martin H. Ellis, J. Michael Steele:
Fast Sorting of Weyl Sequences Using Comparisons. 88-95 - Charles H. Bennett, John Gill:
Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1. 96-113 - Neil D. Jones, Sven Skyum:
A Note on the Complexity of General D0L Membership. 114-117 - Ken-Chih Liu:
On String Pattern Matching: A New Model with a Polynomial Time Algorithm. 118-140 - Frank Ruskey:
Listing and Counting Subtrees of a Tree. 141-150 - Manfred Kunde:
Nonpreemptive LP-Scheduling on Homogeneous Multiprocessor Systems. 151-173 - Stefano Crespi-Reghizzi, Giovanni Guida, Dino Mandrioli:
Operator Precedence Grammars and the Noncounting Property. 174-191 - M. I. Dessouky, Jitender S. Deogun:
Sequencing Jobs with Unequal Ready Times to Minimize Mean Flow Time. 192-202 - Charles J. Colbourn, Kellogg S. Booth:
Linear Time Automorphism Algorithms for Trees, Interval Graphs, and Planar Graphs. 203-225
Volume 10, Number 2, May 1981
- Lawrence Flon, Norihisa Suzuki:
The Total Correctness of Parallel Programs. 227-246 - Naoki Katoh, Toshihide Ibaraki, Hisashi Mine:
An Algorithm for Finding K Minimum Spanning Trees. 247-255 - M. R. Garey, David S. Johnson, Barbara B. Simons, Robert Endre Tarjan:
Scheduling Unit-Time Tasks with Arbitrary Release Times and Deadlines. 256-269 - Greg N. Frederickson, Joseph F. JáJá:
Approximation Algorithms for Several Graph Augmentation Problems. 270-283 - Luc Boasson, Bruno Courcelle, Maurice Nivat:
The Rational Index: A Complexity Measure for Languages. 284-296 - Mihalis Yannakakis:
Edge-Deletion Problems. 297-309 - Mihalis Yannakakis:
Node-Deletion Problems on Bipartite Graphs. 310-327 - Nimrod Megiddo, Arie Tamir, Eitan Zemel, R. Chandrasekaran:
An O(n log2 n) Algorithm for the k-th Longest Path in a Tree with Applications to Location Problems. 328-337 - George S. Lueker:
Optimization Problems on Graphs with Independent Random Edge Weights. 338-351 - Catriel Beeri, Alberto O. Mendelzon, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalence of Relational Database Schemes. 352-370 - Claus-Peter Schnorr:
An Extension of Strassen's Degree Bound. 371-382 - Juris Hartmanis, Stephen R. Mahaney:
Languages Simultaneously Complete for One-Way and Two-Way Log-Tape Automata. 383-390 - Andrzej Proskurowski:
Recursive Graphs, Recursive Labelings and Shortest Paths. 391-397 - Andrew Chi-Chih Yao:
An Analysis of a Memory Allocation Scheme for Implementing Stacks. 398-403
Volume 10, Number 3, August 1981
- Alfred V. Aho, Yehoshua Sagiv, Thomas G. Szymanski, Jeffrey D. Ullman:
Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions. 405-421 - L. Gotlieb:
Optimal Multi-Way Search Trees. 422-433 - Arnold Schönhage:
Partial and Total Matrix Multiplication. 434-455 - Richard Schroeppel, Adi Shamir:
A T=O(2n/2), S=O(2n/4) Algorithm for Certain NP-Complete Problems. 456-464 - Roland Häggkvist, Pavol Hell:
Parallel Sorting with Constant Time for Comparisons. 465-472 - Franco P. Preparata:
A New Approach to Planar Point Location. 473-482 - Hermann A. Maurer, Arto Salomaa, Derick Wood:
Uniform Interpretations of Grammar Forms. 483-502 - Brian H. Mayoh:
Attribute Grammars and Mathematical Semantics. 503-518 - Amir Pnueli, Giora Slutzki:
Automatic Programming of Finite State Linear Programs. 519-535 - Andrzej Ehrenfeucht, Rohit Parikh, Grzegorz Rozenberg:
Pumping Lemmas for Regular Sets. 536-541 - Christos H. Papadimitriou:
Worst-Case and Probabilistic Analysis of a Geometric Location Problem. 542-557 - James R. Bitner, Shou-Hsuan Stephen Huang:
Key Comparison Optimal 2-3 Trees with Maximum Utilization. 558-570 - Igal Golan:
Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms. 571-582 - Cynthia A. Brown, Paul Walton Purdom Jr.:
An Average Time Analysis of Backtracking. 583-593 - Sam Toueg, Jeffrey D. Ullman:
Deadlock-Free Packet Switching Networks. 594-611 - Stephen A. Cook:
Corrigendum: Soundness and Completeness of an Axiom System for Program Verification. 612 - Gaston H. Gonnet, J. Ian Munro, Hendra Suwanda:
Exegesis of Self-Organizing Linear Search. 613-637 - Peter J. Downey, Benton L. Leong, Ravi Sethi:
Computing Sequences with Addition Chains. 638-646 - Catriel Beeri, Peter Honeyman:
Preserving Functional Dependencies. 647-656
Volume 10, Number 4, November 1981
- Eliezer Dekel
, David Nassimi, Sartaj Sahni:
Parallel Matrix and Graph Algorithms. 657-675 - Edward M. Reingold, Robert Endre Tarjan:
On a Greedy Heuristic for Complete Matching. 676-681 - Carla D. Savage, Joseph F. JáJá:
Fast, Efficient Parallel Algorithms for Some Graph Problems. 682-691 - Peter J. Slater, Ernest J. Cockayne, Stephen T. Hedetniemi:
Information Dissemination in Trees. 692-701 - Sam Toueg, Kenneth Steiglitz:
Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks. 702-712 - Ian Holyer:
The NP-Completeness of Some Edge-Partition Problems. 713-717 - Ian Holyer:
The NP-Completeness of Edge-Coloring. 718-720 - Azad Bolour:
Optimal Retrieval Algorithms for Small Region Queries. 721-741 - Charles Rackoff, Joel I. Seiferas:
Limitations on Separating Nondeterministic Complexity Classes. 742-745 - Alon Itai, Richard J. Lipton, Christos H. Papadimitriou, Michael Rodeh:
Covering Graphs by Simple Circuits. 746-750 - Philip A. Bernstein, Nathan Goodman:
Power of Natural Semijoins. 751-771 - Kari-Jouko Räihä, Esko Ukkonen:
Minimizing the Number of Evaluation Passes for Attribute Grammars. 772-786 - Ker-I Ko, Daniel J. Moore:
Completeness, Approximation and Density. 787-796 - Maciej M. Syslo:
An Efficient Cycle Vector Space Algorithm for Listing all Cycles of a Planar Graph. 797-808 - Amnon Barak, Peter J. Downey:
Distributed Processor Scheduling and User Countermeasures. 809-819
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: