The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Javier Esparza: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Javier Esparza
    Decidability and Complexity of Petri Net Problems - An Introduction. [Citation Graph (0, 0)][DBLP]
    Petri Nets, 1996, pp:374-428 [Conf]
  2. Javier Esparza
    A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. [Citation Graph (0, 0)][DBLP]
    ACSD, 2003, pp:61-70 [Conf]
  3. Javier Esparza, Petr Jancar, Alexander Miller
    On the Complexity of Consistency and Complete State Coding for Signal Transition Graphs. [Citation Graph (0, 0)][DBLP]
    ACSD, 2006, pp:47-56 [Conf]
  4. Stephan Melzer, Stefan Römer, Javier Esparza
    Verification Using PEP. [Citation Graph (0, 0)][DBLP]
    AMAST, 1996, pp:591-594 [Conf]
  5. Javier Esparza, Stephan Melzer
    Model Checking LTL Using Constraint Programming. [Citation Graph (0, 0)][DBLP]
    ICATPN, 1997, pp:1-20 [Conf]
  6. Javier Esparza, Manuel Silva
    Circuits, handles, bridges and nets. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1989, pp:210-242 [Conf]
  7. Javier Esparza, Manuel Silva
    On the analysis and synthesis of free choice systems. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1989, pp:243-286 [Conf]
  8. Javier Esparza, Manuel Silva
    Top-down synthesis of live and bounded free choice nets. [Citation Graph (0, 0)][DBLP]
    Applications and Theory of Petri Nets, 1990, pp:118-139 [Conf]
  9. Jörg Desel, Javier Esparza
    Shortest Paths in Reachability Graphs. [Citation Graph (0, 0)][DBLP]
    Application and Theory of Petri Nets, 1993, pp:224-241 [Conf]
  10. Claus Schröter, Stefan Schwoon, Javier Esparza
    The Model-Checking Kit. [Citation Graph (0, 0)][DBLP]
    ICATPN, 2003, pp:463-472 [Conf]
  11. Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza
    Efficient Algorithms for Alternating Pushdown Systems with an Application to the Computation of Certificate Chains. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:141-153 [Conf]
  12. Giorgio Delzanno, Javier Esparza, Jirí Srba
    Monotonic Set-Extended Prefix Rewriting and Verification of Recursive Ping-Pong Protocols. [Citation Graph (0, 0)][DBLP]
    ATVA, 2006, pp:415-429 [Conf]
  13. Javier Esparza
    Grammars as Processes. [Citation Graph (0, 0)][DBLP]
    Formal and Natural Computing, 2002, pp:277-297 [Conf]
  14. Javier Esparza, Peter Rossmanith
    An Automata Approach to Some Problems on Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Foundations of Computer Science: Potential - Theory - Cognition, 1997, pp:143-152 [Conf]
  15. Javier Esparza
    On the Decidability of Model Checking for Several µ-calculi and Petri Nets. [Citation Graph (0, 0)][DBLP]
    CAAP, 1994, pp:115-129 [Conf]
  16. Javier Esparza, David Hansel, Peter Rossmanith, Stefan Schwoon
    Efficient Algorithms for Model Checking Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    CAV, 2000, pp:232-247 [Conf]
  17. Javier Esparza, Astrid Kiehn
    On the Model Checking Problem for Branching Time Logics and Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    CAV, 1995, pp:353-366 [Conf]
  18. Javier Esparza, Stefan Schwoon
    A BDD-Based Model Checker for Recursive Programs. [Citation Graph (0, 0)][DBLP]
    CAV, 2001, pp:324-336 [Conf]
  19. Javier Esparza, Claus Schröter
    Net Reductions for LTL Model-Checking. [Citation Graph (0, 0)][DBLP]
    CHARME, 2001, pp:310-324 [Conf]
  20. Ahmed Bouajjani, Javier Esparza, Oded Maler
    Reachability Analysis of Pushdown Automata: Application to Model-Checking. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1997, pp:135-150 [Conf]
  21. Javier Esparza
    Synthesis Rules for Petri Nets, and How they Lead to New Results. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1990, pp:182-198 [Conf]
  22. Javier Esparza, Stefan Römer
    An Unfolding Algorithm for Synchronous Products of Transition Systems. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:2-20 [Conf]
  23. Javier Esparza, Manuel Silva
    Compositional Synthesis of Live and Bounded Free Choice Petri Nets. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1991, pp:172-187 [Conf]
  24. Maciej Koutny, Javier Esparza, Eike Best
    Operational Semantics for the Petri Box Calculus. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1994, pp:210-225 [Conf]
  25. Christine Röckl, Javier Esparza
    Proof-Checking Protocols Using Bisimulations. [Citation Graph (0, 0)][DBLP]
    CONCUR, 1999, pp:525-540 [Conf]
  26. Alin Stefanescu, Javier Esparza, Anca Muscholl
    Synthesis of Distributed Algorithms Using Asynchronous Automata. [Citation Graph (0, 0)][DBLP]
    CONCUR, 2003, pp:27-41 [Conf]
  27. Eike Best, Javier Esparza
    Model Checking of Persistent Petri Nets. [Citation Graph (0, 0)][DBLP]
    CSL, 1991, pp:35-52 [Conf]
  28. Giorgio Delzanno, Javier Esparza, Andreas Podelski
    Constraint-Based Analysis of Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:50-66 [Conf]
  29. Antonín Kucera, Javier Esparza
    A Logical Viewpoint on Process-Algebraic Quotients. [Citation Graph (0, 0)][DBLP]
    CSL, 1999, pp:499-514 [Conf]
  30. Javier Esparza
    An Automata-Theoretic Approach to Software Verification. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2003, pp:21- [Conf]
  31. Stephan Melzer, Javier Esparza
    Checking System Properties via Integer Programming. [Citation Graph (0, 0)][DBLP]
    ESOP, 1996, pp:250-264 [Conf]
  32. Javier Esparza
    Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    FCT, 1995, pp:221-232 [Conf]
  33. Tomás Brázdil, Javier Esparza, Antonín Kucera
    Analysis and Prediction of the Long-Run Behavior of Probabilistic Sequential Programs with Recursion (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    FOCS, 2005, pp:521-530 [Conf]
  34. Javier Esparza, Jens Knoop
    An Automata-Theoretic Approach to Interprocedural Data-Flow Analysis. [Citation Graph (0, 0)][DBLP]
    FoSSaCS, 1999, pp:14-30 [Conf]
  35. Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, Jan Strejcek
    Reachability Analysis of Multithreaded Software with Asynchronous Communication. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2005, pp:348-359 [Conf]
  36. Allan Cheng, Javier Esparza, Jens Palsberg
    Complexity Results for 1-safe Nets. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1993, pp:326-337 [Conf]
  37. Javier Esparza, Kousha Etessami
    Verifying Probabilistic Procedural Programs. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 2004, pp:16-31 [Conf]
  38. Julian C. Bradfield, Javier Esparza, Angelika Mader
    An Effective Tableau System for the Linear Time µ-Calculus. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:98-109 [Conf]
  39. Javier Esparza, Keijo Heljanko
    A New Unfolding Approach to LTL Model Checking. [Citation Graph (0, 0)][DBLP]
    ICALP, 2000, pp:475-486 [Conf]
  40. Petr Jancar, Javier Esparza
    Deciding Finiteness of Petri Nets Up To Bisimulation. [Citation Graph (0, 0)][DBLP]
    ICALP, 1996, pp:478-489 [Conf]
  41. Javier Esparza, Alain Finkel, Richard Mayr
    On the Verification of Broadcast Protocols. [Citation Graph (0, 0)][DBLP]
    LICS, 1999, pp:352-359 [Conf]
  42. Javier Esparza, Antonín Kucera, Richard Mayr
    Model Checking Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    LICS, 2004, pp:12-21 [Conf]
  43. Javier Esparza, Antonín Kucera, Richard Mayr
    Quantitative Analysis of Probabilistic Pushdown Automata: Expectations and Variances. [Citation Graph (0, 0)][DBLP]
    LICS, 2005, pp:117-126 [Conf]
  44. Leonor Prensa Nieto, Javier Esparza
    Verifying Single and Multi-mutator Garbage Collectors with Owicki-Gries in Isabelle/HOL. [Citation Graph (0, 0)][DBLP]
    MFCS, 2000, pp:619-628 [Conf]
  45. Javier Esparza
    Verification of Systems with an Infinite State Space. [Citation Graph (0, 0)][DBLP]
    MOVEP, 2000, pp:183-186 [Conf]
  46. Ahmed Bouajjani, Javier Esparza, Tayssir Touili
    A generic approach to the static analysis of concurrent programs with procedures. [Citation Graph (0, 0)][DBLP]
    POPL, 2003, pp:62-73 [Conf]
  47. Javier Esparza, Andreas Podelski
    Efficient Algorithms for pre* and post* on Interprocedural Parallel Flow Graphs. [Citation Graph (0, 0)][DBLP]
    POPL, 2000, pp:1-11 [Conf]
  48. Javier Esparza
    Model Checking (with) Declarative Programs. [Citation Graph (0, 0)][DBLP]
    PPDP, 2001, pp:37- [Conf]
  49. Ahmed Bouajjani, Javier Esparza
    Rewriting Models of Boolean Programs. [Citation Graph (0, 0)][DBLP]
    RTA, 2006, pp:136-150 [Conf]
  50. Javier Esparza
    An Algebraic Approach to the Static Analysis of Concurrent Software. [Citation Graph (0, 0)][DBLP]
    SAS, 2002, pp:3- [Conf]
  51. Javier Esparza, Pierre Ganty, Stefan Schwoon
    Locality-Based Abstractions. [Citation Graph (0, 0)][DBLP]
    SAS, 2005, pp:118-134 [Conf]
  52. Javier Esparza, Keijo Heljanko
    Implementing LTL Model Checking with Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    SPIN, 2001, pp:37-56 [Conf]
  53. Eike Best, Raymond R. Devillers, Javier Esparza
    General Refinement and Recursion Operators for the Petri Box Calculus. [Citation Graph (0, 0)][DBLP]
    STACS, 1993, pp:130-140 [Conf]
  54. Jörg Desel, Javier Esparza
    Reachability in Reversible Free Choice Systems. [Citation Graph (0, 0)][DBLP]
    STACS, 1991, pp:384-397 [Conf]
  55. Javier Esparza, Stefan Kiefer, Michael Luttenberger
    On Fixed Point Equations over Commutative Semirings. [Citation Graph (0, 0)][DBLP]
    STACS, 2007, pp:296-307 [Conf]
  56. Javier Esparza, Stefan Kiefer, Stefan Schwoon
    Abstraction Refinement with Craig Interpolation and Symbolic Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    TACAS, 2006, pp:489-503 [Conf]
  57. Javier Esparza, Monika Maidl
    Simple Representative Instantiations for Multicast Protocols. [Citation Graph (0, 0)][DBLP]
    TACAS, 2003, pp:128-143 [Conf]
  58. Javier Esparza, Stefan Römer, Walter Vogler
    An Improvement of McMillan's Unfolding Algorithm. [Citation Graph (0, 0)][DBLP]
    TACAS, 1996, pp:87-106 [Conf]
  59. Stefan Schwoon, Javier Esparza
    A Note on On-the-Fly Verification Algorithms. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:174-190 [Conf]
  60. Dejvuth Suwimonteerabuth, Stefan Schwoon, Javier Esparza
    jMoped: A Java Bytecode Checker Based on Moped. [Citation Graph (0, 0)][DBLP]
    TACAS, 2005, pp:541-545 [Conf]
  61. Javier Esparza, Antonín Kucera, Stefan Schwoon
    Model-Checking LTL with Regular Valuations for Pushdown Systems. [Citation Graph (0, 0)][DBLP]
    TACS, 2001, pp:316-339 [Conf]
  62. Javier Esparza
    Model Checking Using Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    TAPSOFT, 1993, pp:613-628 [Conf]
  63. Javier Esparza, Bernhard von Stengel
    The Asynchronous Committee Meeting Problem. [Citation Graph (0, 0)][DBLP]
    WG, 1993, pp:276-287 [Conf]
  64. Javier Esparza
    Decidability of Model Checking for Infinite-State Concurrent Systems. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1997, v:34, n:2, pp:85-107 [Journal]
  65. Olaf Burkart, Javier Esparza
    More Infinite Results. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1997, v:62, n:, pp:- [Journal]
  66. Javier Esparza, Mogens Nielsen
    Decidability Issues for Petri Nets - a survey. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1994, v:52, n:, pp:244-262 [Journal]
  67. Javier Esparza, Peter Rossmanith, Stefan Schwoon
    A Uniform Framework for Problems on Context-Free Grammars. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 2000, v:72, n:, pp:169-177 [Journal]
  68. Javier Esparza, Mogens Nielsen
    Decidability Issues for Petri Nets - a survey. [Citation Graph (0, 0)][DBLP]
    Elektronische Informationsverarbeitung und Kybernetik, 1994, v:30, n:3, pp:143-160 [Journal]
  69. Ahmed Bouajjani, Javier Esparza, Tayssir Touili
    Reachability Analysis of Synchronized PA Systems. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:153-178 [Journal]
  70. Olaf Burkart, Javier Esparza
    More infinite results. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 1996, v:5, n:, pp:- [Journal]
  71. Javier Esparza, Stephan Melzer
    Verification of Safety Properties Using Integer Programming: Beyond the State Equation. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2000, v:16, n:2, pp:159-189 [Journal]
  72. Javier Esparza, Stefan Römer, Walter Vogler
    An Improvement of McMillan's Unfolding Algorithm. [Citation Graph (0, 0)][DBLP]
    Formal Methods in System Design, 2002, v:20, n:3, pp:285-310 [Journal]
  73. Javier Esparza
    A Polynomial-Time Algorithm for Checking Consistency of Free-Choice Signal Transition Graphs. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2004, v:62, n:2, pp:197-220 [Journal]
  74. Javier Esparza
    Petri Nets, Commutative Context-Free Grammars, and Basic Parallel Processes. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1997, v:31, n:1, pp:13-25 [Journal]
  75. Javier Esparza, Claus Schröter
    Unfolding Based Algorithms for the Reachability Problem. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 2001, v:47, n:3-4, pp:231-245 [Journal]
  76. Javier Esparza
    Reduction and Synthesis of Live and Bounded Free Choice Petri Nets [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1994, v:114, n:1, pp:50-87 [Journal]
  77. Javier Esparza, Antonín Kucera, Stefan Schwoon
    Model checking LTL with regular valuations for pushdown systems. [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 2003, v:186, n:2, pp:355-376 [Journal]
  78. Ahmed Bouajjani, Javier Esparza, Tayssir Touili
    A Generic Approach to the Static Analysis of Concurrent Programs with Procedures. [Citation Graph (0, 0)][DBLP]
    Int. J. Found. Comput. Sci., 2003, v:14, n:4, pp:551-0 [Journal]
  79. Ahmed Bouajjani, Javier Esparza, Alain Finkel, Oded Maler, Peter Rossmanith, Bernard Willems, Pierre Wolper
    An efficient automata approach to some problems on context-free grammars. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2000, v:74, n:5-6, pp:221-227 [Journal]
  80. Javier Esparza
    A Solution to the Covering Problem for 1-Bounded Conflict-Free Petri Nets Using Linear Programming. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1992, v:41, n:6, pp:313-319 [Journal]
  81. Petr Jancar, Javier Esparza, Faron Moller
    Petri Nets and Regular Processes. [Citation Graph (0, 0)][DBLP]
    J. Comput. Syst. Sci., 1999, v:59, n:3, pp:476-503 [Journal]
  82. Antonín Kucera, Javier Esparza, Richard Mayr
    Model Checking Probabilistic Pushdown Automata. [Citation Graph (0, 0)][DBLP]
    Logical Methods in Computer Science, 2006, v:2, n:1, pp:- [Journal]
  83. Antonín Kucera, Javier Esparza
    A Logical Viewpoint on Process-algebraic Quotients. [Citation Graph (0, 0)][DBLP]
    J. Log. Comput., 2003, v:13, n:6, pp:863-880 [Journal]
  84. Javier Esparza
    Model Checking Using Net Unfoldings. [Citation Graph (0, 0)][DBLP]
    Sci. Comput. Program., 1994, v:23, n:2-3, pp:151-195 [Journal]
  85. Eike Best, Jörg Desel, Javier Esparza
    Traps Characterize Home States in Free Choice Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:101, n:2, pp:161-176 [Journal]
  86. Allan Cheng, Javier Esparza, Jens Palsberg
    Complexity Results for 1-Safe Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1995, v:147, n:1&2, pp:117-136 [Journal]
  87. Jörg Desel, Javier Esparza
    Reachability in Cyclic Extended Free-Choice Systems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:114, n:1, pp:93-118 [Journal]
  88. Javier Esparza
    Reachability in Live and Safe Free-Choice Petri Nets is NP-Complete. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1998, v:198, n:1-2, pp:211-224 [Journal]
  89. Javier Esparza, Glenn Bruns
    Trapping Mutual Exclusion in the Box Calculus. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1996, v:153, n:1&2, pp:95-128 [Journal]
  90. Javier Esparza, Manuel Silva
    A Polynomial-Time Algorithm to Decide Liveness of Bounded Free Choice Nets. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1992, v:102, n:1, pp:185-205 [Journal]
  91. Dejvuth Suwimonteerabuth, Felix Berger, Stefan Schwoon, Javier Esparza
    jMoped: A Test Environment for Java Programs. [Citation Graph (0, 0)][DBLP]
    CAV, 2007, pp:164-167 [Conf]
  92. Javier Esparza, Stefan Kiefer, Michael Luttenberger
    An Extension of Newton's Method to omega -Continuous Semirings. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:157-168 [Conf]
  93. Eike Best, Javier Esparza, Harro Wimmel, Karsten Wolf
    Separability in Conflict-Free Petri Nets. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2006, pp:1-18 [Conf]
  94. Stefan Kiefer, Michael Luttenberger, Javier Esparza
    On the convergence of Newton's method for monotone systems of polynomial equations. [Citation Graph (0, 0)][DBLP]
    STOC, 2007, pp:217-226 [Conf]

  95. Learning Workflow Petri Nets. [Citation Graph (, )][DBLP]


  96. Reachability analysis of multithreaded software with asynchronous communication. [Citation Graph (, )][DBLP]


  97. Derivation Tree Analysis for Accelerated Fixed-Point Computation. [Citation Graph (, )][DBLP]


  98. Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness. [Citation Graph (, )][DBLP]


  99. On the Memory Consumption of Probabilistic Pushdown Automata. [Citation Graph (, )][DBLP]


  100. Verification of Graph Transformation Systems with Context-Free Specifications. [Citation Graph (, )][DBLP]


  101. A False History of True Concurrency: From Petri to Tools. [Citation Graph (, )][DBLP]


  102. Approximative Methods for Monotone Systems of Min-Max-Polynomial Equations. [Citation Graph (, )][DBLP]


  103. Newton's Method for omega-Continuous Semirings. [Citation Graph (, )][DBLP]


  104. Space-Efficient Scheduling of Stochastically Generated Tasks. [Citation Graph (, )][DBLP]


  105. Solving Monotone Polynomial Equations. [Citation Graph (, )][DBLP]


  106. Stochastic Process Creation. [Citation Graph (, )][DBLP]


  107. Symbolic Context-Bounded Analysis of Multithreaded Java Programs. [Citation Graph (, )][DBLP]


  108. Convergence Thresholds of Newton's Method for Monotone Polynomial Equations. [Citation Graph (, )][DBLP]


  109. Computing Least Fixed Points of Probabilistic Systems of Polynomials. [Citation Graph (, )][DBLP]


  110. SDSIrep: A Reputation System Based on SDSI. [Citation Graph (, )][DBLP]


  111. Analysis of Systems with Stochastic Process Creation. [Citation Graph (, )][DBLP]


  112. Automatic Error Correction of Java Programs. [Citation Graph (, )][DBLP]


  113. Model Checking Probabilistic Pushdown Automata [Citation Graph (, )][DBLP]


  114. Convergence Thresholds of Newton's Method for Monotone Polynomial Equations [Citation Graph (, )][DBLP]


  115. FTOS-Verify: Analysis and Verification of Non-Functional Properties for Fault-Tolerant Systems [Citation Graph (, )][DBLP]


  116. Modeling and Verification for Timing Satisfaction of Fault-Tolerant Systems with Finiteness [Citation Graph (, )][DBLP]


  117. Computing Least Fixed Points of Probabilistic Systems of Polynomials [Citation Graph (, )][DBLP]


  118. Computing the Least Fixed Point of Positive Polynomial Systems [Citation Graph (, )][DBLP]


  119. Space-efficient scheduling of stochastically generated tasks [Citation Graph (, )][DBLP]


  120. Parikh's Theorem: A simple and direct construction [Citation Graph (, )][DBLP]


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