default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 25
Volume 25, Number 1, October 1997
- Bonnie Berger
, Peter W. Shor:
Tight Bounds for the Maximum Acyclic Subgraph Problem. 1-18 - Martin Dietzfelbinger, Torben Hagerup, Jyrki Katajainen, Martti Penttonen:
A Reliable Randomized Algorithm for the Closest-Pair Problem. 19-51 - Michel Habib, Lhouari Nourine, George Steiner:
Gray Codes for the Ideals of Interval Orders. 52-66 - Mohammad Hossain Heydari, Ivan Hal Sudborough:
On the Diameter of the Pancake Network. 67-94 - Yehuda Afek, Gideon Stupp:
Optimal Time-Space Tradeoff for Shared Memory Leader Election. 95-117 - Michael Krivelevich:
Approximate Set Covering in Uniform Hypergraphs. 118-143 - Michel Barbeau, Froduald Kabanza, Richard St-Denis:
An Efficient Algorithm for Controller Synthesis under Full Observation. 144-161 - Noga Alon, Dmitry N. Kozlov:
Coins with Arbitrary Weights. 162-176 - Binay K. Bhattacharya, Sandeep Sen:
On a Simple, Practical, Optimal, Output-Sensitive Randomized Planar Convex Hull Algorithm. 177-193 - Andrew Chi-Chih Yao, Frances F. Yao:
Dictionary Look-Up with One Error. 194-202
Volume 25, Number 2, November 1997
- Philip N. Klein, Sairam Subramanian:
A Randomized Parallel Algorithm for Single-Source Shortest Paths. 205-220 - D. E. G. Hare:
Computing the Principal Branch of log-Gamma. 221-236 - Peter Slavík:
A Tight Analysis of the Greedy Algorithm for Set Cover. 237-254 - Lusheng Wang, Dan Gusfield:
Improved Approximation Algorithms for Tree Alignment. 255-273 - József Békési, Gábor Galambos, Ulrich Pferschy, Gerhard J. Woeginger:
Greedy Algorithms for On-Line Data Compression. 274-289 - Yossi Azar, Leah Epstein:
On Two Dimensional Packing. 290-310 - Tomasz Luczak, Edyta Szymanska:
A Parallel Randomized Algorithm for Finding a Maximal Independent Set in a Linear Hypergraph. 311-320 - James F. Korsh, Seymour Lipschutz:
Generating Multiset Permutations in Constant Time. 321-335 - Binay K. Bhattacharya, Damon Kaller:
An O(m + n log n) Algorithm for the Maximum-Clique Problem in Circular-Arc Graphs. 336-358
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-04 20: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:
