dblp.uni-trier.dewww.uni-trier.de

Jeanette P. Schmidt Vis

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

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

Coauthor Index

1Russ B. Altman [25]
2Cheng Che Chen [25]
3Richard Cole [27]
4Jonathan L. Cooper [25]
5Amos Fiat [6] [7] [11] [12]
6Vincent A. Fischetti [13] [14] [15] [26]
7David Harel [5]
8Susan Flynn Hummel [22]
9T. C. Ip [26]
10Gad M. Landau [13] [14] [15] [17] [18] [19] [24] [28]
11Bud Mishra (Bhubaneswar Mishra) [27]
12J. Ian Munro [11]
13Eugene W. Myers (Gene Myers) [24]
14Moni Naor [6] [7] [11] [12]
15Amir Pnueli [5]
16Alejandro A. Schäffer [7] [11]
17Peter H. Sellers [13] [14] [15]
18Eli Shamir [1] [2] [3]
19Rivi Sherman [5]
20Alan Siegel [6] [7] [8] [9] [10] [11] [12] [16] [20] [27]
21Dina Sokol [28]
22Aravind Srinivasan [16] [20]
23Vassilis J. Tsotras [17] [19]
24R. N. Uma [22]
25Joel Wein [22]

Colors in the list of coauthors

Copyright © Tue Nov 3 08:52:44 2009 by Michael Ley (ley@uni-trier.de)