default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 8
Volume 8, Number 1, February 1979
- Colin McDiarmid:
Determining the Chromatic Number of a Graph. 1-14 - Yossi Shiloach:
A Minimum Linear Arrangement Algorithm for Undirected Trees. 15-32 - Mark R. Brown:
A Partial Analysis of Random Height-Balanced Trees. 33-41 - Raymond E. Miller, Nicholas Pippenger, Arnold L. Rosenberg, Lawrence Snyder:
Optimal 2, 3-Trees. 42-59 - Vijay B. Aggarwal, James W. Burgmeier:
A Round-Off Error Model with Applications to Arithmetic Expressions. 60-72 - Shmuel Zaks, D. Richards:
Generating Trees and Other Combinatorial Objects Lexicographically. 73-81 - James R. Bitner:
Heuristics That Dynamically Organize Data Structures. 82-110 - Jaroslav Opatrny:
Total Ordering Problem. 111-114
Volume 8, Number 2, May 1979
- L. H. Harper, John E. Savage:
Lower Bounds on Synchronous Combinational Complexity. 115-119 - Laurent Hyafil:
On the Parallel Evaluation of Multivariate Polynomials. 120-123 - Eric C. R. Hehner, R. Nigel Horspool:
A New Representation of the Rational Numbers for Fast Easy Arithmetic. 124-134 - Alon Itai, Yossi Shiloach:
Maximum Flow in Planar Networks. 135-150 - Larry J. Stockmeyer, Ashok K. Chandra:
Provably Difficult Combinatorial Games. 151-174 - Kurt Mehlhorn:
Dynamic Binary Search. 175-198 - Carl R. Carlson:
A Counterexample to Reingold's Pushdown Permuter Characterization Theorem. 199-201 - Edward G. Coffman Jr., Joseph Y.-T. Leung:
Combinatorial Analysis of an Efficient Algorithm for Processor and Storage Allocation. 202-217 - Alfred V. Aho, Yehoshua Sagiv, Jeffrey D. Ullman:
Equivalences Among Relational Expressions. 218-246 - Kenichi Hagihara, Minoru Ito, Kenichi Taniguchi, Tadao Kasami:
Decision Problems for Multivalued Dependencies in Relational Databases. 247-264 - Claus-Peter Schnorr:
Bottlenecks and Edge Connectivity in Unsymmetrical Networks. 265-274 - Sartaj Sahni, Yookun Cho:
Nearly On Line Scheduling of a Uniform Processor System with Release Times. 275-285
Volume 8, Number 3, August 1979
- David R. Stoutemyer:
Automatic Asymptotic and Big-O Calculations Via Computer Algebra. 287-299 - Paul S. Wang, Barry M. Trager:
New Algorithms for Polynomial Square-Free Decomposition Over the Integers. 300-305 - Michael C. Wirth:
Symbolic Vector and Dyadic Analysis. 306-319 - H. I. Epstein:
A Natural Structure Theorem for Complex Fields. 320-325 - Dorothea A. Klip:
New Algorithms for Polynomial Multiplication. 326-343 - John McKay:
Some Remarks on Computing Galois Groups. 344-347 - David Y. Y. Yun:
Uniform Bounds for a Class of Algebraic Mappings. 348-356 - Michael Rothstein, Bob F. Caviness:
A Structure Theorem for Exponential and Primitive Functions. 357-367 - Andrew Chi-Chih Yao:
The Complexity of Pattern Matching for a Random String. 368-387 - Larry J. Stockmeyer, C. K. Wong:
On the Number of Comparisons to Find the Intersection of Two Relations. 388-404 - Christos H. Papadimitriou, Mihalis Yannakakis:
Scheduling Interval-Ordered Tasks. 405-409 - Leslie G. Valiant:
The Complexity of Enumeration and Reliability Problems. 410-421 - Yossi Shiloach:
Multi-Terminal 0-1 Flow. 422-430 - Steven Fortune:
A Note on Sparse Complete Sets. 431-433 - Ronald V. Book:
Polynomial Space and Transitive Closure. 434-439 - David W. Walkup:
On the Expected Value of a Random Assignment Problem. 440-442 - Joseph F. JáJá:
Optimal Evaluation of Pairs of Bilinear Forms. 443-462 - Gaston H. Gonnet, J. Ian Munro:
Efficient Ordering of Hash Tables. 463-478
Volume 8, Number 4, November 1979
- James R. Bitner, C. K. Wong:
Optimal and Near-Optimal Scheduling Algorithms for Batched Processing in Linear Storage. 479-498 - Ravindran Kannan, Achim Bachem:
Polynomial Algorithms for Computing the Smith and Hermite Normal Forms of an Integer Matrix. 499-507 - Lutz Priese:
Towards a Precise Characterization of the Complexity of Universal and Nonuniversal Turing Machines. 508-523 - A. Bagchi, J. K. Roy:
On V-Optimal Trees. 524-541 - Franco P. Preparata:
A Note on Locating a Set of Points in a Planar Subdivision. 542-545 - James E. Donahue:
On the Semantics of "Data Type". 546-560 - Richard M. Karp:
A Patching Algorithm for the Nonsymmetric Traveling-Salesman Problem. 561-573 - Takumi Kasai, Akeo Adachi, Shigeki Iwata:
Classes of Pebble Games and Complete Problems. 574-586 - Elaine J. Weyuker:
Translatability and Decidability Questions for Restricted Classes of Program Schemas. 587-598 - David Maier:
An Efficient Method for Storing Ancestor Information in Trees. 599-618 - Mukkai S. Krishnamoorthy, Narsingh Deo:
Node-Deletion NP-Complete Problems. 619-625 - David K. Probst, Vangalur S. Alagar:
A Family of Algorithms for Powering Sparse Polynomials. 626-644 - Adi Shamir:
A Linear Time Algorithm for Finding Minimum Cutsets in Reducible Graphs. 645-655 - Teruo Hikita, Akihiro Nozaki:
Corrigenda: A Completeness Criterion for Spectra. 656
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-08 20:34 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:
