default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJeanette P. Schmidt
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j16]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): 1266-1280 (2008)- 2001
- [j15]Gad M. Landau, Jeanette P. Schmidt, Dina Sokol:
An Algorithm for Approximate Tandem Repeats. J. Comput. Biol. 8(1): 1-18 (2001) - 2000
- [j14]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): 1-43 (2000)
1990 – 1999
- 1999
- [j13]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): 330-346 (1999) - 1998
- [j12]Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt:
Incremental String Comparison. SIAM J. Comput. 27(2): 557-582 (1998) - [j11]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): 972-992 (1998) - [c13]Jeanette P. Schmidt, Cheng Che Chen, Jonathan L. Cooper, Russ B. Altman:
A Surface Measure for Probabilistic Structural Computations. ISMB 1998: 148-156 - 1996
- [c12]Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein:
Load-Sharing in Heterogeneous Systems via Weighted Factoring. SPAA 1996: 318-328 - 1995
- [j10]Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SIAM J. Discret. Math. 8(2): 223-250 (1995) - [j9]Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras:
Historical Queries Along Multiple Lines of Time Evolution. VLDB J. 4(4): 703-726 (1995) - [c11]Jeanette P. Schmidt:
All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. ISTCS 1995: 67-77 - 1993
- [j8]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): 11-18 (1993) - [j7]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): 157 (1993) - [c10]Gad M. Landau, Jeanette P. Schmidt:
An Algorithm for Approximate Tandem Repeats. CPM 1993: 120-133 - [c9]Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras:
Efficient Support of Historical Queries for Multiple Lines of Evolution. ICDE 1993: 319-326 - [c8]Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan:
Chernoff-Hoeffding Bounds for Applications with Limited Independence. SODA 1993: 331-340 - 1992
- [j6]Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Nonoblivious Hashing. J. ACM 39(4): 764-782 (1992) - [c7]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: 111-120 - 1991
- [j5]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): 406-424 (1991) - 1990
- [j4]Jeanette P. Schmidt, Alan Siegel:
The Spatial Complexity of Oblivious k-Probe Hash Functions. SIAM J. Comput. 19(5): 775-786 (1990) - [c6]Jeanette P. Schmidt, Alan Siegel:
The Analysis of Closed Hashing under Limited Randomness (Extended Abstract). STOC 1990: 224-234
1980 – 1989
- 1989
- [c5]Jeanette P. Schmidt, Alan Siegel:
On Aspects of Universality and Performance for Closed Hashing (Extended Abstract). STOC 1989: 355-366 - 1988
- [c4]Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel:
Storing and Searching a Multikey Table (Extended Abstract). STOC 1988: 344-353 - [c3]Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel:
Non-Oblivious Hashing (Extended Abstract). STOC 1988: 367-376 - 1987
- [j3]Jeanette P. Schmidt:
Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. Discret. Math. 66(3): 259-277 (1987) - [c2]David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman:
On the Formal Semantics of Statecharts (Extended Abstract). LICS 1987: 54-64 - 1985
- [j2]Jeanette P. Schmidt, Eli Shamir:
Component structure in the evolution of random hypergraphs. Comb. 5(1): 81-94 (1985) - 1983
- [j1]Jeanette P. Schmidt, Eli Shamir:
A threshold for perfect matchings in random d-pure hypergraphs. Discret. Math. 45(2-3): 287-295 (1983) - 1980
- [c1]Jeanette P. Schmidt, Eli Shamir:
An Improved Program for Constructing Open Hash Tables. ICALP 1980: 569-581
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:11 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
