The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Jeanette P. Schmidt: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. David Harel, Amir Pnueli, Jeanette P. Schmidt, Rivi Sherman
    On the Formal Semantics of Statecharts (Extended Abstract) [Citation Graph (2, 0)][DBLP]
    LICS, 1987, pp:54-64 [Conf]
  2. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
    Non-Oblivious Hashing (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:367-376 [Conf]
  3. Amos Fiat, Moni Naor, Alejandro A. Schäffer, Jeanette P. Schmidt, Alan Siegel
    Storing and Searching a Multikey Table (Extended Abstract) [Citation Graph (1, 0)][DBLP]
    STOC, 1988, pp:344-353 [Conf]
  4. Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras
    Historical Queries Along Multiple Lines of Time Evolution [Citation Graph (1, 22)][DBLP]
    VLDB J., 1995, v:4, n:4, pp:703-726 [Journal]
  5. Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
    Identifying Periodic Occurrences of a Template with Applications to Protein Structures. [Citation Graph (0, 0)][DBLP]
    CPM, 1992, pp:111-120 [Conf]
  6. Gad M. Landau, Jeanette P. Schmidt
    An Algorithm for Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:120-133 [Conf]
  7. Jeanette P. Schmidt, Eli Shamir
    An Improved Program for Constructing Open Hash Tables. [Citation Graph (0, 0)][DBLP]
    ICALP, 1980, pp:569-581 [Conf]
  8. Gad M. Landau, Jeanette P. Schmidt, Vassilis J. Tsotras
    Efficient Support of Historical Queries for Multiple Lines of Evolution. [Citation Graph (0, 15)][DBLP]
    ICDE, 1993, pp:319-326 [Conf]
  9. Jeanette P. Schmidt, Cheng Che Chen, Jonathan L. Cooper, Russ B. Altman
    A Surface Measure for Probabilistic Structural Computations. [Citation Graph (0, 0)][DBLP]
    ISMB, 1998, pp:148-156 [Conf]
  10. Jeanette P. Schmidt
    All Shortest Paths in Weighted Grid Graphs and its Application to Finding All Approximate Repeats in Strings. [Citation Graph (0, 0)][DBLP]
    ISTCS, 1995, pp:67-77 [Conf]
  11. Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
    Chernoff-Hoeffding Bounds for Applications with Limited Independence. [Citation Graph (0, 0)][DBLP]
    SODA, 1993, pp:331-340 [Conf]
  12. Susan Flynn Hummel, Jeanette P. Schmidt, R. N. Uma, Joel Wein
    Load-Sharing in Heterogeneous Systems via Weighted Factoring. [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:318-328 [Conf]
  13. Jeanette P. Schmidt, Alan Siegel
    On Aspects of Universality and Performance for Closed Hashing (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:355-366 [Conf]
  14. Jeanette P. Schmidt, Alan Siegel
    The Analysis of Closed Hashing under Limited Randomness (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    STOC, 1990, pp:224-234 [Conf]
  15. 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. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1999, v:25, n:2-3, pp:330-346 [Journal]
  16. Jeanette P. Schmidt, Eli Shamir
    Component structure in the evolution of random hypergraphs. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1985, v:5, n:1, pp:81-94 [Journal]
  17. Vincent A. Fischetti, Gad M. Landau, Peter H. Sellers, Jeanette P. Schmidt
    Identifying Periodic Occurrences of a Template with Applications to Protein Structure. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:1, pp:11-18 [Journal]
  18. Vincent A. Fischetti, Gad M. Landau, Jeanette P. Schmidt, Peter H. Sellers
    Corrigendum: Identifying Periodic Occurences of a Template with Applications to Protein Structure. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:46, n:3, pp:157- [Journal]
  19. Amos Fiat, Moni Naor, Jeanette P. Schmidt, Alan Siegel
    Nonoblivious Hashing. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1992, v:39, n:4, pp:764-782 [Journal]
  20. Gad M. Landau, Jeanette P. Schmidt, Dina Sokol
    An Algorithm for Approximate Tandem Repeats. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 2001, v:8, n:1, pp:1-18 [Journal]
  21. 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. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1991, v:43, n:3, pp:406-424 [Journal]
  22. 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. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:1, pp:1-43 [Journal]
  23. Gad M. Landau, Eugene W. Myers, Jeanette P. Schmidt
    Incremental String Comparison. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:2, pp:557-582 [Journal]
  24. Jeanette P. Schmidt
    All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:4, pp:972-992 [Journal]
  25. Jeanette P. Schmidt, Alan Siegel
    The Spatial Complexity of Oblivious k-Probe Hash Functions. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1990, v:19, n:5, pp:775-786 [Journal]
  26. Jeanette P. Schmidt, Alan Siegel, Aravind Srinivasan
    Chernoff-Hoeffding Bounds for Applications with Limited Independence. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1995, v:8, n:2, pp:223-250 [Journal]
  27. Jeanette P. Schmidt
    Probabilistic analysis of strong hypergraph coloring algorithms and the strong chromatic number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1987, v:66, n:3, pp:259-277 [Journal]
  28. Jeanette P. Schmidt, Eli Shamir
    A threshold for perfect matchings in random d-pure hypergraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1983, v:45, n:2-3, pp:287-295 [Journal]

Search in 0.006secs, Finished in 0.009secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002