Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSIAM Journal on Computing, Volume 5
Volume 5, Number 1, March 1976
- J. Ian Munro, Philip M. Spira:
Sorting and Searching in Multisets. 1-8
- Alon Itai:
Optimal Alphabetic Trees. 9-18 - Ronald L. Rivest:
Partial-Match Retrieval Algorithms. 19-50 - Lawrence J. Mazlack:
Machine Selection of Elements in Crossword Puzzles: An Application of Computational Linguistics. 51-72 - Ravi Sethi:
Scheduling Graphs on Two Processors. 73-82 - Michael L. Fredman:
New Bounds on the Complexity of the Shortest Path Problem. 83-89 - Prabhaker Mateti, Narsingh Deo:
On Algorithms for Enumerating All Circuits of a Graph. 90-99 - Andrew Chi-Chih Yao:
On the Evaluation of Powers. 100-103 - Seymour E. Goodman, Stephen T. Hedetniemi, Robert Endre Tarjan:
b-Matchings in Trees. 104-108 - Laurent Hyafil:
Bounds for Selection. 109-114 - Alfred V. Aho, John E. Hopcroft, Jeffrey D. Ullman:
On Finding Lowest Common Ancestors in Trees. 115-132 - Tatsuo Ohtsuki:
A Fast Algorithm for Finding an Optimal Ordering for Vertex Elimination on a Graph. 133-145 - Allan Borodin, Stephen A. Cook:
On the Number of Additions to Compute Specific Polynomials. 146-157 - Ken Kennedy:
A Comparison of Two Algorithms for Global Data Flow Analysis. 158-180
Volume 5, Number 2, June 1976
- David P. Dobkin, Richard J. Lipton:
Multidimensional Searching Problems. 181-186 - Robert L. Probert:
On the Additive Complexity of Matrix Multiplication. 187-203 - Webb Miller:
Graph Transformations for Roundoff Analysis. 204-216 - Ivan Hal Sudborough, A. Zalcberg:
On Families of Languages Defined by Time-Bounded Random Access Machines. 217-230 - Thomas G. Szymanski, John H. Williams:
Noncanonical Extensions of Bottom-Up Parsing Techniques. 231-250 - Y. Edmund Lien:
Termination Properties of Generalized Petri Nets. 251-265 - Donald J. Rose, Robert Endre Tarjan, George S. Lueker:
Algorithmic Aspects of Vertex Elimination on Graphs. 266-283 - Sven Skyum:
Decomposition Theorems for Various Kinds of Languages Parallel in Nature. 284-296 - Jay P. Fillmore, S. G. Williamson:
Ranking Algorithms: The Symmetries and Colorations of the n-Cube. 297-304 - Leon S. Levy:
Local Adjunct Languages and Regular Sets. 305-308 - Arthur J. Bernstein:
Synthesizing a Response Function with a Feedback Scheduling Algorithm. 309-317 - Dorothy Bollman:
On Preserving Proximity in Extendible Arrays. 318-323 - Volker Strassen:
Computational Complexity over Finite Fields. 324-331
Volume 5, Number 3, September 1976
- Edward A. Ashcroft, William W. Wadge:
Lucid - A Formal System for Writing and Proving Programs. 336-354 - Susan L. Gerhart:
Proof Theory of Partial Correctness Verification Systems. 355-377 - Peter J. Downey, Ravi Sethi:
Correct Computation Rules for Recursive Languages. 378-401 - Ashok K. Chandra:
Generalized Program Schemas. 402-413 - Zohar Manna, Adi Shamir:
The Theoretical Aspects of the Optimal Fixed Point. 414-426 - Steven S. Muchnick:
Computational Complexity of Multiple Recursive Schemata. 427-451 - Gordon D. Plotkin:
A Powerdomain Construction. 452-487 - Christopher P. Wadsworth:
The Relation Between Computational and Denotational Properties for Scott's Dinfty-Models of the Lambda-Calculus. 488-521 - Dana S. Scott:
Data Types as Lattices. 522-587
Volume 5, Number 4, December 1976
- Bharat Kinariwala, Kabekode V. S. Bhat:
Theory of Output Set Assignments and Degree Switching Operations. 589-601 - S. G. Williamson:
Ranking Algorithms for Lists of Partitions. 602-617 - L. Csanky:
Fast Parallel Matrix Inversion Algorithms. 618-623 - Roger W. Brockett, David P. Dobkin:
On the Number of Multiplications Required for Matrix Multiplication. 624-628 - Takao Asano, Michiro Shibui, Itsuo Takanami:
General Results on Tour Lengths in Machines and Digraphs. 629-645 - Robert Solovay:
On Sets Cook-Reducible to Sparse Sets. 646-652 - Kapali P. Eswaran, Robert Endre Tarjan:
Augmentation Problems. 653-665 - John C. Cherniavsky:
Simple Programs Realize Exactly Presberger Formulas. 666-677 - Amnon Barak, Eliahu Shamir:
On the Parallel Evaluation of Boolean Expressions. 678-681 - Francis Y. L. Chin:
A Generalized Asymptotic Upper Bound on Fast Polynomial Evaluation and Interpolation. 682-690 - Shimon Even, Alon Itai, Adi Shamir:
On the Complexity of Timetable and Multicommodity Flow Problems. 691-703 - M. R. Garey, David S. Johnson, Robert Endre Tarjan:
The Planar Hamiltonian Circuit Problem is NP-Complete. 704-714 - W. J. Hendricks:
An Account of Self-Organizing Systems. 715-723 - David R. Cheriton, Robert Endre Tarjan:
Finding Minimum Spanning Trees. 724-742 - Alan Jay Smith:
Analysis of the Optimal, Look-Ahead Demand Paging Algorithms. 743-757 - Leonard J. Bass:
Errata: On Optimal Processor Scheduling for Multiprogramming. 758
a service of 
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 2023-09-21 21:22 CEST 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:
