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 YEAR=1995
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Staircase visibility and computation of kernels
S. Schuierer
,
D. Wood
Algorithmica
14
(1), 1995, pp. 1-26
Characterizing and recognizing the visibility graph of a funnel-shaped polygon
Seung-Hak Choi
,
Sung Yong Shin
,
Kyung-Yong Chwa
Algorithmica
14
(1), 1995, pp. 27-51
O(\log\log n)
-time integer geometry on the CRCW PRAM
B.S. Chlebus
,
K. Diks
,
M. Kowaluk
Algorithmica
14
(1), 1995, pp. 52-69
Can PAC learning algorithms tolerate random attribute noise?
S.A. Goldman
,
R.H. Sloan
Algorithmica
14
(1), 1995, pp. 70-84
Approximate regular expression pattern matching with concave gap penalties
J.R. Knight
,
E.W. Myers
Algorithmica
14
(1), 1995, pp. 85-121
Generation of polynomial-time algorithms for some optimization problems on tree-decomposable graphs
R.B. Borie
Algorithmica
14
, 1995, pp. 123-137
Isomorphic tree spanner problems
L. Cai
,
D. Corneil
Algorithmica
14
, 1995, pp. 138-153
Lower bounds for set intersection queries
P. Dietz
,
K. Mehlhorn
,
R. Raman
,
C. Uhrig
Algorithmica
14
, 1995, pp. 154-168
A time-optimal parallel algorithm for three-dimensional convex hulls
N.M. Amato
,
F.P. Preparata
Algorithmica
14
, 1995, pp. 169-182
Finding a closest visible vertex pair between two polygons
N.M. Amato
Algorithmica
14
, 1995, pp. 183-201
A linear-time algorithm for constructing a circular visibility diagram
Shuo-Yan Chou
,
T.C. Woo
Algorithmica
14
, 1995, pp. 203-228
An
O(n^2)
incremental algorithm for modular decomposition of graphs and 2-structures
R.M. McConnell
Algorithmica
14
, 1995, pp. 229-248
On-line construction of suffix trees
E. Ukkonen
Algorithmica
14
, 1995, pp. 249-260
Optimal parallel algorithms for rectilinear link-distance problems
A. Lingas
,
A. Maheshwari
,
J.-R. Sack
Algorithmica
14
, 1995, pp. 261-289
A
2n-2
step algorithm for routing in an
n\times n
array with constant-size queues
T. Leighton
,
F. Makedon
,
I.G. Tollis
Algorithmica
14
, 1995, pp. 291-304
Balancing minimum spanning trees and shortest-path trees
S. Khuller
,
B. Raghavachari
,
N. Young
Algorithmica
14
, 1995, pp. 305-321
An efficient parallel algorithm for shortest paths in planar layered digraphs
S. Subramanian
,
R. Tamassia
,
J.S. Vitter
Algorithmica
14
, 1995, pp. 322-339
Bottom-up mergesort - A detailed analysis
W. Panny
,
H. Prodinger
Algorithmica
14
, 1995, pp. 340-354
Finding all periods and initial palindromes of a string in parallel
D. Breslauer
,
Z. Galil
Algorithmica
14
, 1995, pp. 355-366
The complexity of oblivious plans for orienting and distinguishing polygonal parts
Yui-Bin Chen
,
D.J. Ierardi
Algorithmica
14
, 1995, pp. 367-397
An optimal parallel algorithm for planar cycle separators
Ming-Yang Kao
,
Shang-Hua Teng
,
K. Toyama
Algorithmica
14
, 1995, pp. 398-408
Minimean optimal key arrangements in hash tables
A.C.-C. Yao
Algorithmica
14
, 1995, pp. 409-428
An optimal algorithm for shortest paths on weighted interval and circular-arc graphs, with applications
M.J. Atallah
,
D.Z. Chen
,
D.T. Lee
Algorithmica
14
, 1995, pp. 429-441
Provably good approximation algorithms for optimal kinodynamic planning: Robots with decoupled dynamics bounds
B.R. Donald
,
P.G. Xavier
Algorithmica
14
, 1995, pp. 443-479
Provably good approximation algorithms for optimal kinodynamic planning for Cartesian robots and open-chain manipulators
B.R. Donald
,
P.G. Xavier
Algorithmica
14
, 1995, pp. 480-530
Seiten 1
2
3
>