default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBrenda S. Baker
Person information
- affiliation: Bell Labs
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2007
[j26]Brenda S. Baker:
Finding Clones with Dup: Analysis of an Experiment. IEEE Trans. Software Eng. 33(9): 608-621 (2007)- 2002
- [j25]Brenda S. Baker, Raffaele Giancarlo:
Sparse Dynamic Programming for Longest Common Subsequence from Fragments. J. Algorithms 42(2): 231-254 (2002)
1990 – 1999
- 1999
- [c16]Brenda S. Baker:
Parameterized diff. SODA 1999: 854-855 - 1998
- [c15]Brenda S. Baker, Raffaele Giancarlo:
Longest Common Subsequence from Fragments via Sparse Dynamic Programming. ESA 1998: 79-90 - [c14]Brenda S. Baker, Udi Manber:
Deducing Similarities in Java Sources from Bytecodes. USENIX ATC 1998 - 1997
- [j24]Brenda S. Baker:
Parameterized Duplication in Strings: Algorithms and an Application to Software Maintenance. SIAM J. Comput. 26(5): 1343-1362 (1997) - 1996
- [j23]Brenda S. Baker:
Parameterized Pattern Matching: Algorithms and Applications. J. Comput. Syst. Sci. 52(1): 28-42 (1996) - [j22]Brenda S. Baker, Edward G. Coffman Jr.:
Mutual Exclusion Scheduling. Theor. Comput. Sci. 162(2): 225-243 (1996) - [j21]Brenda S. Baker, Eric Grosse:
Local Control over Filtered WWW Access. World Wide Web J. 1(1) (1996) - 1995
- [c13]Brenda S. Baker:
Parameterized Pattern Matching by Boyer-Moore-Type Algorithms. SODA 1995: 541-550 - [c12]Brenda S. Baker:
On Finding Duplication and Near-Duplication in Large Software Systems. WCRE 1995: 86-95 - [c11]Brenda S. Baker, Eric Grosse:
Local Control over Filtered WWW Access. WWW (Fall) 1995: 423-432 - 1994
- [j20]Brenda S. Baker:
Approximation Algorithms for NP-Complete Problems on Planar Graphs. J. ACM 41(1): 153-180 (1994) - 1993
- [c10]Brenda S. Baker:
A theory of parameterized pattern matching: algorithms and applications. STOC 1993: 71-80
1980 – 1989
- 1988
- [j19]Brenda S. Baker, Eric Grosse, Conor S. Rafferty:
Nonobtuse Triangulation of Polygons. Discret. Comput. Geom. 3: 147-168 (1988) - 1986
- [j18]Brenda S. Baker, Steven Fortune, Stephen R. Mahaney:
Polygon Containment under Translation. J. Algorithms 7(4): 532-548 (1986) - [j17]Brenda S. Baker:
A Provably Good Algorithm for the Two Module Routing Problem. SIAM J. Comput. 15(1): 162-188 (1986) - 1985
- [j16]Brenda S. Baker, Edward G. Coffman Jr., Dan E. Willard:
Algorithms for Resolving Conflicts in Dynamic Storage Allocation. J. ACM 32(2): 327-343 (1985) - [j15]Brenda S. Baker:
A New Proof for the First-Fit Decreasing Bin-Packing Algorithm. J. Algorithms 6(1): 49-70 (1985) - [c9]Brenda S. Baker, Steven Fortune, Eric Grosse:
Stable prehension with a multi-fingered hand. ICRA 1985: 570-575 - [c8]Brenda S. Baker, Steven Fortune, Eric Grosse:
Stable Prehension with Three Fingers. STOC 1985: 114-120 - 1984
- [j14]Brenda S. Baker, Edward G. Coffman Jr.:
Insertion and Compaction Algorithms in Sequentially Allocated Storage. SIAM J. Comput. 13(3): 600-609 (1984) - 1983
- [j13]Brenda S. Baker, Jerald S. Schwarz:
Shelf Algorithms for Two-Dimensional Packing Problems. SIAM J. Comput. 12(3): 508-525 (1983) - [c7]Brenda S. Baker:
Approximation Algorithms for NP-Complete Problems on Planar Graphs (Preliminary Version). FOCS 1983: 265-273 - [c6]Brenda S. Baker, Ron Y. Pinter:
An Algorithm for the Optimal Placement and Routing of a Circuit within a Ring of Pads (Extended Abstract). FOCS 1983: 360-370 - [c5]Brenda S. Baker, Sandeep N. Bhatt, Frank Thomson Leighton:
An Approximation Algorithm for Manhattan Routing (Extended Abstract). STOC 1983: 477-486 - 1982
- [j12]Donna J. Brown, Brenda S. Baker, Howard P. Katseff:
Lower Bounds for On-Line Two-Dimensional Packing Algorithms. Acta Informatica 18: 207-225 (1982) - [j11]Brenda S. Baker, Edward G. Coffman Jr.:
A Two-Dimensional Bin-Packing Model of Preemptive, FIFO Storage Allocation. J. Algorithms 3(4): 303-316 (1982) - 1981
- [j10]Brenda S. Baker, Donna J. Brown, Howard P. Katseff:
A 5/4 Algorithm for Two-Dimensional Packing. J. Algorithms 2(4): 348-368 (1981) - 1980
- [j9]Brenda S. Baker, Edward G. Coffman Jr., Ronald L. Rivest:
Orthogonal Packings in Two Dimensions. SIAM J. Comput. 9(4): 846-855 (1980)
1970 – 1979
- 1979
- [j8]Brenda S. Baker:
Composition of Top-Down and Bottom-Up Tree Transductions. Inf. Control. 41(2): 186-213 (1979) - [j7]Brenda S. Baker, S. Rao Kosaraju:
A Comparison of Multilevel break and next Statements. J. ACM 26(3): 555-566 (1979) - 1978
- [j6]Brenda S. Baker:
Tree Transducers and Tree Languages. Inf. Control. 37(3): 241-266 (1978) - [j5]Brenda S. Baker:
Generalized Syntax Directed Translation, Tree Transducers, and Linear Space. SIAM J. Comput. 7(3): 376-391 (1978) - 1977
- [j4]Brenda S. Baker:
An Algorithm for Structuring Flowgraphs. J. ACM 24(1): 98-120 (1977) - 1976
- [c4]Brenda S. Baker:
An Algorithm for Structuring Programs. POPL 1976: 113-126 - 1974
- [j3]Brenda S. Baker:
Non-context-Free Grammars Generating Context-Free Languages. Inf. Control. 24(3): 231-246 (1974) - [j2]Brenda S. Baker, Ronald V. Book:
Reversal-Bounded Multipushdown Machines. J. Comput. Syst. Sci. 8(3): 315-332 (1974) - 1973
- [b1]Brenda S. Baker:
Tree Transductions and Families of Tree Languges. University Cambridge, 1973 - [c3]Brenda S. Baker:
Tree Transductions and Families of Tree Languges. STOC 1973: 200-206 - 1972
- [j1]Brenda S. Baker, Robert E. Shostak:
Gossips and telephones. Discret. Math. 2(3): 191-193 (1972) - [c2]Brenda S. Baker, Ronald V. Book:
Reversal-Bounded Multi-Pushdown Machines: Extended Abstract. SWAT 1972: 207-211 - [c1]Brenda S. Baker:
Context-Sensitive Grammars Generating Context-Free Languages. ICALP 1972: 501-506
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-07-17 20:33 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
