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=J. Algorithms AND Volume=25
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Tight bounds for the maximum acyclic subgraph problem
Bonnie Berger
,
Peter W. Shor
Journal of Algorithms
25
(1), 1997, pp. 1-18
A reliable randomized algorithm for the closest-pair problem
Martin Dietzfelbinger
,
Torben Hagerup
,
Jyrki Katajainen
,
Martti Penttonen
Journal of Algorithms
25
(1), 1997, pp. 19-51
Gray codes for the ideals of interval orders
Michel Habib
,
Lhouari Nourine
,
George Steiner
Journal of Algorithms
25
(1), 1997, pp. 52-66
On the diameter of the pancake network
Mohammad H. Heydari
,
I. Hal Sudborough
Journal of Algorithms
25
(1), 1997, pp. 67-94
Optimal time-space tradeoff for shared memory leader election
Yehuda Afek
,
Gideon Stupp
Journal of Algorithms
25
(1), 1997, pp. 95-117
Approximate set covering in uniform hypergraphs
Michael Krivelevich
Journal of Algorithms
25
(1), 1997, pp. 118-143
An efficient algorithm for controller synthesis under full observation
M. Barbeau
,
F. Kabanza
,
R. St-Denis
Journal of Algorithms
25
(1), 1997, pp. 144-161
Coins with arbitrary weights
Noga Alon
,
Dmitry N. Kozlov
Journal of Algorithms
25
(1), 1997, pp. 162-176
On a simple, practical, optimal, output-sensitive randomized planar convex hull algorithm
Binay K. Bhattacharya
,
Sandeep Sen
Journal of Algorithms
25
(1), 1997, pp. 177-193
Dictionary look-up with one error
Andrew C. Yao
,
Frances F. Yao
Journal of Algorithms
25
(1), 1997, pp. 194-202
A randomized parallel algorithm for single-source shortest paths
Philip N. Klein
,
Sairam Subramanian
Journal of Algorithms
25
(2), 1997, pp. 205-220
Computing the principal branch of log-Gamma
D.E.G. Hare
Journal of Algorithms
25
(2), 1997, pp. 221-236
A tight analysis of the greedy algorithm for set cover
Petr Slavík
Journal of Algorithms
25
(2), 1997, pp. 237-254
Improved approximation algorihtms for tree alignment
Lusheng Wang
,
Dan Gusfield
Journal of Algorithms
25
(2), 1997, pp. 255-273
Greedy algorithms for on-line data compression
József Békési
,
Gábor Galambos
,
Ulrich Pferschy
,
Gerhard J. Woeginger
Journal of Algorithms
25
(2), 1997, pp. 274-289
On two dimensional packing
Yossi Azar
,
Leah Epstein
Journal of Algorithms
25
(2), 1997, pp. 290-310
A parallel randomized algorithm for finding a maximal independent set in a linear hypergraph
Tomasz Łuczak
,
Edyta Szymańska
Journal of Algorithms
25
(2), 1997, pp. 311-320
Generating multiset permutations in constant time
James Korsh
,
Seymour Lipschutz
Journal of Algorithms
25
(2), 1997, pp. 321-335
An
O(m+n\log n)
algorithm for the maximum-clique problem in circular-arc graphs
Binay K. Bhattacharya
,
Damon Kaller
Journal of Algorithms
25
(2), 1997, pp. 336-358