default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 6
Volume 6, Number 1, March 1977
- Derek A. Zave:
Optimal Polyphase Sorting. 1-39 - Donald L. Adolphson:
Single Machine Job Sequencing with Precedence Constraints. 40-54 - Arnie Rosenthal, Anita Goldner:
Smallest Augmentations to Biconnect a Graph. 55-66 - Lawrence T. Kou:
Polynomial Complete Consecutive Information Retrieval Problems. 67-75 - Christos H. Papadimitriou, Kenneth Steiglitz:
On the Complexity of Local Search for the Traveling Salesman Problem. 76-83 - Robert Solovay, Volker Strassen:
A Fast Monte-Carlo Test for Primality. 84-85 - K. Aoshima, Masao Iri:
Comments on F. Hadlock's Paper: "Finding a Maximum Cut of a Planar Graph in Polynomial Time". 86-87 - Peter B. Henderson, Yechezkel Zalcstein:
A Graph-Theoretic Characterization of the PV_chunk Class of Synchronizing Primitives. 88-108 - Thomas G. Szymanski, Jeffrey D. Ullman:
Evaluating Relational Expressions with Dense and Sparse Arguments. 109-122 - Seymour Ginsburg, Nancy A. Lynch:
Derivation Complexity in Context-Free Grammar Forms. 123-138 - Harold N. Gabow:
Two Algorithms for Generating Weighted Spanning Trees in Order. 139-150 - Sukhamay Kundu, Jayadev Misra:
A Linear Tree Partitioning Algorithm. 151-154 - Teofilo F. Gonzalez, Oscar H. Ibarra, Sartaj Sahni:
Bounds for LPT Schedules on Uniform Processors. 155-166 - Dennis G. Kafura, Vincent Y. Shen:
Task Scheduling on a Multiprocessor System with Independent Memories. 167-187 - David G. Kirkpatrick, Zvi M. Kedem:
Adequate Requirements for Rational Functions. 188-199 - Edward A. Ashcroft, William W. Wadge:
Erratum: Lucid - A Formal System for Writing and Proving Programs. 200
Volume 6, Number 2, June 1977
- Masahiro Miyakawa, Toshitsugu Yuba, Yoshio Sugito, Mamoru Hoshi:
Optimum Sequence Trees. 201-234 - Kurt Mehlhorn:
A Best Possible Bound for the Weighted Path Length of Binary Search Trees. 235-239 - Robert Sedgewick:
Quicksort with Equal Keys. 240-268 - Janet Fabri:
Some Remarks on p-Way Merging. 269-271 - Aravind K. Joshi, Leon S. Levy:
Constraints on Structural Descriptions: Local Transformations. 272-284 - Teruo Hikita, Akihiro Nozaki:
A Completeness Criterion for Spectra. 285-297 - Nicholas Pippenger:
Superconcentrators. 298-304 - Leonard Berman, Juris Hartmanis:
On Isomorphisms and Density of NP and Other Complete Sets. 305-322 - Donald E. Knuth, James H. Morris Jr., Vaughan R. Pratt:
Fast Pattern Matching in Strings. 323-350 - Luis Trabb Pardo:
Stable Sorting and Merging with Optimal Space and Time Bounds. 351-372 - William F. McColl, Mike Paterson:
The Depth of All Boolean Functions. 373-380 - David B. Benson:
Some Preservation Properties of Normal Form Grammars. 381-402
Volume 6, Number 3, September 1977
- Bruce D. Russell:
Implementation Correctness Involving a Language with goto Statements. 403-415 - M. R. Garey, David S. Johnson:
Two-Processor Scheduling with Start-Times and Deadlines. 416-426 - Wolfgang J. Paul:
A 2.5 n-Lower Bound on the Combinational Complexity of Boolean Functions. 427-443 - Zvi Galil:
On Resolution with Clauses of Bounded Size. 444-459 - Yoshihide Igarashi:
The Tape Complexity of Some Classes of Szilard Languages. 460-466 - Richard E. Ladner
:
The Computational Complexity of Provability in Systems of Modal Propositional Logic. 467-480 - Donald L. Adolphson, Glenn N. Thomas:
A Linear Time Algorithm for a 2 × n Transportation Problem. 481-486 - Joel I. Seiferas:
Linear-Time Computation by Nondeterministic Multidimensional Iterative Arrays. 487-504 - Shuji Tsukiyama, Mikio Ide, Hiromu Ariyoshi, Isao Shirakawa:
A New Algorithm for Generating All the Maximal Independent Sets. 505-517 - Shui Lam, Ravi Sethi:
Worst Case Analysis of Two Scheduling Algorithms. 518-536 - Robert Endre Tarjan, Anthony E. Trojanowski:
Finding a Maximum Independent Set. 537-546 - Erik Meineche Schmidt, Thomas G. Szymanski:
Succinctness of Descriptions of Unambiguous Context-Free Languages. 547-553 - Francis Y. L. Chin:
The Partial Fraction Expansion Problem and Its Inverse. 554-562 - Daniel J. Rosenkrantz, Richard Edwin Stearns, Philip M. Lewis II:
An Analysis of Several Heuristics for the Traveling Salesman Problem. 563-581 - H. T. Kung, D. M. Tong:
Fast Algorithms for Partial Fraction Decomposition. 582-593 - D. T. Lee, Franco P. Preparata:
Location of a Point in a Planar Subdivision and Its Applications. 594-606
Volume 6, Number 4, December 1977
- David L. Russell:
Internal Fragmentation in a Class of Buddy Systems. 607-621 - Adriano M. Garsia, Michelle L. Wachs:
A New Algorithm for Minimum Cost Binary Trees. 622-642 - Vasek Chvátal:
Determining the Stability Number of a Graph. 643-662 - Richard G. Larson:
Minimizing Garbage Collection as a Function of Region Size. 663-668 - Ronald L. Rivest:
On the Worst-Case Behavior of String-Searching Algorithms. 669-674 - John Gill:
Computational Complexity of Probabilistic Turing Machines. 675-695 - John S. Carson II, Averill M. Law:
A Note on Spira's Algorithm for the All-Pairs Shortest-Path Problem. 696-699 - Bernard J. Fino, V. Ralph Algazi:
A Unified Treatment of Discrete Fast Unitary Transforms. 700-717 - Jayadev Misra:
Prospects and Limitations of Automatic Assertion Generation for Loop Programs. 718-729 - Steven W. Reyner:
An Analysis of a Good Algorithm for the Subtree Problem. 730-732 - Allan Borodin:
On Relating Time and Space to Size and Depth. 733-744 - Frank Ruskey, T. C. Hu:
Generating Binary Trees Lexicographically. 745-758
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-04 20:45 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:
