The SCEAS System
| |||||||

## Search the dblp DataBase
Lenore Cowen:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Adam Cannon, Lenore Cowen
**Approximation Algorithms for the Class Cover Problem.**[Citation Graph (0, 0)][DBLP] AMAI, 2000, pp:- [Conf] - Mihir Bellare, Lenore Cowen, Shafi Goldwasser
**On the Structure of Secret Key Exchange Protocols.**[Citation Graph (0, 0)][DBLP] CRYPTO, 1989, pp:604-605 [Conf] - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
**Near-Linear Cost Sequential and Distribured Constructions of Sparse Neighborhood Covers**[Citation Graph (0, 0)][DBLP] FOCS, 1993, pp:638-647 [Conf] - Lenore Cowen, Joan Feigenbaum, Sampath Kannan
**A Formal Framework for Evaluating Heuristic Programs.**[Citation Graph (0, 0)][DBLP] ICALP, 1996, pp:634-645 [Conf] - Marta Arias, Lenore Cowen, Kofi A. Laing
**Compact roundtrip routing with topology-independent node names.**[Citation Graph (0, 0)][DBLP] PODC, 2003, pp:43-52 [Conf] - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
**Fast Network Decomposition (Extended Abstract).**[Citation Graph (0, 0)][DBLP] PODC, 1992, pp:169-177 [Conf] - Lenore Cowen, Rudolf Mathar
**The Offset Problem (Abstract).**[Citation Graph (0, 0)][DBLP] PODC, 1996, pp:313- [Conf] - Lenore Cowen, Christopher G. Wagner
**Compact roundtrip routing in directed networks (extended abstract).**[Citation Graph (0, 0)][DBLP] PODC, 2000, pp:51-59 [Conf] - Phil Bradley, Lenore Cowen, Matthew Menke, Jonathan King, Bonnie Berger
**Predicting the beta-helix fold from protein sequence data.**[Citation Graph (0, 0)][DBLP] RECOMB, 2001, pp:59-67 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] RECOMB, 2004, pp:298-307 [Conf] - Bonnie Berger, Lenore Cowen
**Complexity Results and Algorithms for { <, <=, = }-Constrained Scheduling.**[Citation Graph (0, 0)][DBLP] SODA, 1991, pp:137-147 [Conf] - Lenore Cowen
**Compact Routing with Minimum Stretch.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:255-260 [Conf] - Lenore Cowen, Wayne Goddard, C. E. Jesurum
**Coloring with Defect.**[Citation Graph (0, 0)][DBLP] SODA, 1997, pp:548-557 [Conf] - Lenore Cowen, Christopher G. Wagner
**Compact Roundtrip Routing for Digraphs.**[Citation Graph (0, 0)][DBLP] SODA, 1999, pp:885-886 [Conf] - Marta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka
**Compact routing with name independence.**[Citation Graph (0, 0)][DBLP] SPAA, 2003, pp:184-192 [Conf] - Arthur Brady, Lenore Cowen
**Compact routing with additive stretch using distance labelings.**[Citation Graph (0, 0)][DBLP] SPAA, 2006, pp:233- [Conf] - Baruch Awerbuch, Lenore Cowen, Mark A. Smith
**Efficient asynchronous distributed symmetry breaking.**[Citation Graph (0, 0)][DBLP] STOC, 1994, pp:214-223 [Conf] - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
**Low-Diameter Graph Decomposition is in NC.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:83-93 [Conf] - Arthur Brady, Lenore Cowen
**Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes.**[Citation Graph (0, 0)][DBLP] DISC, 2006, pp:339-354 [Conf] - Adam Cannon, Lenore Cowen
**Approximation Algorithms for the Class Cover Problem.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 2004, v:40, n:3-4, pp:215-224 [Journal] - Lenore Cowen, Joan Feigenbaum, Sampath Kannan
**A Formal Framework for Evaluating Heuristic Programs.**[Citation Graph (0, 0)][DBLP] Ann. Math. Artif. Intell., 1998, v:22, n:3-4, pp:193-206 [Journal] - Lenore Cowen, Rudolf Mathar
**The Offset Problem.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1997, v:6, n:2, pp:159-164 [Journal] - Bill Bogstad, Lenore Cowen
**The distinguishing number of the hypercube.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2004, v:283, n:1-3, pp:29-35 [Journal] - Lenore Cowen, Jerrold R. Griggs, Douglas B. West
**Foreword.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 2002, v:257, n:2-3, pp:191-192 [Journal] - Bonnie Berger, Lenore Cowen
**Scheduling with Concurrency-Based Constraints.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 1995, v:18, n:1, pp:98-123 [Journal] - Lenore Cowen
**Compact Routing with Minimum Stretch.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2001, v:38, n:1, pp:170-183 [Journal] - Lenore Cowen, Christopher G. Wagner
**Compact roundtrip routing in directed networks.**[Citation Graph (0, 0)][DBLP] J. Algorithms, 2004, v:50, n:1, pp:79-95 [Journal] - Lenore Cowen, Phil Bradley, Matthew Menke, Jonathan King, Bonnie Berger
**Predicting the Beta-Helix Fold from Protein Sequence Data.**[Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2002, v:9, n:2, pp:261-276 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] Journal of Computational Biology, 2005, v:12, n:6, pp:777-795 [Journal] - Lenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg
**Guest Editor's Foreword.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2002, v:65, n:1, pp:1- [Journal] - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
**Fast Distributed Network Decompositions and Covers.**[Citation Graph (0, 0)][DBLP] J. Parallel Distrib. Comput., 1996, v:39, n:2, pp:105-114 [Journal] - Rudolf Mathar, Lenore Cowen
**Concurrence Probabilities for a Locally Slotted Packet Radio Network by Combinatorial Methods.**[Citation Graph (0, 0)][DBLP] Perform. Eval., 1993, v:17, n:1, pp:43-51 [Journal] - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
**Low-Diameter Graph Decomposition Is in NC.**[Citation Graph (0, 0)][DBLP] Random Struct. Algorithms, 1994, v:5, n:3, pp:441-452 [Journal] - Baruch Awerbuch, Bonnie Berger, Lenore Cowen, David Peleg
**Near-Linear Time Construction of Sparse Neighborhood Covers.**[Citation Graph (0, 0)][DBLP] SIAM J. Comput., 1998, v:28, n:1, pp:263-277 [Journal] - C. T. Cheng, L. J. Cowen
**On the local distinguishing numbers of cycles.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:196, n:1-3, pp:97-108 [Journal] **Evaluating Between-Pathway Models with Expression Data.**[Citation Graph (, )][DBLP]**A Distance-Based Method for Detecting Horizontal Gene Transfer in Whole Genomes.**[Citation Graph (, )][DBLP]**Touring Protein Space with Matt.**[Citation Graph (, )][DBLP]**Augmented training of hidden Markov models to recognize remote homologs via simulated evolution.**[Citation Graph (, )][DBLP]**Recognition of beta-structural motifs using hidden Markov models trained with simulated evolution.**[Citation Graph (, )][DBLP]
Search in 0.006secs, Finished in 0.009secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |