Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science
Latest Publications

TOTAL DOCUMENTS

(FIVE YEARS 0)

H-INDEX

(FIVE YEARS 0)

Published By Springer Berlin Heidelberg

9783540582182, 9783540485773

Latest Documents Most Cited Documents Contributed Authors Related Sources Related Keywords

New on-line algorithms for the page replication problem

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_3 ◽

1994 ◽

pp. 25-36 ◽

Cited By ~ 4

Author(s):

Susanne Albers ◽

Hisashi Koga

Keyword(s):

On Line

Download Full-text

The parallel hierarchical memory model

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_22 ◽

1994 ◽

pp. 240-251 ◽

Cited By ~ 2

Author(s):

Ben H. H. Juurlink ◽

Harry A. G. Wijshoff

Keyword(s):

Memory Model ◽

Hierarchical Memory

Download Full-text

Sequential and parallel algorithms for embedding problems on classes of partial k-trees

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_16 ◽

1994 ◽

pp. 172-182 ◽

Cited By ~ 13

Author(s):

Arvind Gupta ◽

Naomi Nishimura

Keyword(s):

Parallel Algorithms

Download Full-text

On triangulating planar graphs under the four-connectivity constraint

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_8 ◽

1994 ◽

pp. 83-94 ◽

Cited By ~ 3

Author(s):

Therese Biedl ◽

Goos Kant ◽

Michael Kaufmann

Keyword(s):

Planar Graphs ◽

Connectivity Constraint

Download Full-text

A new algorithm for the construction of optimal B-trees

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_5 ◽

1994 ◽

pp. 49-60 ◽

Cited By ~ 1

Author(s):

Peter Becker

Keyword(s):

B Trees

Download Full-text

An O(log log n) algorithm to compute the kernel of a polygon

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_29 ◽

1994 ◽

pp. 314-325

Author(s):

S. Schuierer

Download Full-text

Hard graphs for randomized subgraph exclusion algorithms

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_26 ◽

1994 ◽

pp. 278-289

Author(s):

Marcus Peinado

Download Full-text

Asymptotically optimal election on weighted rings

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_19 ◽

1994 ◽

pp. 207-218 ◽

Cited By ~ 1

Author(s):

Lisa Higham ◽

Teresa Przytycka

Keyword(s):

Asymptotically Optimal

Download Full-text

A tight lower bound for on-line monotonic list labeling

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_12 ◽

1994 ◽

pp. 131-142 ◽

Cited By ~ 6

Author(s):

Paul F. Dietz ◽

Joel I. Seiferas ◽

Ju Zhang

Keyword(s):

Lower Bound ◽

On Line

Download Full-text

Improved approximations of independent sets in bounded-degree graphs

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science ◽

10.1007/3-540-58218-5_18 ◽

1994 ◽

pp. 195-206 ◽

Cited By ~ 7

Author(s):

Magnús M. Halldórsson ◽

Jaikumar Radhakrishnan

Keyword(s):

Independent Sets ◽

Bounded Degree ◽

Bounded Degree Graphs

Download Full-text

Algorithm Theory — SWAT '94 - Lecture Notes in Computer ScienceLatest Publications

TOTAL DOCUMENTS

H-INDEX

Published By Springer Berlin Heidelberg

New on-line algorithms for the page replication problem

The parallel hierarchical memory model

Sequential and parallel algorithms for embedding problems on classes of partial k-trees

On triangulating planar graphs under the four-connectivity constraint

A new algorithm for the construction of optimal B-trees

An O(log log n) algorithm to compute the kernel of a polygon

Hard graphs for randomized subgraph exclusion algorithms

Asymptotically optimal election on weighted rings

A tight lower bound for on-line monotonic list labeling

Improved approximations of independent sets in bounded-degree graphs

Algorithm Theory — SWAT '94 - Lecture Notes in Computer Science
Latest Publications