An Improved Program for Constructing Open Hash Tables. - Jeanette P. Schmidt; Eli Shamir 001 (ICALP, 1980)

A threshold for perfect matchings in random d-pure hypergraphs. - Jeanette P. Schmidt; Eli Shamir 001 (Discret. Math., 1983)

Component structure in the evolution of random hypergraphs. - Jeanette P. Schmidt; Eli Shamir 001 (Comb., 1985)

On the Formal Semantics of Statecharts (Extended Abstract) - David Harel; Amir Pnueli; Jeanette P. Schmidt; Rivi Sherman (LICS, 1987)

Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. - Jeanette P. Schmidt (Discret. Math., 1987)

Non-Oblivious Hashing (Extended Abstract) - Amos Fiat; Moni Naor; Jeanette P. Schmidt; Alan Siegel (STOC, 1988)

Storing and Searching a Multikey Table (Extended Abstract) - Amos Fiat; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (STOC, 1988)

On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) - Jeanette P. Schmidt; Alan Siegel (STOC, 1989)

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) - Jeanette P. Schmidt; Alan Siegel (STOC, 1990)

The Spatial Complexity of Oblivious k-Probe Hash Functions. - Jeanette P. Schmidt; Alan Siegel (SIAM J. Comput., 1990)

An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. - Amos Fiat; J. Ian Munro; Moni Naor; Alejandro A. Schäffer; Jeanette P. Schmidt; Alan Siegel (J. Comput. Syst. Sci., 1991)

Identifying Periodic Occurrences of a Template with Applications to Protein Structures. - Vincent A. Fischetti; Gad M. Landau; Jeanette P. Schmidt; Peter H. Sellers (CPM, 1992)

Nonoblivious Hashing. - Amos Fiat; Moni Naor; Jeanette P. Schmidt; Alan Siegel (J. ACM, 1992)

An Algorithm for Approximate Tandem Repeats. - Gad M. Landau; Jeanette P. Schmidt (CPM, 1993)

Efficient Support of Historical Queries for Multiple Lines of Evolution. - Gad M. Landau; Jeanette P. Schmidt; Vassilis J. Tsotras (ICDE, 1993)

Identifying Periodic Occurrences of a Template with Applications to Protein Structure. - Vincent A. Fischetti; Gad M. Landau; Peter H. Sellers; Jeanette P. Schmidt (Inf. Process. Lett., 1993)

Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure. - Vincent A. Fischetti; Gad M. Landau; Jeanette P. Schmidt; Peter H. Sellers (Inf. Process. Lett., 1993)

All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. - Jeanette P. Schmidt (ISTCS, 1995)

Chernoff-Hoeffding Bounds for Applications with Limited Independence. - Jeanette P. Schmidt; Alan Siegel; Aravind Srinivasan (SIAM J. Discret. Math., 1995)

Historical Queries Along Multiple Lines of Time Evolution - Gad M. Landau; Jeanette P. Schmidt; Vassilis J. Tsotras (VLDB J., 1995)

Load-Sharing in Heterogeneous Systems via Weighted Factoring. - Susan Flynn Hummel; Jeanette P. Schmidt; R. N. Uma; Joel Wein (SPAA, 1996)

A Surface Measure for Probabilistic Structural Computations. - Jeanette P. Schmidt; Cheng Che Chen; Jonathan L. Cooper; Russ B. Altman (ISMB, 1998)

Incremental String Comparison. - Gad M. Landau; Eugene W. Myers; Jeanette P. Schmidt (SIAM J. Comput., 1998)

All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. - Jeanette P. Schmidt (SIAM J. Comput., 1998)

An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary Structure. - T. C. Ip; Vincent A. Fischetti; Jeanette P. Schmidt (Algorithmica, 1999)

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. - Richard Cole 001; Bud Mishra; Jeanette P. Schmidt; Alan Siegel (SIAM J. Comput., 2000)

An Algorithm for Approximate Tandem Repeats. - Gad M. Landau; Jeanette P. Schmidt; Dina Sokol (J. Comput. Biol., 2001)

The Simbios National Center: Systems Biology in Motion. - Jeanette P. Schmidt; Scott L. Delp; Michael A. Sherman; Charles A. Taylor; Vijay S. Pande; Russ B. Altman (Proc. IEEE, 2008)