default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Algorithms, Volume 14
Volume 14, Number 1, January 1993
- Hans L. Bodlaender
:
On Linear Time Minor Tests with Depth-First Search. 1-23 - Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Mean Flow Time in Two-Machine Open Shops and Flow Shops. 24-44 - Jianzhong Du, Joseph Y.-T. Leung:
Minimizing Mean Flow Time with Release Time and Deadline Constraints. 45-68 - Pankaj K. Agarwal, Micha Sharir:
Circle Shooting in a Simple Polygon. 69-87 - Radhakrishna S. Valiveti, B. John Oommen:
Self-Organizing Doubly-Linked Lists. 88-114 - Pavol Hell, David G. Kirkpatrick:
Algorithms for Degree Constrained Graph Factors of Minimum Deficiency. 115-138 - Jeong-In Doh, Kyung-Yong Chwa:
An Algorithm for Determining Visibility of a Simple Polygon from an Internal Line Segment. 139-168
Volume 14, Number 2, March 1993
- David Pearson, Vijay V. Vazirani:
Efficient Sequential and Parallel Algorithms for Maximal Bipartite Sets. 171-179 - Andrew V. Goldberg, Serge A. Plotkin, Pravin M. Vaidya:
Sublinear-Time Parallel Algorithms for Matching and Related Problems. 180-213 - Samir Khuller, Ramakrishna Thurimella:
Approximation Algorithms for Graph Augmentation. 214-225 - Janez Zerovnik, Tomaz Pisanski:
Computing the Diameter in Multiple-Loop Networks. 226-243 - Oscar H. Ibarra, Hui Wang, Tao Jiang:
On Efficient Parallel Algorithms for Solving Set Recurrence Equations. 244-257 - Krzysztof Diks, Hristo N. Djidjev, Ondrej Sýkora, Imrich Vrto:
Edge Separators of Planar and Outerplanar Graphs with Applications. 258-279 - Marek Karpinski, Michael Luby:
Approximating the Number of Zeroes of a GF[2] Polynomial. 280-287 - Sara Bitan, Shmuel Zaks:
Optimal Linear Broadcast. 288-315 - Yehuda Afek, Moty Ricklin:
Sparser: A Paradigm for Running Distributed Algorithms. 316-328
Volume 14, Number 3, May 1993
- Philip N. Klein:
Parallelism, Preprocessing, and Reachability: A Hybrid Algorithm for Directed Graphs. 331-343 - Omer Berkman, Baruch Schieber, Uzi Vishkin:
Optimal Doubly Logarithmic Parallel Algorithms Based on Finding All Nearest Smaller Values. 344-370 - Prabhakar Ragde:
The Parallel Simplicity of Compaction and Chaining. 371-380 - Luc Devroye, Godfried T. Toussaint:
Convex Hulls for Random Lines. 381-394 - Christos Levcopoulos, Ola Petersson:
Adaptive Heapsort. 395-413 - James Aspnes:
Time- and Space-Efficient Randomized Consensus. 414-431 - Jirí Matousek:
Linear Optimization Queries. 432-448 - Yishay Mansour, Boaz Patt-Shamir:
Greedy Packet Scheduling on Shortest Paths. 449-465 - Biing-Feng Wang, Gen-Huey Chen, Kunsoo Park:
On the Set LCS and Set-Set LCS Problems. 466-477 - Bala Kalyanasundaram, Kirk Pruhs:
Online Weighted Matching. 478-488
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-04 01:27 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:
