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
[2]
Hilfe
Suche: Author="Baker, B.S."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Polygon containment under translation
B.S. Baker
,
S.J. Fortune
,
S.R. Mahaney
Journal of Algorithms
7
(4), 1986, December, pp. 532-548
A provably good algorithm for the two module routing problem
B.S. Baker
SIAM Journal on Computing
15
(1), 1986, February, pp. 162-188
Algorithms for resolving conflicts in dynamic storage allocation
B.S. Baker
,
E.G., Jr. Coffman
,
D.E. Willard
Journal of the ACM
32
(2), 1985, pp. 327-343
Stable prehension with three fingers
B.S. Baker
,
S. Fortune
,
E. Grosse
Proceedings of the 17th Annual ACM Symposium on Theory of Computing, STOC'85 (Providence, RI, May 6-8, 1985)
, 1985, pp. 114-120
A new proof for the first-fit decreasing bin-packing algorithm
B.S. Baker
Journal of Algorithms
6
(1), 1985, March, pp. 49-70
Insertion and compaction algorithms in sequentially allocated storage
B.S. Baker
,
E.G., Jr. Coffman
SIAM Journal on Computing
13
(3), 1984, August, pp. 600-609
An approximation algorithm for Manhattan routing
B.S. Baker
,
S.N. Bhatt
,
F.T. Leighton
Proceedings of the 15th Annual ACM Symposium on Theory of Computing, STOC'83 (Boston, MA, May 25-27, 1983)
, 1983, pp. 477-486
Approximation algorithms for maximizing the number of squares packed into a rectangle
B.S. Baker
,
A.R. Calderbank
,
E.G., Jr. Coffman
,
J.C. Lagarias
SIAM Journal on Algebraic Discrete Methods
4
, 1983, pp. 383-397
An algorithm for the optimal placement and routing of a circuit within a ring of pads
B.S. Baker
,
R.Y. Pinter
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 360-370
Shelf algorithms for two-dimensional packing problems
B.S. Baker
,
J.S. Schwarz
SIAM Journal on Computing
12
(3), 1983, August, pp. 508-525
Approximation algorithms for
NP
-complete problems on planar graphs
B.S. Baker
Proceedings of the 24th Annual IEEE Symposium on Foundations of Computer Science, FOCS'83 (Tucson, AZ, November 7-9, 1983)
, 1983, pp. 265-273
A two-dimensional bin-packing model of preemptive, FIFO storage allocation
B.S. Baker
,
E.G., Jr. Coffman
Journal of Algorithms
3
(4), 1982, December, pp. 303-316
Lower bounds for on-line two-dimensional packing algorithms
D.J. Brown
,
B.S. Baker
,
H.P. Katseff
Acta Informatica
18
(2), 1982, pp. 207-225
A tight asymptotic bound for next-fit-decreasing bin-packing
B.S. Baker
,
E.G., Jr. Coffman
SIAM Journal on Algebraic Discrete Methods
2
(2), 1981, June, pp. 147-152
Orthogonal packings in two dimensions
B.S. Baker
,
E.G., Jr. Coffman
,
R.L. Rivest
SIAM Journal on Computing
9
(4), 1980, November, pp. 846-855
A comparison of multilevel break and next statements
B.S. Baker
,
S.R. Kosaraju
Journal of the ACM
26
, 1979, pp. 555-566
Generalized syntax directed translation, tree transducers, and linear space
B.S. Baker
SIAM Journal on Computing
7
(3), 1978, August, pp. 376-391
An algorithm for structuring flowgraphs
B.S. Baker
Journal of the ACM
24
, 1977, pp. 98-120
Tree transductions and families of tree languages
B.S. Baker
Proceedings of the 5th Annual ACM Symposium on Theory of Computing, STOC'73 (Austin, TX, April 30 - May 2, 1973)
, 1973, pp. 200-206