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=15
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Testing homotopic routability under polygonal wiring rules
F.M. Maley
Algorithmica
15
(1), 1996, pp. 1-16
The optimal control approach to generalized multiprocessor scheduling
G.N. Srinivasa Prasanna
,
B.R. Musicus
Algorithmica
15
(1), 1996, pp. 17-49
A subquadratic algorithm for approximate limited expression matching
Sun Wu
,
U. Manber
,
G. Myers
Algorithmica
15
(1), 1996, pp. 50-67
Fast algorithms for minimum matrix norm with application in computer graphics
Shouwen Tang
,
Kaizhong Zhang
,
Xiaolin Wu
Algorithmica
15
(1), 1996, pp. 68-81
Using topological sweep to extract the boundaries of regions in maps represented by region quadtrees
M.B. Dillencourt
,
H. Samet
Algorithmica
15
(1), 1996, pp. 82-102
Parallel algorithms for arrangements
R. Anderson
,
P. Beame
,
E. Brisson
Algorithmica
15
, 1996, pp. 104-125
Sweep methods for parallel computational geometry
M.T. Goodrich
,
M.R. Ghouse
,
J. Bright
Algorithmica
15
, 1996, pp. 126-153
Optimal cooperative search in fractional cascaded data structures
R. Tamassia
,
J.S. Vitter
Algorithmica
15
, 1996, pp. 154-171
Parallel construction of binary trees with near optimal weighted path length
D.G. Kirkpatrick
,
T. Przytycka
Algorithmica
15
, 1996, pp. 172-192
Preconditioning index set transformations for time-optimal affine scheduling
B. Lisper
Algorithmica
15
, 1996, pp. 193-203
A constrained edit distance between unordered labeled trees
Kaizhong Zhang
Algorithmica
15
, 1996, pp. 205-222
Incremental topological flipping works for regular triangulations
H. Edelsbrunner
,
N.R. Shah
Algorithmica
15
, 1996, pp. 223-241
Optimal parallel algorithm for finding
st
-ambitus of a planar biconnected graph
K.S. Easwarakumar
,
S.V. Krishnan
,
C. Pandu Rangan
,
S. Seshadri
Algorithmica
15
, 1996, pp. 242-255
Bidirectional edges problem: Part I - A simple algorithm
B. Mishra
Algorithmica
15
, 1996, pp. 256-286
Designing checkers for programs that run in parallel
R. Rubinfeld
Algorithmica
15
, 1996, pp. 287-301
On-line maintenance of triconneted components with SPQR-trees
G. di Battista
,
R. Tamassia
Algorithmica
15
, 1996, pp. 302-318
Fast deterministic selection on mesh-connected processor arrays
D. Krizanc
,
L. Narayanan
,
R. Raman
Algorithmica
15
, 1996, pp. 319-331
The implementation of linear programming algorithms based on homotopies
J.L. Nazareth
Algorithmica
15
, 1996, pp. 332-350
A paradigm for listing
(s,t)
-cuts in graphs
J.S. Provan
,
D.R. Shier
Algorithmica
15
, 1996, pp. 351-372
Scheduling tree dags on parallel architectures
K. Kalpakis
,
Y. Yesha
Algorithmica
15
, 1996, pp. 373-396
Weighted and unweighted maximum clique algorithms with upper bounds from fractional coloring
E. Balas
,
Jue Xue
Algorithmica
15
, 1996, pp. 397-412
Strongly adaptive token distribution
F. Meyer auf der Heide
,
B. Oesterdiekhoff
,
R. Wanka
Algorithmica
15
, 1996, pp. 413-427
Lines in space: Combinatorics and algorithms
B. Chazelle
,
H. Edelsbrunner
,
L.J. Guibas
,
M. Sharir
,
J. Stolfi
Algorithmica
15
, 1996, pp. 428-447
Searching among intervals and compact routing tables
G.N. Frederickson
Algorithmica
15
, 1996, pp. 448-466
Recurrence relations on heaps
R. Sprugnoli
Algorithmica
15
, 1996, pp. 467-480
Seiten 1
2
>