default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 4
Volume 4, Number 1, March 1983
- Victor Y. Pan:
The Additive and Logical Complexities of Linear and Bilinear Arithmetic Algorithms. 1-34 - Daniel Leven, Zvi Galil:
NP Completeness of Finding the Chromatic Index of Regular Graphs. 35-44 - Uzi Vishkin:
Implementation of Simultaneous Memory Address Access in Models That Forbid It. 45-50 - Udaiprakash I. Gupta, D. T. Lee, C. K. Wong:
Ranking and Unranking of B-Trees. 51-60 - Greg N. Frederickson, Donald B. Johnson:
Finding k-th Paths and p-Centers by Generating and Searching Good Data Structures. 61-80 - Ephraim Feig:
Minimal Algorithms for Bilinear Forms May Have Divisions. 81-84 - Leonidas J. Guibas:
Problems. 85-86 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 87-100
Volume 4, Number 2, June 1983
- Ronald I. Becker, Yehoshua Perl:
Shifting Algorithms for Tree Partitioning with General Weighting Functions. 101-120 - Binay K. Bhattacharya, Godfried T. Toussaint:
Efficient Algorithms for Computing the Maximum Distance Between Two Finite Planar Sets. 121-136 - Ephraim Feig:
Certain Systems of Bilinear Forms Whose Minimal Algorithms Are All Quadratic. 137-149 - Alan D. Kalvin, Yaakov L. Varol:
On the Generation of All Topological Sortings. 150-162 - Gregory Butler:
Computing Normalizers in Permutation Groups. 163-175 - Leonidas J. Guibas:
Problems. 176-188 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 189-203
Volume 4, Number 3, September 1983
- John D. Dixon, Herbert S. Wilf:
The Random Selection of Unlabeled Graphs. 205-213 - A. Guénoche:
Random Spanning Tree. 214-220 - W. M. Beynon:
A Formal Account of Some Elementary Continued Fraction Algorithms. 221-240 - T. C. Hu, M. T. Shing:
Multiterminal Flows in Outerplanar Networks. 241-261 - Errol L. Lloyd:
An O(n log m) Algorithm for the Josephus Problem. 262-270 - Eliezer L. Lozinskii:
An Algorithm for Parallel Evaluation of Functions. 271-281 - C. Pandu Rangan:
On the Minimum Number of Additions Required to Compute a Quadratic Form. 282-285 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 286-300 - Mark H. Overmars:
Corrigendum: Dynamization of Order Decomposable Set Problems. 301
Volume 4, Number 4, December 1983
- Pavol Hell, Moshe Rosenfeld:
The Complexity of Finding Generalized Paths in Tournaments. 303-309 - Hiroshi Imai, Takao Asano:
Finding the Connected Components and a Maximum Clique of an Intersection Graph of Rectangles in the Plane. 310-323 - Ronald L. Graham, F. Frances Yao:
Finding the Convex Hull of a Simple Polygon. 324-331 - Paul Pritchard:
Fast Compact Prime Number Sieves (among Others). 332-344 - Edward Minieka, Niranjani H. Patel:
On Finding the Core of a Tree with a Specified Length. 345-352 - Ten-Hwang Lai, Sartaj Sahni:
Nearly On-Line Scheduling of Multiprocessor Systems with Memories. 353-362 - Jean-Pierre Duval:
Factorizing Words over an Ordered Alphabet. 363-381 - Leonidas J. Guibas:
Problems. 382-396 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 397-411
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-12-20 23:48 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:
