Jeanette P. Schmidt - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2008

The Simbios National Center: Systems Biology in MotionJeanette P. Schmidt, Scott L. Delp, Michael A. Sherman, Charles A. Taylor, Vijay S. Pande, Russ B. Altman. pieee, 96(8):1266-1280, 2008. [doi]

2001

An Algorithm for Approximate Tandem RepeatsGad M. Landau, Jeanette P. Schmidt, Dina Sokol. jcb, 8(1):1-18, 2001.

2000

On the Dynamic Finger Conjecture for Splay Trees. Part I: Splay Sorting log n-Block SequencesRichard Cole, Bud Mishra, Jeanette P. Schmidt, Alan Siegel. SICOMP, 30(1):1-43, 2000.

1999

An Algorithm for Identifying Similar Amino Acid Clusters among Different Alpha-Helical Coiled-Coil Proteins Using Their Secondary StructureT. C. Ip, Vincent A. Fischetti, Jeanette P. Schmidt. algorithmica, 25(2-3):330-346, 1999. [doi]

1998

Incremental String ComparisonGad M. Landau, Eugene W. Myers, Jeanette P. Schmidt. SICOMP, 27(2):557-582, 1998.

All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in StringsJeanette P. Schmidt. SICOMP, 27(4):972-992, 1998. [doi]

A Surface Measure for Probabilistic Structural ComputationsJeanette P. Schmidt, Cheng-Che Chen, Jonathan L. Cooper, Russ B. Altman. ismb 1998: 148-156

1996

Load-Sharing in Heterogeneous Systems via Weighted FactoringSusan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein. spaa 1996: 318-328

1995

Historical Queries Along Multiple Lines of Time EvolutionGad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras. vldb, 4(4):703-726, 1995. [doi]

Chernoff-Hoeffding Bounds for Applications with Limited IndependenceJeanette P. Schmidt, Alan Siegel, Aravind Srinivasan. siamdm, 8(2):223-250, 1995. [doi]

All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in StringsJeanette P. Schmidt. istcs 1995: 67-77

1993

1992

Nonoblivious HashingAmos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. JACM, 39(4):764-782, 1992. [doi]

Identifying Periodic Occurrences of a Template with Applications to Protein StructuresVincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers. cpm 1992: 111-120

1991

An Implicit Data Structure for Searching a Multikey Table in Logarithmic TimeAmos Fiat, J. Ian Munro, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel. jcss, 43(3):406-424, 1991.

1990

The Analysis of Closed Hashing under Limited Randomness (Extended Abstract)Jeanette P. Schmidt, Alan Siegel. stoc 1990: 224-234

The Spatial Complexity of Oblivious k-Probe Hash FunctionsJeanette P. Schmidt, Alan Siegel. SICOMP, 19(5):775-786, 1990.

1989

On Aspects of Universality and Performance for Closed Hashing (Extended Abstract)Jeanette P. Schmidt, Alan Siegel. stoc 1989: 355-366

1988

Non-Oblivious Hashing (Extended Abstract)Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel. stoc 1988: 367-376

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

1987

On the Formal Semantics of Statecharts (Extended Abstract)David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman. lics 1987: 54-64

Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic numberJeanette P. Schmidt. DM, 66(3):259-277, 1987. [doi]

1985

Component structure in the evolution of random hypergraphsJeanette P. Schmidt, Eli Shamir. combinatorica, 5(1):81-94, 1985.

1983

A threshold for perfect matchings in random d-pure hypergraphsJeanette P. Schmidt, Eli Shamir. DM, 45(2-3):287-295, 1983. [doi]

1980

An Improved Program for Constructing Open Hash TablesJeanette P. Schmidt, Eli Shamir. icalp 1980: 569-581

Sign in or sign up to see more results.

runs on WebDSL