![]() | ![]() |
Lenore J. Cowen
List of publications from the DBLP Bibliography Server - FAQ
| 2012 | ||
|---|---|---|
| 49 | Noah Daniels, Raghavendra Hosur, Bonnie Berger, Lenore J. Cowen: SMURFLite: combining simplified Markov random fields with simulated evolution improves remote homology detection for beta-structural proteins into the twilight zone. Bioinformatics 28(9): 1216-1222 (2012) | |
| 2011 | ||
| 48 | Mark D. M. Leiserson, Diana Tatar, Lenore J. Cowen, Benjamin J. Hescott: Inferring Mechanisms of Compensation from E-MAP and SGA Data Using Local Search Algorithms for Max Cut. RECOMB 2011: 154-167 | |
| 2010 | ||
| 47 | Noah Daniels, Anoop Kumar, Lenore Cowen, Matthew Menke: Touring Protein Space with Matt. ISBRA 2010: 18-28 | |
| 46 | Anoop Kumar, Lenore Cowen: Recognition of beta-structural motifs using hidden Markov models trained with simulated evolution. Bioinformatics [ISMB] 26(12): 287-293 (2010) | |
| 2009 | ||
| 45 | Benjamin J. Hescott, Mark D. M. Leiserson, Lenore Cowen, Donna K. Slonim: Evaluating Between-Pathway Models with Expression Data. RECOMB 2009: 372-385 | |
| 44 | Anoop Kumar, Lenore Cowen: Augmented training of hidden Markov models to recognize remote homologs via simulated evolution. Bioinformatics 25(13): 1602-1608 (2009) | |
| 43 | Allen W. Bryan Jr., Matthew Menke, Lenore J. Cowen, Susan Lindquist, Bonnie Berger: BETASCAN: Probable β-amyloids Identified by Pairwise Probabilistic Analysis. PLoS Computational Biology 5(3): (2009) | |
| 2008 | ||
| 42 | 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 | |
| 41 | Lenore Cowen: Packet Routing. Encyclopedia of Algorithms 2008 | |
| 40 | Marta Arias, Lenore Cowen, Kofi A. Laing: Compact roundtrip routing with topology-independent node names. J. Comput. Syst. Sci. 74(5): 775-795 (2008) | |
| 39 | Matthew Menke, Bonnie Berger, Lenore Cowen: Matt: Local Flexibility Aids Protein Multiple Structure Alignment. PLoS Computational Biology 4(1): (2008) | |
| 2006 | ||
| 38 | Arthur Brady, Lenore Cowen: Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes. DISC 2006: 339-354 | |
| 37 | Arthur Brady, Lenore Cowen: Compact routing with additive stretch using distance labelings. SPAA 2006: 233 | |
| 36 | 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 | ||
| 35 | 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 | ||
| 34 | 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 | |
| 33 | Adam Cannon, Lenore Cowen: Approximation Algorithms for the Class Cover Problem. Ann. Math. Artif. Intell. 40(3-4): 215-224 (2004) | |
| 32 | Bill Bogstad, Lenore Cowen: The distinguishing number of the hypercube. Discrete Mathematics 283(1-3): 29-35 (2004) | |
| 31 | Lenore Cowen, Christopher G. Wagner: Compact roundtrip routing in directed networks. J. Algorithms 50(1): 79-95 (2004) | |
| 2003 | ||
| 30 | Marta Arias, Lenore Cowen, Kofi A. Laing: Compact roundtrip routing with topology-independent node names. PODC 2003: 43-52 | |
| 29 | Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka: Compact routing with name independence. SPAA 2003: 184-192 | |
| 2002 | ||
| 28 | Lenore Cowen, Jerrold R. Griggs, Douglas B. West: Foreword. Discrete Mathematics 257(2-3): 191-192 (2002) | |
| 27 | Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg: Guest Editor's Foreword. J. Comput. Syst. Sci. 65(1): 1 (2002) | |
| 26 | 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 | ||
| 25 | Phil Bradley, Lenore Cowen, Matthew Menke, Jonathan King, Bonnie Berger: Predicting the beta-helix fold from protein sequence data. RECOMB 2001: 59-67 | |
| 24 | Lenore Cowen: Compact Routing with Minimum Stretch. J. Algorithms 38(1): 170-183 (2001) | |
| 2000 | ||
| 23 | Adam Cannon, Lenore Cowen: Approximation Algorithms for the Class Cover Problem. AMAI 2000 | |
| 22 | Lenore Cowen, Christopher G. Wagner: Compact roundtrip routing in directed networks (extended abstract). PODC 2000: 51-59 | |
| 1999 | ||
| 21 | Lenore Cowen: Compact Routing with Minimum Stretch. SODA 1999: 255-260 | |
| 20 | Lenore Cowen, Christopher G. Wagner: Compact Roundtrip Routing for Digraphs. SODA 1999: 885-886 | |
| 19 | C. T. Cheng, Lenore Cowen: On the local distinguishing numbers of cycles. Discrete Mathematics 196(1-3): 97-108 (1999) | |
| 1998 | ||
| 18 | Lenore Cowen, Joan Feigenbaum, Sampath Kannan: A Formal Framework for Evaluating Heuristic Programs. Ann. Math. Artif. Intell. 22(3-4): 193-206 (1998) | |
| 17 | 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 | ||
| 16 | Lenore Cowen, Wayne Goddard, C. E. Jesurum: Coloring with Defect. SODA 1997: 548-557 | |
| 15 | Lenore Cowen, Rudolf Mathar: The Offset Problem. Combinatorics, Probability & Computing 6(2): 159-164 (1997) | |
| 1996 | ||
| 14 | Lenore Cowen, Joan Feigenbaum, Sampath Kannan: A Formal Framework for Evaluating Heuristic Programs. ICALP 1996: 634-645 | |
| 13 | Lenore Cowen, Rudolf Mathar: The Offset Problem (Abstract). PODC 1996: 313 | |
| 12 | Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg: Fast Distributed Network Decompositions and Covers. J. Parallel Distrib. Comput. 39(2): 105-114 (1996) | |
| 11 | Joanne F. Houlahan, Lenore J. Cowen, Gerald M. Masson: Hypercube sandwich approach to conferencing. The Journal of Supercomputing 10(3): 271-283 (1996) | |
| 1995 | ||
| 10 | Joanne F. Houlahan, Lenore J. Cowen, Gerald M. Masson: Hypercube Sandwich Approach to Conferencing. PDPTA 1995: 481-490 | |
| 9 | Bonnie Berger, Lenore Cowen: Scheduling with Concurrency-Based Constraints. J. Algorithms 18(1): 98-123 (1995) | |
| 1994 | ||
| 8 | 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 | Mihir Bellare, Lenore Cowen, Shafi Goldwasser: On the Structure of Secret Key Exchange Protocols. CRYPTO 1989: 604-605 | |
Colors in the list of coauthors
Last update Tue May 29 01:28:40 2012 CET by the DBLP Team —
Data released under the ODC-BY 1.0 license — See also our legal information page