Electrical Engineering
      and Computer Sciences

Electrical Engineering and Computer Sciences

COLLEGE OF ENGINEERING

UC Berkeley

   

Ph.D. Dissertations - Richard M. Karp

Modularity Conserved during Evolution: Algorithms and Analysis
Luqman Hodgkinson [2013]

Algorithms for Human Genetics
Bonnie Kirkpatrick [2011]

Comparative and Evolutionary Analysis of Cellular Pathways
Manikandan Narayanan [2007]

Optimization and Reconstruction over Graphs
Samantha J. Riesenfeld [2007]

Computational Analyses of Eukaryotic Gene Evolution
Sourav Chatterji [2006]

Evolution, Modularity, and Dynamics of Gene Regulatory Networks
Amoolya Singh [2006]

Combinatorics of Viterbi Sequences
Eric H.-S. Kuo [2005]

Probabilistic Graphical Models and Algorithms for Genomic Analysis
Eric Poe Xing [2004]

An Assessment of Genome Annotation Tools and an Approach to Solving a Set of Problems from a Genome Sequencing Project
George W. Hartzell III [2001]

Efficient Algorithms for Broadcast, Prefix Summing, and Matrix Computation for Distributed-Memory Machines
Eunice E. Santos [1995]

Efficient Algorithms for a Realistic Machine-Independent Model of Parallel Machines
Abhijit Sahay [1994]

Finding, Evaluating, and Counting DNA Physical Maps
Lee A. Newberg [1993]

Competitive Algorithms for On-Line Paging and Graph Coloring
Sandra S. Irani [1991]

On Characterizing and Learning Some Classes of Read-Once Functions
Lisa Hellerstein [1989]

On Space-Bounded Learning and the Vapnik-Chervonenkis Dimension
Sally J. Floyd [1989]

Parallel Algorithms for Combinatorial Search Problems
Yanjun Zhang [1989]

The Asynchronous PRAM: A Semisynchronous Model for Shared-Memory MIMD Machines
Phillip B. Gibbons [1989]

Using Hard Problems to Create Pseudorandom Generators
Noam Nisan [1989]

Lower Bounds on the Complexity of Graph Properties
Valerie King [1988]

Probabilistic Analysis of Matching and Network Flow Algorithms
Rajeev Motwani [1988]

Circuit Placement Methods Using Multiple Eigenvectors and Linear Probe Techniques
Jonathan A. Frankle [1987]

Fast Parallel Algorithms for Graphs and Networks
Danny Soroker [1987]

Lower Bounds for Parallel Computation
Prabhakar L. Ragde [1986]

Fast Parallel Algorithms for Graph-Theoretic Problems: Matching, Coloring and Partitioning
Howard J. Karloff [1985]

Coping with NP-Complete Problems
Narendra K. Karmarkar [1983]

Monte-Carlo Methods for Estimating System Reliability
Michael G. Luby [1983]

Synchronizing Concurrent Access to Shared Data
James P. Richardson [1984]

Two Problems in Concrete Complexity: Cycle Detection and Parallel Prefix Computation
Faith E. Fich [1982]

Scheduling with Release Times and Deadlines
Barbara B. Simons [1981]

On Partitioning a Graph: A Theoretical and Empirical Study
Robert M. MacGregor [1978]

Infinite Normal Forms for the Lambda-Calculus and Semantics of Programming Languages
Reiji Nakajima [1975]

PQ-Tree Algorithms
Kellogg S. Booth [1975]

A Lower Bound for the Scholz-Brauer Problem
Anne G. Cottrell [1974]

An Interactive Program-Verifier
L. Peter Deutsch [1973]

Correctness of Programs Manipulating Data Structures
Tomasz Kowaltowski [1973]

On the Efficiency of Network Flow Algorithms
Norman A. Zadeh [1972]

Two Methods for Solving Large Linear Programs
Ysmar V. Silva-Filho [1972]

A Primal Approach to Network Flow Problems with Convex Costs
Felix A. P. Weintraub [1971]

Closures of Parallel Program Schemata
Robert M. Keller [1970]