default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 11
Volume 11, Number 1, March 1990
- Hazel Everett, Derek G. Corneil:
Recognizing Visibility Graphs of Spiral Polygons. 1-26 - Liwu Li, T. Anthony Marsland:
Probability-Based Game Tree Pruning. 27-43 - Yuejiang Huang:
A New Algorithm for the Generation of Binary de Bruijn Sequences. 44-51 - Brendan D. McKay, Nicholas C. Wormald:
Uniform Generation of Random Regular Graphs of Moderate Degree. 52-67 - Frank Ruskey
, Andrzej Proskurowski:
Generating Binary Trees by Transpositions. 68-84 - David Eppstein:
Sequence Comparison with Mixed Convex and Concave Costs. 85-101 - Marek Chrobak, Takao Nishizeki:
Improved Edge-Coloring Algorithms for Planar Graphs. 102-116 - H. R. Morton, H. B. Short:
Calculating the 2-Variable Polynomial for Knots Presented as Closed Braids. 117-131 - Joseph Naor, Mark B. Novick:
An Efficient Reconstruction of a Graph from its Line Graph in Parallel. 132-143 - David S. Johnson:
The NP-Completeness Column: An Ongoing Guide. 144-151
Volume 11, Number 2, June 1990
- Francine Berman, David S. Johnson, Frank Thomson Leighton, Peter W. Shor, Larry Snyder:
Generalized Planar Matching. 153-184 - Vidyadhar G. Kulkarni:
Generating Random Combinatorial Objects. 185-207 - Mark S. Manasse, Lyle A. McGeoch, Daniel Dominic Sleator:
Competitive Algorithms for Server Problems. 208-230 - Edward F. Schmeichel, S. Louis Hakimi, M. Otsuka, Geoff Sullivan:
A Parallel Fault Identification Algorithm. 231-241 - Mark Allen Weiss, Robert Sedgewick:
Tight Lower Bounds for Shellsort. 242-251 - Gur Saran Adhar, Shietung Peng:
Parallel Algorithms for Cographs and Parity Graphs with Applications. 252-284 - Eytan Ronn:
NP-Complete Stable Matching Problems. 285-304
Volume 11, Number 3, September 1990
- Baruch Awerbuch, Amotz Bar-Noy, Nathan Linial, David Peleg:
Improved Routing Strategies with Succinct Tables. 307-341 - Baruch Awerbuch:
On the Effects of Feedback in Dynamic Network Protocols. 342-373 - Gil Neiger, Sam Toueg:
Automatically Increasing the Fault-Tolerance of Distributed Algorithms. 374-419 - Ofer Biran, Shlomo Moran, Shmuel Zaks:
A Combinatorial Characterization of the Distributed 1-Solvable Tasks. 420-440 - James Aspnes, Maurice Herlihy:
Fast Randomized Consensus Using Shared Memory. 441-461 - David B. Johnson, Willy Zwaenepoel:
Recovery in Distributed Systems Using Optimistic Message Logging and Checkpointing. 462-491 - Ming-Deh A. Huang, Shang-Hua Teng:
Security, Verifiability, and Universality in Distributed Computing. 492-521
Volume 11, Number 4, December 1990
- William M. Kantor:
Finding Sylow Normalizers in Polynomial Time. 523-563 - David M. Mount, Ruth Silverman:
Packing and Covering the Plane with Translates of a Convex Polygon. 564-580 - Dennis E. Shasha, Kaizhong Zhang:
Fast Algorithms for the Unit Cost Editing Distance Between Trees. 581-621 - Yishay Mansour, Leonard J. Schulman:
Sorting on a Ring of Processors. 622-630 - Hans L. Bodlaender:
Polynomial Algorithms for Graph Isomorphism and Chromatic Index on Partial k-Trees. 631-643 - Johan Håstad:
Tensor Rank is NP-Complete. 644-654
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-05 22:23 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:
