The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Sampath Kannan: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan
    Complexity of Problems on Graphs Represented as OBDDs (Extended Abstract). [Citation Graph (1, 0)][DBLP]
    STACS, 1998, pp:216-226 [Conf]
  2. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
    Oracles and Queries That Are Sufficient for Exact Learning. [Citation Graph (1, 0)][DBLP]
    J. Comput. Syst. Sci., 1996, v:52, n:3, pp:421-433 [Journal]
  3. Boulos Harb, Sampath Kannan, Andrew McGregor
    Approximating the Best-Fit Tree Under Lp Norms. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2005, pp:123-133 [Conf]
  4. Joan Feigenbaum, Sampath Kannan, Noam Nisan
    Lower Bounds on Random-Self-Reducibility. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1990, pp:100-109 [Conf]
  5. Tugkan Batu, Sudipto Guha, Sampath Kannan
    Inferring Mixtures of Markov Chains. [Citation Graph (0, 0)][DBLP]
    COLT, 2004, pp:186-199 [Conf]
  6. Nader H. Bshouty, Richard Cleve, Sampath Kannan, Christino Tamon
    Oracles and Queries that are Sufficient for Exact Learning (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    COLT, 1994, pp:130-139 [Conf]
  7. Sampath Kannan
    On the Query Complexity of Learning. [Citation Graph (0, 0)][DBLP]
    COLT, 1993, pp:58-66 [Conf]
  8. Craig J. Benham, Sampath Kannan, Tandy Warnow
    Of Chicken Teeth and Mouse Eyes, or Generalized Character Compatibility. [Citation Graph (0, 0)][DBLP]
    CPM, 1995, pp:17-26 [Conf]
  9. Sampath Kannan, Eugene W. Myers
    An Algorithm for Locating Non-Overlapping Regions of Maximum Alignment Score. [Citation Graph (0, 0)][DBLP]
    CPM, 1993, pp:74-86 [Conf]
  10. Richard Berger, Sampath Kannan, René Peralta
    A Framework for the Study of Cryptographic Protocols. [Citation Graph (0, 0)][DBLP]
    CRYPTO, 1985, pp:87-103 [Conf]
  11. Andris Ambainis, Richard Desper, Martin Farach, Sampath Kannan
    Nearly Tight Bounds on the Learnability of Evolution. [Citation Graph (0, 0)][DBLP]
    FOCS, 1997, pp:524-533 [Conf]
  12. Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
    Checking the Correctness of Memories [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:90-99 [Conf]
  13. Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
    An Approximate L1-Difference Algorithm for Massive Data Streams. [Citation Graph (0, 0)][DBLP]
    FOCS, 1999, pp:501-511 [Conf]
  14. Yael Gertner, Sampath Kannan, Tal Malkin, Omer Reingold, Mahesh Viswanathan
    The Relationship between Public Key Encryption and Oblivious Transfer. [Citation Graph (0, 0)][DBLP]
    FOCS, 2000, pp:325-335 [Conf]
  15. Sampath Kannan, Tandy Warnow
    Inferring Evolutionary History from DNA Sequences (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:362-371 [Conf]
  16. Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner
    Thresholds and Optimal Binary Comparison Search Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2001, pp:83-95 [Conf]
  17. Sandip K. Biswas, Sampath Kannan
    Minimizing Space Usage in Evaluation of Expression Trees. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1995, pp:377-390 [Conf]
  18. Rajeev Alur, Sampath Kannan, Salvatore La Torre
    Polyhedral Flows in Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    HSCC, 1999, pp:5-18 [Conf]
  19. Rajeev Alur, Sampath Kannan, Mihalis Yannakakis
    Communicating Hierarchical State Machines. [Citation Graph (0, 0)][DBLP]
    ICALP, 1999, pp:169-178 [Conf]
  20. Lenore Cowen, Joan Feigenbaum, Sampath Kannan
    A Formal Framework for Evaluating Heuristic Programs. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:634-645 [Conf]
  21. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
    On Graph Problems in a Semi-streaming Model. [Citation Graph (0, 0)][DBLP]
    ICALP, 2004, pp:531-543 [Conf]
  22. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A Bound on the Capacity of Backoff and Acknowledgement-Based Protocols. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:705-716 [Conf]
  23. Sampath Kannan, Andrew Chi-Chih Yao
    Program Checkers for Probability Generation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1991, pp:163-173 [Conf]
  24. Saumya K. Debray, Sampath Kannan, Mukul Paithane
    Weighted Decision Trees. [Citation Graph (0, 0)][DBLP]
    JICSLP, 1992, pp:654-668 [Conf]
  25. Volkan Isler, Sampath Kannan, Kostas Daniilidis
    Local exploration: online algorithms and a probabilistic framework. [Citation Graph (0, 0)][DBLP]
    ICRA, 2003, pp:1913-1920 [Conf]
  26. Insup Lee, Sampath Kannan, Moonjoo Kim, Oleg Sokolsky, Mahesh Viswanathan
    Runtime Assurance Based On Formal Specifications. [Citation Graph (0, 0)][DBLP]
    PDPTA, 1999, pp:279-287 [Conf]
  27. Koenraad De Bosschere, Saumya K. Debray, David Gudeman, Sampath Kannan
    Call Forwarding: A Simple Interprocedural Optimization Technique for Dynamically Typed Languages. [Citation Graph (0, 0)][DBLP]
    POPL, 1994, pp:409-420 [Conf]
  28. Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim
    Efficient Enumeration of Phylogenetically Informative Substrings. [Citation Graph (0, 0)][DBLP]
    RECOMB, 2006, pp:248-264 [Conf]
  29. Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Z. Sweedyk
    On the complexity and approximation of syntenic distance. [Citation Graph (0, 0)][DBLP]
    RECOMB, 1997, pp:99-108 [Conf]
  30. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:118-127 [Conf]
  31. Stanislav Angelov, Boulos Harb, Sampath Kannan, Li-San Wang
    Weighted isotonic regression under the L1 norm. [Citation Graph (0, 0)][DBLP]
    SODA, 2006, pp:783-791 [Conf]
  32. Noga Alon, Manuel Blum, Amos Fiat, Sampath Kannan, Moni Naor, Rafail Ostrovsky
    Matching Nuts and Bolts. [Citation Graph (0, 0)][DBLP]
    SODA, 1994, pp:690-696 [Conf]
  33. Tugkan Batu, Sampath Kannan, Sanjeev Khanna, Andrew McGregor
    Reconstructing strings from random traces. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:910-918 [Conf]
  34. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
    Graph distances in the streaming model: the value of space. [Citation Graph (0, 0)][DBLP]
    SODA, 2005, pp:745-754 [Conf]
  35. Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
    Testing and spot-checking of data streams (extended abstract). [Citation Graph (0, 0)][DBLP]
    SODA, 2000, pp:165-174 [Conf]
  36. Volkan Isler, Sampath Kannan, Sanjeev Khanna
    Randomized pursuit-evasion with limited visibility. [Citation Graph (0, 0)][DBLP]
    SODA, 2004, pp:1060-1069 [Conf]
  37. Sampath Kannan, Sanjeev Khanna
    Selection with monotone comparison cost. [Citation Graph (0, 0)][DBLP]
    SODA, 2003, pp:10-17 [Conf]
  38. Sampath Kannan, Eugene L. Lawler, Tandy Warnow
    Determining the Evolutionary Tree. [Citation Graph (0, 0)][DBLP]
    SODA, 1990, pp:475-484 [Conf]
  39. Sampath Kannan, Todd A. Proebsting
    Register Allocation in Structured Programs. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:360-368 [Conf]
  40. Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
    Counting and Random Generation of Strings in Regular Languages. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:551-557 [Conf]
  41. Sampath Kannan, Tandy Warnow
    Triangulating Three-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    SODA, 1991, pp:337-343 [Conf]
  42. Sampath Kannan, Tandy Warnow
    A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies when the Number of Character States is Fixed. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:595-603 [Conf]
  43. Sampath Kannan, Tandy Warnow, Shibu Yooseph
    Computing the Local Consensus of Trees. [Citation Graph (0, 0)][DBLP]
    SODA, 1995, pp:68-77 [Conf]
  44. Manuel Blum, Sampath Kannan
    Designing Programs That Check Their Work [Citation Graph (0, 0)][DBLP]
    STOC, 1989, pp:86-97 [Conf]
  45. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
    Spot-Checkers. [Citation Graph (0, 0)][DBLP]
    STOC, 1998, pp:259-268 [Conf]
  46. Martin Farach, Sampath Kannan
    Efficient Algorithms for Inverting Evolution. [Citation Graph (0, 0)][DBLP]
    STOC, 1996, pp:230-236 [Conf]
  47. Martin Farach, Sampath Kannan, Tandy Warnow
    A robust model for finding optimal evolutionary trees. [Citation Graph (0, 0)][DBLP]
    STOC, 1993, pp:137-145 [Conf]
  48. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs [Citation Graph (0, 0)][DBLP]
    STOC, 1988, pp:334-343 [Conf]
  49. Oleg Sokolsky, Sampath Kannan, Insup Lee
    Simulation-Based Graph Similarity. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:426-440 [Conf]
  50. Stanislav Angelov, Boulos Harb, Sampath Kannan, Sanjeev Khanna, Junhyong Kim, Li-San Wang
    Genome Identification and Classification by Short Oligo Arrays. [Citation Graph (0, 0)][DBLP]
    WABI, 2004, pp:400-411 [Conf]
  51. Sampath Kannan, Tandy Warnow
    Tree Reconstruction from Partial Orders. [Citation Graph (0, 0)][DBLP]
    WADS, 1993, pp:397-408 [Conf]
  52. Manuel Blum, William S. Evans, Peter Gemmell, Sampath Kannan, Moni Naor
    Checking the Correctness of Memories. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1994, v:12, n:2/3, pp:225-244 [Journal]
  53. Martin Farach, Sampath Kannan, Tandy Warnow
    A Robust Model for Finding Optimal Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1995, v:13, n:1/2, pp:155-179 [Journal]
  54. Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
    Testing and Spot-Checking of Data Streams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2002, v:34, n:1, pp:67-80 [Journal]
  55. Joan Feigenbaum, Sampath Kannan, Jian Zhang
    Computing Diameter in the Streaming and Sliding-Window Models. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2004, v:41, n:1, pp:25-41 [Journal]
  56. Jessica H. Fong, Anna C. Gilbert, Sampath Kannan, Martin J. Strauss
    Better Alternatives to OSPF Routing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2005, v:43, n:1-2, pp:113-131 [Journal]
  57. Lenore Cowen, Joan Feigenbaum, Sampath Kannan
    A Formal Framework for Evaluating Heuristic Programs. [Citation Graph (0, 0)][DBLP]
    Ann. Math. Artif. Intell., 1998, v:22, n:3-4, pp:193-206 [Journal]
  58. Joan Feigenbaum, Sampath Kannan, Moshe Y. Vardi, Mahesh Viswanathan
    The Complexity of Problems on Graphs Represented as OBDDs. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 1999, v:1999, n:, pp:- [Journal]
  59. Bhaskar DasGupta, Tao Jiang, Sampath Kannan, Ming Li, Elizabeth Sweedyk
    On the Complexity and Approximation of Syntenic Distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:59-82 [Journal]
  60. Sampath Kannan, Danny Soroker
    Tiling Polygons with Parallelograms. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1992, v:7, n:, pp:175-188 [Journal]
  61. Nader H. Bshouty, Richard Cleve, Ricard Gavaldà, Sampath Kannan, Christino Tamon
    Oracles and Queries That Are Sufficient for Exact Learning [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1995, v:2, n:15, pp:- [Journal]
  62. Arvind Easwaran, Sampath Kannan, Oleg Sokolsky
    Steering of Discrete Event Systems: Control Theory Approach. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2006, v:144, n:4, pp:21-39 [Journal]
  63. Moonjoo Kim, Sampath Kannan, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan
    Java-MaC: a Run-time Assurance Tool for Java Programs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2001, v:55, n:2, pp:- [Journal]
  64. Moonjoo Kim, Sampath Kannan, Insup Lee, Oleg Sokolsky, Mahesh Viswanathan
    Computational Analysis of Run-time Monitoring - Fundamentals of Java-MaC. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2002, v:70, n:4, pp:- [Journal]
  65. Rajeev Alur, Sampath Kannan, Salvatore La Torre
    Polyhedral Flows in Hybrid Automata. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2004, v:24, n:3, pp:261-280 [Journal]
  66. Moonzoo Kim, Mahesh Viswanathan, Sampath Kannan, Insup Lee, Oleg Sokolsky
    Java-MaC: A Run-Time Assurance Approach for Java Programs. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2004, v:24, n:2, pp:129-155 [Journal]
  67. Vivek Gore, Mark Jerrum, Sampath Kannan, Z. Sweedyk, Stephen R. Mahaney
    A Quasi-Polynomial-Time Algorithm for Sampling Words from a Context-Free Language. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1997, v:134, n:1, pp:59-74 [Journal]
  68. Gilles Brassard, Sampath Kannan
    The Generation of Random Permutations on the Fly. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1988, v:28, n:4, pp:207-212 [Journal]
  69. Manuel Blum, Sampath Kannan
    Designing Programs that Check Their Work. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1995, v:42, n:1, pp:269-291 [Journal]
  70. Martin Farach, Sampath Kannan
    Efficient Algorithms for Inverting Evolution. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1999, v:46, n:4, pp:437-449 [Journal]
  71. Richard J. Anderson, Sampath Kannan, Howard J. Karloff, Richard E. Ladner
    Thresholds and optimal binary comparison search trees. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 2002, v:44, n:2, pp:338-358 [Journal]
  72. Sampath Kannan, Eugene L. Lawler, Tandy Warnow
    Determining the Evolutionary Tree Using Experiments. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1996, v:21, n:1, pp:26-50 [Journal]
  73. Sampath Kannan, Todd A. Proebsting
    Register Allocation in Structured Programs. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1998, v:29, n:2, pp:223-237 [Journal]
  74. Craig J. Benham, Sampath Kannan, Michael Paterson, Tandy Warnow
    Hen's Teeth and Whale's Feet: Generalized Characters and Their Compatibility. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1995, v:2, n:4, pp:515-525 [Journal]
  75. Funda Ergün, Sampath Kannan, Ravi Kumar, Ronitt Rubinfeld, Mahesh Viswanathan
    Spot-Checkers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2000, v:60, n:3, pp:717-751 [Journal]
  76. Sampath Kannan, Mihalis Yannakakis
    Guest Editors' foreword. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 2004, v:68, n:2, pp:237- [Journal]
  77. Volkan Isler, Sampath Kannan, Kostas Daniilidis, Pavel Valtr
    VC-Dimension of Exterior Visibility. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 2004, v:26, n:5, pp:667-671 [Journal]
  78. Joan Feigenbaum, Sampath Kannan, Martin Strauss, Mahesh Viswanathan
    An Approximate L1-Difference Algorithm for Massive Data Streams. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2002, v:32, n:1, pp:131-151 [Journal]
  79. Leslie Ann Goldberg, Mark Jerrum, Sampath Kannan, Mike Paterson
    A bound on the capacity of backoff and acknowledgment-based protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:313-331 [Journal]
  80. Sampath Kannan, Eugene W. Myers
    An Algorithm for Locating Nonoverlapping Regions of Maximum Alignment Score. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1996, v:25, n:3, pp:648-662 [Journal]
  81. Sampath Kannan, Tandy Warnow
    Inferring Evolutionary History from DNA Sequences. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:4, pp:713-737 [Journal]
  82. Sampath Kannan, Tandy Warnow
    Tree Reconstruction from Partial Orders. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1995, v:24, n:3, pp:511-519 [Journal]
  83. Sampath Kannan, Tandy Warnow
    A Fast Algorithm for the Computation and Enumeration of Perfect Phylogenies. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:6, pp:1749-1763 [Journal]
  84. Sampath Kannan, Tandy Warnow
    Computing the Local Consensus of Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1998, v:27, n:6, pp:1695-1724 [Journal]
  85. Wenceslas Fernandez de la Vega, Sampath Kannan, Miklos Santha
    Two Probabilistic Results on Merging. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1993, v:22, n:2, pp:261-271 [Journal]
  86. Sampath Kannan, Moni Naor, Steven Rudich
    Implicit Representation of Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:4, pp:596-603 [Journal]
  87. Sampath Kannan, Tandy Warnow
    Triangulating 3-Colored Graphs. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1992, v:5, n:2, pp:249-258 [Journal]
  88. Volkan Isler, Sampath Kannan, Sanjeev Khanna
    Randomized Pursuit-Evasion with Local Visibility. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 2006, v:20, n:1, pp:26-41 [Journal]
  89. Sampath Kannan, Todd A. Proebsting
    Short Communication: Correction to 'Producing Good Code for the case Statement'. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1994, v:24, n:2, pp:233- [Journal]
  90. Joan Feigenbaum, Sampath Kannan, Andrew McGregor, Siddharth Suri, Jian Zhang
    On graph problems in a semi-streaming model. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:348, n:2-3, pp:207-216 [Journal]
  91. Matthew Chu, Sampath Kannan, Andrew McGregor
    Checking and Spot-Checking the Correctness of Priority Queues. [Citation Graph (0, 0)][DBLP]
    ICALP, 2007, pp:728-739 [Conf]

  92. Formally specified monitoring of temporal properties. [Citation Graph (, )][DBLP]


  93. STCON in Directed Unique-Path Graphs. [Citation Graph (, )][DBLP]


  94. Reconstructing Numbers from Pairwise Function Values. [Citation Graph (, )][DBLP]


  95. Spatio-temporal analysis of Wikipedia metadata and the STiki anti-vandalism tool. [Citation Graph (, )][DBLP]


  96. STiki: an anti-vandalism tool for Wikipedia using spatio-temporal analysis of revision metadata. [Citation Graph (, )][DBLP]


  97. Detecting Wikipedia vandalism via spatio-temporal analysis of revision metadata? [Citation Graph (, )][DBLP]


  98. QuanTM: a quantitative trust management system. [Citation Graph (, )][DBLP]


  99. Dynamic Trust Management. [Citation Graph (, )][DBLP]


Search in 0.066secs, Finished in 0.069secs
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
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002