Jeanette P. Schmidt

Publication Activity (10 Years)

Years Active: 1980-2008
Publications (10 Years): 0

Publications

Jeanette P. Schmidt, Scott L. Delp, Michael A. Sherman, Charles A. Taylor, Vijay S. Pande, Russ B. Altman
The Simbios National Center: Systems Biology in Motion. Proc. IEEE 96 (8) (2008)
Gad M. Landau, Jeanette P. Schmidt, Dina Sokol
An Algorithm for Approximate Tandem Repeats. J. Comput. Biol. 8 (1) (2001)
Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel
On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences. SIAM J. Comput. 30 (1) (2000)
T. C. Ip, Vincent A. Fischetti, Jeanette P. Schmidt
An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary Structure. Algorithmica 25 (2-3) (1999)
Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt
Incremental String Comparison. SIAM J. Comput. 27 (2) (1998)
Jeanette P. Schmidt, Cheng Che Chen, Jonathan L. Cooper, Russ B. Altman
A Surface Measure for Probabilistic Structural Computations. ISMB (1998)
Jeanette P. Schmidt
All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. SIAM J. Comput. 27 (4) (1998)
Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein
Load-Sharing in Heterogeneous Systems via Weighted Factoring. SPAA (1996)
Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras
Historical Queries Along Multiple Lines of Time Evolution VLDB J. 4 (4) (1995)
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discret. Math. 8 (2) (1995)
Jeanette P. Schmidt
All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. ISTCS (1995)
Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA (1993)
Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure. Inf. Process. Lett. 46 (3) (1993)
Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras
Efficient Support of Historical Queries for Multiple Lines of Evolution. ICDE (1993)
Vincent A. Fischetti, Gad M. Landau, Peter H. Sellers, Jeanette P. Schmidt
Identifying Periodic Occurrences of a Template with Applications to Protein Structure. Inf. Process. Lett. 45 (1) (1993)
Gad M. Landau, Jeanette P. Schmidt
An Algorithm for Approximate Tandem Repeats. CPM (1993)
Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
Identifying Periodic Occurrences of a Template with Applications to Protein Structures. CPM (1992)
Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
Nonoblivious Hashing. J. ACM 39 (4) (1992)
Amos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
An Implicit Data Structure for Searching a Multikey Table in Logarithmic Time. J. Comput. Syst. Sci. 43 (3) (1991)
Jeanette P. Schmidt, Alan Siegel
The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) STOC (1990)
Jeanette P. Schmidt, Alan Siegel
The Spatial Complexity of Oblivious k-Probe Hash Functions. SIAM J. Comput. 19 (5) (1990)
Jeanette P. Schmidt, Alan Siegel
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) STOC (1989)
Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
Storing and Searching a Multikey Table (Extended Abstract) STOC (1988)
Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
Non-Oblivious Hashing (Extended Abstract) STOC (1988)
David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman
On the Formal Semantics of Statecharts (Extended Abstract) LICS (1987)
Jeanette P. Schmidt
Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. Discret. Math. 66 (3) (1987)
Jeanette P. Schmidt, Eli Shamir
Component structure in the evolution of random hypergraphs. Comb. 5 (1) (1985)
Jeanette P. Schmidt, Eli Shamir
A threshold for perfect matchings in random d-pure hypergraphs. Discret. Math. 45 (2-3) (1983)
Jeanette P. Schmidt, Eli Shamir
An Improved Program for Constructing Open Hash Tables. ICALP (1980)