dblp.uni-trier.dewww.uni-trier.de

Lenore Cowen

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo
Home Page

2008
35EEXintao 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
2006
34EEArthur Brady, Lenore Cowen: Exact Distance Labelings Yield Additive-Stretch Compact Routing Schemes. DISC 2006: 339-354
33EEArthur Brady, Lenore Cowen: Compact routing with additive stretch using distance labelings. SPAA 2006: 233
2005
32EEMatthew 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
31EEMatthew 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
30EEAdam Cannon, Lenore Cowen: Approximation Algorithms for the Class Cover Problem. Ann. Math. Artif. Intell. 40(3-4): 215-224 (2004)
29EEBill Bogstad, Lenore Cowen: The distinguishing number of the hypercube. Discrete Mathematics 283(1-3): 29-35 (2004)
28EELenore Cowen, Christopher G. Wagner: Compact roundtrip routing in directed networks. J. Algorithms 50(1): 79-95 (2004)
2003
27EEMarta Arias, Lenore Cowen, Kofi A. Laing: Compact roundtrip routing with topology-independent node names. PODC 2003: 43-52
26EEMarta Arias, Lenore Cowen, Kofi A. Laing, Rajmohan Rajaraman, Orjeta Taka: Compact routing with name independence. SPAA 2003: 184-192
2002
25EELenore Cowen, Jerrold R. Griggs, Douglas B. West: Foreword. Discrete Mathematics 257(2-3): 191-192 (2002)
24EELenore Cowen, Ronald Fagin, Joe Kilian, Jon M. Kleinberg: Guest Editor's Foreword. J. Comput. Syst. Sci. 65(1): 1 (2002)
23 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
22EEPhil Bradley, Lenore Cowen, Matthew Menke, Jonathan King, Bonnie Berger: Predicting the beta-helix fold from protein sequence data. RECOMB 2001: 59-67
21 Lenore Cowen: Compact Routing with Minimum Stretch. J. Algorithms 38(1): 170-183 (2001)
2000
20EEAdam Cannon, Lenore Cowen: Approximation Algorithms for the Class Cover Problem. AMAI 2000
19EELenore Cowen, Christopher G. Wagner: Compact roundtrip routing in directed networks (extended abstract). PODC 2000: 51-59
1999
18EELenore Cowen: Compact Routing with Minimum Stretch. SODA 1999: 255-260
17EELenore Cowen, Christopher G. Wagner: Compact Roundtrip Routing for Digraphs. SODA 1999: 885-886
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
8EEBaruch 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
1EEMihir Bellare, Lenore Cowen, Shafi Goldwasser: On the Structure of Secret Key Exchange Protocols. CRYPTO 1989: 604-605

Coauthor Index

1Marta Arias [26] [27]
2Baruch Awerbuch [3] [4] [6] [7] [8] [10] [15]
3Mihir Bellare [1]
4Bonnie Berger [2] [3] [4] [6] [7] [9] [10] [15] [22] [23] [31] [32]
5Bill Bogstad [29]
6Phil Bradley [22] [23]
7Arthur Brady [33] [34] [35]
8Carla E. Brodley [35]
9Adam Cannon [20] [30]
10Ronald Fagin [24]
11Joan Feigenbaum [12] [16]
12Wayne Goddard [14]
13Shafi Goldwasser [1]
14Jerrold R. Griggs [25]
15C. E. Jesurum [14]
16Sampath Kannan [12] [16]
17Joe Kilian [24]
18Jonathan King [22] [23] [31] [32]
19Jon M. Kleinberg [24]
20Ambrose Kofi Laing (Kofi A. Laing) [26] [27]
21Rudolf Mathar [5] [11] [13]
22Matthew Menke [22] [23] [31] [32]
23David Peleg [3] [4] [6] [7] [10] [15]
24Rajmohan Rajaraman [26]
25Eben Scanlon [31]
26D. Sculley (David Sculley) [35]
27Donna K. Slonim [35]
28Mark A. Smith [8]
29Orjeta Taka [26]
30Christopher G. Wagner [17] [19] [28]
31Xintao Wei [35]
32Douglas B. West [25]

Colors in the list of coauthors

Copyright © Wed May 28 02:56:03 2008 by Michael Ley (ley@uni-trier.de)