default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 2
Volume 2, Number 1, March 1973
- Eralp A. Akkoyunlu:
The Enumeration of Maximal Cliques of Large Graphs. 1-6 - Chin-Liang Chang, Richard C. T. Lee, John K. Dixon:
The Specialization of Programs by Theorem Proving. 7-15 - Seymour E. Goodman, Stephen T. Hedetniemi:
Eulerian Walks in Graphs. 16-27 - Philip M. Spira:
A New Algorithm for Finding all Shortest Paths in a Graph of Positive Arcs in Average Time 0(n2 log2n). 28-32 - Jürg Nievergelt, Edward M. Reingold:
Binary Search Trees of Bounded Balance. 33-43 - S. G. Williamson:
Isomorph Rejection and a Theorem of De Bruijn. 44-59 - Mike Paterson, Larry J. Stockmeyer:
On the Number of Nonscalar Multiplications Necessary to Evaluate Polynomials. 60-66
Volume 2, Number 2, June 1973
- J. Robert Jump, P. S. Thiagarajan:
On the Equivalence of Asynchronous Control Structures. 67-87 - John H. Holland:
Genetic Algorithms and the Optimal Allocation of Trials. 88-105 - Alfred V. Aho, Jeffrey D. Ullman:
A Technique for Speeding up LR(k) Parsers. 106-127 - Phillip J. Chase:
Transposition Graphs. 128-133
Volume 2, Number 3, September 1973
- John E. Hopcroft, Robert Endre Tarjan:
Dividing a Graph into Triconnected Components. 135-158 - John E. Hopcroft, Jean E. Musinski:
Duality Applied to the Complexity of Matrix Multiplication and Other Bilinear Forms. 159-173 - Walter J. Savitch:
How to Make Arbitrary Grammars Look Like Context-Free Grammars. 174-182 - Donald P. Gaver, Gerald S. Shedler:
Approximate Models for Processor Utilization in Multiprogrammed Computer Systems. 183-192 - Toshihide Ibaraki:
Finite State Representations of Discrete Optimization Problems. 193-210 - Robert Endre Tarjan:
Enumeration of the Elementary Circuits of a Directed Graph. 211-216
Volume 2, Number 4, December 1973
- Loren Haskins, Donald J. Rose:
Toward Characterization of Perfect Elimination Digraphs. 217-224 - John E. Hopcroft, Richard M. Karp:
An n5/2 Algorithm for Maximum Matchings in Bipartite Graphs. 225-231 - Stephen S. Lavenberg:
Queueing Analysis of a Multiprogrammed Computer System Having a Multilevel Storage Hierarchy. 232-252 - J. C. Dunn:
Continuous Group Averaging and Pattern Classification Problems. 253-272 - Leonard J. Bass:
On Optimal Processor Scheduling for Multiprogramming. 273-280 - Walter B. McRae, Ernest R. Davidson:
An Algorithm for the Extreme Rays of a Pointed Convex Polyhedral Cone. 281-293 - John E. Hopcroft, Jeffrey D. Ullman:
Set Merging Algorithms. 294-303 - Sheila A. Greibach:
The Hardest Context-Free Language. 304-310 - Derek G. Corneil, Bruce Graham:
An Algorithm for Determining the Chromatic Number of a Graph. 311-318
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 2025-01-23 20:32 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:
