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

Search the dblp DataBase

Title:
Author:
Ivan Hal Sudborough: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ivan Hal Sudborough
    Time and Tape Bounded Auxiliary Pushdown Automata. [Citation Graph (1, 0)][DBLP]
    MFCS, 1977, pp:493-503 [Conf]
  2. Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
    Embedding Grids into Hypercubes. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:201-211 [Conf]
  3. Zevi Miller, Ivan Hal Sudborough
    A Polynomial Algorithm for Recognizing Samll Cutwidth in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Aegean Workshop on Computing, 1986, pp:252-260 [Conf]
  4. Burkhard Monien, Ivan Hal Sudborough
    Simulating Binary Trees on Hypercubes. [Citation Graph (0, 0)][DBLP]
    AWOC, 1988, pp:170-180 [Conf]
  5. Linda Morales, Ivan Hal Sudborough
    Comparing Star and Pancake Networks. [Citation Graph (0, 0)][DBLP]
    The Essence of Computation, 2002, pp:18-36 [Conf]
  6. Fillia Makedon, Christos H. Papadimitriou, Ivan Hal Sudborough
    Topological Bandwidth. [Citation Graph (0, 0)][DBLP]
    CAAP, 1983, pp:317-331 [Conf]
  7. Saïd Bettayeb, Zevi Miller, Tony Peng, Ivan Hal Sudborough
    Embedding k-D Meshes into Optimum Hypercubes with Dilation 2k-1 (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    Canada-France Conference on Parallel and Distributed Computing, 1994, pp:73-80 [Conf]
  8. Wolfgang W. Bein, Lawrence L. Larmore, Linda Morales, Ivan Hal Sudborough
    A Faster and Simpler 2-Approximation Algorithm for Block Sorting. [Citation Graph (0, 0)][DBLP]
    FCT, 2005, pp:115-124 [Conf]
  9. Ivan Hal Sudborough
    Pebbling and Bandwith. [Citation Graph (0, 0)][DBLP]
    FCT, 1981, pp:373-383 [Conf]
  10. Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
    Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees [Citation Graph (0, 0)][DBLP]
    FOCS, 1982, pp:262-271 [Conf]
  11. Ivan Hal Sudborough
    Computation by Multi-Head Finite Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1971, pp:105-113 [Conf]
  12. Ivan Hal Sudborough
    On Tape-Bounded Complexity Classes and Multi-Head Finite Automata [Citation Graph (0, 0)][DBLP]
    FOCS, 1973, pp:138-144 [Conf]
  13. Ivan Hal Sudborough
    Efficient Algorithms for Path System Problems and Applications to Alternating and Time-Space Complexity Classes [Citation Graph (0, 0)][DBLP]
    FOCS, 1980, pp:62-73 [Conf]
  14. Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
    Towards Trusted Online Dissemination of Consumer Information. [Citation Graph (0, 0)][DBLP]
    HICSS, 2004, pp:- [Conf]
  15. Linda Gardner, Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
    Embedding hypercubes into pancake, cycle prefix and substring reversal networks. [Citation Graph (0, 0)][DBLP]
    HICSS (2), 1995, pp:537-545 [Conf]
  16. Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
    Efficient Algorithms for Batch Re-Keying Operations in Secure Multicast. [Citation Graph (0, 0)][DBLP]
    HICSS, 2006, pp:- [Conf]
  17. Linda Morales, Ivan Hal Sudborough, Mohamed Eltoweissy, Mohammad Hossain Heydari
    Combinatorial Optimization of Multicast Key Management. [Citation Graph (0, 0)][DBLP]
    HICSS, 2003, pp:332- [Conf]
  18. Mohammad Hossain Heydari, Linda Morales, C. O. Shields Jr., Ivan Hal Sudborough
    Computing Cross Associations for Attack Graphs and Other Applications. [Citation Graph (0, 0)][DBLP]
    HICSS, 2007, pp:270- [Conf]
  19. Fillia Makedon, Ivan Hal Sudborough
    Minimizing Width in Linear Layouts. [Citation Graph (0, 0)][DBLP]
    ICALP, 1983, pp:478-490 [Conf]
  20. Burkhard Monien, Ivan Hal Sudborough
    On Eliminating Nondeterminism From Turing Machines Which Use Less Than Logarithmic Worktape Space. [Citation Graph (0, 0)][DBLP]
    ICALP, 1979, pp:431-445 [Conf]
  21. Burkhard Monien, Ivan Hal Sudborough
    Min Cut is NP-Complete for Edge Weigthed Trees. [Citation Graph (0, 0)][DBLP]
    ICALP, 1986, pp:265-274 [Conf]
  22. Ivan Hal Sudborough
    The Time and Tape Complexity of Developmental Languages. [Citation Graph (0, 0)][DBLP]
    ICALP, 1977, pp:509-523 [Conf]
  23. Dipak Pravin Doctor, Ivan Hal Sudborough
    Parallel Algorithm for Quadtree Medial Axis Transform. [Citation Graph (0, 0)][DBLP]
    ICCI, 1993, pp:266-271 [Conf]
  24. Douglas W. Bass, Ivan Hal Sudborough
    Pancake Problems with Restricted Prefix Reversals and some Corresponding Cayley Networks. [Citation Graph (0, 0)][DBLP]
    ICPP, 1998, pp:11-0 [Conf]
  25. Bin Cong, Zevi Miller, Ivan Hal Sudborough
    Optimum Simulation of Meshes by Small Hypercubes. [Citation Graph (0, 0)][DBLP]
    IMYCS, 1990, pp:30-46 [Conf]
  26. Douglas W. Bass, Ivan Hal Sudborough
    Symmetric k-Factorizations of Hypercubes with Factors of Small Diameter. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:219-224 [Conf]
  27. Douglas W. Bass, Ivan Hal Sudborough
    On The Shuffle-Exchange Permutation Network. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1997, pp:165-171 [Conf]
  28. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
    Block Sorting is Hard. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:349-354 [Conf]
  29. X. Feng, Z. Meng, Ivan Hal Sudborough
    Improved Upper Bound for Sorting by Short Swaps. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2004, pp:98-103 [Conf]
  30. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Three-Dimensional Embedding of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2000, pp:140-147 [Conf]
  31. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Fixed Layer Embeddings of Binary Trees. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:281-0 [Conf]
  32. Marissa P. Justan, Felix P. Muga II, Ivan Hal Sudborough
    On the Generalization of the Pancake Network. [Citation Graph (0, 0)][DBLP]
    ISPAN, 2002, pp:173-178 [Conf]
  33. Y.-B. Lin, Ivan Hal Sudborough, Zevi Miller, Dan Pritikin, Manley Perkel
    On Mapping Complete Binary Trees into Grids and Extended Grids. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:242-247 [Conf]
  34. Ivan Hal Sudborough, Taoyu Zhang
    Circuit-Switched Routings for Automorphisms of a Hypercube. [Citation Graph (0, 0)][DBLP]
    ISPAN, 1999, pp:28-35 [Conf]
  35. Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
    Simulation Permutation Networks on Hypercubes. [Citation Graph (0, 0)][DBLP]
    LATIN, 1992, pp:61-70 [Conf]
  36. Burkhard Monien, Ivan Hal Sudborough
    Time and Space Bounded Complexity Classes and Bandwidth Constrained Problems (A Survey). [Citation Graph (0, 0)][DBLP]
    MFCS, 1981, pp:78-93 [Conf]
  37. Burkhard Monien, Ivan Hal Sudborough
    Comparing Interconnection Networks. [Citation Graph (0, 0)][DBLP]
    MFCS, 1988, pp:138-153 [Conf]
  38. Ivan Hal Sudborough, A. Zalcberg
    On Families of Languages Defined by Time-Bounded Random Access Machines. [Citation Graph (0, 0)][DBLP]
    MFCS, 1973, pp:333-338 [Conf]
  39. Mohammad Hossain Heydari, Ivan Hal Sudborough
    On Sorting by Prefix Reversals and the Diameter of Pancake Networks. [Citation Graph (0, 0)][DBLP]
    Heinz Nixdorf Symposium, 1992, pp:218-227 [Conf]
  40. Dipak Pravin Doctor, Ivan Hal Sudborough
    Efficient Parallel Sibling Finding for Quadtree Data Structure. [Citation Graph (0, 0)][DBLP]
    SPDP, 1993, pp:141-149 [Conf]
  41. S. Madhavapeddy, Ivan Hal Sudborough
    A topological property of hypercubes: node disjoint paths. [Citation Graph (0, 0)][DBLP]
    SPDP, 1990, pp:532-539 [Conf]
  42. Burkhard Monien, Ivan Hal Sudborough
    Bandwidth Constrained NP-Complete Problems [Citation Graph (0, 0)][DBLP]
    STOC, 1981, pp:207-217 [Conf]
  43. Ivan Hal Sudborough
    On Deterministic Context-Free Languages, Multihead Automata, and the Power of an Auxiliary Pushdown Store [Citation Graph (0, 0)][DBLP]
    STOC, 1976, pp:141-148 [Conf]
  44. Ivan Hal Sudborough
    Separating Tape Bounded Auxiliary Pushdown Automata Classes [Citation Graph (0, 0)][DBLP]
    STOC, 1977, pp:208-217 [Conf]
  45. Adair Dingle, Ivan Hal Sudborough
    On the Complexity of Single Row Routing Problems. [Citation Graph (0, 0)][DBLP]
    WADS, 1989, pp:529-540 [Conf]
  46. Seshu Madhavapeddy, Ivan Hal Sudborough
    Disjoint Paths in the Hypercube. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:3-18 [Conf]
  47. Seshu Madhavapeddy, Ivan Hal Sudborough
    Deterministic Message Routing in Faulty Hypercubes. [Citation Graph (0, 0)][DBLP]
    WG, 1990, pp:154-169 [Conf]
  48. Ivan Hal Sudborough
    The Complexity of Path Problems in Graphs and Path Systems of Bounded Bandwidth. [Citation Graph (0, 0)][DBLP]
    WG, 1980, pp:293-305 [Conf]
  49. Moon-Jung Chung, Michael Evangelist, Ivan Hal Sudborough
    Complete Problems for Space Bounded Subclasses of NP. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1985, v:22, n:4, pp:379-395 [Journal]
  50. Y.-B. Lin, Zevi Miller, Manley Perkel, Dan Pritikin, Ivan Hal Sudborough
    Expansion of layouts of complete binary trees into grids. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2003, v:131, n:3, pp:611-642 [Journal]
  51. Jonathan A. Ellis, Ivan Hal Sudborough, Jonathan S. Turner
    The Vertex Separation and Search Number of a Graph [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:113, n:1, pp:50-79 [Journal]
  52. Hermann A. Maurer, Ivan Hal Sudborough, Emo Welzl
    On the Complexity of the General Coloring Problem [Citation Graph (0, 0)][DBLP]
    Information and Control, 1981, v:51, n:2, pp:128-145 [Journal]
  53. Ivan Hal Sudborough
    Bounded-Reversal Multihead Finite Automata Languages [Citation Graph (0, 0)][DBLP]
    Information and Control, 1974, v:25, n:4, pp:317-328 [Journal]
  54. Ivan Hal Sudborough
    One-Way Multihead Writing Finite Automata [Citation Graph (0, 0)][DBLP]
    Information and Control, 1976, v:30, n:1, pp:1-20 [Journal]
  55. Wolfgang W. Bein, Lawrence L. Larmore, Shahram Latifi, Ivan Hal Sudborough
    Block Sorting is Hard. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:3, pp:425-437 [Journal]
  56. Xiaojun Shen, Qing Hu, Bin Cong, Ivan Hal Sudborough, Mike Girou, Saïd Bettayeb
    The 4-Star Graph is not a Subgraph of Any Hypercube. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1993, v:45, n:4, pp:199-203 [Journal]
  57. Shai Simonson, Ivan Hal Sudborough
    On the Complexity of Tree Embedding Problems. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:44, n:6, pp:323-328 [Journal]
  58. Ivan Hal Sudborough
    A Note on Weak Operator Precedence Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1977, v:6, n:6, pp:213-218 [Journal]
  59. Ivan Hal Sudborough
    A Note on Weak Operator Precedence Grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1978, v:7, n:5, pp:213-218 [Journal]
  60. Ivan Hal Sudborough
    Some Remarks on Multihead Automata. [Citation Graph (0, 0)][DBLP]
    ITA, 1977, v:11, n:3, pp:181-195 [Journal]
  61. Ivan Hal Sudborough
    A Note on Tape-Bounded Complexity Classes and Linear Context-Free languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1975, v:22, n:4, pp:499-500 [Journal]
  62. Ivan Hal Sudborough
    On the Tape Complexity of Deterministic Context-Free Languages. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1978, v:25, n:3, pp:405-414 [Journal]
  63. Eitan M. Gurari, Ivan Hal Sudborough
    Improved Dynamic Programming Algorithms for Bandwidth Minimization and the MinCut Linear Arrangement Problem. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1984, v:5, n:4, pp:531-546 [Journal]
  64. Mohammad Hossain Heydari, Ivan Hal Sudborough
    On the Diameter of the Pancake Network. [Citation Graph (0, 0)][DBLP]
    J. Algorithms, 1997, v:25, n:1, pp:67-94 [Journal]
  65. Saïd Bettayeb, Zevi Miller, Ivan Hal Sudborough
    Embedding Grids into Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1992, v:45, n:3, pp:340-366 [Journal]
  66. Adair Dingle, Ivan Hal Sudborough
    Single Row Routing on Multilayers. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1995, v:50, n:1, pp:126-131 [Journal]
  67. Ivan Hal Sudborough
    On Tape-Bounded Complexity Classes and Multihead Finite Automata. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1975, v:10, n:1, pp:62-76 [Journal]
  68. Douglas W. Bass, Ivan Hal Sudborough
    Hamilton Decompositions and (n/2)-Factorizations of Hypercubes. [Citation Graph (0, 0)][DBLP]
    J. Graph Algorithms Appl., 2003, v:7, n:1, pp:79-98 [Journal]
  69. Mohamed Eltoweissy, Mohammad Hossain Heydari, Linda Morales, Ivan Hal Sudborough
    Combinatorial Optimization of Group Key Management. [Citation Graph (0, 0)][DBLP]
    J. Network Syst. Manage., 2004, v:12, n:1, pp:- [Journal]
  70. Wolfgang W. Bein, Lawrence L. Larmore, Charles Shields Jr., Ivan Hal Sudborough
    Embedding A Complete Binary Tree Into A Three-Dimensional Grid. [Citation Graph (0, 0)][DBLP]
    Journal of Interconnection Networks, 2004, v:5, n:2, pp:111-130 [Journal]
  71. Douglas W. Bass, Ivan Hal Sudborough
    Pancake problems with restricted prefix reversals and some corresponding Cayley networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 2003, v:63, n:3, pp:327-336 [Journal]
  72. Adair Dingle, Ivan Hal Sudborough
    Simulation of Binary Trees and X-Trees on Pyramid Networks. [Citation Graph (0, 0)][DBLP]
    J. Parallel Distrib. Comput., 1993, v:19, n:2, pp:119-124 [Journal]
  73. Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
    Bounded Dilation Maps of Hypercubes into Cayley Graphs on the Symmetric Group. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1996, v:29, n:6, pp:551-572 [Journal]
  74. Zevi Miller, Ivan Hal Sudborough
    A Polynomial Algorithm for Recognizing Bounded Cutwidth in Hypergraphs. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:1, pp:11-40 [Journal]
  75. Zevi Miller, Dan Pritikin, Manley Perkel, Ivan Hal Sudborough
    The sequential sum problem and performance bounds on the greedy algorithm for the on-line Steiner problem. [Citation Graph (0, 0)][DBLP]
    Networks, 2005, v:45, n:3, pp:143-164 [Journal]
  76. Moon-Jung Chung, Fillia Makedon, Ivan Hal Sudborough, Jonathan S. Turner
    Polynomial Time Algorithms for the Min Cut Problem on Degree Restricted Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1985, v:14, n:1, pp:158-177 [Journal]
  77. Ivan Hal Sudborough, A. Zalcberg
    On Families of Languages Defined by Time-Bounded Random Access Machines. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1976, v:5, n:2, pp:217-230 [Journal]
  78. Saïd Bettayeb, Bin Cong, Mike Girou, Ivan Hal Sudborough
    Embedding Star Networks into Hypercubes. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1996, v:45, n:2, pp:186-194 [Journal]
  79. Zevi Miller, Dan Pritikin, Ivan Hal Sudborough
    Near Embeddings of Hypercubes into Cayley Graphs on the Symmetric Group. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Computers, 1994, v:43, n:1, pp:13-22 [Journal]
  80. Qian-Ping Gu, Shietung Peng, Ivan Hal Sudborough
    A 2-Approximation Algorithm for Genome Rearrangements by Reversals and Transpositions. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1999, v:210, n:2, pp:327-339 [Journal]
  81. Changwook Kim, Ivan Hal Sudborough
    Leftmove-bounded picture languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:237, n:1-2, pp:183-195 [Journal]
  82. Changwook Kim, Ivan Hal Sudborough
    The Membership and Equivalence Problems for Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1987, v:52, n:, pp:177-191 [Journal]
  83. Changwook Kim, Ivan Hal Sudborough
    On Reversal-Bounded Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:104, n:2, pp:185-206 [Journal]
  84. Burkhard Monien, Ivan Hal Sudborough
    On Eliminating Nondeterminism from Turing Machines which Use less than Logarithm Worktape Space. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1982, v:21, n:, pp:237-253 [Journal]
  85. Burkhard Monien, Ivan Hal Sudborough
    Bandwidth Constrained NP-Complete Problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:41, n:, pp:141-167 [Journal]
  86. Burkhard Monien, Ivan Hal Sudborough
    Min Cut is NP-Complete for Edge Weighted Treees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1988, v:58, n:, pp:209-229 [Journal]
  87. Ivan Hal Sudborough
    Bandwidth Constraints on Problems Complete for Polynomial Time. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1983, v:26, n:, pp:25-52 [Journal]
  88. Ivan Hal Sudborough, Emo Welzl
    Complexity and Decidability for Chain Code Picture Languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1985, v:36, n:, pp:173-202 [Journal]
  89. Douglas W. Bass, Ivan Hal Sudborough
    Removing edges from hypercubes to obtain vertex-symmetric networks with small diameter. [Citation Graph (0, 0)][DBLP]
    Telecommunication Systems, 2000, v:13, n:1, pp:135-146 [Journal]
  90. Darel A. Linebarger, Ivan Hal Sudborough, Ioannis G. Tollis
    Difference bases and sparse sensor arrays. [Citation Graph (0, 0)][DBLP]
    IEEE Transactions on Information Theory, 1993, v:39, n:2, pp:716-0 [Journal]
  91. Adair Dingle, Ivan Hal Sudborough
    Efficient Mappings of Pyramid Networks. [Citation Graph (0, 0)][DBLP]
    IEEE Trans. Parallel Distrib. Syst., 1994, v:5, n:10, pp:1009-1017 [Journal]

  92. Adjacent Swaps on Strings. [Citation Graph (, )][DBLP]


  93. Bounding Prefix Transposition Distance for Strings and Permutations. [Citation Graph (, )][DBLP]


  94. Bounding the Size of k-Tuple Covers. [Citation Graph (, )][DBLP]


  95. Clustering and the Biclique Partition Problem. [Citation Graph (, )][DBLP]


  96. Stack and Queue Layouts for Toruses and Extended Hypercubes. [Citation Graph (, )][DBLP]


  97. Three disjoint path paradigms in star networks. [Citation Graph (, )][DBLP]


  98. Calibrating an Embedded Protocol on an Asynchronous System. [Citation Graph (, )][DBLP]


  99. Bandwidth and pebbling. [Citation Graph (, )][DBLP]


  100. On minimizing width in linear layouts. [Citation Graph (, )][DBLP]


  101. Short proofs for cut-and-paste sorting of permutations. [Citation Graph (, )][DBLP]


Search in 0.005secs, Finished in 0.454secs
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