The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Antoni Lozano: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Antoni Lozano, Jacobo Torán
    On the Nonuniform Complexity on the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1992, pp:118-129 [Conf]
  2. Mitsunori Ogiwara, Antoni Lozano
    On One Query Self-Reducible Sets. [Citation Graph (0, 0)][DBLP]
    Structure in Complexity Theory Conference, 1991, pp:139-151 [Conf]
  3. Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
    Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:1-46 [Conf]
  4. Antoni Lozano, Jacobo Torán
    On the Non-Uniform Complexity of the Graph Isomorphism Problem. [Citation Graph (0, 0)][DBLP]
    Complexity Theory: Current Research, 1992, pp:245-271 [Conf]
  5. Antoni Lozano, Vijay Raghavan
    On the Complexity of Counting the Number of Vertices Moved by Graph Automorphisms. [Citation Graph (0, 0)][DBLP]
    FSTTCS, 1998, pp:295-306 [Conf]
  6. Vikraman Arvind, Yenjo Han, Lane A. Hemachandra, Johannes Köbler, Antoni Lozano, Martin Mundhenk, Mitsunori Ogiwara, Uwe Schöning, Riccardo Silvestri, Thomas Thierauf
    Reductions to Sets of Low Information Content. [Citation Graph (0, 0)][DBLP]
    ICALP, 1992, pp:162-173 [Conf]
  7. Vikraman Arvind, Richard Beigel, Antoni Lozano
    The Complexity of Modular Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    STACS, 1998, pp:172-182 [Conf]
  8. Antoni Lozano, José L. Balcázar
    The Complexity of Graph Problems fore Succinctly Represented Graphs. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:277-286 [Conf]
  9. Antoni Lozano
    NP-Hardness on succinct representation of graphs. [Citation Graph (0, 0)][DBLP]
    Bulletin of the EATCS, 1988, v:35, n:, pp:158-162 [Journal]
  10. Bernd Borchert, Antoni Lozano
    Succinct Circuit Representations and Leaf Language Classes are Basically the same Concept [Citation Graph (0, 0)][DBLP]
    Electronic Colloquium on Computational Complexity (ECCC), 1996, v:3, n:6, pp:- [Journal]
  11. Bernd Borchert, Antoni Lozano
    Succinct Circuit Representations and Leaf Language Classes are Basically the Same Concept. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 1996, v:59, n:4, pp:211-215 [Journal]
  12. Antoni Lozano
    Bounded Queries to Arbitrary Sets. [Citation Graph (0, 0)][DBLP]
    ITA, 1996, v:30, n:2, pp:91-100 [Journal]
  13. Antoni Lozano, Jacobo Torán
    Self-Reducible Sets of Small Sensity. [Citation Graph (0, 0)][DBLP]
    Mathematical Systems Theory, 1991, v:24, n:2, pp:83-100 [Journal]
  14. Vikraman Arvind, Richard Beigel, Antoni Lozano
    The Complexity of Modular Graph Automorphism. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2000, v:30, n:4, pp:1299-1320 [Journal]
  15. Mitsunori Ogiwara, Antoni Lozano
    On Sparse Hard Sets for Counting Classes. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1993, v:112, n:2, pp:255-275 [Journal]
  16. José L. Balcázar, Albert Bifet, Antoni Lozano
    Subtree Testing and Closed Tree Mining Through Natural Representations. [Citation Graph (0, 0)][DBLP]
    DEXA Workshops, 2007, pp:499-503 [Conf]
  17. José L. Balcázar, Albert Bifet, Antoni Lozano
    Mining Frequent Closed Unordered Trees Through Natural Representations. [Citation Graph (0, 0)][DBLP]
    ICCS, 2007, pp:347-359 [Conf]
  18. Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabriel Valiente, Michal Ziv-Ukelson
    Seeded Tree Alignment and Planar Tanglegram Layout. [Citation Graph (0, 0)][DBLP]
    WABI, 2007, pp:98-110 [Conf]

  19. Tile-Packing Tomography Is \mathbbNP{\mathbb{NP}}-hard. [Citation Graph (, )][DBLP]


  20. Mining Implications from Lattices of Closed Trees. [Citation Graph (, )][DBLP]


  21. Tile Packing Tomography is NP-hard [Citation Graph (, )][DBLP]


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