#### Filter Results:

- Full text PDF available (11)

#### Publication Year

1978

2008

- This year (0)
- Last 5 years (0)
- Last 10 years (5)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

#### Organism

Learn More

- David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman
- LICS
- 1987

- Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
- SIAM J. Discrete Math.
- 1993

Chernoff-Hoeffding bounds are fundamental tools used in bounding the tail probabilities of the sums of bounded and independent random variables. We present a simple technique which gives slightly better bounds than these, and which more importantly requires only limited independence among the random variables, thereby importing a variety of standard results… (More)

- Jeanette P. Schmidt
- SIAM J. Comput.
- 1998

- Jeanette P. Schmidt, Alan Siegel
- SIAM J. Comput.
- 1990

- Vincent A. Fischetti, Gad M. Landau, Peter H. Sellers, Jeanette P. Schmidt
- Inf. Process. Lett.
- 1993

- Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt
- SIAM J. Comput.
- 1998

The problem of comparing two sequences A and B to determine their LCS or the edit distance between them has been much studied. In this paper we consider the following incremental version of these problems: given an appropriate encoding of a comparison between A and B, can one incrementally compute the answer for A and bB, and the answer for A and Bb with… (More)

- Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein
- SPAA
- 1996

We consider the problem of scheduling a parallel loop with independent iterations on a network of heterogeneous workstations , and demonstrate the effectiveness of a variant of fa.toring, a scheduling policy originating in the context of shared address-space homogeneous multiprocessors. In the new scheme, weighted factoring, processors are dynamically… (More)

- Jeanette P. Schmidt, Eli Shamir
- Combinatorica
- 1985

Universal hash functions that exhibit clog n-wise independence are shown to give a performance in double hashing, uniform hashing and virtually any reasonable generalization of double hashing that has an expected probe count of 1 1? +O(1 n) for the insertion of the n-th item into a table of size n, for any xed < 1. This performance is optimal. These results… (More)

- Jeanette P. Schmidt, Scott L. Delp, Michael A. Sherman, Charles A. Taylor, Vijay S. Pande, Russ B. Altman
- Proceedings of the IEEE
- 2008

Physics-based simulation is needed to understand the function of biological structures and can be applied across a wide range of scales, from molecules to organisms. Simbios (the National Center for Physics-Based Simulation of Biological Structures, http://www.simbios.stanford.edu/) is one of seven NIH-supported National Centers for Biomedical Computation.… (More)