Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDAlgorithmica, Volume 21, 1998
Volume 21, Number 1, May 1998
- Artur Czumaj, Przemyslawa Kanarek, Miroslaw Kutylowski, Krzysztof Lorys:
Fast Generation of Random Permutations Via Networks Simulation. 2-20 - Alan M. Frieze
, Wojciech Szpankowski:
Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal. 21-36 - Alfredo Viola, Patricio V. Poblete:
The Analysis of Linear Probing Hashing with Buckets. 37-71 - Luca Trevisan:
Parallel Approximation Algorithms by Positive Linear Programming. 72-88 - Helmut Alt, Ulrich Fuchs, Günter Rote, Gerald Weber:
Matching Convex Shapes with Respect to the Symmetric Difference. 89-103 - Noga Alon, Yossi Azar, János Csirik, Leah Epstein, Sergey V. Sevastianov, Arjen P. A. Vestjens, Gerhard J. Woeginger:
On-Line and Off-Line Approximation Algorithms for Vector Covering Problems. 104-118 - Esther M. Arkin, Yi-Jen Chiang, Martin Held, Joseph S. B. Mitchell, Vera Sacristán, Steven Skiena, Tae-Heng Yang:
On Minimum-Area Hulls. 119-136 - Juha Kärkkäinen, Erkki Sutinen:
Lempel-Ziv Index for q-Grams. 137-154
Volume 21, Number 2, June 1998
- Pierre Fraigniaud, Cyril Gavoille:
Interval Routing Schemes. 155-182 - Arvind Gupta, Naomi Nishimura:
Finding Largest Subtrees and Smallest Supertrees. 183-210 - Liang-Fang Chao, Andrea S. LaPaugh:
Finding All Minimal Shapes in a Routing Channel. 211-244
Volume 21, Number 3, July 1998
- Steven J. Phillips, Jeffery R. Westbrook:
On-Line Load Balancing and Network Flow. 245-261 - Tao Jiang, Richard M. Karp:
Mapping Clones with a Given Ordering or Interleaving. 262-284 - Christos Levcopoulos, Drago Krznaric:
A Linear-Time Approximation Scheme for Minimum, Weight Triangulation of Convex Polygons. 285-311 - Susanne Albers, Michael Mitzenmacher:
Average Case Analyses of List Update Algorithms, with Applications to Data Compression. 312-329
Volume 21, Number 4, August 1998
- Joel Friedman:
Computing Betti Numbers via Combinatiorial Laplacians. 331-346 - Ishai Ben-Aroya, Donald D. Chinn, Assaf Schuster:
A Lower Bound for Nearly Minimal Adaptive and Hot Potato Algorithms. 347-376 - Sanjeev Khanna, Rajeev Motwani, Randall H. Wilson:
On Certificates and Lookahead in Dynamic Graph Problems. 377-394 - Ka Wong Chong, Tak Wah Lam:
Approximating Biconnectivity in Parallel. 395-410
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 2024-04-25 05:28 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:
