The SCEAS System
| |||||||

## Search the dblp DataBase
Antoni Lozano:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- 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] - 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] - 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] - 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] - 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] - 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] - Vikraman Arvind, Richard Beigel, Antoni Lozano
**The Complexity of Modular Graph Automorphism.**[Citation Graph (0, 0)][DBLP] STACS, 1998, pp:172-182 [Conf] - 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] - 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] - 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] - 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] - Antoni Lozano
**Bounded Queries to Arbitrary Sets.**[Citation Graph (0, 0)][DBLP] ITA, 1996, v:30, n:2, pp:91-100 [Journal] - 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] - 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] - 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] - 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] - 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] - 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] **Tile-Packing Tomography Is \mathbb**[Citation Graph (, )][DBLP]*NP*{\mathbb{NP}}-hard.**Mining Implications from Lattices of Closed Trees.**[Citation Graph (, )][DBLP]**Tile Packing Tomography is NP-hard**[Citation Graph (, )][DBLP]
Search in 0.035secs, Finished in 0.036secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |