Segueix
Antoni Lozano
Antoni Lozano
Professor of Computer Science, Universitat Politècnica de Catalunya
Correu electrònic verificat a cs.upc.edu
Títol
Citada per
Citada per
Any
The complexity of algorithmic problems on succinct instances
JL Balcázar, A Lozano, J Torán
Computer science: research and applications, 351-377, 1992
821992
Reductions to sets of low information content
V Arvind, Y Han, L Hemachandra, J Köbler, A Lozano, M Mundhenk, ...
Automata, Languages and Programming: 19th International Colloquium Wien …, 1992
751992
The complexity of graph problems for succinctly represented graphs
A Lozano, JL Balcázar
International Workshop on Graph-Theoretic Concepts in Computer Science, 277-286, 1989
681989
On the Non-Uniform Complexity of the Graph Isomorphism Problem.
A Lozano, J Torán
Complexity Theory: Current Research, 245-271, 1992
401992
Mining frequent closed rooted trees
JL Balcázar, A Bifet, A Lozano
Machine Learning 78, 1-33, 2010
362010
On the maximum common embedded subtree problem for ordered trees
A Lozano, G Valiente
String Algorithmics, 155-170, 2004
352004
On one query self-reducible sets
M Ogiwara, A Lozano
数理解析研究所講究録 754, 45-56, 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
321996
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
252008
Seeded tree alignment and planar tanglegram layout
A Lozano, RY Pinter, O Rokhlenko, G Valiente, M Ziv-Ukelson
Algorithms in Bioinformatics: 7th International Workshop, WABI 2007 …, 2007
242007
Self-reducible sets of small density
A Lozano, J Torán
Mathematical Systems Theory 24, 83-100, 1991
241991
Caterpillars are antimagic
A Lozano, M Mora, C Seara, J Tey
Mediterranean Journal of Mathematics 18, 1-12, 2021
232021
Antimagic labelings of caterpillars
A Lozano, M Mora, C Seara
Applied Mathematics and Computation 347, 734-740, 2019
192019
On sparse hard sets for counting classes
M Ogiwara, A Lozano
Theoretical Computer Science 112 (2), 255-275, 1993
191993
Mining frequent closed unordered trees through natural representations
JL Balcázar, A Bifet, A Lozano
International Conference on Conceptual Structures, 347-359, 2007
152007
Intersection algorithms and a closure operator on unordered trees
JL Balcázar, A Bifet, A Lozano
MLG 2006, 1, 2006
132006
Symmetry breaking in tournaments
A Lozano Boixadors
Electronic journal of combinatorics 20 (1, Paper 69), 1-14, 2013
112013
Caterpillars have antimagic orientations
A Lozano
Analele ştiinţifice ale Universităţii" Ovidius" Constanţa. Seria Matematică …, 2018
102018
The complexity of modular graph automorphism
V Arvind, R Beigel, A Lozano
SIAM Journal on Computing 30 (4), 1299-1320, 2000
92000
Mining Implications from Lattices of Closed Trees.
JL Balcázar, A Bifet, A Lozano
EGC, 373-384, 2008
82008
En aquests moments el sistema no pot dur a terme l'operació. Torneu-ho a provar més tard.
Articles 1–20