- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Colin J. Wynne
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Christopher Wagner
- Scheduling with ConcurrencyBased Constraints Bonnie Berger \Lambda
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Craig Feinstein
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Brenton Squires
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Bilal Khan
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Mike Capalbo
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Amitabha Bagchi
- 550.770: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Scribe: Motoya Machida
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Kip Lubliner
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Lenka Goldman
- 550.777: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Scribe: Adam Cannon
- 550.770: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Scribe: Kofi Laing
- Approximation Algorithms for the Class Cover Problem Adam Cannon and Lenore Cowen
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Heather Park
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: David Mazur
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Adam Cannon
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Greg Levin
- COMP 15005: Combinatorial Optimization Prof. Lenore Cowen Tufts University Fall 2005
- DIMACS Technical Report 95-27 A Formal Framework for Evaluating Heuristic
- 550.770: Approximation Algorithms Guest Lecturer: Prof. Leslie Hall Johns Hopkins University Scribe: Christine Cheng
- So we have taken care of full graphs with forbidden subgraph A. Now we take care of full graphs containing subgraph B. We will break up such graphs into
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Chan Jin
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Christine Cheng
- Compact Roundtrip Routing with Topology-Independent Marta Arias
- 550.770: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Scribe: Mihai Pop
- 550.770: Approximation Algorithms Professor Lenore Cowen Johns Hopkins University Scribe: Mihai Pop
- COMP 150-05: Combinatorial Optimization Prof. Lenore Cowen Tufts University Fall 2005
- 550.777: The Probabilistic Method Professor Lenore Cowen JHU Math Sciences, Spring 1995 Scribe: Chris Wagner
- 550.770: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Scribe: Amitabha Bagchi
- 550.770: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Scribe: Nathan Kleinman
- Efficient Asynchronous Distributed Symmetry Breaking Baruch Awerbuch \Lambda Lenore Cowen y Mark Smith z
- Compact Routing With Name Independence Marta Arias
- A Linear-Time Algorithm for Network Decomposition Lenore J. Cowen
- Coloring with Defect L. J. Cowen W. Goddard y C. E. Jesurum z
- Evaluating Between-Pathway Models with Expression Data B. J. HESCOTT, M. D. M. LEISERSON, L. J. COWEN, and D. K. SLONIM
- Birthday Banquet Danny Kleitman
- Compact Routing with Minimum Stretch Lenore J. Cowen
- Low-Diameter Graph Decomposition is in NC Baruch Awerbuch Bonnie Berger y
- Randomized non-linear projections uncover high-dimensional Lenore J. Cowen and Carey E. Priebe
- 550.777: Department of Mathematical Sciences Professor Lenore Cowen Johns Hopkins University Bibliography and References
- Fast Distributed Network Decompositions and Baruch Awerbuch y
