Jeanette P. Schmidt

According to our database, Jeanette P. Schmidt authored at least 28 papers between 1980 and 2008.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2008

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

2001

An Algorithm for Approximate Tandem Repeats.

Gad M. Landau, Jeanette P. Schmidt, Dina Sokol

J. Comput. Biol., 2001

2000

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block Sequences.

Richard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel

SIAM J. Comput., 2000

1999

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

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

Incremental String Comparison.

Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt

SIAM J. Comput., 1998

A Surface Measure for Probabilistic Structural Computations.

Jeanette P. Schmidt, Cheng Che Chen, Jonathan L. Cooper, Russ B. Altman

Proceedings of the 6th International Conference on Intelligent Systems for Molecular Biology (ISMB-98), Montréal, Québec, Canada, June 28, 1998

1996

Load-Sharing in Heterogeneous Systems via Weighted Factoring.

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

Proceedings of the 8th Annual ACM Symposium on Parallel Algorithms and Architectures, 1996

1995

Historical Queries Along Multiple Lines of Time Evolution

Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras

VLDB J., 1995

Chernoff-Hoeffding Bounds for Applications with Limited Independence.

Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan

SIAM J. Discret. Math., 1995

All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings.

Jeanette P. Schmidt

Proceedings of the Third Israel Symposium on Theory of Computing and Systems, 1995

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

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

Efficient Support of Historical Queries for Multiple Lines of Evolution.

Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras

Proceedings of the Ninth International Conference on Data Engineering, 1993

An Algorithm for Approximate Tandem Repeats.

Gad M. Landau, Jeanette P. Schmidt

Proceedings of the Combinatorial Pattern Matching, 4th Annual Symposium, 1993

1992

Nonoblivious Hashing.

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel

J. ACM, 1992

Identifying Periodic Occurrences of a Template with Applications to Protein Structures.

Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers

Proceedings of the Combinatorial Pattern Matching, Third Annual Symposium, 1992

1991

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

1990

The Spatial Complexity of Oblivious k-Probe Hash Functions.

Jeanette P. Schmidt, Alan Siegel

SIAM J. Comput., 1990

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract)

Jeanette P. Schmidt, Alan Siegel

Proceedings of the 22nd Annual ACM Symposium on Theory of Computing, 1990

1989

On Aspects of Universality and Performance for Closed Hashing (Extended Abstract)

Jeanette P. Schmidt, Alan Siegel

Proceedings of the 21st Annual ACM Symposium on Theory of Computing, 1989

1988

Storing and Searching a Multikey Table (Extended Abstract)

Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

Non-Oblivious Hashing (Extended Abstract)

Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel

Proceedings of the 20th Annual ACM Symposium on Theory of Computing, 1988

1987

Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number.

Jeanette P. Schmidt

Discret. Math., 1987

On the Formal Semantics of Statecharts (Extended Abstract)

David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman

Proceedings of the Symposium on Logic in Computer Science (LICS '87), 1987

1985

Component structure in the evolution of random hypergraphs.

Jeanette P. Schmidt, Eli Shamir

Comb., 1985

1983

A threshold for perfect matchings in random d-pure hypergraphs.

Jeanette P. Schmidt, Eli Shamir

Discret. Math., 1983

1980

An Improved Program for Constructing Open Hash Tables.

Jeanette P. Schmidt, Eli Shamir

Proceedings of the Automata, 1980