#### Filter Results:

- Full text PDF available (41)

#### Publication Year

1959

2018

- This year (4)
- Last 5 years (13)
- Last 10 years (37)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

- Lenore Cowen
- SODA
- 1999

We present the first universal compact routing algorithm with maximum stretch bounded by 3 that uses sublinear space at every vertex. The algorithm uses local routing tables of size O(n2j3 log413 n)â€¦ (More)

- Matthew Menke, Bonnie Berger, Lenore Cowen
- PLoS Computational Biology
- 2008

Even when there is agreement on what measure a protein multiple structure alignment should be optimizing, finding the optimal alignment is computationally prohibitive. One approach used by manyâ€¦ (More)

- Arthur Brady, Lenore Cowen
- ALENEX
- 2006

We present a universal routing scheme for unweighted, undirected networks that always routes a packet along a path whose length is at most an additive factor of d more than opt (where opt is theâ€¦ (More)

- Lenore Cowen, Wayne Goddard, C. Esther Jesurum
- Journal of Graph Theory
- 1997

A graph is (k, d)-colorable if one can color the vertices with k colors such that no vertex is adjacent to more than d vertices of its same color. In this paper we investigate the existence of suchâ€¦ (More)

- P. Bradley, Lenore Cowen, Markus Menke, J. King, B. Berger
- Proceedings of the National Academy of Sciencesâ€¦
- 2001

The amino acid sequence rules that specify beta-sheet structure in proteins remain obscure. A subclass of beta-sheet proteins, parallel beta-helices, represent a processive folding of the chain intoâ€¦ (More)

- Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
- SIAM J. Comput.
- 1998

- Bill Bogstad, Lenore Cowen
- Discrete Mathematics
- 2004

The distinguishing number of a graph G is the minimum number of colors for which there exists an assignment of colors to the vertices of G so that the group of color-preserving automorphisms of Gâ€¦ (More)

- Lenore Cowen, Robert Cowen, Douglas R. Woodall
- Journal of Graph Theory
- 1986

We call a graph (m, k)-colorable if its vertices can be colored with m colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. For the class of planarâ€¦ (More)

This paper is concerned with compact routing in the name independent model first introduced by Awerbuch et al. [1] for adaptive routing in dynamic networks. A compact routing scheme that uses localâ€¦ (More)

- Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
- J. Parallel Distrib. Comput.
- 1996

This paper presents deterministic sublinear-time distributed algorithms for network decomposition and for constructing a sparse neighborhood cover of a network. The latter construction leads toâ€¦ (More)