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

Search the dblp DataBase

Title:
Author:
Joseph JáJá: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carla D. Savage, Joseph JáJá
    Fast, Efficient Parallel Algorithms for Some Graph Problems. [Citation Graph (1, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:4, pp:682-691 [Journal]
  2. David R. Helman, Joseph JáJá
    Designing Practical Efficient Algorithms for Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    ALENEX, 1999, pp:37-56 [Conf]
  3. Deepak D. Sherlekar, Joseph JáJá
    Input Sensitive VLSI Layouts for Graphs of Arbitrary Degree. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:268-277 [Conf]
  4. Tinku Acharya, Joseph JáJá
    Enhancing Lempel-Ziv Codes Using an On-Line Variable Length Binary Encoding. [Citation Graph (0, 0)][DBLP]
    Data Compression Conference, 1996, pp:419- [Conf]
  5. Joseph JáJá
    Robust technologies for automated ingestion and long-term preservation of digital information. [Citation Graph (0, 0)][DBLP]
    DG.O, 2006, pp:285-286 [Conf]
  6. Sangchul Song, Joseph JáJá
    New techniques for ensuring the long term integrity of digital archives. [Citation Graph (0, 0)][DBLP]
    DG.O, 2007, pp:57-65 [Conf]
  7. Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
    Some Triply-Logarithmic Parallel Algorithms (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1990, pp:871-881 [Conf]
  8. Joseph JáJá
    Computation of Algebraic Functions with Root Extractions [Citation Graph (0, 0)][DBLP]
    FOCS, 1981, pp:95-100 [Conf]
  9. Joseph JáJá
    On the Computational Complexity of the Permanent (Extended Abstract) [Citation Graph (0, 0)][DBLP]
    FOCS, 1983, pp:312-319 [Conf]
  10. Joseph JáJá
    Identification Is Easier Than Decoding [Citation Graph (0, 0)][DBLP]
    FOCS, 1985, pp:43-50 [Conf]
  11. Shing-Chong Chang, Joseph JáJá
    Parallel Algorithms for Wiring Module Pins to Frame Pads. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:102-105 [Conf]
  12. Hassan Fallah-Adl, Joseph JáJá, Shunlin Liang
    Efficient Algorithms for Estimating Atmosperic Parameters for Surface Reflectance Retrieval. [Citation Graph (0, 0)][DBLP]
    ICPP, Vol. 2, 1996, pp:132-141 [Conf]
  13. David R. Helman, Joseph JáJá
    Efficient Image Processing Algorithms on the Scan Line Array Processor. [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:90-93 [Conf]
  14. Ying-Min Huang, Joseph JáJá
    An Optimal Ear Decomposition Algorithm with Applications on Fixed-Size Linear Arrays. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1995, pp:97-104 [Conf]
  15. Joseph JáJá
    On Combining Technology and Theory in Search of a Parallel Computation Model. [Citation Graph (0, 0)][DBLP]
    ICPP Workshop, 1996, pp:115-123 [Conf]
  16. Joseph JáJá, Kwan Woo Ryu
    Load Balancing on the Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP]
    ICPP (1), 1990, pp:203-210 [Conf]
  17. Robert Michael Owens, Joseph JáJá
    Optimal Algorithms for Mesh-Connected Parallel Processors with Serial Memories. [Citation Graph (0, 0)][DBLP]
    ICPP, 1986, pp:812-818 [Conf]
  18. Kwan Woo Ryu, Joseph JáJá
    List Ranking on the Hypercube. [Citation Graph (0, 0)][DBLP]
    ICPP (3), 1989, pp:20-23 [Conf]
  19. Robert Snelick, Joseph JáJá, Raghu Kacker, Gordon Lyon
    Using Synthetic-Perturbation Techniques for Tuning Shared Memory Programs (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    ICPP, 1993, pp:2-10 [Conf]
  20. David A. Bader, Joseph JáJá
    Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:292-301 [Conf]
  21. David A. Bader, Joseph JáJá, David Harwood, Larry S. Davis
    Parallel Algorithms for Image Enhancement and Segmentation by Region Growing with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    IPPS, 1996, pp:414-423 [Conf]
  22. David R. Helman, Joseph JáJá
    Sorting on Clusters of SMPs. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1998, pp:561-567 [Conf]
  23. David R. Helman, Joseph JáJá
    Prefix Computations on Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPPS/SPDP, 1999, pp:7-13 [Conf]
  24. Joseph JáJá
    Designing Efficient Parallel Algorithms: Models and Paradigms with Applications to Image Processing. [Citation Graph (0, 0)][DBLP]
    IPPS, 1993, pp:385- [Conf]
  25. Joseph JáJá, Kwan Woo Ryu
    The Block Distributed Memory Model for Shared Memory Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:752-756 [Conf]
  26. Joseph JáJá, Kwan Woo Ryu, Uzi Vishkin
    Sorting Strings and Constructing Digital Search Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    IPPS, 1994, pp:349-356 [Conf]
  27. Joseph JáJá
    On Computation Models for Clusters of Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2001, pp:136- [Conf]
  28. Qin Wang, Joseph JáJá, Amitabh Varshney
    An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering. [Citation Graph (0, 0)][DBLP]
    IPDPS, 2006, pp:- [Conf]
  29. Joseph JáJá, Christian Worm Mortensen, Qingmin Shi
    Space-Efficient and Fast Algorithms for Multidimensional Dominance Reporting and Counting. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:558-568 [Conf]
  30. Qingmin Shi, Joseph JáJá
    Techniques for Indexing and Querying Temporal Observations for a Collection of Objects. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2004, pp:822-834 [Conf]
  31. Joseph JáJá
    Strategies for Exploring Large Scale Data. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:2- [Conf]
  32. Joseph JáJá, Janos Simon
    Parallel Algorithms in Graph Theory: Planarity Testing (preliminary version). [Citation Graph (0, 0)][DBLP]
    MFCS, 1980, pp:305-319 [Conf]
  33. Reagan W. Moore, Joseph JáJá, Robert Chadduck
    Mitigating Risk of Data Loss in Preservation Environments. [Citation Graph (0, 0)][DBLP]
    MSST, 2005, pp:39-48 [Conf]
  34. Joseph JáJá, Mike Smorul, Fritz McCall, Yang Wang
    Scalable, Reliable Marshalling and Organization of Distributed Large Scale Data Onto Enterprise Storage Environments. [Citation Graph (0, 0)][DBLP]
    MSST, 2005, pp:197-201 [Conf]
  35. David A. Bader, Joseph JáJá
    Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    PPOPP, 1995, pp:123-133 [Conf]
  36. Hassan Fallah-Adl, Joseph JáJá, Shunlin Liang, Yoram J. Kaufman, John Townshend
    Efficient Algorithms for Atmospheric Correction of Remotely Sensed Data. [Citation Graph (0, 0)][DBLP]
    SC, 1995, pp:- [Conf]
  37. Manuel Rodriguez-Martinez, Nick Roussopoulos, John M. McGann, Stephen Kelley, Vadim Katz, Zhexuan Song, Joseph JáJá
    MOCHA: A Database Middleware System Featuring Automatic Deployment of Application-Specific Functionality. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2000, pp:594- [Conf]
  38. David R. Helman, David A. Bader, Joseph JáJá
    Parallel Algorithms for Personalized Communication and Sorting with an Experimental Study (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    SPAA, 1996, pp:211-222 [Conf]
  39. Joseph JáJá, Kwan Woo Ryu
    An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. [Citation Graph (0, 0)][DBLP]
    SPAA, 1993, pp:230-239 [Conf]
  40. Joseph JáJá, Jusub Kim, Qin Wang
    Temporal Range Exploration of Large Scale Multidimensional Time Series Data. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2004, pp:95-0 [Conf]
  41. Qingmin Shi, Joseph JáJá
    Efficient Techniques for Range Search Queries on Earth Science Data. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2002, pp:142-0 [Conf]
  42. Joseph JáJá
    Optimal Evaluation of Pairs of Bilinear Forms [Citation Graph (0, 0)][DBLP]
    STOC, 1978, pp:173-183 [Conf]
  43. Joseph JáJá
    On the Complexity of Bilinear Forms with Commutativity [Citation Graph (0, 0)][DBLP]
    STOC, 1979, pp:197-208 [Conf]
  44. Joseph JáJá
    Time-Space Tradeoffs for some Algebraic Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1980, pp:339-350 [Conf]
  45. Qingmin Shi, Joseph JáJá
    Fast Algorithms for a Class of Temporal Range Queries. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:91-102 [Conf]
  46. Joseph JáJá, Janos Simon
    Space Efficient Algorithms for Some Graph Theoretical Problems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1982, v:17, n:, pp:411-423 [Journal]
  47. S. Alice Wu, Joseph JáJá
    Optimal Algorithms for Adjacent Side Routing. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1991, v:6, n:4, pp:565-578 [Journal]
  48. Qingmin Shi, Joseph JáJá
    Fast Algorithms For 3-D Dominance Reporting And Counting. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2004, v:15, n:4, pp:673-684 [Journal]
  49. David R. Helman, Joseph JáJá
    Sorting on Clusters of SMPs. [Citation Graph (0, 0)][DBLP]
    Informatica (Slovenia), 1999, v:23, n:1, pp:- [Journal]
  50. Ronald I. Greenberg, Joseph JáJá, Sridhar Krishnamurthy
    On the Difficulty of Manhattan Channel Routing. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:5, pp:281-284 [Journal]
  51. Joseph JáJá, Jean Takche
    Improved Lower Bounds for Some Matrix Multiplication Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1985, v:21, n:3, pp:123-127 [Journal]
  52. Qingmin Shi, Joseph JáJá
    Optimal and near-optimal algorithms for generalized intersection reporting on pointer machines. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2005, v:95, n:3, pp:382-388 [Journal]
  53. Robert Snelick, Joseph JáJá, Raghu Kacker, Gordon Lyon
    Using Synthetic Perturbations and Statistical Screening to Assay Shared-Memory Programs. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1995, v:54, n:3, pp:147-153 [Journal]
  54. Tinku Acharya, Joseph JáJá
    An On-Line Variable-Length Binary Encoding of Text. [Citation Graph (0, 0)][DBLP]
    Inf. Sci., 1996, v:94, n:1-4, pp:1-22 [Journal]
  55. Joseph JáJá
    Computations of Bilinear Forms over Finite Fields. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1980, v:27, n:4, pp:822-830 [Journal]
  56. Joseph JáJá
    Time-Space Trade-offs for Some Algebraic Problems [Citation Graph (0, 0)][DBLP]
    J. ACM, 1983, v:30, n:3, pp:657-667 [Journal]
  57. Joseph JáJá
    The VLSI Complexity of Selected Graph Problems. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:2, pp:377-391 [Journal]
  58. Joseph JáJá, Viktor K. Prasanna
    Information Transfer in Distributed Computing with Applications to VLSI. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1984, v:31, n:1, pp:150-162 [Journal]
  59. Teofilo F. Gonzalez, Joseph JáJá
    On the Complexity of Computing Bilinear Forms with {0, 1} Constants. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1980, v:20, n:1, pp:77-95 [Journal]
  60. Joseph JáJá
    The Computational Complexity of a Set of Quadratic Functions. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1982, v:24, n:2, pp:209-223 [Journal]
  61. David A. Bader, David R. Helman, Joseph JáJá
    Practical Parallel Algorithms for Personalized Communication and Integer Sorting. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1996, v:1, n:, pp:3- [Journal]
  62. David R. Helman, Joseph JáJá, David A. Bader
    A New Deterministic Parallel Sorting Algorithm with an Experimental Evaluation. [Citation Graph (0, 0)][DBLP]
    ACM Journal of Experimental Algorithms, 1998, v:3, n:, pp:4- [Journal]
  63. David A. Bader, Joseph JáJá
    Parallel Algorithms for Image Histogramming and Connected Components with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1996, v:35, n:2, pp:173-190 [Journal]
  64. David A. Bader, Joseph JáJá
    SIMPLE: A Methodology for Programming High Performance Algorithms on Clusters of Symmetric Multiprocessors (SMPs). [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1999, v:58, n:1, pp:92-108 [Journal]
  65. David R. Helman, David A. Bader, Joseph JáJá
    A Randomized Parallel Sorting Algorithm with an Experimental Study. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1998, v:52, n:1, pp:1-23 [Journal]
  66. David R. Helman, Joseph JáJá
    Prefix Computations on Symmetric Multiprocessors. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2001, v:61, n:2, pp:265-278 [Journal]
  67. Joseph JáJá, Kwan Woo Ryu
    Load Balancing and Routing on the Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1992, v:14, n:4, pp:431-435 [Journal]
  68. Joseph JáJá, Pearl Y. Wang
    Special Issue on Data Parallel Algorithms and Programming - Guest Editors' Introduction. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1994, v:21, n:1, pp:1-3 [Journal]
  69. David R. Helman, Joseph JáJá
    Efficient Image Processing Algorithms on the Scan Line Array Processor. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Pattern Anal. Mach. Intell., 1995, v:17, n:1, pp:47-56 [Journal]
  70. Omer Berkman, Joseph JáJá, Sridhar Krishnamurthy, Ramakrishna Thurimella, Uzi Vishkin
    Top-Bottom Routing Around a Rectangle is as Easy as Computing Prefix Minima. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1994, v:23, n:3, pp:449-465 [Journal]
  71. Greg N. Frederickson, Joseph JáJá
    Approximation Algorithm for Several Graph Augmentation Problems. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1981, v:10, n:2, pp:270-283 [Journal]
  72. Teofilo F. Gonzalez, Joseph JáJá
    Evaluation of Arithmetic Expressions with Algebraic Identities. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:4, pp:633-662 [Journal]
  73. Joseph JáJá
    Optimal Evaluation of Pairs of Bilinear Forms. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1979, v:8, n:3, pp:443-462 [Journal]
  74. Joseph JáJá
    On the Complexity of Bilinear Forms with Commutativity. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1980, v:9, n:4, pp:713-728 [Journal]
  75. Joseph JáJá, Shing-Chong Chang
    Parallel Algorithms for Channel Routing in the Knock-Knee Model. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1991, v:20, n:2, pp:228-245 [Journal]
  76. Joseph JáJá, Viktor K. Prasanna, Janos Simon
    Information Transfer under Different Sets of Protocols. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1984, v:13, n:4, pp:840-849 [Journal]
  77. Joseph JáJá, Janos Simon
    Parallel Algorithms in Graph Theory: Planarity Testing. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1982, v:11, n:2, pp:314-328 [Journal]
  78. Joseph JáJá, Jean Takche
    On the Validity of the Direct Sum Conjecture. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1986, v:15, n:4, pp:1004-1020 [Journal]
  79. Robert Snelick, Joseph JáJá, Raghu Kacker, Gordon Lyon
    Synthetic-perturbation Techniques for Screening Shared Memory Programs. [Citation Graph (0, 0)][DBLP]
    Softw., Pract. Exper., 1994, v:24, n:8, pp:679-701 [Journal]
  80. Chaitali Chakrabarti, Joseph JáJá
    Systolic Architectures for the Computation of the Discrete Hartley and the Discrete Cosine Transforms Based on Prime Factor Decomposition. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1990, v:39, n:11, pp:1359-1368 [Journal]
  81. Chaitali Chakrabarti, Joseph JáJá
    VLSI Architectures for Multidimensional Transforms. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1991, v:40, n:9, pp:1053-1057 [Journal]
  82. Joseph JáJá, Robert Michael Owens
    VLSI Sorting with Reduced Hardware. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1984, v:33, n:7, pp:668-671 [Journal]
  83. Joseph JáJá, Sau-Mou Wu
    A New Approach to Realizing Partially Symmetric Functions. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1989, v:38, n:6, pp:896-898 [Journal]
  84. Robert Michael Owens, Joseph JáJá
    Parallel Sorting with Serial Momories. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1985, v:34, n:4, pp:379-383 [Journal]
  85. Joseph JáJá, S. Alice Wu
    On routing two-terminal nets in the presence of obstacles. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. on CAD of Integrated Circuits and Systems, 1989, v:8, n:5, pp:563-570 [Journal]
  86. Greg N. Frederickson, Joseph JáJá
    On the Relationship between the Biconnectivity Augmentation and Traveling Salesman Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:19, n:, pp:189-201 [Journal]
  87. Joseph JáJá, Kwan Woo Ryu
    An Efficient Parallel Algorithm for the Single Function Coarsest Partition Problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1994, v:129, n:2, pp:293-307 [Journal]
  88. Joseph JáJá, Kwan Woo Ryu, Uzi Vishkin
    Sorting Strings and Constructing Digital Search Trees in Parallel. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:154, n:2, pp:225-245 [Journal]
  89. Qingmin Shi, Joseph JáJá
    A new framework for addressing temporal range queries and some preliminary results. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2005, v:332, n:1-3, pp:109-121 [Journal]
  90. David A. Bader, Joseph JáJá, Rama Chellappa
    Scalable data parallel algorithms for texture synthesis using Gibbs random fields. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Image Processing, 1995, v:4, n:10, pp:1456-1460 [Journal]
  91. Joseph JáJá, Kwan Woo Ryu
    The Block Distributed Memory Model. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1996, v:7, n:8, pp:830-840 [Journal]
  92. Joseph JáJá, Kwan Woo Ryu
    Optimal Algorithms on the Pipelined Hypercube and Related Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1993, v:4, n:5, pp:582-591 [Journal]
  93. Kwan Woo Ryu, Joseph JáJá
    Efficient Algorithms for List Ranking and for Solving Graph Problems on the Hypercube. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1990, v:1, n:1, pp:83-90 [Journal]
  94. Qingmin Shi, Joseph JáJá
    Isosurface Extraction and Spatial Filtering using Persistent Octree (POT). [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Vis. Comput. Graph., 2006, v:12, n:5, pp:1283-1290 [Journal]
  95. Jusub Kim, Joseph JáJá
    Information-Aware 2n-Tree for Efficient Out-of-Core Indexing of Very Large Multidimensional Volumetric Data. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2007, pp:9- [Conf]
  96. Jusub Kim, Joseph JáJá
    Component-based Data Layout for Efficient Slicing of Very Large Multidimensional Volumetric Data. [Citation Graph (0, 0)][DBLP]
    SSDBM, 2007, pp:8- [Conf]
  97. Qin Wang, Joseph JáJá, Amitabh Varshney
    An efficient and scalable parallel algorithm for out-of-core isosurface extraction and rendering. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2007, v:67, n:5, pp:592-603 [Journal]

  98. Interactive direct volume rendering on desktop multicore processors. [Citation Graph (, )][DBLP]


Search in 0.119secs, Finished in 0.126secs
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