| 2008 |
|---|
| 39 | EE | Xintao Wei,
Lenore Cowen,
Carla E. Brodley,
Arthur Brady,
D. Sculley,
Donna K. Slonim:
A Distance-Based Method for Detecting Horizontal Gene Transfer in Whole Genomes.
ISBRA 2008: 26-37 |
| 38 | EE | Lenore Cowen:
Packet Routing.
Encyclopedia of Algorithms 2008 |
| 37 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing:
Compact roundtrip routing with topology-independent node names.
J. Comput. Syst. Sci. 74(5): 775-795 (2008) |
| 2006 |
|---|
| 36 | EE | Arthur Brady,
Lenore Cowen:
Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.
DISC 2006: 339-354 |
| 35 | EE | Arthur Brady,
Lenore Cowen:
Compact routing with additive stretch using distance labelings.
SPAA 2006: 233 |
| 34 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing,
Rajmohan Rajaraman,
Orjeta Taka:
Compact Routing with Name Independence.
SIAM J. Discrete Math. 20(3): 705-726 (2006) |
| 2005 |
|---|
| 33 | EE | Matthew Menke,
Jonathan King,
Bonnie Berger,
Lenore Cowen:
Wrap-and-Pack: A New Paradigm for Beta Structural Motif Recognition with Application to Recognizing Beta Trefoils.
Journal of Computational Biology 12(6): 777-795 (2005) |
| 2004 |
|---|
| 32 | EE | Matthew Menke,
Eben Scanlon,
Jonathan King,
Bonnie Berger,
Lenore Cowen:
Wrap-and-pack: a new paradigm for beta structural motif recognition with application to recognizing beta trefoils.
RECOMB 2004: 298-307 |
| 31 | EE | Adam Cannon,
Lenore Cowen:
Approximation Algorithms for the Class Cover Problem.
Ann. Math. Artif. Intell. 40(3-4): 215-224 (2004) |
| 30 | EE | Bill Bogstad,
Lenore Cowen:
The distinguishing number of the hypercube.
Discrete Mathematics 283(1-3): 29-35 (2004) |
| 29 | EE | Lenore Cowen,
Christopher G. Wagner:
Compact roundtrip routing in directed networks.
J. Algorithms 50(1): 79-95 (2004) |
| 2003 |
|---|
| 28 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing:
Compact roundtrip routing with topology-independent node names.
PODC 2003: 43-52 |
| 27 | EE | Marta Arias,
Lenore Cowen,
Kofi A. Laing,
Rajmohan Rajaraman,
Orjeta Taka:
Compact routing with name independence.
SPAA 2003: 184-192 |
| 2002 |
|---|
| 26 | EE | Lenore Cowen,
Jerrold R. Griggs,
Douglas B. West:
Foreword.
Discrete Mathematics 257(2-3): 191-192 (2002) |
| 25 | EE | Lenore Cowen,
Ronald Fagin,
Joe Kilian,
Jon M. Kleinberg:
Guest Editor's Foreword.
J. Comput. Syst. Sci. 65(1): 1 (2002) |
| 24 | | Lenore Cowen,
Phil Bradley,
Matthew Menke,
Jonathan King,
Bonnie Berger:
Predicting the Beta-Helix Fold from Protein Sequence Data.
Journal of Computational Biology 9(2): 261-276 (2002) |
| 2001 |
|---|
| 23 | EE | Phil Bradley,
Lenore Cowen,
Matthew Menke,
Jonathan King,
Bonnie Berger:
Predicting the beta-helix fold from protein sequence data.
RECOMB 2001: 59-67 |
| 22 | | Lenore Cowen:
Compact Routing with Minimum Stretch.
J. Algorithms 38(1): 170-183 (2001) |
| 2000 |
|---|
| 21 | EE | Adam Cannon,
Lenore Cowen:
Approximation Algorithms for the Class Cover Problem.
AMAI 2000 |
| 20 | EE | Lenore Cowen,
Christopher G. Wagner:
Compact roundtrip routing in directed networks (extended abstract).
PODC 2000: 51-59 |
| 1999 |
|---|
| 19 | EE | Lenore Cowen:
Compact Routing with Minimum Stretch.
SODA 1999: 255-260 |
| 18 | EE | Lenore Cowen,
Christopher G. Wagner:
Compact Roundtrip Routing for Digraphs.
SODA 1999: 885-886 |
| 17 | EE | C. T. Cheng,
Lenore Cowen:
On the local distinguishing numbers of cycles.
Discrete Mathematics 196(1-3): 97-108 (1999) |
| 1998 |
|---|
| 16 | | Lenore Cowen,
Joan Feigenbaum,
Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs.
Ann. Math. Artif. Intell. 22(3-4): 193-206 (1998) |
| 15 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Near-Linear Time Construction of Sparse Neighborhood Covers.
SIAM J. Comput. 28(1): 263-277 (1998) |
| 1997 |
|---|
| 14 | | Lenore Cowen,
Wayne Goddard,
C. E. Jesurum:
Coloring with Defect.
SODA 1997: 548-557 |
| 13 | | Lenore Cowen,
Rudolf Mathar:
The Offset Problem.
Combinatorics, Probability & Computing 6(2): 159-164 (1997) |
| 1996 |
|---|
| 12 | | Lenore Cowen,
Joan Feigenbaum,
Sampath Kannan:
A Formal Framework for Evaluating Heuristic Programs.
ICALP 1996: 634-645 |
| 11 | | Lenore Cowen,
Rudolf Mathar:
The Offset Problem (Abstract).
PODC 1996: 313 |
| 10 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Fast Distributed Network Decompositions and Covers.
J. Parallel Distrib. Comput. 39(2): 105-114 (1996) |
| 1995 |
|---|
| 9 | | Bonnie Berger,
Lenore Cowen:
Scheduling with Concurrency-Based Constraints.
J. Algorithms 18(1): 98-123 (1995) |
| 1994 |
|---|
| 8 | EE | Baruch Awerbuch,
Lenore Cowen,
Mark A. Smith:
Efficient asynchronous distributed symmetry breaking.
STOC 1994: 214-223 |
| 7 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Low-Diameter Graph Decomposition Is in NC.
Random Struct. Algorithms 5(3): 441-452 (1994) |
| 1993 |
|---|
| 6 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers
FOCS 1993: 638-647 |
| 5 | | Rudolf Mathar,
Lenore Cowen:
Concurrence Probabilities for a Locally Slotted Packet Radio Network by Combinatorial Methods.
Perform. Eval. 17(1): 43-51 (1993) |
| 1992 |
|---|
| 4 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Fast Network Decomposition (Extended Abstract).
PODC 1992: 169-177 |
| 3 | | Baruch Awerbuch,
Bonnie Berger,
Lenore Cowen,
David Peleg:
Low-Diameter Graph Decomposition is in NC.
SWAT 1992: 83-93 |
| 1991 |
|---|
| 2 | | Bonnie Berger,
Lenore Cowen:
Complexity Results and Algorithms for { <, <=, = }-Constrained Scheduling.
SODA 1991: 137-147 |
| 1989 |
|---|
| 1 | EE | Mihir Bellare,
Lenore Cowen,
Shafi Goldwasser:
On the Structure of Secret Key Exchange Protocols.
CRYPTO 1989: 604-605 |
