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

Search the dblp DataBase

Title:
Author:
Michele Zito: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Mihalis Beis, William Duckworth, Michele Zito
    Large k-Separated Matchings of Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    ACSC, 2005, pp:175-182 [Conf]
  2. Salvatore Caporaso, Michele Zito, Nicola Galesi, Emanuele Covino
    Syntactic Characterization in LISP of the Polynominal Complexity Classes and Hierarchy. [Citation Graph (0, 0)][DBLP]
    CIAC, 1997, pp:61-73 [Conf]
  3. William Duckworth, Nicholas C. Wormald, Michele Zito
    Maximum Induced Matchings of Random Cubic Graphs. [Citation Graph (0, 0)][DBLP]
    COCOON, 2000, pp:34-43 [Conf]
  4. Michele Zito
    Greedy Algorithms for Minimisation Problems in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:524-536 [Conf]
  5. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
    Coupon Collectors, q-Binomial Coefficients and the Unsatisfiability Threshold. [Citation Graph (0, 0)][DBLP]
    ICTCS, 2001, pp:328-338 [Conf]
  6. Michele Zito
    Small Maximal Matchings in Random Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2000, pp:18-27 [Conf]
  7. Mihalis Beis, William Duckworth, Michele Zito
    Packing Edges in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2002, pp:118-130 [Conf]
  8. Michele Zito, Ida Pu, Martyn Amos, Alan Gibbons
    RNC Algorithms for the Uniform Generation of Combinatorial Structures. [Citation Graph (0, 0)][DBLP]
    SODA, 1996, pp:429-437 [Conf]
  9. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient Web Searching Using Temporal Factors. [Citation Graph (0, 0)][DBLP]
    WADS, 1999, pp:294-305 [Conf]
  10. Colin Cooper, Ralf Klasing, Michele Zito
    Dominating Sets in Web Graphs. [Citation Graph (0, 0)][DBLP]
    WAW, 2004, pp:31-43 [Conf]
  11. Michele Zito
    Induced Matchings in Regular Graphs and Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1999, pp:89-100 [Conf]
  12. Salvatore Caporaso, Michele Zito
    On a Relation Between Uniform Coding and Problems of the Form DTIMEF(F) =? DSPACEF(F). [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1998, v:35, n:8, pp:665-672 [Journal]
  13. William Duckworth, Paul E. Dunne, Alan Gibbons, Michele Zito
    Leafy spanning trees in hypercubes. [Citation Graph (0, 0)][DBLP]
    Appl. Math. Lett., 2001, v:14, n:7, pp:801-804 [Journal]
  14. William Duckworth, Michele Zito
    Sparse Hypercube 3-spanners. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2000, v:103, n:1-3, pp:289-295 [Journal]
  15. Michele Zito
    An Upper Bound on the Space Complexity of Random Formulae in Resolution [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 2001, v:, n:079, pp:- [Journal]
  16. William Duckworth, Michele Zito
    Large 2-Independent Sets of Regular Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. Notes Theor. Comput. Sci., 2003, v:78, n:, pp:- [Journal]
  17. Paul E. Dunne, Michele Zito
    An Inproved Upper Bound on the Non-3-Colourability Threshold. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1998, v:65, n:1, pp:17-23 [Journal]
  18. Michele Zito
    An Upper Bound on the Space Complexity of Random Formulae in Resolution. [Citation Graph (0, 0)][DBLP]
    ITA, 2002, v:36, n:4, pp:329-339 [Journal]
  19. William Duckworth, David Manlove, Michele Zito
    On the approximability of the maximum induced matching problem. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2005, v:3, n:1, pp:79-91 [Journal]
  20. William Duckworth, Nicholas C. Wormald, Michele Zito
    A PTAS for the sparsest 2-spanner of 4-connected planar triangulations. [Citation Graph (0, 0)][DBLP]
    J. Discrete Algorithms, 2003, v:1, n:1, pp:67-76 [Journal]
  21. Michele Zito
    Linear Time Maximum Induced Matching Algorithm for Trees. [Citation Graph (0, 0)][DBLP]
    Nord. J. Comput., 2000, v:7, n:1, pp:58-0 [Journal]
  22. Salvatore Caporaso, Michele Zito, Nicola Galesi
    A predicative and decidable characterization of the polynomial classes of languages. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:250, n:1-2, pp:83-99 [Journal]
  23. Artur Czumaj, Ian Finch, Leszek Gasieniec, Alan Gibbons, Paul H. Leng, Wojciech Rytter, Michele Zito
    Efficient web searching using temporal factors. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2001, v:262, n:1, pp:569-582 [Journal]
  24. Artur Czumaj, Leszek Gasieniec, Daya Ram Gaur, Ramesh Krishnamurti, Wojciech Rytter, Michele Zito
    On polynomial-time approximation algorithms for the variable length scheduling problem. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:302, n:1-3, pp:489-495 [Journal]
  25. Paul E. Dunne, Alan Gibbons, Michele Zito
    Complexity-theoretic models of phase transitions in search problems. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2000, v:249, n:2, pp:243-263 [Journal]
  26. Michele Zito
    Small maximal matchings in random graphs. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2003, v:1, n:297, pp:487-507 [Journal]
  27. William Duckworth, Michele Zito
    Uncover Low Degree Vertices and Minimise the Mess: Independent Sets in Random Regular Graphs. [Citation Graph (0, 0)][DBLP]
    MFCS, 2007, pp:56-66 [Conf]
  28. Colin Cooper, Michele Zito
    Realistic Synthetic Data for Testing Association Rule Mining Algorithms for Market Basket Databases. [Citation Graph (0, 0)][DBLP]
    PKDD, 2007, pp:398-405 [Conf]
  29. Alexis C. Kaporis, Lefteris M. Kirousis, Yannis C. Stamatiou, Malvina Vamvakari, Michele Zito
    The unsatisfiability threshold revisited. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2007, v:155, n:12, pp:1525-1538 [Journal]

  30. Frequent Sub-graph Mining on Edge Weighted Graphs. [Citation Graph (, )][DBLP]


  31. Martingales on Trees and the Empire Chromatic Number of Random Trees. [Citation Graph (, )][DBLP]


  32. Web-Site Boundary Detection. [Citation Graph (, )][DBLP]


  33. Colouring Random Empire Trees. [Citation Graph (, )][DBLP]


  34. Text Classification using Graph Mining-based Feature Extraction. [Citation Graph (, )][DBLP]


  35. An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.301secs
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