Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Algorithmica AND Volume=5
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
An improved parallel algorithm for integer GCD
Benny Chor
,
Oded Goldreich
Algorithmica
5
, 1990, pp. 1-10
Approximation algorithms for partitioning a rectangle with interior points
Teofilo Gonzalez
,
Si-Qing Zheng
Algorithmica
5
, 1990, pp. 11-42
Efficient parallel algorithms for graph problems
Clyde P. Kruskal
,
Larry Rudolph
,
Marc Snir
Algorithmica
5
, 1990, pp. 43-64
A new algorithm for the largest empty rectangle problem
M. Orlowski
Algorithmica
5
, 1990, pp. 65-73
Improved sorting networks with
O(\log N)
depth
M.S. Paterson
Algorithmica
5
, 1990, pp. 75-92
On the complexity of embedding planar graphs to minimize certain distance measures
Daniel Bienstock
,
Clyde L. Monma
Algorithmica
5
, 1990, pp. 93-109
On heuristics for minimum length rectilinear partitions
Dingzhu Du
,
Yanjun Zhang
Algorithmica
5
, 1990, pp. 111-128
Efficient parallel algorithms for
r
-dominating set and
p
-center problems on trees
Xin He
,
Yaacov Yesha
Algorithmica
5
, 1990, pp. 129-145
An algorithm for constructing Gröbner bases from characteristic sets and its application to geometry
Shang-Ching Chou
,
William F. Schelter
,
Jin-Gen Yang
Algorithmica
5
, 1990, pp. 147-154
Parallel geometric algorithms on a mesh-connected computer
C.S. Jeong
,
D.T. Lee
Algorithmica
5
, 1990, pp. 155-177
Solving some combinatorial problems on arrays with one-way dataflow
Carla D. Savage
,
Matthias Stallmann
,
Jo Ellen Perry
Algorithmica
5
, 1990, pp. 179-199
A fast algorithm for computing sparse visibility graphs
S. Sudarshan
,
C. Pandu Rangan
Algorithmica
5
, 1990, pp. 201-214
Dynamic fractional cascading
Kurt Mehlhorn
,
Stefan Näher
Algorithmica
5
, 1990, pp. 215-241
An optimal time bound for oblivious routing
Ian Parberry
Algorithmica
5
, 1990, pp. 243-250
Internal and external algorithms for the points-in-regions problem - the INSIDE join of geo-relational algebra
Gabriele Blankenagel
,
Ralf Hartmut Güting
Algorithmica
5
, 1990, pp. 251-276
Dynamic detection of subgraphs in computer networks
Israel Cidon
,
Inder S. Gopal
Algorithmica
5
, 1990, pp. 277-294
Analysis of the standard deletion algorithms in exact fit domain binary search trees
Joseph Culberson
,
J. Ian Munro
Algorithmica
5
, 1990, pp. 295-311
A linear-time algorithm for finding approximate shortest common superstrings
Esko Ukkonen
Algorithmica
5
, 1990, pp. 313-323
Asynchronous distributed termination - Parallel and symmetric solutions with echo algorithm
Friedemann Mattern
Algorithmica
5
, 1990, pp. 325-340
An optimal approximation algorithm for the rectilinear
m
-center problem
M.T. Ko
,
R.C.T. Lee
,
J.S. Chang
Algorithmica
5
, 1990, pp. 341-352
The complexity of planar compliant motion planning under uncertainty
Bruce R. Donald
Algorithmica
5
, 1990, pp. 353-382
An efficient distributed algorithm for maximum matching in general graphs
Michael M. Wu
,
Michael C. Loui
Algorithmica
5
, 1990, pp. 383-406
Computing Euclidean maximum spanning trees
Clyde Monma
,
Michael Paterson
,
Subhash Suri
,
Frances Yao
Algorithmica
5
, 1990, pp. 407-419
Computational geometry in a curved world
David P. Dobkin
,
Diane L. Souvaine
Algorithmica
5
, 1990, pp. 421-457
A better performance guarantee for approximate graph coloring
Bonnie Berger
,
John Rompel
Algorithmica
5
, 1990, pp. 459-466
Seiten 1
2
>