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=11
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the power of randomization in on-line algorithms
S. Ben-David
,
A. Borodin
,
R. Karp
,
G. Tardos
,
A. Wigderson
Algorithmica
11
(1), 1994, pp. 2-14
Randomized competitive algorithms for the list update problem
Nick Reingold
,
Jeffery Westbrook
,
Daniel D. Sleator
Algorithmica
11
(1), 1994, pp. 15-32
On-line algorithms for locating checkpoints
Marshall Bern
,
Daniel H. Greene
,
Arvind Raghunathan
,
Madhu Sudan
Algorithmica
11
(1), 1994, pp. 33-52
Coloring inductive graphs on-line
Sandy Irani
Algorithmica
11
(1), 1994, pp. 53-72
A new measure for the study of on-line algorithms
S. Ben-David
,
A. Borodin
Algorithmica
11
(1), 1994, pp. 73-91
Dynamic programming and convex clustering
Vladimir Batagelj
,
Simona Korenjak-C̑erne
,
Sandi Klavz̑ar
Algorithmica
11
, 1994, pp. 93-103
A tight lower bound for the worst case of Bottom-Up-Heapsort
Rudolf Fleischer
Algorithmica
11
, 1994, pp. 104-115
Algorithms for bichromatic line-segment problems and polyhedral terrains
Bernard Chazelle
,
Herbert Edelsbrunner
,
Leonidas J. Guibas
,
Micha Sharir
Algorithmica
11
, 1994, pp. 116-132
Variations on ray shooting
Reuven Bar-Yehuda
,
Sergio Fogel
Algorithmica
11
, 1994, pp. 133-145
The derivation of on-line algorithms, with an application to finding palindromes
Johan Jeuring
Algorithmica
11
, 1994, pp. 146-184
Planar geometric location problems
Pankaj K. Agarwal
,
Micha Sharir
Algorithmica
11
, 1994, pp. 185-195
Flow in planar graphs with vertex capacities
Samir Khuller
,
Joseph (Seffi) Naor
Algorithmica
11
, 1994, pp. 200-225
Tight bounds on the number of minimum-mean cycle cancellations and related results
Tomasz Radzik
,
Andrew V. Goldberg
Algorithmica
11
, 1994, pp. 226-242
A new scaling algorithm for the maximum mean cut problem
Kazuo Iwano
,
Shinji Misono
,
Shu Tezuka
,
Satoru Fujishige
Algorithmica
11
, 1994, pp. 243-255
Efficient algorithms for minimum-cost flow problems with piecewise-linear convex costs
Yaron Pinto
,
Ron Shamir
Algorithmica
11
, 1994, pp. 256-277
A faster parametric minimum-cut algorithm
Dan Gusfield
,
Éva Tardos
Algorithmica
11
, 1994, pp. 278-290
Network flow and 2-satisfiability
Tomás Feder
Algorithmica
11
, 1994, pp. 291-319
Algorithms and complexity analysis for some flow problems
Edith Cohen
,
Nimrod Megiddo
Algorithmica
11
, 1994, pp. 320-340
A linear algorithm for analysis of minimum spanning and shortest-path trees of planar graphs
Heather Booth
,
Jeffery Westbrook
Algorithmica
11
, 1994, pp. 341-352
On the complexity of preflow-push algorithms for maximum-flow problems
Levent Tunçel
Algorithmica
11
, 1994, pp. 353-359
Visibility with a moving point of view
Marshall Bern
,
David Dobkin
,
David Eppstein
,
Robert Grossman
Algorithmica
11
, 1994, pp. 360-378
Edge crossings in drawings of bipartite graphs
Peter Eades
,
Nicholas C. Wormald
Algorithmica
11
, 1994, pp. 379-403
A workbench for computational geometry
P. Epstein
,
J. Kavanagh
,
A. Knight
,
J. May
,
T. Nguyen
,
J.-R. Sack
Algorithmica
11
, 1994, pp. 404-428
Provably good pattern generators for a random pattern test
Thomas H. Spencer
Algorithmica
11
, 1994, pp. 429-442
Finding the closed partition of a planar graph
Vijaya Ramachandran
,
Honghua Yang
Algorithmica
11
, 1994, pp. 443-468
Seiten 1
2
>