Antoni Lozano
Antoni Lozano
Professor of Computer Science, Universitat Politècnica de Catalunya
Verified email at cs.upc.edu
Title
Cited by
Cited by
Year
The complexity of algorithmic problems on succinct instances
JL Balcázar, A Lozano, J Torán
Computer Science, 351-377, 1992
781992
Reductions to sets of low information content
V Arvind, Y Han, L Hemachandra, J Köbler, A Lozano, M Mundhenk, ...
International Colloquium on Automata, Languages, and Programming, 162-173, 1992
721992
On the Non-Uniform Complexity of the Graph Isomorphism Problem.
A Lozano, J Torán
Complexity Theory: Current Research, 245-271, 1992
391992
On one query self-reducible sets
M Ogiwara, A Lozano
京都大学数理解析研究所, 1991
351991
Succinct circuit representations and leaf language classes are basically the same concept
B Borchert, A Lozano
Information Processing Letters 59 (4), 211-215, 1996
341996
Mining frequent closed rooted trees
JL Balcázar, A Bifet, A Lozano
Machine Learning 78 (1-2), 1, 2010
302010
On the maximum common embedded subtree problem for ordered trees
A Lozano, G Valiente
String Algorithmics, 155-170, 2004
282004
Self-reducible sets of small density
A Lozano, J Torán
Mathematical Systems Theory 24 (1), 83-100, 1991
251991
Seeded tree alignment
A Lozano, RY Pinter, O Rokhlenko, G Valiente, M Ziv-Ukelson
IEEE/ACM transactions on Computational Biology and Bioinformatics 5 (4), 503-513, 2008
212008
Seeded tree alignment and planar tanglegram layout
A Lozano, RY Pinter, O Rokhlenko, G Valiente, M Ziv-Ukelson
International Workshop on Algorithms in Bioinformatics, 98-110, 2007
212007
On sparse hard sets for counting classes
M Ogiwara, A Lozano
Theoretical Computer Science 112 (2), 255-275, 1993
181993
Mining frequent closed unordered trees through natural representations
JL Balcázar, A Bifet, A Lozano
International Conference on Conceptual Structures, 347-359, 2007
142007
Antimagic labelings of caterpillars
A Lozano, M Mora, C Seara
Applied Mathematics and Computation 347, 734-740, 2019
132019
Intersection algorithms and a closure operator on unordered trees
JL Balcázar, A Bifet, A Lozano
MLG 2006, 1, 2006
112006
The complexity of modular graph automorphism
V Arvind, R Beigel, A Lozano
SIAM Journal on Computing 30 (4), 1299-1320, 2000
82000
Symmetry breaking in tournaments
A Lozano
the electronic journal of combinatorics 20 (1), P69, 2013
72013
Mining Implications from Lattices of Closed Trees.
JL Balcázar, A Bifet, A Lozano
EGC, 373-384, 2008
72008
Subtree testing and closed tree mining through natural representations
JL Balcázar, A Bifet, A Lozano
18th International Workshop on Database and Expert Systems Applications …, 2007
72007
Els límits de la computació: indecidibilitat i NP-completesa
M Serna Iglesias, C Álvarez Faura, R Cases Muñoz
Universitat Politècnica de Catalunya. Iniciativa Digital Politècnica, 2004
62004
NP-Hardness on succinct representation of graphs
A Lozano
Bulletin of the EATCS 35, 158-162, 1988
61988
The system can't perform the operation now. Try again later.
Articles 1–20