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=1991
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Retiming synchronous circuitry
Charles E. Leiserson
,
James B. Saxe
Algorithmica
6
(1), 1991, pp. 5-35
Partitioning circuits for improved testability
Sandeep N. Bhatt
,
Fan R.K. Chung
,
Arnold L. Rosenberg
Algorithmica
6
(1), 1991, pp. 37-48
Optimal tradeoffs for addition on systolic arrays
Alok Aggarwal
,
J. Lawrence Carter
,
S. Rao Kosaraju
Algorithmica
6
(1), 1991, pp. 49-71
Multiterminal global routing: A deterministic approximation scheme
Prabhakar Raghavan
,
Clark D. Thompson
Algorithmica
6
(1), 1991, pp. 73-82
Optimal multilayer channel routing with overlap
Martin L. Brady
,
Donna J. Brown
Algorithmica
6
(1), 1991, pp. 83-101
A generic algorithm for one-dimensional homotopic compaction
F. Miller Maley
Algorithmica
6
(1), 1991, pp. 103-128
Multilayer grid embeddings for VLSI
Alok Aggarwal
,
Maria Klawe
,
Peter Shor
Algorithmica
6
(1), 1991, pp. 129-151
Search directions for interior linear-programming methods
Clovis C. Gonzaga
Algorithmica
6
(2), 1991, pp. 153-181
Moving a disc between polygons
Hans Rohnert
Algorithmica
6
(2), 1991, pp. 182-191
Probabilistic analysis of a grouping algorithm
D.F. Wong
,
Edward M. Reingold
Algorithmica
6
(2), 1991, pp. 192-206
An
O(n\log n)
plane-sweep algorithm for
L_1
and
L_\infty
Delaunay triangulations
Gary M. Shute
,
Linda L. Deneen
,
Clark D. Thomborson
Algorithmica
6
(2), 1991, pp. 207-221
FFD bin packing for item sizes with uniform distributions on
[0,\frac{1}{2}]
Sally Floyd
,
Richard M. Karp
Algorithmica
6
(2), 1991, pp. 222-240
A lower bound on the area of permutation layouts
Alok Aggarwal
,
Maria Klawe
,
David Lichtenstein
,
Nathan Linial
,
Avi Wigderson
Algorithmica
6
(2), 1991, pp. 241-255
On the height of digital trees and related problems
Wojciech Szpankowski
Algorithmica
6
(2), 1991, pp. 256-277
Stochastic rearrangement rules for self-organizing data structures
Sanjiv Kapoor
,
Edward M. Reingold
Algorithmica
6
(2), 1991, pp. 278-291
A theoretical framework for simulated annealing
Fabio Romeo
,
Alberto Sangiovanni-Vincentelli
Algorithmica
6
(3), 1991, pp. 302-345
Analysis of finite length annealing schedules
Philip N. Strenski
,
Scott Kirkpatrick
Algorithmica
6
(3), 1991, pp. 346-366
Efficient simulated annealing on fractal energy landscapes
Gregory B. Sorkin
Algorithmica
6
(3), 1991, pp. 367-418
Simulated annealing type algorithms for multivariate optimization
Saul B. Gelfand
,
Sanjoy K. Mitter
Algorithmica
6
(3), 1991, pp. 419-436
Boltzmann machines as a model for parallel annealing
Emile H.L. Aarts
,
Jan H.M. Korst
Algorithmica
6
(3), 1991, pp. 437-465
Stochastic neural networks
Eugene Wong
Algorithmica
6
(3), 1991, pp. 466-478
Large parallel machines can be extremely slow for small problems
Vince Grolmusz
Algorithmica
6
(4), 1991, pp. 479-489
Order-
k
Voronoi diagrams of sites with additive weights in the plane
Harald Rosenberger
Algorithmica
6
(4), 1991, pp. 490-521
On sorting triangles in a Delaunay tessellation
Leila de Floriani
,
Bianca Falcidieno
,
George Nagy
,
Caterina Pienovi
Algorithmica
6
(4), 1991, pp. 522-532
Convex hulls of objects bounded by algebraic curves
Chanderjit Bajaj
,
Myung-Soo Kim
Algorithmica
6
(4), 1991, pp. 533-553
Seiten 1
2
>