bibliography bsb
-
B. S. Baker and R. Shostak,
Gossips and Telephones,
Discrete Math.,
Vol. 2,
3,
pp. 191--193,
June 1972.
-
B. S. Baker and R. V. Book,
Reversal-Bounded Multi-pushdown Machines,
Proc. 13th Annual Symposium on Switching and Automata Theory,
pp. 207--211,
October 1972.
-
B. S. Baker,
Tree Transductions and Families of Tree Languages,
rm Ph.D. Dissertation Harvard University Cambridge Massachusetts,
1973.
-
B. S. Baker,
Tree Transductions and Families of Tree Languages,
Proc. 5th Annual ACM Symp. on Theory of Computing,
pp. 200--206,
May 1973.
-
B. S. Baker,
Non-Context-Free Grammars Generating Context-Free Languages,
Information and Control,
Vol. 24,
3,
pp. 231--246,
March 1974.
-
B. S. Baker and R. V. Book,
Reversal-Bounded Multipushdown Machines,
J. Comp. Sys. Sci.,
Vol. 8,
3,
pp. 315--332,
June 1974.
-
B. S. Baker,
An Algorithm for Structuring Programs: Extended Abstract,
Proc. 3rd ACM Symposium on Principles of Programming Languages,
pp. 98--120,
January 1976.
-
B. S. Baker and S. R. Kosaraju,
A Comparison of Multilevel Break and Next Statements,
Proc. Conf. on Information Sciences and Systems,
pp. 213--218,
1977.
-
B. S. Baker,
An Algorithm for Structuring Flowgraphs,
J. Assoc. Comp. Mach.,
Vol. 24,
1,
pp. 98--120,
January 1977.
-
B. S. Baker,
Tree Transducers and Tree Languages,
Info. and Control,
Vol. 37,
3,
pp. 241--266,
June 1978.
-
B. S. Baker,
Generalized Syntax-Directed Translation Tree Transducers and Linear Space,
SIAM J. Comput.,
Vol. 7,
3,
pp. 376--391,
August 1978.
-
B. S. Baker and Coffman Jr. E. G. and R. L. Rivest,
Orthogonal Packings in Two Dimensions,
Proc. 16th Annual Allerton Conf. on Communication Control and Computing,
pp. 626--635,
October 1978.
-
B. S. Baker and D. J. Brown and H. P. Katseff,
The Up-Down Algorithm for Two-Dimensional Bin Packing,
Proc. 17th Annual Allerton Conf. on Communication Control and Computing,
October 1979.
-
B. S. Baker and D. J. Brown and H. P. Katseff,
Lower Bounds for On-Line Two-Dimensional Packing Algorithms,
Proc. Conf. on Inf. Sci. and Sys.,
pp. 174--179,
March 1979.
-
B. S. Baker and J. S. Schwarz,
Shelf Algorithms for Two-Dimensional Packing Problems,
Proc. Conf. on Inf. Sci. and Sys.,
pp. 273--276,
March 1979.
-
B. S. Baker,
Composition of Top-Down and Bottom-Up Tree Transductions,
Info. and Control,
Vol. 41,
2,
pp. 186--213,
May 1979.
-
B. S. Baker and S. R. Kosaraju,
A Comparison of Multilevel Break and Next Statements,
J. Assoc. Comput. Mach.,
Vol. 26,
3,
pp. 555--566,
July 1979.
-
B. S. Baker and Coffman Jr. E. G. and R. L. Rivest,
Orthogonal Packings in Two Dimensions,
SIAM J. on Computing,
Vol. 9,
4,
pp. 846--855,
November 1980.
-
B. S. Baker and D. J. Brown and H. P. Katseff,
A 5 4 Algorithm for Two-Dimensional Packing,
J. of Algorithms,
Vol. 2,
pp. 348--368,
1981.
-
B. S. Baker and Coffman Jr. E. G.,
A Tight Asymptotic Bound for Next-Fit-Decreasing Bin-Packing,
SIAM J. on Algebraic and Discrete Methods,
Vol. 2,
2,
pp. 147--152,
June 1981.
-
B. S. Baker and D. J. Brown and H. P. Katseff,
Lower Bounds for On-Line Two-Dimensional Packing Algorithms,
it Acta Informatica,
pp. 207-225.
-
B. S. Baker and Coffman Jr. E. G.,
A Two Dimensional Bin-Packing Model of Preemptive Fifo Storage Allocation,
J. of Algorithms,
Vol. 3,
pp. 303--316,
1982.
-
B. S. Baker and A. R. Calderbank and Coffman Jr. E. G. and J. C. Lagarias,
Approximation Algorithms for Maximizing the Number of Squares Packed into a Rectangle,
SIAM J. on Algebraic and Discrete Methods,
Vol. 4,
3,
pp. 383--397,
September 1983.
-
B. S. Baker and J. S. Schwarz,
Shelf Algorithms for Two-Dimensional Packing Problems,
SIAM J. Comp.,
Vol. 12,
3,
pp. 508--525,
1983.
-
B. S. Baker and S. N. Bhatt and F. T. Leighton,
An Approximation Algorithm for Manhattan Routing,
Proc. 15th Annual Symp. on Theory of Computing,
pp. 477--486,
1983.
-
B. S. Baker and R. Y. Pinter,
An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads,
Proc. of 24th Annual Symp. on Foundations of Computer Science,
pp. 360--370,
1983.
-
B. S. Baker,
Approximation Algorithms for NP -complete Problems on Planar Graphs,
Proc. of 24th Annual Symp. on Foundations of Computer Science,
pp. 265--273,
1983.
-
B. S. Baker and Coffman Jr. E. G.,
Insertion and Compaction Algorithms in Sequentially Allocated Storage,
SIAM J. on Computing,
Vol. 13,
3,
pp. 600--609,
August 1984.
-
B. S. Baker and S. J. Fortune and S. Mahaney,
Inspection by Polygon Containment,
Proc. of 22nd Annual Allerton Conf. on Communication Control and Computing,
October 1984.
-
B. S. Baker,
A New Proof for the First-Fit Decreasing Bin-Packing Algorithm,
J. of Algorithms,
Vol. 6,
1,
pp. 49--70,
March 1985.
-
B. S. Baker and Coffman Jr. E. G. and D. E. Willard,
Algorithms for Allocating Fragmented Storage,
J. Assoc. Comput. Mach.,
Vol. 32,
2,
pp. 327--343,
April 1985.
-
B. S. Baker and S. J. Fortune and E. H. Grosse,
Stable Prehension with a Multi-Fingered Hand,
Proc. Int l Conf. on Robotics and Automation,
pp. 570--575,
St. Louis MO,
March 1985.
-
B. S. Baker and S. J. Fortune and E. H. Grosse,
Stable Prehension with Three Fingers,
Proc. 17th Symp. on Theory of Computing,
pp. 114--120,
1985.
-
B. S. Baker and S. N. Bhatt and F. T. Leighton,
An Approximation Algorithm for Manhattan Routing,
Advances in Computing Research Vol. 2: VLSI Theory,
Ed. F. Preparata,
JAI Press,
1985.
-
B. S. Baker,
A Provably Good Algorithm for the Two Module Routing Problem,
SIAM J. on Computing,
Vol. 15,
1,
pp. 162--188,
February 1986.
-
B. S. Baker and S. J. Fortune and S. R. Mahaney,
Polygon Containment under Translation,
J. of Algorithms,
Vol. 7,
4,
pp. 532--548,
1986.
-
B. S. Baker and E. H. Grosse and C. Rafferty,
Non-obtuse Triangulation of Polygons,
Discrete and Computational Geometry,
Vol. 3,
pp. 147--168,
1988.
-
B. S. Baker,
A Program for Identifying Duplicated Code,
Proc. Comput. Sci. and Statistics: 24th Symposium on the Interface,
March 1992.
-
B. S. Baker,
A Theory of Parameterized Pattern Matching: Algorithms and Applications (Extended Abstract),
Proc. 25th ACM Symposium on Theory of Computing,
pp. 71--80,
May 1993.
-
B. S. Baker,
Approximation Algorithms for NP -complete Problems on Planar Graphs,
J. Assoc. Comput. Mach.,
pp. 153--180,
January 1994.
-
B. S. Baker,
Parameterized Pattern Matching by B oyer- M oore Type Algorithms,
Proc. Sixth Annual ACM-SIAM Symposium on Discrete Algorithms,
pp. 541--550,
January.
-
B. S. Baker,
On Finding Duplication and Near-Duplication in Large Software Systems,
Proc. Second IEEE Working Conference on Reverse Engineering,
pp. 86--95,
July,
(Received IEEE Outstanding Paper Award) .
-
B. S. Baker and Eric Grosse,
Local Control over Filtered WWW Access,
World Wide Web Journal - Fourth International World Wide Web Conference Proceedings,
pp. 423--432,
December.
-
B. S. Baker,
Parameterized Pattern Matching: Algorithms and Applications,
J. Comput. Syst. Sci.,
pp. 28--42,
February 1996.
-
B. S. Baker and Coffman Jr. E. G.,
Mutual Exclusion Scheduling,
Theoretical Computer Science,
pp. 225-243.
-
B. S. Baker,
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance,
SIAM J. Computing,
pp. 1343--1362,
October.
-
Brenda S. Baker and Udi Manber,
Deducing Similarities in Java Sources from Bytecodes,
Proc. of Usenix Annual Technical Conf.,
pp. 179--190,
June.
-
B.S. Baker,
Parameterized Diff,
ACM-SIAM Symp. on Discrete Algorithms,
pp. S854-S855,
Jan. 1999.
-
B.S. Baker and Raffaele Giancarlo,
Longest Common Subsequence from Fragments via Sparse Dynamic Programming,
European Symposium on Algorithms,
pp. 79-90,
Aug. 1998.
-
Brenda S. Baker Udi Manber and Robert Muth,
Compressing Differences of Executable Code,
ACM SIGPLAN Workshop on Compiler Support for System Software (WCSS),
pp. 1-10,
May.
Go to the Computing Sciences
Research Center home page.
Modified: December, 1997.
Copyright © 1997
Lucent Technologies. All rights reserved.