The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Jörg Rothe: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Anyone but Him: The Complexity of Precluding an Alternative. [Citation Graph (0, 0)][DBLP]
    AAAI, 2005, pp:95-101 [Conf]
  2. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    On Sets with Easy Certificates and the Existence of One-Way Permutations. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:264-275 [Conf]
  3. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    The Join Can Lower Complexity. [Citation Graph (0, 0)][DBLP]
    COCOON, 1996, pp:260-267 [Conf]
  4. Lane A. Hemaspaandra, Jörg Rothe
    Intersection Suffices for Boolean Hierarchy Equivalence. [Citation Graph (0, 0)][DBLP]
    COCOON, 1995, pp:430-435 [Conf]
  5. Jörg Rothe
    Exact-Four-Colorability, Exact Domatic Number Problems, and the Boolean Hierarchy. [Citation Graph (0, 0)][DBLP]
    Algebraic Methods in Computational Complexity, 2004, pp:- [Conf]
  6. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems. [Citation Graph (0, 0)][DBLP]
    FCT, 1999, pp:124-135 [Conf]
  7. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
    If P != NP Then Some Strongly Noninvertible Functions Are Invertible. [Citation Graph (0, 0)][DBLP]
    FCT, 2001, pp:162-171 [Conf]
  8. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP]
    ICALP, 1997, pp:214-224 [Conf]
  9. André Große, Jörg Rothe, Gerd Wechsung
    Relating Partial and Complete Solutions and the Complexity of Computing Smallest Solutions. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:339-356 [Conf]
  10. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2005, pp:265-279 [Conf]
  11. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of Exact-Four-Colorability and of the Winner Problem for Young Elections. [Citation Graph (0, 0)][DBLP]
    IFIP TCS, 2002, pp:310-322 [Conf]
  12. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control. [Citation Graph (0, 0)][DBLP]
    IJCAI, 2007, pp:1308-1314 [Conf]
  13. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
    Tally NP Sets and Easy Census Functions. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:483-492 [Conf]
  14. Lane A. Hemaspaandra, Jörg Rothe
    A Second Step Towards Circuit Complexity-Theoretic Analogs of Rice's Theorem. [Citation Graph (0, 0)][DBLP]
    MFCS, 1998, pp:418-426 [Conf]
  15. Tobias Riege, Jörg Rothe
    An Exact 2.9416n Algorithm for the Three Domatic Number Problem. [Citation Graph (0, 0)][DBLP]
    MFCS, 2005, pp:733-744 [Conf]
  16. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
    Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP]
    WG, 2002, pp:258-269 [Conf]
  17. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    Easy Sets and Hard Certificate Schemes. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:11, pp:859-879 [Journal]
  18. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Anyone but him: The complexity of precluding an alternative. [Citation Graph (0, 0)][DBLP]
    Artif. Intell., 2007, v:171, n:5-6, pp:255-285 [Journal]
  19. Jörg Rothe
    Heuristics Versus Completeness for Graph Coloring. [Citation Graph (0, 0)][DBLP]
    Chicago J. Theor. Comput. Sci., 2000, v:2000, n:, pp:- [Journal]
  20. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
    If P \neq NP then Some Strongly Noninvertible Functions are Invertible [Citation Graph (0, 0)][DBLP]
    CoRR, 2000, v:0, n:, pp:- [Journal]
  21. André Große, Jörg Rothe, Gerd Wechsung
    Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  22. André Große, Jörg Rothe, Gerd Wechsung
    A Note on the Complexity of Computing the Smallest Four-Coloring of Planar Graphs [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  23. Jörg Rothe
    Exact Complexity of Exact-Four-Colorability [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  24. Edith Hemaspaandra, Jörg Rothe, Holger Spakowski
    Recognizing When Heuristics Can Approximate Minimum Vertex Covers Is Complete for Parallel Access to NP [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  25. Jörg Rothe
    Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  26. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of the Winner Problem for Young Elections [Citation Graph (0, 0)][DBLP]
    CoRR, 2001, v:0, n:, pp:- [Journal]
  27. Tobias Riege, Jörg Rothe
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2002, v:0, n:, pp:- [Journal]
  28. Lane A. Hemaspaandra, Jörg Rothe
    Creating Strong Total Commutative Associative Complexity-Theoretic One-Way Functions from Any Complexity-Theoretic One-Way Function [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  29. Jörg Rothe
    Immunity and Simplicity for Exact Counting and Other Counting Classes [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  30. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
    Tally NP Sets and Easy Census Functions [Citation Graph (0, 0)][DBLP]
    CoRR, 1998, v:0, n:, pp:- [Journal]
  31. Lane A. Hemaspaandra, Jörg Rothe
    Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  32. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Polynomial-Time Multi-Selectivity [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  33. Lane A. Hemaspaandra, Jörg Rothe, Gerd Wechsung
    Easy Sets and Hard Certificate Schemes [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  34. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Exact Analysis of Dodgson Elections: Lewis Carroll's 1876 Voting System is Complete for Parallel Access to NP [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  35. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Boolean Operations, Joins, and the Extended Low Hierarchy [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  36. Lane A. Hemaspaandra, Jörg Rothe
    A Second Step Towards Complexity-Theoretic Analogs of Rice's Theorem [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  37. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Raising NP Lower Bounds to Parallel NP Lower Bounds [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  38. Jörg Rothe, Lane A. Hemaspaandra
    Characterizations of the Existence of Partial and Total One-Way Permutations [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  39. Bernd Borchert, Lane A. Hemaspaandra, Jörg Rothe
    Restrictive Acceptance Suffices for Equivalence Problems [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  40. Alina Beygelzimer, Lane A. Hemaspaandra, Christopher M. Homan, Jörg Rothe
    One-Way Functions in Worst-Case Cryptography: Algebraic and Security Properties [Citation Graph (0, 0)][DBLP]
    CoRR, 1999, v:0, n:, pp:- [Journal]
  41. Jörg Rothe
    Some facets of complexity theory and cryptography: A five-lecture tutorial. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2002, v:34, n:4, pp:504-549 [Journal]
  42. Jörg Rothe
    Some Facets of Complexity Theory and Cryptography: A Five-Lectures Tutorial [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:096, pp:- [Journal]
  43. Tobias Riege, Jörg Rothe
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2002, v:, n:068, pp:- [Journal]
  44. Gábor Erdélyi, Tobias Riege, Jörg Rothe
    Quantum Cryptography: A Survey [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2005, v:, n:146, pp:- [Journal]
  45. Judy Goldsmith, Mitsunori Ogihara, Jörg Rothe
    Tally NP Sets and Easy Census Functions. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2000, v:158, n:1, pp:29-52 [Journal]
  46. Jörg Rothe
    Kryptographische Protokolle und Null-Information. [Citation Graph (0, 0)][DBLP]
    Informatik Spektrum, 2002, v:25, n:2, pp:120-131 [Journal]
  47. Edith Hemaspaandra, Jörg Rothe
    Recognizing when Greed can Approximate Maximum Independent Sets is Complete for Parallel Access to NP. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:3, pp:151-156 [Journal]
  48. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe
    Corrigendum to "Upward separation for FewP and related classes". [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:1-2, pp:89- [Journal]
  49. Rajesh P. N. Rao, Jörg Rothe, Osamu Watanabe
    Upward Separation for FewP and Related Classes. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1994, v:52, n:4, pp:175-180 [Journal]
  50. Jörg Rothe
    Exact complexity of Exact-Four-Colorability. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:87, n:1, pp:7-12 [Journal]
  51. Jörg Rothe, Lane A. Hemaspaandra
    On characterizing the existence of partial one-way permutations. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2002, v:82, n:3, pp:165-171 [Journal]
  52. André Große, Jörg Rothe, Gerd Wechsung
    On computing the smallest four-coloring of planar graphs and non-self-reducible sets in P. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2006, v:99, n:6, pp:215-221 [Journal]
  53. Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
    An improved exact algorithm for the domatic number problem. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2007, v:101, n:3, pp:101-106 [Journal]
  54. Jörg Rothe
    Immunity and simplicity for exact counting and other counting classes. [Citation Graph (0, 0)][DBLP]
    ITA, 1999, v:33, n:2, pp:159-176 [Journal]
  55. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Exact analysis of Dodgson elections: Lewis Carroll's 1876 voting system is complete for parallel access to NP. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1997, v:44, n:6, pp:806-825 [Journal]
  56. Lane A. Hemaspaandra, Jörg Rothe
    Creating Strong, Total, Commutative, Associative One-Way Functions from Any One-Way Function in Complexity Theory. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:58, n:3, pp:648-659 [Journal]
  57. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Polynomial-Time Multi-Selectivity. [Citation Graph (0, 0)][DBLP]
    J. UCS, 1997, v:3, n:3, pp:197-229 [Journal]
  58. Tobias Riege, Jörg Rothe
    Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems - a Survey. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:5, pp:551-578 [Journal]
  59. Tobias Riege, Jörg Rothe
    Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:6, pp:725-745 [Journal]
  60. Jörg Rothe, Hiroki Arimura
    Computational Challenges of Massive Data Sets and Randomness in Computation (J.UCS Special Issue on the First and Second Japanese-German Frontiers of Science Symposia). [Citation Graph (0, 0)][DBLP]
    J. UCS, 2006, v:12, n:6, pp:579-580 [Journal]
  61. André Große, Jörg Rothe, Gerd Wechsung
    Computing Complete Graph Isomorphisms and Hamiltonian Cycles from Partial Ones. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2002, v:35, n:1, pp:81-93 [Journal]
  62. Jörg Rothe, Holger Spakowski, Jörg Vogel
    Exact Complexity of the Winner Problem for Young Elections. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2003, v:36, n:4, pp:375-386 [Journal]
  63. Lane A. Hemaspaandra, Jörg Rothe
    Unambiguous Computation: Boolean Hierarchies and Sparse Turing-Complete Sets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 1997, v:26, n:3, pp:634-653 [Journal]
  64. Lane A. Hemaspaandra, Zhigen Jiang, Jörg Rothe, Osamu Watanabe
    Boolean Operations, Joins, and the Extended Low Hierarchy. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:205, n:1-2, pp:317-327 [Journal]
  65. Lane A. Hemaspaandra, Kari Pasanen, Jörg Rothe
    If P neq NP then some strongly noninvertible functions are invertible. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:362, n:1-3, pp:54-62 [Journal]
  66. Lane A. Hemaspaandra, Jörg Rothe
    A second step towards complexity-theoretic analogs of Rice's Theorem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:205-217 [Journal]
  67. Lane A. Hemaspaandra, Jörg Rothe
    Characterizing the existence of one-way permutations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:244, n:1-2, pp:257-261 [Journal]
  68. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Llull and Copeland Voting Broadly Resist Bribery and Control. [Citation Graph (0, 0)][DBLP]
    AAAI, 2007, pp:724-730 [Conf]
  69. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness Versus Average-Case Polynomial Time. [Citation Graph (0, 0)][DBLP]
    FCT, 2007, pp:300-311 [Conf]
  70. Dorothea Baumeister, Jörg Rothe
    Satisfiability Parsimoniously Reduces to the TantrixTM Rotation Puzzle Problem. [Citation Graph (0, 0)][DBLP]
    MCU, 2007, pp:134-145 [Conf]
  71. Gábor Erdélyi, Lane A. Hemaspaandra, Jörg Rothe, Holger Spakowski
    On Approximating Optimal Weighted Lobbying, and Frequency of Correctness versus Average-Case Polynomial Time [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  72. Dorothea Baumeister, Jörg Rothe
    Satisfiability Parsimoniously Reduces to the Tantrix(TM) Rotation Puzzle Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  73. Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    A Richer Understanding of the Complexity of Election Systems [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  74. Tobias Riege, Jörg Rothe, Holger Spakowski, Masaki Yamamoto
    An Improved Exact Algorithm for the Domatic Number Problem [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  75. Lane A. Hemaspaandra, Jörg Rothe, Amitabh Saxena
    Enforcing and Defying Associativity, Commutativity, Totality, and Strong Noninvertibility for One-Way Functions in Complexity Theory [Citation Graph (0, 0)][DBLP]
    CoRR, 2005, v:0, n:, pp:- [Journal]
  76. Edith Hemaspaandra, Lane A. Hemaspaandra, Jörg Rothe
    Hybrid Elections Broaden Complexity-Theoretic Resistance to Control [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]
  77. Dagmar Bruß, Gábor Erdélyi, Tim Meyer, Tobias Riege, Jörg Rothe
    Quantum cryptography: A survey. [Citation Graph (0, 0)][DBLP]
    ACM Comput. Surv., 2007, v:39, n:2, pp:- [Journal]
  78. Tobias Riege, Jörg Rothe
    Complexity of the Exact Domatic Number Problem and of the Exact Conveyor Flow Shop Problem. [Citation Graph (0, 0)][DBLP]
    Theory Comput. Syst., 2006, v:39, n:5, pp:635-668 [Journal]

  79. Copeland Voting Fully Resists Constructive Control. [Citation Graph (, )][DBLP]


  80. The cost of stability in weighted voting games. [Citation Graph (, )][DBLP]


  81. Complexity of social welfare optimization in multiagent resource allocation. [Citation Graph (, )][DBLP]


  82. The Complexity of Computing Minimal Unidirectional Covering Sets. [Citation Graph (, )][DBLP]


  83. Complexity of Merging and Splitting for the Probabilistic Banzhaf Power Index in Weighted Voting Games. [Citation Graph (, )][DBLP]


  84. Taking the Final Step to a Full Dichotomy of the Possible Winner Problem in Pure Scoring Rules. [Citation Graph (, )][DBLP]


  85. Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control. [Citation Graph (, )][DBLP]


  86. The shield that never was: societies with single-peaked preferences are more open to manipulation and control. [Citation Graph (, )][DBLP]


  87. Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols. [Citation Graph (, )][DBLP]


  88. The Cost of Stability in Coalitional Games. [Citation Graph (, )][DBLP]


  89. The Three-Color and Two-Color TantrixTM Rotation Puzzle Problems Are NP-Complete Via Parsimonious Reductions. [Citation Graph (, )][DBLP]


  90. The Complexity of Probabilistic Lobbying. [Citation Graph (, )][DBLP]


  91. An Exact 2.9416n Algorithm for the Three Domatic Number Problem [Citation Graph (, )][DBLP]


  92. Anyone but Him: The Complexity of Precluding an Alternative [Citation Graph (, )][DBLP]


  93. The Three-Color and Two-Color Tantrix(TM) Rotation Puzzle Problems are NP-Complete via Parsimonious Reductions [Citation Graph (, )][DBLP]


  94. Copeland Voting Fully Resists Constructive Control [Citation Graph (, )][DBLP]


  95. Sincere-Strategy Preference-Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control [Citation Graph (, )][DBLP]


  96. Frequency of Correctness versus Average-Case Polynomial Time and Generalized Juntas [Citation Graph (, )][DBLP]


  97. Llull and Copeland Voting Computationally Resist Bribery and Control [Citation Graph (, )][DBLP]


  98. Deciding Membership in Minimal Upward Covering Sets is Hard for Parallel Access to NP [Citation Graph (, )][DBLP]


  99. Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols [Citation Graph (, )][DBLP]


  100. The Complexity of Probabilistic Lobbying [Citation Graph (, )][DBLP]


  101. The Cost of Stability in Coalitional Games [Citation Graph (, )][DBLP]


  102. The Shield that Never Was: Societies with Single-Peaked Preferences are More Open to Manipulation and Control [Citation Graph (, )][DBLP]


  103. Control Complexity in Fallback Voting [Citation Graph (, )][DBLP]


  104. Bucklin Voting is Broadly Resistant to Control [Citation Graph (, )][DBLP]


  105. Completeness in the Boolean Hierarchy: Exact-Four-Colorability, Minimal Graph Uncolorability, and Exact Domatic Number Problems. [Citation Graph (, )][DBLP]


  106. Improving Deterministic and Randomized Exponential-Time Algorithms for the Satisfiability, the Colorability, and the Domatic Number Problem. [Citation Graph (, )][DBLP]


Search in 0.009secs, Finished in 0.012secs
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