https://www.euro-online.org/enog/inoc mac https://www.euro-online.org/enog/inoc2007/Papers/mac
ALBCOM: Publications
   ALBCOM: Algorithms, Bioinformatics, Complexity and Formal Methods
 Sections
  Homepage
  People
  Research
  Publications
  Prizes & Distinctions
  Projects
  In the media
  Agenda
  Visitors
  Former members
  Contact
 Search
Author:
Title:
Type:
From:
To:
Order:

 Download

BibTeX / Text


 Update

Add / Modify / Delete
(Password required)


 Publications

The search has obtained 1003 resultats.
Select one of them to modify or delete.

  • The 20th asia and south pacific design automation conference, ASP-DAC 2015, chiba, japan, january 19-22, 2015, 2015.

  • Automated technology for verification and analysis - 13th international symposium, ATVA 2015, shanghai, china, october 12-15, 2015, proceedings, 2015.

  • Business process management - 13th international conference, BPM 2015, innsbruck, austria, august 31 - september 3, 2015, proceedings, 2015.

  • Proceedings of the BPM demo session 2015 co-located with the 13th international conference on business process management (BPM 2015), innsbruck, austria, september 2, 2015, 2015.

  • Proceedings of the international workshop on algorithms & theories for the analysis of event data, ATAED 2015, satellite event of the conferences: 36th international conference on application and theory of petri nets and concurrency petri nets 2015 and 15th international conference on application of concurrency to system design ACSD 2015, brussels, belgium, june 22-23, 2015, 2015.

  • Arya Adriansyah, Jorge Munoz-Gama, Josep Carmona, Boudewijn F. van Dongen, and Wil M. P. van der Aalst. Measuring precision of modeled behavior, 2015.

  • Carme Àlvarez and Maria Serna. Preface, 2015.

  • Albert Atserias and Moritz Müller. Partially definable forcing and bounded arithmetic, 2015.

  • Albert Atserias, Moritz Müller, and Sergi Oliva. Lower bounds for DNF-refutations of a relativized weak pigeonhole principle, 2015.

  • Christian Blum, Borja Calvo, and Maria J. Blesa. FrogCOL and frogMIS: new decentralized algorithms for finding large independent sets in graphs, 2015.

  • Marco Cannizzaro, Salomon Beer, Jordi Cortadella, Ran Ginosar, and Luciano Lavagno. Saferazor: Metastability-robust adaptive clocking in resilient circuits, 2015.

  • Jorge Castro, Joaquim Gabarró, Maria J. Serna, and Alan Stewart. The robustness of periodic orchestrations in uncertain evolving environments, 2015.

  • Jordi Cortadella, Marc Galceran Oms, Michael Kishinevsky, and Sachin S. Sapatnekar. RTL synthesis: From logic synthesis to automatic pipelining, 2015.

  • Javier de San Pedro, Josep Carmona, and Jordi Cortadella. Log-based simplification of process models, 2015.

  • Amalia Duch, Joaquim Gabarró, Jordi Petit, Maria J. Blesa, and Maria J. Serna. A cost-benefit analysis of continuous assessment, 2015.

  • José Luiz Fiadeiro and Fernando Orejas. Abstract constraint data types, 2015.

  • Bruno Fosso, Monica Santamaria, Marinella Marzano, Daniel Alonso-Alemany, Gabriel Valiente, Giacinto Donvito, Alfonso Monaco, Pasquale Notarangelo, and Graziano Pesole. BiomaS: a modular pipeline for bioinformatic analysis of metagenomic ampliconS, 2015.

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, Yingfei Xiong, Susann Gottmann, and Thomas Engel. Model synchronization based on triple graph grammars: correctness, completeness and invertibility, 2015.

  • Palkesh Jain, Sachin S. Sapatnekar, and Jordi Cortadella. A retargetable and accurate methodology for logic-IP-internal electromigration assessment, 2015.

  • Evelia Lizarraga, Maria J. Blesa, Christian Blum, and Günther R. Raidl. On solving the most strings with few bad columns problem: An ILP model and heuristics, 2015.

  • Conrado Martínez, Markus E. Nebel, and Sebastian Wild. Analysis of branch misses in quicksort, 2015.

  • Andrey Mokhov and Josep Carmona. Event log visualisation with conditional partial order graphs: from control flow to data, 2015.

  • Xavier Molinero, Fabián Riquelme, and Maria Serna. Cooperation through social influence, 2015.

  • Xavier Molinero, Fabián Riquelme, and Maria Serna. Forms of representation for simple games: sizes, conversions and equivalences, 2015.

  • Nikos Mylonakis, Fernando Orejas, and José Luiz Fiadeiro. A semantics of business configurations using symbolic graphs, 2015.

  • Marisa Navarro, Fernando Orejas, and Elvira Pino. Satisfiability of constraint specifications on XML documents, 2015.

  • Edelmira Pasarella and Jorge Lobo. Reasoning about policy behavior in logic-based trust management systems: Some complexity results and an operational framework, 2015.

  • Hernán Ponce de León, César Rodríguez, and Josep Carmona. POD - A tool for process discovery using partial orders and independence information, 2015.

  • Hernán Ponce de León, César Rodríguez, Josep Carmona, Keijo Heljanko, and Stefan Haar. Unfolding-based process discovery, 2015.

  • Joel Ribeiro and Josep Carmona. A method for assessing parameter impact on control-flow discovery algorithms, 2015.

  • Thomas Steiner, Ruben Verborgh, Joaquim Gabarró, Erik Mannens, and Rik Van de Walle. Clustering media items stemming from multiple social networks, 2015.

  • Alan Stewart, Joaquim Gabarró, and Anthony Keenan. Uncertainty in the cloud: An angel-daemon approach to modelling performance, 2015.

  • Timo Sztyler, Johanna Völker, Josep Carmona, Oliver Meier, and Heiner Stuckenschmidt. Discovery of personal processes from labeled sensor data - an application of process mining to personalized health care, 2015.

  • Hybrid metaheuristics - 9th international workshop, HM 2014, hamburg, germany, june 11-13, 2014. proceedings, 2014.

  • The IEEE/ACM international conference on computer-aided design, ICCAD 2014, san jose, CA, USA, november 3-6, 2014, 2014.

  • Daniel Alonso-Alemany, A. Barré, Stefano Beretta, Paola Bonizzoni, Macha Nikolski, and Gabriel Valiente. Further steps in TANGO: Improved taxonomic assignment in metagenomics, 2014.

  • Carme Àlvarez, Maria J. Blesa, and Hendrik Molter. Firefighting as a game, 2014.

  • Albert Atserias and Anuj Dawar. Degree lower bounds of tower-type for approximating formulas with parity quantifiers, 2014.

  • Albert Atserias and Sergi Oliva. Bounded-width QBF is PSPACE-complete, 2014.

  • Albert Atserias and Neil Thapen. The ordering principle in a fragment of approximate counting, 2014.

  • Albert Atserias, Johannes Klaus Fichte, and Marc Thurley. Clause-learning algorithms with many restarts and bounded-width resolution, 2014.

  • Albert Atserias, Massimo Lauria, and Jakob Nordström. Narrow proofs may be maximally long (extended abstract), 2014.

  • Nikolett Bereczky, Amalia Duch, Krisztián Németh, and Salvador Roura. Quad-K-d trees, 2014.

  • Maria J. Blesa, Amalia Duch, Joaquim Gabarró, and Maria J. Serna. The life cycle of a cutting-edge technology course - A coaching experience on android, 2014.

  • Christian Blum, Maria J. Blesa, and Borja Calvo. Can frogs find large independent sets in a decentralized way? yes they can!, 2014.

  • Christian Blum, Maria J. Blesa, Carlos García-Martínez, Francisco J. Rodríguez, and Manuel Lozano. The firefighter problem: application of hybrid ant colony optimization algorithms, 2014.

  • Josep Carmona and Jordi Cortadella. Process discovery algorithms using numerical abstract domains, 2014.

  • Josep Carmona, Mihai Teodor Lazarescu, and Marta Pietkiewicz-Koutny. Introduction to special issue on application of concurrency to system design (ACSD'13), 2014.

  • Hua-Huai Chern, María-Inés Fernández-Camacho, Hsien-Kuei Hwang, and Conrado Martínez. Psi-series method for equality of random trees and quadratic convolution recurrences, 2014.

  • Jordi Cortadella, Jordi Petit, Sergio Gómez, and Francesc Moll. A Boolean Rule-Based Approach for Manufacturability-Aware Cell Routing, 2014.

  • Marta R. Costa-Jussà, Lluís Formiga, Jordi Petit, and José A. R. Fonollosa. Detailed description of the development of a MOOC in the topic of statistical machine translation, 2014.

  • Carles Creus and Guillem Godoy. Automatic evaluation of context-free grammars (system description), 2014.

  • Carles Creus and Guillem Godoy. Tree automata with height constraints between brothers, 2014.

  • Carles Creus, Pau Fernández, and Guillem Godoy. Automatic evaluation of reductions between NP-complete problems, 2014.

  • Carles Creus, Guillem Godoy, and Lander Ramos. Excessively duplicating patterns represent non-regular languages, 2014.

  • Javier de San Pedro, Jordi Cortadella, and Antoni Roca. A hierarchical approach for generating regular floorplans, 2014.

  • Josep Díaz and George B. Mertzios. Minimum bisection is NP-hard on unit disk graphs, 2014.

  • Josep Díaz, Ioannis Giotis, Lefteris Kirousis, Maria Serna, and Vangelis Markakis. On the stability of generalized second price auctions with budgets, 2014.

  • Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria Serna, and Paul G. Spirakis. Approximating fixation probabilities in the generalized moran process, 2014.

  • Josep Díaz, Leslie Ann Goldberg, David Richerby, and Maria Serna. Absorption time of the Moran process, 2014.

  • Amalia Duch, Rosa M. Jiménez, and Conrado Martínez. Selection by rank in K-dimensional binary search trees, 2014.

  • Hartmut Ehrig, Ulrike Golas, Annegret Habel, Leen Lambers, and Fernando Orejas. M-adhesive transformation systems with nested application conditions. Part 1: parallelism, concurrency and amalgamation, 2014.

  • Leonor Frias and Salvador Roura. Multikey quickselect, 2014.

  • Joaquim Gabarro, Alina Garcia, and Maria Serna. Computational Aspects of Uncertainty Profiles and Angel-Daemon Games, 2014.

  • Joaquim Gabarró, Maria J. Serna, and Alan Stewart. Analysing web-orchestrations under stress using uncertainty profiles, 2014.

  • Zhicheng Gao, Conrado Martinez, Daniel Panario, and Bruce Richmond. The rth smallest part size of a random integer partition, 2014.

  • Ahmed Helmi, Conrado Martínez, and Alois Panholzer. Analysis of the strategy ``hiring above the m-th best candidate'', 2014.

  • Frank Hermann, Hartmut Ehrig, Ulrike Golas, and Fernando Orejas. Formal analysis of model transformations based on triple graph grammars, 2014.

  • Leen Lambers and Fernando Orejas. Tableau-based reasoning for graph properties, 2014.

  • Anaga Mani, Divya Venkataramani, Jordi Petit, and Salvador Roura. Better feedback for educational online judges, 2014.

  • Xavier Molinero, Fabián Riquelme, and Maria J. Serna. Power indices of influence games and new centrality measures for agent societies and social networks, 2014.

  • Jorge Munoz-Gama, Josep Carmona, and Wil M. P. van der Aalst. Single-entry single-exit decomposed conformance checking, 2014.

  • Fernando Orejas and Elvira Pino. Correctness of incremental model synchronization with triple graph grammars, 2014.

  • Edelmira Pasarella and Jorge Lobo. An operational framework to reason about policies behavior in trust management system, 2014.

  • Algorithms and complexity, 8th international conference, CIAC 2013, barcelona, spain, may 22-24, 2013. proceedings, 2013.

  • Albert Atserias. The proof-search problem between bounded-width resolution and bounded-degree semi-algebraic proofs, 2013.

  • A. Atserias and A. Dawar. Degree lower bounds of tower-type for approximating formulas with parity quantifiers, 2013. Accepted for publication in ACM Transactions on Computational Logic (TOCL).

  • A. Atserias and E. Maneva. Sherali-Adams Relaxations and Indistinguishability in Counting Logics, 2013.

  • Albert Atserias and Sergi Oliva. Bounded-width QBF is PSPACE-complete, 2013.

  • A. Atserias, M. Grohe, and D. Marx. Size bounds and query plans for relational joins, 2013.

  • A. Atserias, M. Müller, and S. Oliva. Lower Bounds for DNF-Refutations of a Relativized Weak Pigeonhole Principle, 2013.

  • Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, and Camille Vacher. Decidable classes of tree automata mixing local and global constraints modulo flat theories, 2013.

  • Josep Carmona and Jetty Kleijn. Compatibility in a multi-component environment, 2013.

  • J. Cortadella. Asynchronous circuits, 2013. Seminar at the Collège de France within the course on Algorithms, Machines and Languages organized by Gérard Berry.

  • J. Cortadella. Elastic circuits, 2013. Advanced course at EMICRO/SIM 2013 (XV Escola de Microeletrônica Sul / 28o Simpósio Sul de Microeletrônica), Porto Alegre (Brasil).

  • J. Cortadella. Elastic circuits, blending synchronous and asynchronous technologies, 2013. Seminar at the Collège de France within the course on Algorithms, Machines and Languages organized by Gérard Berry.

  • Jordi Cortadella. Area-Optimal Transistor Folding for 1-D Gridded Cell Design, 2013.

  • J. Cortadella, J. de San Pedro, N. Nikitin, and J. Petit. Physical-aware system-level design for tiled hierarchical chip multiprocessors, 2013.

  • Carles Creus, Adrià Gascón, and Guillem Godoy. Emptiness and Finiteness for Tree Automata with Global Reflexive Disequality Constraints, 2013.

  • Carles Creus, Guillem Godoy, Francesc Massanes, and Ashish Tiwari. Non-linear rewrite closure and weak normalization, 2013.

  • Varsha Dani, Josep Díaz, Tom Hayes, and Cris Moore. The power of choice for random satisfiability, 2013.

  • Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, and Paul G. Spirakis. On the fixation probability of superstars, 2013.

  • A. Duch, J. Petit, E. Rodríguez-Carbonell, and S. Roura. Fun in CS2, 2013.

  • Francisco Duran, Fernando Orejas, and Steffen Zschaler. Behaviour protection in modular rule-based system specifications, 2013.

  • Joaquim Gabarró, Alina García, and Maria Serna. On the hardness of game equivalence under local isomorphism, 2013.

  • Jose Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, and Fernando Orejas. Invariant-free clausal temporal resolution, 2013.

  • Z. Gao, C. Martínez, D. Panario, and B. Richmond. The rth smallest part size of a random integer partition, 2013. accepted.

  • Guillem Godoy and Omer Giménez. The HOM problem is decidable, 2013.

  • Esther Guerra, Juan de Lara, and Fernando Orejas. Inter-modelling with patterns, 2013.

  • A. Helmi, C. Martínez, and A. Panholzer. Analysis of the strategy ``hiring above the m-th best candidate'', 2013. accepted.

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, Yingfei Xiong, Susann Gottmann, and Thomas Engel. From model transformation to incremental bidirectional model synchronization, 2013.

  • Hsien-Kuei Hwang, Conrado Martínez, and Robert Sedgewick. Guest editorial [Special issue: Analytic algorithmics and combinatorics], 2013.

  • X. Molinero, F. Riquelme, and M. J. Serna. Power indices of influence games and new centrality measures for social networks, 2013. CoRR, abs/1306.6929.

  • Xavier Molinero, Fabián Riquelme, and Maria J. Serna. Star-shaped mediation in influence games, 2013.

  • Jorge Munoz-Gama, Josep Carmona, and Wil M. P. van der Aalst. Conformance checking in the large: Partitioning and topology bf (best student paper award), 2013.

  • Jorge Munoz-Gama, Josep Carmona, and Wil M. P. van der Aalst. Hierarchical conformance checking of process models based on event logs, 2013.

  • Nikita Nikitin, Javier de San Pedro, and Jordi Cortadella. Architectural Exploration of Large-Scale Hierarchical Chip Multiprocessors, 2013.

  • Fernando Orejas, Artur Boronat, Ulrike Golas, and Nikos Mylonakis. Checking bisimilarity for attributed graph transformation, 2013.

  • Fernando Orejas, Artur Boronat, Ulrike Golas, and Nikos Mylonakis. Checking bisimilarity for attributed graph transformation, 2013.

  • J. De San Pedro, N. Nikitin, J. Cortadella, and J. Petit. Physical planning for the architectural exploration of large-scale chip multiprocessors, 2013.

  • Ferdinand Peper, Jia Lee, Josep Carmona, Jordi Cortadella, and Kenichi Morita. Brownian circuits: Fundamentals, 2013.

  • Francisco J. Rodriguez, Manuel Lozano, Christian Blum, and Carlos García-Martínez. An iterated greedy algorithm for the large-scale unrelated parallel machines scheduling problem, 2013.

  • Salvador Roura. Fibonacci BSTs: A new balancing method for binary search trees, 2013.

  • Salvador Roura. Fibonacci BSTs: A new balancing method for binary search trees, 2013.

  • Marc Solé and Josep Carmona. Amending C-net discovery algorithms, 2013.

  • Marc Solé and Josep Carmona. Region-based foldings in process discovery, 2013.

  • Ruben Verborgh, Thomas Steiner, Davy Van Deursen, Jos De Roo, Rik Van de Walle, and Joaquim Gabarró Vallés. Capturing the functionality of web services with functional descriptions, 2013.

  • Algorithmic game theory - 5th international symposium, SAGT 2012, barcelona, spain, october 22-23, 2012. proceedings, 2012.

  • Arya Adriansyah, Jorge Munoz-Gama, Josep Carmona, Boudewijn F. van Dongen, and Wil M. P. van der Aalst. Alignment based precision checking, 2012.

  • Carme Àlvarez, Josep Díaz, Dieter Mitsche, and Maria Serna. Continuous monitoring in the dynamic sensor field model, 2012.

  • Carme Àlvarez, Josep Díaz, Dieter Mitsche, and Maria J. Serna. Continuous monitoring in the dynamic sensor field model, 2012.

  • Carme Àlvarez, Amalia Duch, Maria Serna, and Dimitrios M. Thilikos. On the existence of nash equilibria in strategic search games, 2012.

  • Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente. Faster computation of the robinson-foulds distance between phylogenetic networks, 2012.

  • A. Atserias and A. Dawar. Degree lower bounds of tower-type for approximating formulas with parity quantifiers, 2012.

  • A. Atserias and E. Maneva. Sherali-Adams Relaxations and Indistinguishability in Counting Logics, 2012.

  • Christian Blum. Hybrid metaheuristics in combinatorial optimization: a tutorial, 2012.

  • Josep Carmona. The label splitting problem, 2012.

  • Josep Carmona. Projection approaches to process mining using region-based techniques, 2012.

  • Josep Carmona and Ricard Gavaldà. Online techniques for dealing with concept drift in process mining, 2012.

  • H.-H. Chern, M. I. Fernández-Camacho, H.-K. Hwang, and C. Martínez. Psi-series method for equality of random trees and quadratic convolution recurrences, 2012. DOI: 10.1002/rsa.20428.

  • Carles Creus, Adrià Gascón, and Guillem Godoy. One-context unification with STG-compressed terms is in NP, 2012.

  • Carles Creus, Adrià Gascón, Guillem Godoy, and Lander Ramos. The HOM problem is EXPTIME-complete, 2012.

  • H. Daudé, C. Martínez, V. Rasendrahasina, and V. Ravelomanana. The MAX-CUT of sparse random graphs, 2012.

  • Javier de San Pedro, Josep Carmona, Jordi Cortadella, and Jordi Petit. Integrating formal verification in an online judge for e-learning logic circuit design, 2012.

  • Josep Díaz. Book review: George dyson "turing's cathedral: The origins of the digital universe" (2012) pantheon books, 2012.

  • Josep Díaz and Carme Torras. A personal account of turing’s imprint on the development of computer science, 2012.

  • Josep Díaz, Leslie Ann Goldberg, George B. Mertzios, David Richerby, Maria J. Serna, and Paul G. Spirakis. Approximating fixation probabilities in the generalized moran process, 2012.

  • Josep Díaz, Olli Pottonen, Maria J. Serna, and Erik Jan van Leeuwen. On the complexity of metric dimension, 2012.

  • A. Duch, R. M. Jiménez, and C. Martínez. Selection by rank in K-dimensional binary search trees, 2012. DOI: 10.1002/rsa.20476.

  • Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, and Ulrike Golas. M-adhesive transformation systems with nested application conditions. part 1: Parallelism , concurrency and amalgamation, 2012.

  • Hartmut Ehrig, Annegret Habel, Fernando Orejas, Ulrike Golas, and Leen Lambers. scr M-adhesive transformation systems with nested application conditions. Part 2: Embedding, critical pairs and local confluence, 2012.

  • Josep Freixas, Xavier Molinero, and Salvador Roura. Complete voting systems with two classes of voters: weightedness and counting, 2012.

  • Joaquim Gabarró, Maria J. Serna, and Alan Stewart. Orchestrating unreliable services: Strategic and probabilistic approaches to reliability, 2012.

  • O. Giménez, J. Petit, and S. Roura. Jutge.org: An educational programming judge, 2012.

  • Ulrike Golas, Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Attributed graph transformation with inheritance: efficient conflict detection and local confluence analysis using abstract critical pairs, 2012.

  • A. Helmi, C. Martínez, and A. Panholzer. Hiring above the m-th best candidate: a generalization of records in permutations, 2012.

  • Ahmed Helmi, Jérémie Lumbroso, Conrado Martínez, and Alfredo Viola. Data streams as random permutations: the distinct element problem, 2012.

  • Vera Hemmelmayr, Verena Schmid, and Christian Blum. Variable neighbourhood search for the variable sized bin packing problem, 2012.

  • Frank Hermann, Hartmut Ehrig, Claudia Ermel, and Fernando Orejas. Concurrent Model Synchronization with Conflict Resolution Based on Triple Graph Grammars, 2012.

  • Frank Hermann, Hartmut Ehrig, Ulrike Golas, and Fernando Orejas. Formal analysis of model transformations based on triple graph grammars, 2012.

  • Hugo Hernández and Christian Blum. Distributed ant colony optimization for minimum energy broadcasting in sensor networks with realistic antennas, 2012.

  • Elitza Maneva. P versus NP: the star problem of the mathematics of computation, 2012.

  • X. Molinero, F. Riquelme, and M. J. Serna. Social influence as a voting system: A complexity analysis of parameters and properties, 2012. CoRR, abs/1208.3751.

  • Muhammad Naeem, Reiko Heckel, Fernando Orejas, and Frank Hermann. Incremental service composition based on partial matching of visual contracts, 2012.

  • N. Nikitin and J. Cortadella. Static task mapping for tiled chip multiprocessors with multiple voltage islands, 2012.

  • Nikita Nikitin, Javier de San Pedro, Josep Carmona, and Jordi Cortadella. Analytical performance modeling of hierarchical interconnect fabrics, 2012.

  • Fernando Orejas and Leen Lambers. Lazy graph transformation, 2012.

  • Fernando Orejas, Artur Boronat, and Nikos Mylonakis. Borrowed contexts for attributed graphs, 2012.

  • Edelmira Pasarella, Fernando Orejas, Elvira Pino, and Marisa Navarro. Semantics of structured normal logic programs, 2012.

  • F. J. Rodriguez, C. Blum, C. García-Martínez, and M. Lozano. GRASP with path-relinking for the non-identical parallel machine scheduling problem with minimising total weighted completion times, 2012.

  • Andrea Roli, Stefano Benedettini, Thomas Stützle, and Christian Blum. Large neighbourhood search algorithms for the founder sequence reconstruction problem, 2012.

  • Bruno Salvy, Bob Sedgewick, Michèle Soria, Wojciech Szpankowski, Brigitte Vallée, Josep Díaz, Conrado Martínez, and Marc Noy. Philippe Flajolet, 1948-2011, 2012.

  • Monica Santamaria, Bruno Fosso, A. Consiglio, G. De Caro, G. Grillo, F. Licciulli, S. Liuni, M. Marzano, Daniel Alonso-Alemany, Gabriel Valiente, and Graziano Pesole. Reference databases for taxonomic assignment in metagenomics, 2012.

  • Marc Solé and Josep Carmona. A high-level strategy for C-net discovery, 2012.

  • Marc Solé and Josep Carmona. Incremental process discovery, 2012.

  • Marc Solé and Josep Carmona. An SMT-based discovery algorithm for C-nets, 2012.

  • Thomas Steiner, Ruben Verborgh, Joaquim Gabarró, and Rik Van de Walle. Defining aesthetic principles for automatic media gallery layout for visual and audial event summarization based on social networks, 2012.

  • Thomas Steiner, Ruben Verborgh, Raphaël Troncy, Joaquim Gabarró, and Rik Van de Walle. Adding realtime coverage to the google knowledge graph, 2012.

  • Ruben Verborgh, Vincent Haerinck, Thomas Steiner, Davy Van Deursen, Sofie Van Hoecke, Jos De Roo, Rik Van de Walle, and Joaquim Gabarró. Functional composition of sensor web APIs, 2012.

  • Ruben Verborgh, Thomas Steiner, Davy Van Deursen, Sam Coppens, Joaquim Gabarró Vallés, and Rik Van de Walle. Functional descriptions as the bridge between hypermedia APIs and the semantic web, 2012.

  • Ruben Verborgh, Thomas Steiner, Joaquim Gabarró, Erik Mannens, and Rik Van de Walle. A social description revolution - describing web APIs' social parameters with RESTdesc, 2012.

  • Fundamental approaches to software engineering, FASE 2011, 2011.

  • Daniel Alonso-Alemany, José C. Clemente, Jesper Jansson, and Gabriel Valiente. Taxonomic assignment in metagenomics with TANGO, 2011.

  • Carme Àlvarez, Maria Blesa, and Maria Serna. The robustness of stability under link and node failures, 2011.

  • Carme Àlvarez, Ioannis Chatzigiannakis, Amalia Duch, Joaquim Gabarró, Othon Michail, Maria J. Serna, and Paul G. Spirakis. Computational models for networks of tiny artifacts: A survey, 2011.

  • Carme Àlvarez, Joaquim Gabarro, and Maria Serna. Equilibria problems on games: complexity versus succinctness, 2011.

  • Albert Atserias. A why-on-earth tutorial on finite model theory, 2011.

  • A. Atserias and E. Maneva. Mean-payoff games and propositional proofs, 2011.

  • Albert Atserias, Mikolaj Bojanczyk, Balder ten Cate, Ronald Fagin, Floris Geerts, and Kenneth Ross. Foreword, 2011.

  • Albert Atserias, Johannes Klaus Fichte, and Marc Thurley. Clause-learning algorithms with many restarts and bounded-width resolution, 2011.

  • Nayantara Bhatnagar and Elitza Maneva. A computational method for bounding the probability of reconstruction on trees, 2011.

  • Maria J. Blesa, Amalia Duch, Joaquim Gabarró, Hugo Hernández, and Maria J. Serna. Coaching on new technologies: Programming workshop android applications for google phones, 2011.

  • Christian Blum. Iterative beam search for simple assembly line balancing with a fixed number of work stations, 2011.

  • Christian Blum and Roberto Battiti. Guest editorial: Special issue based on the LION 4 conference, 2011. Held in Venice, January 18-22, 2010.

  • Christian Blum and Cristobal Miralles. On solving the assembly line worker assignment and balancing problem via beam search, 2011.

  • Christian Blum, Jakob Puchinger, Günther Raidl, and Andrea Roli. Hybrid metaheuristics, 2011.

  • Tiziana Calamoneri and Josep Diaz. Editorial [Special papers: Selected papers from the 7th International Conference on Algorithms and Complexity (CIAC 2010)], 2011. Held at ``Sapienza'' University, Rome, May 26-28, 2010.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Comparison of galled trees, 2011.

  • J. Carmona. The label splitting problem, 2011.

  • J. Carmona, J. Júlvez, J. Cortadella, and M. Kishinevsky. A scheduling strategy for synchronous elastic designs, 2011.

  • José C. Clemente, Jesper Jansson, and Gabriel Valiente. Flexible taxonomic assignment of ambiguous sequencing reads, 2011.

  • Josep Díaz. Cris moore, stephen mertens, , the nature of computation (2011) oxford UP, 2011.

  • Josep Díaz, Alberto Marchetti-Spaccamela, Dieter Mitsche, Paolo Santi, and Julinda Stefa. Social-aware forwarding improves routing performance in pocket switched networks, 2011.

  • Josep Díaz, Dieter Mitsche, and Paolo Santi. Theoretical aspects of graph models for MANETs, 2011.

  • Zinovy Diskin, Yingfei Xiong, Krzysztof Czarnecki, Hartmut Ehrig, Frank Hermann, and Fernando Orejas. From State- to Delta-Based Bidirectional Model Transformations: The Symmetric Case, 2011.

  • Josep Freixas, Xavier Molinero, Martin Olsen, and Maria Serna. On the complexity of problems on simple games, 2011.

  • Joaquim Gabarró, Alina García, and Maria Serna. The complexity of game isomorphism, 2011.

  • Joaquim Gabarro, Maria Serna, and Alan Stewart. Web services and incerta spiriti: a game theoretic approach to uncertainty, 2011.

  • Marc Galceran-Oms, Alexander Gotmanov, Jordi Cortadella, and Mike Kishinevsky. Microarchitectural Transformations Using Elasticity, 2011.

  • Adrià Gascón, Guillem Godoy, and Manfred Schmidt-Schauss. Unification and matching on compressed terms, 2011.

  • Omer Giménez, Guillem Godoy, and Sebastian Maneth. Deciding regularity of the set of instances of a set of terms with regular constraints is EXPTIME-complete, 2011.

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, Krzysztof Czarnecki, Zinovy Diskin, and Yingfei Xiong. Correctness of Model Synchronization Based on Triple Graph Grammars, 2011.

  • Guy Louchard, Conrado Martínez, and Helmut Prodinger. The Swedish leader election protocol: analysis and variations, 2011.

  • Conrado Martínez, Alois Panholzer, and Helmut Prodinger. The analysis of Range Quickselect and related problems, 2011.

  • J. Munoz-Gama and J. Carmona. Enhancing precision in process conformance: Stability, confidence and severity, 2011.

  • Fernando Orejas. Symbolic graphs for attributed graph constraints, 2011.

  • J. Pérez-Puigdemont, F. Moll, and J. Cortadella. Measuring the tolerance of self-adaptive clocks to supply voltage noise, 2011. (PDF)

  • Jordi Petit. Addenda to the survey of layout problems, 2011.

  • Paolo Ribeca and Gabriel Valiente. Computational challenges of sequence classification in microbiomic data, 2011.

  • Marc Solé and Josep Carmona. Light region-based techniques for process discovery, 2011.

  • Algorithms and complexity, 2010.

  • Approximation, randomization, and combinatorial optimization. algorithms and techniques, 13th international workshop, APPROX 2010, and 14th international workshop, RANDOM 2010, barcelona, spain, september 1-3, 2010. proceedings, 2010.

  • Miguel Arenas, Mateus Patricio, David Posada, and Gabriel Valiente. Characterization of phylogenetic networks with NetTest, 2010.

  • Tetsuo Asano, Jesper Jansson, Kunihiko Sadakane, Ryuhei Uehara, and Gabriel Valiente. Faster computation of the Robinson-Foulds distance between phylogenetic networks, 2010.

  • A. Atserias and E. Maneva. Mean-payoff games and propositional proofs, 2010.

  • Luis Barguñó, Carles Creus, Guillem Godoy, Florent Jacquemard, and Camille Vacher. The emptiness problem for tree automata with global constraints, 2010.

  • Luis Barguñó, Guillem Godoy, Eduard Huntingford, and Ashish Tiwari. Termination of rewriting with right-flat rules modulo permutative theories, 2010.

  • M. Blesa, J. Anguera, J. Farré, V. López, and J. Petit. Topology control algorithms in WISELIB, 2010.

  • Christian Blum. Hybrid metaheuristics, 2010.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Nodal distances for rooted phylogenetic trees, 2010.

  • J. Carmona and J. Cortadella. Process mining meets abstract interpretation, 2010.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. New region-based algorithms for deriving bounded petri nets, 2010.

  • José C. Clemente, Jesper Jansson, and Gabriel Valiente. Accurate taxonomic assignment of short pyrosequencing reads, 2010.

  • J. Cortadella, M. Galceran-Oms, and M. Kishinevsky. Elastic systems, 2010.

  • J. Cortadella, M. Galceran-Oms, and M. Kishinevsky. Elastic systems, 2010. Invited lecture at the 8th ACM/IEEE International Conference on Formal Methods and Models for Codesign (MEMOCODE), Grenoble (France).

  • J. Cortadella, L. Lavagno, D. Amiri, J. Casanova, C. Macián, F. Martorell, J. A. Moya, L. Necchi, D. Sokolov, and E. Tuncer. Narrowing the margins with elastic clocks, 2010.

  • Josep Díaz and Dieter Mitsche. The cook-book approach to the differential equation method, 2010.

  • Josep Díaz, Marcin Kaminski, and Dimitrios M. Thilikos. A note on the subgraphs of the (2 times infty )-grid, 2010.

  • A. Duch, R. M. Jiménez, and C. Martínez. Rank selection in multidimensional data, 2010.

  • Hartmut Ehrig, Annegret Habel, Leen Lambers, Fernando Orejas, and Ulrike Golas. Local confluence for rules with nested application conditions, 2010.

  • Josep Freixas and Xavier Molinero. Detection of paradoxes of power indices for simple games, 2010.

  • Josep Freixas and Xavier Molinero. Weighted games without a unique minimal representation in integers, 2010.

  • Joaquim Gabarró, Peter Kilpatrick, Maria J. Serna, and Alan Stewart. Stressed web environments as strategic games: Risk profiles and weltanschauung, 2010.

  • M. Galceran-Oms, J. Cortadella, and M. Kishinevsky. Symbolic performance analysis of elastic systems, 2010.

  • M. Galceran-Oms, J. Cortadella, M. Kishinevsky, and D. Bufistov. Automatic microarchitectural pipelining, 2010.

  • Adrià Gascón, Guillem Godoy, Manfred Schmidt-Schauß, and Ashish Tiwari. Context unification with one context variable, 2010.

  • Guillem Godoy. Normalization properties for shallow TRS and innermost rewriting, 2010.

  • Guillem Godoy, Omer Giménez, Lander Ramos, and Carme Àlvarez. The HOM problem is decidable, 2010.

  • Esther Guerra, Juan de Lara, and Fernando Orejas. Controlling reuse in pattern-based model-to-model transformations, 2010.

  • Frank Hermann, Hartmut Ehrig, Fernando Orejas, and Ulrike Golas. Formal analysis of functional behaviour for model transformations based on triple graph grammars, 2010.

  • Rosa M. Jiménez and Conrado Martínez. Interval sorting, 2010.

  • Jorge Júlvez, Jordi Cortadella, and Michael Kishinevsky. On the performance evaluation of multi-guarded marked graphs with single-server semantics, 2010.

  • Manuel López-Ibáñez and Christian Blum. Beam-ACO for the travelling salesman problem with time windows, 2010.

  • Carlos J. Martín, Oscar Martínez-Graullera, Gregorio Godoy, and Luis G. Ullate. Coarray synthesis based on polynomial decomposition, 2010.

  • Conrado Martínez and Uwe Rösler. Partial Quicksort and Quickpartitionsort, 2010.

  • Conrado Martínez, Daniel Panario, and Alfredo Viola. Adaptive sampling strategies for quickselect, 2010.

  • J. Munoz-Gama and J. Carmona. A fresh look at precision in process conformance, 2010.

  • Jorge Munoz-Gama and Josep Carmona. A fresh look at precision in process conformance, 2010.

  • N. Nikitin, S. Chatterjee, J. Cortadella, M. Kishinevsky, and U. Ogras. Physical-aware link allocation and route assignment for chip multiprocessing, 2010.

  • Fernando Orejas and Leen Lambers. Delaying constraint solving in symbolic graph transformation, 2010.

  • Fernando Orejas, Hartmut Ehrig, Markus Klein, Julia Padberg, Elvira Pino, and Sonia Pérez. A generic approach to connector architectures. I. The general framework, 2010.

  • Fernando Orejas, Hartmut Ehrig, Markus Klein, Julia Padberg, Elvira Pino, and Sonia Pérez. A generic approach to connector architectures. II. Instantiation to Petri Nets and CSP, 2010.

  • Fernando Orejas, Hartmut Ehrig, and Ulrike Prange. Reasoning with graph constraints, 2010.

  • M. Solé and J. Carmona. Process mining from a basis of state regions, 2010.

  • M. Solé and J. Carmona. Rbminer: A tool for discovering Petri nets from transition systems, 2010.

  • Mallika Veeramalai, David Gilbert, and Gabriel Valiente. An optimized TOPS+ comparison method for enhanced TOPS models, 2010.

  • Martin J. Wainwright, Elitza Maneva, and Emin Martinian. Lossy source compression using low-density generator matrix codes: analysis and algorithms, 2010.

  • Ricardo Alberich, Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. An algebraic metric for phylogenetic trees, 2009.

  • Carme Àlvarez and Maria Serna. On the proper intervalization of colored caterpillar trees, 2009.

  • Carme Àlvarez, Amalia Duch, Joaquim Gabarró, and Maria Serna. Algorithmic aspects of wireless sensor networks, 5th international workshop, ALGOSENSORS 2009, rhodes, greece, july 10-11, 2009. revised selected papers, 2009.

  • Margaret Archibald and Conrado Martínez. The hiring problem and permutations, 2009.

  • Federico Ardila and Elitza Maneva. Pruning processes and a new characterization of convex geometries, 2009.

  • Albert Atserias. Four subareas of the theory of constraints, and their links, 2009.

  • A. Atserias and M. Weyer. Decidable relationships between consistency notions for constraint satisfaction problems, 2009.

  • A. Atserias, A. Bulatov, and A. Dawar. Affine systems of equations and counting infinitary logic, 2009.

  • A. Atserias, J. K. Fichte, and M. Thurley. Clause-learning algorithms with many restarts and bounded-width resolution, 2009.

  • D. Baneres, J. Cortadella, and M. Kishinevsky. Timing-driven N-way decomposition, 2009.

  • D. Baneres, J. Cortadella, and M. Kishinevsky. Variable-latency design by function speculation, 2009.

  • Maria Blesa, Daniel Calzada, Antonio Fernández, Luis López, Andrés L. Martínez, Agustín Santos, Maria Serna, and Christopher Thraves. Adversarial queueing model for continuous network dynamics, 2009.

  • Christian Blum, Maria J. Blesa, and Manuel López-Ibáñez. Beam search for the longest common subsequence problem, 2009.

  • D. Bufistov, J. Cortadella, M. Galceran-Oms, J. Júlvez, and M. Kishinevsky. Retiming and recycling for elastic systems with early evaluation, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Comparison of galled trees, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Metrics for phylogenetic networks I: Generalizations of the Robinson-Foulds metric, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Metrics for phylogenetic networks II: Nodal and triplets metrics, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. On Nakhleh's metric for reduced phylogenetic networks, 2009.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Path lengths in tree-child time consistent hybridization networks, 2009.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. Comparison of tree-child phylogenetic networks, 2009.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. Divide-and-conquer strategies for process mining, 2009.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. Genet: a tool for the synthesis and mining of Petri nets, 2009.

  • J. Carmona, J. Cortadella, M. Kishinevsky, and Alexander Taubin. Elastic circuits, 2009.

  • J. Carmona, Jorge Júlvez, J. Cortadella, and M. Kishinevsky. Scheduling synchronous elastic designs bf (best paper award), 2009.

  • J. Casanova and J. Cortadella. Multi-level clustering for clock skew optimization, 2009.

  • José C. Clemente, K. Ikeo, Gabriel Valiente, and T. Gojobori. Optimized ancestral state reconstruction using Sankoff parsimony, 2009.

  • Marc Comas and Maria Serna. Vertex fusion under distance constraints, 2009.

  • Jordi Cortadella and Alexander Taubin. Guest editorial: Special section on asynchronous circuits and systems, 2009.

  • J. Cortadella, M. Kishinevsky, D. Bufistov, J. Carmona, and J. Júlvez. Elasticity and Petri nets, 2009.

  • Carles Creus, Guillem Godoy, Francesc Massanes, and Ashish Tiwari. Non-linear rewrite closure and weak normalization, 2009.

  • Josep Díaz, Francesco Grandoni, and Alberto Marchetti-Scapamela. Balanced cut approximation in random geometric graphs, 2009.

  • Josep Díaz, A. Kaporis, G. D. Kemkes, Lefteris Kirousis, Xavier Pérez, and Nick Wormald. On the chromatic number of a random 5-regular grap, 2009.

  • Josep Díaz, Lefteris Kirousis, Dieter Mitsche, and Xavier Pérez. On the satisfiability threshold of formulae with three literals per clause, 2009.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez. Connectivity for dynamic random geometric graphs, 2009.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez. On the probability of existence of mid-size components in random geometric graphs, 2009.

  • Josep Díaz, Dieter Mitsche, Navin Rustagui, and Jared Saia. On the power of mediators, 2009.

  • Josep Díaz, Maria J. Serna, Paul G. Spirakis, and Jacobo Torán. Paradigms for fast parallel approximability (reprint from 1997), 2009.

  • Amalia Duch and Conrado Martínez. Updating relaxed K-d trees, 2009.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Efficient reconstruction of metabolic pathways by bidirectional chemical search, 2009.

  • J. Freixas and X. Molinero. Maximum tolerance and maximum greatest tolerance of strict separating systems, 2009.

  • J. Freixas and X. Molinero. Measures of voting power: Counting of power indices and paradoxes, 2009.

  • J. Freixas and X. Molinero. On the existence of a minimum integer representation for weighted voting systems, 2009.

  • J. Freixas and X. Molinero. Simple games and weighted games: a theoretical and computational viewpoint, 2009.

  • Josep Freixas and Xavier Molinero. Weightedness for simple games with less than 9 voters, 2009.

  • L. Frias and J. Petit. Combining digital access and parallel partition for quicksort and quickselect, 2009.

  • Leonor Frias, Jordi Petit, and Salvador Roura. Lists revisited: cache-conscious STL lists, 2009.

  • Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, and Fernando Orejas. Dual systems of tableaux and sequents for PLTL, 2009.

  • M. Galceran-Oms, J. Cortadella, and M. Kishinevsky. Speculation in elastic systems, 2009.

  • M. Galceran-Oms, J. Cortadella, M. Kishinevsky, and D. Bufistov. Automatic microarchitectural pipelining, 2009.

  • Adrià Gascón, Guillem Godoy, and Manfred Schmidt-Schauß. Unification with singleton tree grammars, 2009.

  • O. Gimnez, J. Petit, and S. Roura. Programació 1: A pure problem-oriented approach for a CS1 course, 2009.

  • Guillem Godoy and Hugo Hernández. Undecidable properties of flat term rewrite systems, 2009.

  • Guillem Godoy and Florent Jacquemard. Unique normalization for shallow TRS, 2009.

  • Guillem Godoy and Ashish Tiwari. Invariant checking for programs with procedure calls, 2009.

  • Parikshit Gopalan, Phokion G. Kolaitis, Elitza Maneva, and Christos H. Papadimitriou. The connectivity of Boolean satisfiability: computational and structural dichotomies, 2009.

  • Conrado Martínez and Helmut Prodinger. Moves and displacements of particular elements in quicksort, 2009.

  • Conrado Martínez, Lucia Moura, Daniel Panario, and Brett Stevens. Locating errors using ELAs, covering arrays, and adaptive testing algorithms, 2009.

  • N. Nikitin and J. Cortadella. A performance analytical model for Network-on-Chip with constant service time routers, 2009.

  • Fernando Orejas and Martin Wirsing. On the specification and verification of model transformations, 2009.

  • Fernando Orejas, Esther Guerra, Juan de Lara, and Hartmut Ehrig. Correctness, completeness and termination of pattern-based model-to-model transformation, 2009.

  • J. Petit and S. Roura. Programacin-1: Una asignatura orientada a la resolución de problemas, 2009.

  • Francesc Rosselló and Gabriel Valiente. All that glisters is not galled, 2009.

  • Maria Serna and Carme Àlvarez. Preface to special section of selected papers from WEA 2006, 2009. Held in Menorca, May 24-27, 2006.

  • E. Tuncer, J. Cortadella, and L. Lavagno. Enabling adaptability through elastic clocks, 2009.

  • Gabriel Valiente. Combinatorial pattern matching algorithms in computational biology using perl and R, 2009.

  • Graph transformations, 4th international conference, ICGT 2008, leicester, united kingdom, september 7-13, 2008. proceedings, 2008.

  • Graph transformations, 4th international conference, ICGT 2008, leicester, united kingdom, september 7-13, 2008. proceedings, 2008.

  • Hybrid metaheuristics: An emerging approach to optimization, 2008.

  • Hybrid metaheuristics: Fifth international workshop, HM 2008, 2008.

  • Hybrid metaheuristics, 2008. An emerging approach to optimization.

  • C. Àlvarez, J. Diaz, J. Petit, J. Rolim, and M. Serna. High level communication functionalities for wireless sensor networks, 2008.

  • José Nelson Amaral and Joaquim Gabarró. Topic 9: Parallel and distributed programming, 2008.

  • M. Archibald and C. Martínez. The hiring problem in permutations, 2008.

  • Miguel Arenas, Gabriel Valiente, and David Posada. Characterization of phylogenetic reticulate networks based on the coalescent with recombination, 2008.

  • A. Atserias. On digraph coloring problems and treewidth duality, 2008.

  • A. Atserias and V. Dalmau. A combinatorial characterization of resolution width, 2008.

  • A. Atserias, A. Dawar, and M. Grohe. Preservation under Extensions on Well-Behaved Finite Structures, 2008.

  • A. Atserias, M. Grohe, and D. Marx. Size Bounds and Query Plans for Relational Joins, 2008.

  • Carlo Bertolli, Massimiliano Meneghin, and Joaquim Gabarró. A markov model for fault-tolerant task parallel computations, 2008.

  • M. Blesa, D. Calzada, A. Fernández, L. López, A. L. Martínez, A. Santos, M. Serna, and C. Thraves. Adversarial queueing model for continuous network dynamics, 2008. Accepted for publication.

  • C. Blum. Beam-ACO for simple assembly line balancing, 2008.

  • C. Blum and M. Blesa. Optimization techniques for solving complex problems, 2008.

  • C. Blum and A. Roli. Hybrid metaheuristics, 2008.

  • C. Blum, C. Cotta, A. J. Fernández, J. E. Gallardo, and M. Mastrolilli. Hybrid metaheuristics, 2008.

  • C. Blum, M. Yábar-Vallès, and M. J. Blesa. An ant colony optimization algorithm for DNA sequencing by hybridization, 2008.

  • D. Bufistov, J. Júlvez, and J. Cortadella. Performance optimization of elastic systems using buffer resizing and buffer insertion, 2008.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. A distance metric for a class of tree-sibling phylogenetic networks, 2008.

  • Gabriel Cardona, Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. Metrics for phylogenetic networks II: Nodal and triplets metrics, 2008. In press.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. A perl package and an alignment tool for phylogenetic networks, 2008.

  • Gabriel Cardona, Francesc Rosselló, and Gabriel Valiente. Tripartitions do not always discriminate phylogenetic networks, 2008.

  • J. Carmona and J. Cortadella. Encoding large asynchronous controllers with ILP techniques, 2008.

  • J. Carmona, J. Cortadella, and M. Kishinevsky. A region-based algorithm for discovering Petri nets from event logs, 2008.

  • J. Carmona, J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. A symbolic algorithm for the synthesis of bounded petri nets, 2008.

  • J. Carmona, J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. A symbolic algorithm for the synthesis of bounded Petri nets, 2008.

  • Josep Carmona, Jordi Cortadella, Yousuke Takada, and Ferdinand Peper. Formal methods for the analysis and synthesis of nanometer-scale cellular arrays, 2008.

  • Hubie Chen and Omer Giménez. Causal graphs and structurally restricted planning, 2008.

  • M. Comas and M. Serna. A coloring characterization for graph cover problems, 2008.

  • M. Comas and M. Serna. A coloring characterization for graph cover problems, 2008.

  • J. Díaz, L. Kirousis, D. Mitsche, and X. Pérez-Giménez. A new upper bound for 3-SAT, 2008.

  • J. Díaz, X. Pérez, M. J. Serna, and N. C. Wormald. Walkers on the cycle and the grid, 2008.

  • Josep Díaz, Zvi Lotker, and Maria Serna. The distant-2 chromatic number of random proximity and random geometric graphs, 2008.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez-Giménez. On the connectivity of dynamic random geometric graphs, 2008.

  • Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. Efficient algorithms for counting parameterized list H-colorings, 2008.

  • Michael Drmota, Omer Giménez, and Marc Noy. Vertices of given degree in series-parallel graphs, 2008. Accepted for publication.

  • M. Fellows, C. Knauer, N. Nishimura, P. Ragde, F. Rosamond, U. Stege, D. Thilikos, and S. Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems, 2008.

  • J. Freixas and X. Molinero. Complete voting systems with two types of voters: weightedness and counting, 2008. Submitted.

  • J. Freixas and X. Molinero. A fibonacci sequence for linear structures with two types of components, 2008.

  • J. Freixas and X. Molinero. The greatest allowed relative error in weights and threshold of strict separating systems, 2008.

  • J. Freixas and X. Molinero. A new method to check whether a simple game is weighted, 2008.

  • J. Freixas and X. Molinero. Weighted integer realizations for linear simple games with two types of voters, 2008.

  • J. Freixas and X. Molinero. Weightedness for simple games with less than 9 voters, 2008. Submitted.

  • Josep Freixas, Xavier Molinero, Martin Olsen, and Maria J. Serna. The complexity of testing properties of simple games, 2008. http://arxiv.org/abs/0803.0404.

  • L. Frias and J. Petit. Parallel partition revisited, 2008.

  • L. Frias and J. Singler. Parallelization of Bulk Operations for STL Dictionaries, 2008.

  • L. Frias, J. Singler, and P. Sanders. Single-Pass List Partitioning, 2008.

  • L. Frias, J. Singler, and P. Sanders. Single-pass list partitioning, 2008.

  • Joaquim Gabarro, Alina Garcia, Maurice Clint, Peter Kilpatrick, and Alan Stewart. Bounded site failures: an approach to unreliable grid computing, 2008.

  • Joaquim Gabarro, Alina Garcia, Maria Serna, Peter Kilpatrick, and Alan Stewart. Analysing orchestrations with risk profiles and angel-daemon games, 2008.

  • J. Gabarró, A. García, and M. Serna. On the complexity of equilibria problems in angel-daemon games, 2008.

  • B. Gel and X. Messeguer. Implementing an interactive web-based DAS client, 2008.

  • Stefanie Gerke, Omer Giménez, Marc Noy, and Andreas Weißl. The number of graphs not containing K sb 3,3 as a minor, 2008.

  • Omer Giménez and Anders Jonsson. The complexity of planning problems with simple causal graphs, 2008.

  • Omer Giménez and Anders Jonsson. In search of the tractability boundary of planning problems, 2008.

  • Omer Giménez and Marc Noy. Asymptotic enumeration and limit laws of planar graphs, 2008. In press.

  • J. Júlvez. Polynomial throughput bounds for equal conflict petri nets with multi-guarded transitions, 2008.

  • T. Kam, M. Kishinevsky, J. Cortadella, and M. Galceran-Oms. Correct-by-construction microarchitectural pipelining, 2008.

  • Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Efficient conflict detection in graph transformation systems by essential critical pairs, 2008.

  • Leen Lambers, Hartmut Ehrig, Ulrike Prange, and Fernando Orejas. Embedding and confluence of graph transformations with negative application conditions, 2008.

  • Antoni Lozano, Ron Pinter, Oleg Rokhlenko, Gabriel Valiente, and Michal Ziv-Ukelson. Seeded tree alignment, 2008.

  • Paqui Lucio, Fernando Orejas, Edelmira Pasarella, and Elvira Pino. A functorial framework for constraint normal logic programming, 2008.

  • Elitza Maneva and Alistair Sinclair. On the satisfiability threshold and clustering of solutions of random 3-SAT formulas, 2008.

  • Conrado Martínez, Lucia Moura, Daniel Panario, and Brett Stevens. Algorithms to locate errors using covering arrays, 2008.

  • Conrado Martínez, Alois Panholzer, and Helmut Prodinger. Generating random derangements, 2008.

  • X. Molinero. Generació ordenada d’estructures combinatòries, 2008.

  • Fernando Orejas. Attributed graph constraints, 2008.

  • Fernando Orejas and Sonia Pérez. Architectural connectors for sequence diagrams, 2008.

  • Fernando Orejas, Hartmut Ehrig, and Ulrike Prange. A logic of graph constraints, 2008.

  • Michael Sammeth, Gabriel Valiente, and Roderic Guigó. Bubbles: Alternative splicing events of arbitrary dimension in splicing graphs, 2008.

  • Maria J. Serna. Parallel algorithms for two processors precedence constraint scheduling, 2008.

  • Maria Serna and Fatos Xhafa. Parallel approximation to high multiplicity scheduling problems via smooth multi-valued quadratic programming, 2008.

  • J. Stewart, A., Clint, M., Harmer, T., Kilpatrick, P., Perrott, R., Gabarró. Assessing the reliability and cost of web and grid orchestrations, 2008.

  • T. Treangen and X. Messeguer. Gapped extension for local multiple alignment of interspersed DNA repeats, 2008.

  • T. Treangen and X. Messeguer. Novel computational methods for large scale genome comparison, 2008.

  • A. Ziyatdinov, D. Bañeres, and J. Cortadella. Multi-clustering net model for placement algorithms, 2008.

  • Mathematical foundations of computer science 2007, 32nd international symposium, MFCS 2007, cesky krumlov, czech republic, august 26-31, 2007, proceedings, 2007.

  • Hybrid metaheuristics: Fourth international workshop, HM 2007, 2007.

  • Carme Àlvarez, Rafel Cases, Josep Díaz, Jordi Petit, and Maria Serna. Communication tree problems, 2007.

  • A. Atserias. Conjunctive query evaluation by search-tree revisited, 2007.

  • A. Atserias, A. Bulatov, and V. Dalmau. On the power of k-consistency, 2007.

  • A. Atserias, A. Bulatov, and A. Dawar. Affine systems of equations and counting infinitary logic, 2007.

  • D. Bañeres, J. Cortadella, and M. Kishinevsky. Layout-aware gate duplication and buffer insertion, 2007.

  • J. Bautista, C. Blum, and J. Pereira. Equilibrado de Líneas de montaje mediante Beam ACO, 2007. In press.

  • R. Guigó E. Blanco and X. Messeguer. Multiple non-collinear TF-maps alignments of promoter regions, 2007.

  • M. Blesa and C. Blum. Handbook of approximation algorithms and metaheuristics, 2007.

  • M. J. Blesa and C. Blum. Finding edge-disjoint paths in networks by means of artificial ant colonies, 2007.

  • C. Blum. Iterated local search and constructive heuristics for error correcting code design, 2007. Invited paper for the inaugural issue.

  • C. Blum. Revisiting dynamic programming for finding optimal subtrees in trees, 2007.

  • C. Blum and M. Blesa. Probabilistic Beam Search for the Longest Common Subsequence Problem, 2007. © LNCS, Springer-Verlag.

  • C. Blum, C. Cotta, A. J. Fernández, and J. E. Gallardo. A probabilistic beam search algorithm for the shortest common supersequence problem, 2007. To appear.

  • Manuel Bodirsky, Omer Giménez, Mihyun Kang, and Marc Noy. Enumeration and limit laws for series-parallel graphs, 2007.

  • Joseph E. Bonin and Omer Giménez. Multi-path matroids, 2007.

  • D. Bufistov, J. Cortadella, M. Kishinevsky, and S. Sapatnekar. A general model for performance optimization of sequential systems, 2007.

  • Hubie Chen and Omer Giménez. Act local, think global: Width notions for tractable planning, 2007.

  • Robert Clarisó and Jordi Cortadella. The octahedron abstract domain, 2007.

  • Robert Clarisó and Jordi Cortadella. Verification of concurrent systems with parametric delays using octahedra, 2007.

  • José C. Clemente, Kenji Satou, and Gabriel Valiente. Phylogenetic reconstruction from non-genomic data, 2007.

  • J. Cortadella and M. Kishinevsky. Synchronous elastic circuits with early evaluation and token counterflow, 2007.

  • X Messeguer D. Farré, N. Bellora, L. Mularoni and M. Albà. Housekeeping genes tend to show reduced upstream sequence conservation, 2007.

  • J. Díaz. 2006 Nevanlinna Prize: Jon Kleinberg, 2007.

  • Josep Díaz and Marcin Kaminski. MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs, 2007.

  • Josep Díaz, Dieter Mitsche, and Xavier Pérez. Sharp threshold for Hamiltonicity of random geometric graphs, 2007.

  • Josep Díaz, Maria J. Serna, and Dimitrios M. Thilikos. Complexity issues on bounded restrictive H-coloring, 2007.

  • Josep Díaz, Maria J. Serna, and Nicholas C. Wormald. Bounds on the bisection width for random d -regular graphs, 2007.

  • Amalia Duch and Conrado Martínez. On the average cost of insertions on random relaxed k-d trees, 2007.

  • Liliana Félix and Gabriel Valiente. Validation of metabolic pathway databases based on chemical substructure search, 2007.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Reconstructing metabolic pathways by bidirectional chemical search, 2007.

  • Paolo Ferragina, Raffaele Giancarlo, Valentina Greco, Giovanni Manzini, and Gabriel Valiente. Compression-based classification of biological sequences and structures via the Universal Similarity Metric: Experimental assessment, 2007.

  • J. Freixas and X. Molinero. The donation paradox of power indices: classification and counting, 2007.

  • J. Freixas and X. Molinero. On the frequency of the donation paradox for power indices in weighted simple games, 2007.

  • J. Freixas and X. Molinero. Some tests to count paradoxes of power indices, 2007.

  • J. Freixas and X. Molinero. Weighted games without a unique minimal representation in integers, 2007. Submitted.

  • J. Freixas, X. Molinero, and S. Roura. Minimal representations for majority games, 2007. Third Conference on Computability in Europe CiE 2007, Siena, Italy, June 2007, Proceedings.

  • L. Frias. Algorithm Engineering: Efficient Data Structure Libraries, 2007.

  • Joaquim Gabarró, Alina García, and Maria J. Serna. On the complexity of game isomorphism, 2007.

  • Joaquim Gabarró, Isabel Vallejo, and Fatos Xhafa. On using partial orders for web application design, 2007.

  • Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, Marisa Navarro, and Fernando Orejas. A cut-free and invariant-free sequent calculus for PLTL, 2007.

  • David Gilbert, Francesc Rosselló, Gabriel Valiente, and Mallika Veeramalai. Alignment-free comparison of TOPS strings, 2007.

  • Omer Giménez and Anders Jonsson. On the hardness of planning problems with simple causal graphs, 2007.

  • Omer Giménez, Marc Noy, and Juan José Rué. Graph classes with given 3-connected components: asymptotic counting and critical phenomena, 2007. European Conference on Combinatorics, Graph Theory and Applications, European Conference on Combinatorics, Graph Theory and Applications.

  • K. Gorg^onio, J. Cortadella, and F. Xia. A compositional method for the synthesis of asynchronous communication mechanisms, 2007.

  • Kyller Costa Gorg^onio, Jordi Cortadella, Fei Xia, and Alexandre Yakovlev. Automating synthesis of asynchronous communication mechanisms, 2007.

  • Markus Klein, Julia Padberg, and Fernando Orejas. Towards multiple access in generic component architectures, 2007.

  • Antoni Lozano, Ron Pinter, Oleg Rokhlenko, Gabriel Valiente, and Michal Ziv-Ukelson. Seeded tree alignment and planar tanglegram layout, 2007.

  • Paqui Lucio and Fernando Orejas. Preface, 2007.

  • F. Luna, C. Blum, E. Alba, and A. J. Nebro. ACO vs EAs for solving a real-world frequency assignment problem in GSM networks, 2007. In press.

  • Maria J. Serna. Random models for geometric graphs (abstract), 2007.

  • K. Socha and C. Blum. An ant colony optimization algorithm for continuous optimization: Application to feed-forward neural network training, 2007.

  • J. A. Subirana and X. Messeguer. Structural families of genomic microsatellites, 2007.

  • Alexander Taubin, Jordi Cortadella, Luciano Lavagno, Alex Kondratyev, and Ad Peeters. Design automation of real life asynchronous devices and systems, 2007.

  • Ryuhei Uehara and Gabriel Valiente. Linear structure of bipartite permutation graphs and the longest path problem, 2007.

  • Gabriel Valiente. Efficient algorithms on trees and graphs with unique node labels, 2007.

  • Special issue on ``Hybrid Metaheuristics'', 2006.

  • Hybrid metaheuristics: Third international workshop, HM 2006, gran canaria, spain, october 13-15, 2006, 2006.

  • Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2006, 2006.

  • Experimental algorithms, 5th international workshop, WEA 2006, cala galdana, menorca, spain, may 24-27, 2006, proceedings, 2006.

  • Approximation, randomization, and combinatorial optimization. algorithms and techniques, 9th international workshop on approximation algorithms for combinatorial optimization problems, APPROX 2006 and 10th international workshop on randomization and computation, RANDOM 2006, barcelona, spain, august 28-30 2006, proceedings, 2006.

  • Approximation, randomization and combinatorial optimization, 2006. Algorithms and techniques.

  • Proc. 17th annual symposium on combinatorial pattern matching, 2006.

  • N. T. Perna A.E. Darling, T. Treangen, L. Zhang, C. Kuiken, X. Messeguer. Procastination leads to efficient filtration for local multiple alignment, 2006.

  • E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Díaz, I. Dorta, J. Gabarró, C. León, G. Luque, J. Petit, C. Rodrí­guez, A. Rojas, and F. Xhafa. Efficient parallel LAN/WAN algorithms for optimization. the MALLBA project, 2006.

  • Tetsuo Asano, Patricia Evans, Ryuhei Uehara, and Gabriel Valiente. Site consistency in phylogenetic networks with recombination, 2006.

  • A. Atserias. Distinguishing SAT from Polynomial-Size Circuits, through Black-Box Queries, 2006.

  • A. Atserias, A. Dawar, and Ph. G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries, 2006.

  • D. Bañeres, J. Cortadella, and M. Kishinevsky. Dominator-based partitioning for delay optimization, 2006.

  • X. Messeguer Blanco E, Farré D, Albà MM and Guigó R. ABS: a database of annotated regulatory binding sites from orthologous promoters, 2006.

  • M. Blesa and C. Blum. A nature-inspired algorithm for the disjoint paths problem, 2006. In conjunction with The 20th IEEE/ACM International Parallel and Distributed Processing (IPDPS). copyright IEEE. CD-ROM INSPEC Accession Number:8969613.

  • M. Blesa and C. Georgiou. A review on DISC 2005, the 19th international symposium on distributed computing, 2006.

  • M. Blesa, J. Petit, and F. Xhafa. Generic parallel implementations for Tabu Search, 2006.

  • C. Blum. A new hybrid evolutionary algorithm for the k-cardinality tree problem, 2006. Best paper award.

  • C. Blum and M. Yábar Vallès. Multi-level ant colony optimization for DNA sequencing by hybridization, 2006.

  • C. Blum and M. Yábar Vallès. New constructive heuristics for DNA sequencing by hybridization, 2006. To appear.

  • C. Blum, J. Bautista, and J. Pereira. Beam-ACO applied to assembly line balancing, 2006. To appear.

  • J. Carmona and J. Cortadella. State encoding of large asynchronous controllers, 2006.

  • J. Carmona, J. Cortadella, Y. Takada, and F. Peper. From molecular interactions to gates: a systematic approach, 2006.

  • Josep Carmona, José M. Colom, Jordi Cortadella, and Fernando García-Vallés. Synthesis of asynchronous controllers using integer linear programming, 2006.

  • Jaume Casasnovas, José C. Clemente, Joe Miró-Julià, Francesc Rosselló, Kenji Satou, and Gabriel Valiente. Fuzzy clustering improves phylogenetic relationships reconstruction from metabolic pathways, 2006.

  • José C. Clemente, Kenji Satou, and Gabriel Valiente. Finding conserved and non-conserved reactions using a metabolic pathway alignment algorithm, 2006.

  • J. Cortadella, M. Kishinevsky, and B. Grundmann. Specification and design of synchronous elastic circuits, 2006.

  • J. Cortadella, M. Kishinevsky, and B. Grundmann. Synthesis of synchronous elastic architectures, 2006.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, and Christos Sotiriou. Desynchronization: Synthesis of asynchronous circuits from synchronous specifications, 2006.

  • Josep Díaz and Dimitrios M. Thilikos. Fast FPT-algorithms for cleaning grids, 2006.

  • Josep Díaz and Dimitrios M. Thilikos. Fast FPT-algorithms for cleaning grids, 2006.

  • Josep Diaz, Fabrizio Grandoni, and Alberto Marchetti Spaccamela. Balanced cut approximation in random geometric graphs, 2006.

  • Josep Díaz, Jordi Petit, and Dimitrios M. Thilikos. Kernels for the vertex cover problem on the preferred attachment model, 2006.

  • Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. Efficient algorithms for parameterized H-colorings, 2006.

  • Hartmut Ehrig, Fernando Orejas, and Ulrike Prange. Categorical foundations of distributed graph transformation, 2006.

  • Gregor Engels, Fernando Orejas, and Francesco Parisi-Presicce. Special issue with selected papers from ICGT 2004, 2006.

  • Fedor V. Fomin and Dimitrios M. Thilikos. New upper bounds on the decomposability of planar graphs, 2006.

  • X. Franch, J. Marco, X. Molinero, J. Petit, and F. Xhafa. Fonaments de programació. problemes resolts de C++, 2006. URL: http://www.edicionsupc.es/virtuals/vindex.htm.

  • X. Franch, J. Marco, X. Molinero, J. Petit, and F. Xhafa. Introducció a la programació, 2006. URL: http://www.edicionsupc.es/virtuals/vindex.htm.

  • J. Freixas and X. Molinero. Minimal integer representation for weighted voting systems. international workshop and conference applied mathematical programming and modelling (apmod2006); june 18-21, madrid (spain), 2006.

  • J. Freixas and X. Molinero. Some advances in the theory of voting systems based on experimental algorithms, 2006.

  • J. Freixas and X. Molinero. Some advances in the theory of voting systems based on experimental algorithms, 2006.

  • L. Frias, J. Petit, and S. Roura. Lists Revisited: Cache Conscious STL Lists, 2006.

  • Omer Giménez and Marc Noy. On the complexity of computing the Tutte polynomial of bicircular matroids, 2006.

  • Omer Giménez, Petr Hlineny, and Marc Noy. Computing the Tutte polynomial on graphs of bounded clique-width, 2006.

  • R. Guigó, E. Blanco, X. Messeguer, and TF. Smith. Transcription factor map alignment of promoter regions, 2006.

  • J. Júlvez, J. Cortadella, and M. Kishinevsky. Performance analysis of concurrent systems with early evaluation, 2006.

  • S. Krstic, J. Cortadella, M. Kishinevsky, and J. O'Leary. Synchronous elastic networks, 2006.

  • S. Krstic, J. Cortadella, M. Kishinevsky, and J. O'Leary. Synchronous elastic networks, 2006.

  • Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Conflict detection for graph transformation with negative application conditions, 2006.

  • Leen Lambers, Hartmut Ehrig, and Fernando Orejas. Efficient detection of conflicts in graph-based model transformation, 2006.

  • G. Leguizamón, C. Blum, and E. Alba. Approximation algorithms and metaheuristics, 2006. In press.

  • Mercè Llabrés, Jairo Rocha, Francesc Rosselló, and Gabriel Valiente. On the ancestral compatibility of two phylogenetic trees with nested taxa, 2006.

  • Paqui Lucio, Fernando Orejas, Edelmira Pasarella, and Elvira Pino. A functorial framework for constraint normal logic programming, 2006.

  • C. Martínez, X. Molinero, and Nicolad M. Thiéry. Generació ordenada de classes d’estructures combinatòries, 2006.

  • Fernando Orejas. Thirty years of algebraic specification, 2006.

  • Francesc Rosselló and Gabriel Valiente. An algebraic view of the relation between largest common subtrees and smallest common supertrees, 2006.

  • Alan Stewart, Joaquim Gabarró, Maurice Clint, Terence J. Harmer, Peter Kilpatrick, and Ronald H. Perrott. Managing grid computations: An ORC-based approach, 2006.

  • Treangen T and Messeguer X. M-GCAT: Interactively and efficiently constructing large-scale multiple genome comparison frameworks in closely related species, 2006.

  • Gabriel Valiente. Assessing clustering results with reference taxonomies, 2006.

  • F. Xhafa, P.-P. Vázquez, J. Marco, X. Molinero, and A. Martín. Programación en C++ para ingenieros, 2006. URL: http://www.thomsonparaninfo.com/.

  • Proceedings of hybrid metaheuristics: Second international workshop, HM 2005, barcelona, spain, august 29-30, 2005, 2005.

  • Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005, 2005.

  • Special issue on ``Swarm Intelligence'', 2005. In press.

  • C. Àlvarez, J. Gabarró, and M. Serna. Polynomial space suffices for deciding nash equilibria properties for extensive games with large trees, ., 2005.

  • C. Àlvarez, J. Gabarró, and M. Serna. Pure nash equilibria in games with a large number of actions., 2005.

  • A. Atserias. Conjunctive query evaluation by search tree revisited, 2005. Best newcomer paper award.

  • A. Atserias. Definability on a Random 3-CNF Formula, 2005.

  • A. Atserias. On digraph coloring problems and treewidth duality, 2005.

  • A. Atserias, A. Dawar, and M. Grohe. Preservation under extensions on well-behaved finite structures, 2005.

  • M. Blesa. Deciding stability in packet-switched FIFO networks under the Adversarial Queuing model in polynomial time, 2005. © LNCS, Springer-Verlag.

  • M. Blesa, D. Calzada, A. Fernández, L. López, A. L. Martínez, A. Santos, and M. Serna. Adversarial queueing model for continuous network dynamics, 2005. © LNCS, Springer-Verlag.

  • C. Blum. Ant colony optimization: Introduction and recent trends, 2005.

  • C. Blum. Review of the book "Ant Colony Optimization" by M. Dorigo and T. Stützle, 2005.

  • C. Blum and M. Blesa. Combining Ant Colony Optimization with Dynamic Programming for solving the k-cardinality tree problem, 2005.

  • C. Blum and M. Blesa. New metaheuristic approaches for the edge-weighted k-cardinality tree problem, 2005.

  • C. Blum and M. Blesa. Optimització mitjançant colònies de formigues artificials, 2005. Review on the conference of M. Dorigo at the CosmoCaixa Museum in Barcelona. In Catalan.

  • C. Blum and M. Dorigo. Search bias in ant colony optimization: On the role of competition-balanced systems, 2005.

  • C. Blum and K. Socha. Training feed-forward neural networks with ant colony optimization: An application to pattern classification, 2005. To appear.

  • C. Blum, M. Blesa, and A. Roli. Combining ILS with an effective constructive heuristic for the application to error correcting code design, 2005.

  • C. Blum, A. Roli, and E. Alba. Parallel metaheuristics: A new class of algorithms, 2005.

  • Manuel Bodirsky, Omer Giménez, Mihyun Kang, and Marc Noy. On the number of series parallel and outerplanar graphs, 2005.

  • R. Clarisó and J. Cortadella. Verification of concurrent systems with parametric delays using octahedra, 2005.

  • R. Clarisó, E. Rodríguez-Carbonell, and J. Cortadella. Derivation of non-structural invariants of petri nets using abstract interpretation, 2005.

  • Jose Clemente, Kenji Satou, and Gabriel Valiente. Reconstruction of phylogenetic relationships from metabolic pathways based on the enzyme hierarchy and the gene ontology, 2005.

  • J. Cortadella, K. Gorgônio, F. Xia, and A. Yakovlev. Automatic synthesis of asynchronous coomunication mechanisms, 2005.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, and Yosinori Watanabe. Quasi-static scheduling of independent tasks for reactive systems, 2005.

  • Josep Díaz and Juhani Karhumaki. Preface [Automata, languages and programming: algorithms and complexity (ICALP-A 2004)], 2005. Held in Turku, July, 2004.

  • J. Díaz, G. Grammatikopoulos, A. C. Kaporis, L. M. Kirousis, X. Pérez, and D. G. Sotiropoulos. 5-regular graphs are 3-colorable with positive probability, 2005.

  • J. Diaz, M. Serna, and D. M. Thilikós. The restrictive H-coloring problem, 2005.

  • Josep Díaz, Xavier Pérez, Maria J. Serna, and Nicholas C. Wormald. Connectivity for wireless agents moving on a cycle or grid, 2005.

  • Josep Díaz, Xavier Pérez, Maria J. Serna, and Nicholas C. Wormald. Connectivity for wireless agents moving on a cycle or grid, 2005.

  • Josep Díaz, Maria Serna, and Dimitrios M. Thilikos. The restrictive H-coloring problem, 2005.

  • X. Messeguer D. Dominguez-Sal and J. A. Subirana. Fibrehelix: A programe for calculating the X ray diffraction pattern of macromolecules with helical symmetry: Aplications to DNA coiled-coils, 2005.

  • M. Dorigo and C. Blum. Ant colony optimization theory: A survey, 2005.

  • Amalia Duch and Conrado Martínez. Improving the performance of multidimensional search using fingers, 2005.

  • X. Messeguer E. Blanco, D. Farre, M Mar Alba and R. Guigo. ABS: a database of annotated regulatory binding sites from orthologous promoters, 2005.

  • Hartmut Ehrig, Benjamin Braatz, Markus Klein, Fernando Orejas, Sonia Pérez, and Elvira Pino. Object-oriented connector-component architectures, 2005.

  • Liliana Félix and Gabriel Valiente. Efficient validation of metabolic pathway databases, 2005.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Optimal artificial chemistries and metabolic pathways, 2005.

  • Philippe Flajolet, Joaquim Gabarró, and Helmut Pekari. Analytic urns, 2005.

  • L. Frias. STL maps using LBSTs, 2005.

  • Omer Giménez and Marc Noy. The number of planar graphs and properties of random planar graphs, 2005.

  • Omer Giménez, Anna de Mier, and Marc Noy. On the number of bases of bicircular matroids, 2005.

  • Omer Giménez, Petr Hlineny, and Marc Noy. Computing the Tutte polynomial on graphs of bounded clique-width, 2005.

  • C. Martínez and X. Molinero. Efficient iteration in admissible combinatorial classes, 2005.

  • D. Merkle and C. Blum. Swarm intelligence -- An optimization-based introduction, 2005.

  • X. Molinero. Ordered generation of classes of combinatorial structures, 2005.

  • Fernando Orejas and Sonia Pérez. Towards architectural connectors for UML, 2005.

  • Fernando Orejas and Jan van Leeuwen. Preface: Automata, languages and programming, 2005.

  • Roderic D. M. Page and Gabriel Valiente. An edit script for taxonomic classifications, 2005.

  • Edelmira Pasarella, Fernando Orejas, Elvira Pino, and Marisa Navarro. A transformational semantics of static embedded implications of normal logic programs, 2005.

  • Hoan Pham, Dang Hung Tran, Tu Bao Ho, Kenji Satou, and Gabriel Valiente. Qualitatively predicting acetylation and methylation areas in DNA sequences, 2005.

  • E. Rodríguez-Carbonell and J. Cortadella. Inference of numerical relations from digital circuits. Extended abstract of the presentation at the First International Workshop on Numerical & Symbolic Abstract Domains (NSAD), 2005.

  • A. Roli, M. Blesa, and C. Blum. Random walk and parallelism in local search, 2005.

  • Francesc Rosselló and Gabriel Valiente. Chemical graphs, chemical reaction graphs, and chemical graph transformation, 2005.

  • Francesc Rosselló and Gabriel Valiente. Graph transformation in molecular biology, 2005.

  • Maria Serna and Dimitrios M. Thilikos. Parameterized complexity for graph layout problems, 2005.

  • Maria Serna, Luca Trevisan, and Fatos Xhafa. The approximability of non-Boolean satisfiability problems and restricted integer programming, 2005.

  • Maria J. Serna, Luca Trevisan, and Fatos Xhafa. The approximability of non-boolean satisfiability problems and restricted integer programming, 2005.

  • K. Socha and C. Blum. Metaheuristic procedures for training neural networks, 2005. To appear.

  • D. M. Thilikos, M. J. Serna, and H. Bodlaender. Cutwidth I: A constructive linear time algorithm for cutwidth, 2005.

  • Dimitrios M. Thilikos, Maria Serna, and Hans L. Bodlaender. Cutwidth. II. Algorithms for partial w-trees of bounded degree, 2005.

  • Nicolas M. Thiéry, Florent Hivert, François Descouens, Teresa Gomez-Diaz, Jean-Christophe Novelli, Éric Laugerotte, Houda Abbad, Patrick Lemeur, Christophe Carré, Frédéric Chapoton, Janvier Nzeutchap, and Xavier Molinero. MuPAD-combinat, 2005.

  • Gabriel Valiente. Constrained tree inclusion, 2005.

  • Gabriel Valiente. A fast algorithmic technique for comparing large phylogenetic trees, 2005.

  • C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. Adversarial models for priority-based networks, 2005.

  • Proc. 5th annual spanish bioinformatics conference, 2004. 214 pages.

  • Applications and Theory of Petri Nets 2004, 2004.

  • C. Àlvarez and M. Serna. The proper interval colored graph problem for caterpillar trees (extended abstract), 2004.

  • Javier Álvez, Paqui Lucio, and Fernando Orejas. Constructive negation by bottom-up computation of literal answers, 2004.

  • A. Atserias. Notions of Average-Case Complexity for Random 3-SAT, 2004.

  • A. Atserias. On sufficient conditions for unsatisfiability of random formulas, 2004.

  • A. Atserias and M. L. Bonet. On the automatizability of resolution and related propositional proof systems, 2004.

  • A. Atserias, A. Dawar, and Ph. G. Kolaitis. On preservation under homomorphisms and unions of conjunctive queries, 2004.

  • A. Atserias, Ph. G. Kolaitis, and M. Y. Vardi. Constraint propagation as a proof system, 2004.

  • D. Bañeres, J. Cortadella, and M. Kishinevsky. A recursive paradigm to solve boolean relations, 2004. Best paper award.

  • M. Blesa. On the use of topology extensions for provoking instability in communication network, 2004.

  • M. Blesa and C. Blum. Ant colony optimization for the maximum edge-disjoint paths problem, 2004.

  • M. Blesa and F. Xhafa. Using parallelism in experimenting and fine tuning of parameters for metaheuristics, 2004.

  • I. Blunno, J. Cortadella, A. Kondratyev, L. Lavagno, K. Lwin, and C. Sotiriou. Handshake protocols for de-synchronization, 2004. Best paper award.

  • H. L. Bodlaender and D. M. Thilikós. Computing small search numbers in lineartime, 2004.

  • J. Carmona. Structural Methods for the Synthesis of Well-Formed Concurrent Specifications, 2004.

  • J. Carmona, J. Cortadella, V. Khomenko, and A. Yakovlev. Synthesis of asynchronous hardware from Petri nets, 2004.

  • R. Clarisó and J. Cortadella. Verification of timed circuits with symbolic delays, 2004.

  • Robert Clarisó and Jordi Cortadella. The octahedron abstract domain, 2004.

  • J. Cortadella, A. Kondratyev, L. Lavagno, K. Lwin, and C. Sotiriou. From synchronous to asynchronous: An automatic approach, 2004.

  • J. Cortadella, A. Kondratyev, L. Lavagno, and C. Sotiriou. Coping with the variability of combinational logic delays, 2004.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Alexander Taubin, and Yosinori Watanabe. Quasi-static scheduling for concurrent architectures, 2004.

  • E. D. Demaine, F. V. Fomin, M. Hajiaghayi, and D. M. Thilikós. Subexponential parameterized algorithms on graphs of bounded genus and H-minor-free graphs, 2004.

  • E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Bidimensional parameters and local treewidth, 2004. To appear.

  • E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Bidimensional parameters and local treewidth, 2004.

  • E. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs, 2004. To appear.

  • E. D. Demaine, M. Hajiaghayi, and D. M. Thilikós. Exponential speedup of fixed parameter algorithms on K3,3-minor-free or K5-minor-free graphs, 2004. To appear.

  • E. D. Demaine, N. Nishimura, M. Hajiaghayi, P. Ragde, and D. M. Thilikós. Approximation algorithms for classes of graphs excluding single-crossing graphs as minors, 2004. To appear.

  • J. Diaz, M. Serna, and D. M. Thilikós. Fixed parameter algorithms for counting and deciding bounded restrictive H-coloring, 2004.

  • J. Diaz, S. Serna, and N. C. Wormald. Computation of the bisection width for random d-regular graphs, 2004.

  • Amalia Duch. Design and analysis of multidimensional data structures, 2004.

  • Amalia Duch. Randomized insertion and deletion in point quad trees., 2004.

  • Amalia Duch and Conrado Martínez. Fingered multidimensional search trees., 2004.

  • J. Díaz, M. Serna, and D. M. Thilikos. Recent results on parameterized H-colorings, 2004.

  • J. Petit E. Levy, G. Louchard. A distributed algorithm to find hamiltonian cycles in Gnp random graphs, 2004.

  • Hartmut Ehrig, Fernando Orejas, Benjamin Braatz, Markus Klein, and Martti Piirainen. A component framework for system modeling based on high-level replacement systems, 2004.

  • Hartmut Ehrig, Julia Padberg, Benjamin Braatz, Markus Klein, Fernando Orejas, Sonia Pérez, and Elvira Pino. A generic framework for connector architectures based on components and transformations, 2004.

  • Domènec Farré, David García, M. Mar Albà, and Xavier Messeguer. Prediction of transcription factor binding sites with PROMOv.3: Improving the specificity of weight matrices and the searching process., 2004.

  • Fedor V. Fomin and Dimitrios M. Thilikos. A 3-approximation for the pathwidth of Halin graphs, 2004.

  • F. V. Fomin and D. M. Thilikós. A 3-approximation for the pathwidth of halin graphs, 2004. To appear in: Electronic Notes on Discrete Mathematics, 2004.

  • F. V. Fomin and D. M. Thilikós. A simple and fast approach for solving problems on planar graphs, 2004.

  • F. V. Fomin, P. Fraigniaud, and D. M. Thilikós. The price of connectedness in expansions, 2004. Submitted.

  • Liliana Félix, Francesc Rosselló, and Gabriel Valiente. Artificial chemistries and metabolic pathways, 2004.

  • Omer Giménez and Marc Noy. Estimating the growth constant of labelled planar graphs, 2004.

  • Mercè Llabrés, Francesc Rosselló, and Gabriel Valiente. On supertrees of phylogenetic trees, 2004.

  • Antoni Lozano and Gabriel Valiente. On the maximum common embedded subtree problem for ordered trees, 2004.

  • C. Martínez and X. Molinero. An efficient generic algorithm for the generation of unlabelled cycles, 2004.

  • C. Martínez and X. Molinero. An experimental study of unranking algorithms, 2004.

  • Conrado Martinez, Daniel Panario, and Alfredo Viola. Adaptive sampling for quickselect, 2004.

  • Conrado Martínez and Xavier Molinero. Decomposable objects, counting, unranking, random, and exhaustive generation of combinatorial classes., 2004.

  • N. Modi and J. Cortadella. Boolean decomposition using two-literal divisors, 2004.

  • Nikos Mylonakis and Fernando Orejas. A distributed and mobile component system based on the ambient calculus, 2004.

  • N. Nishimura, M. R. Fellows, C. Knauer, P. Ragde, F. A. Rosamond, Thilikós, D.M., and S. Whitesides. Faster fixed-parameter tractable algorithms for matching and packing problems, 2004.

  • N. Nishimura, P. Ragde, and D. M. Thilikós. Smaller kernels for hitting set problems of constant arity, 2004.

  • Fernando Orejas and Elvira Pino. On the integration of modular heterogeneous specifications, 2004.

  • Francesc Rosselló and Gabriel Valiente. Analysis of metabolic pathways by graph transformation, 2004.

  • A. Stewart, M. Clint, and J. Gabarró. Barrier synchronization: axiomatization and relaxation, 2004.

  • Todd Treangen and Xavier Messeguer. M-GCAT: Multiple genome comparison and alignment tool., 2004.

  • Fomin F. V. and D. M. Thilikós. Fast parameterized algorithms for graphs on surfaces: Linear kernel and exponential speed-up, 2004.

  • G. Valiente. Trading uninitialized space for time, 2004.

  • Gabriel Valiente. On the algorithm of Berztiss for tree pattern matching, 2004.

  • F. Xhafa, S. Caballé, T. Daradoumis, and N. Zhou. A grid-based approach for processing group activity log files., 2004.

  • C. Àlvarez and M. Serna. The proper interval colored graph problem for caterpillar trees, 2004.

  • C. Àlvarez, M. Blesa, J. Díaz, A. Fernández, and M. Serna. The complexity of deciding stability under FFS in the adversarial model, 2004.

  • C. Àlvarez, M. Blesa, and M. Serna. A characterization of universal stability in the adversarial queueing model, 2004.

  • C. Àlvarez, M. Blesa, and M. Serna. The impact of failure management on the stability of communication networks, 2004.

  • C. Àlvarez, J. Diaz, J. Petit, J. Rolim, and M. Serna. Efficient and relliable high level communicatioon in deployed sensor networks, 2004.

  • C. Àlvarez, M. Blesa, J. Diaz, A. Fernández, and M. Serna. Adversarial models for priority-based networks, 2003.

  • A. Atserias. Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms, 2003.

  • A. Atserias and V. Dalmau. A combinatorial characterization of resolution width, 2003.

  • Ricardo A. Baeza-Yates, Joaquim Gabarró, and Xavier Messeguer. Fringe analysis of synchronized parallel insertion algorithms in 2-3 trees., 2003.

  • J. Carmona and J. Cortadella. ILP models for the synthesis of asynchronous control circuits, 2003.

  • R. Clarisó and J. Cortadella. Verification of timed circuits with symbolic delays, 2003.

  • Jordi Cortadella. Timing-driven logic bi-decomposition, 2003.

  • J. Cortadella, A. Kondratyev, L. Lavagno, and C. Sotiriou. A concurrent model for de-synchronization, 2003.

  • J. Cortadella, A. Kondratyev, L. Lavagno, and Y. Watanabe. Quasi-static scheduling for concurrent architectures, 2003.

  • J. Delgado, J. M. Pujol, and R. Sangüesa. Emergence of coordination in scale-free networks, 2003.

  • E. D. D. Demaine, F. V. Fomin, M. T. Hajiaghayi, and D. M. Thilikós. Fixed-parameter algorithms for the (k,r)-center in planar graphs and map graphs, 2003.

  • J. Díaz, N. Do, M. Serna, and N. Wormald. Bounds on the max and min bixection of random cubic and 4-regular graphs, 2003. Selected papers in honor of Lawrence Harper.

  • J. Díaz, J. Petit, and M. Serna. Evaluation of basic protocols for optical smart dust networks, 2003.

  • Hartmut Ehrig, Fernando Orejas, Benjamin Braatz, Markus Klein, and Martti Piirainen. A component framework based on high-level replacement systems, 2003.

  • Domènec Farré, Roman Roset, Mario Huerta, José E. Adsuara, Llorenç Roselló, M. Mar Albà, and Xavier Messeguer. Identification of patterns in biological sequences at the ALGGEN server: PROMO and MALGEN., 2003.

  • F. V. Fomin and D. M. Thilikós. Dominating sets and local treewidth, 2003.

  • F. V. Fomin and D. M. Thilikós. Dominating sets in planar graphs: branchwidth and exponential speed-up, 2003.

  • G. Arzhantseva, J. Díaz, J. Petit, J. Rolim and M. Serna. International workshop on ambient intelligence computing, 2003.

  • J Gabarró, A. Stewart, M. Clint, E. Boyle, and I. Vallejo. Computational models for web- and grid-based computation, 2003.

  • J. Díaz, J. Petit and M. Serna. A random graph model for optical networks of sensors, 2003.

  • H. Jung, P. Spirakis, and M. Serna. An efficient deterministic parallel algorithm for two processors precedence constraint scheduling, 2003.

  • C. Martínez and X. Molinero. Generic algorithms for the generation of combinatorial objects, 2003.

  • C. Martínez and X. Molinero. An efficient generic algorithm for the generation of unlabelled cycles, 2003.

  • C. Martínez and X. Molinero. Generic algorithms for the generation of combinatorial objects, 2003.

  • Fernando Orejas and Hartmut Ehrig. Components for algebra transformation systems, 2003.

  • J. Petit. Combining spectral sequencing and parallel simulated annealing for the MinLA problem, 2003.

  • Roman Roset, Juan A. Subirana, and Xavier Messeguer. MREPATT: detection and analysis of exact consecutive repeats in genomic sequences, 2003.

  • Julio Rozas, Juan C. Sánchez-DelBarrio, Xavier Messeguer, and Ricardo Rozas. DnaSP, DNA polymorphism analyses by the coalescent and other methods, 2003.

  • Gabriel Valiente. Constrained tree inclusion, 2003.

  • Gabriel Valiente. A new simple algorithm for the maximum-weight independent set problem on circle graphs, 2003.

  • Advances in concurrency and hardware design, 2002.

  • E. Alba, F. Almeida, M. Blesa, J. Cabeza, C. Cotta, M. Diaz, I. Dorta, J. Gabarró, C. León, J. Luna, L. Moreno, C. Pablos, J. Petit, A. Rojas, and F. Xhafa. MALLBA: A library of skeletons for combinatorial optimisation, 2002.

  • A. Atserias. Unsatisfiable random formulas are hard to certify, 2002. Kleene award for best student paper.

  • A. Atserias and M. L. Bonet. On the automatizability of resolution and related propositional proof systems, 2002.

  • A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle and random formulas beyond resolution, 2002.

  • A. Atserias, N. Galesi, and P. Pudlák. Monotone simulations of nonmonotone proofs, 2002.

  • M. J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method Based on Search Strategies and Neighborhood Partition, 2002.

  • J. Carmona and J. Cortadella. Input/output compatibility of reactive systems, 2002.

  • Josep Carmona, Jordi Cortadella, and Enric Pastor. A structural encoding technique for the synthesis of asynchronous circuits, 2002.

  • Josep Carmona, Jordi Cortadella, and Enric Pastor. Synthesis of reactive systems: Application to asynchronous circuit design, 2002.

  • R. Clarisó, J. Cortadella, A. Kondratyev, L. Lavagno, C. Passerone, and Y. Watanabe. Synthesis of embedded software for reactive systems, 2002.

  • J. Cortadella. Bi-decomposition and tree-height reduction for timing optimization, 2002.

  • Jordi Cortadella, Michael Kishinevsky, Steve M. Burns, Alex Kondratyev, Luciano Lavagno, Ken S. Stevens, Alexander Taubin, and Alexandre Yakovlev. Lazy transition systems and asynchronous circuit synthesis with relative timing assumptions, 2002.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Logic synthesis of asynchronous controllers and interfaces, 2002.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Claudio Passerone, and Yosinori Watanabe. Quasi-static scheduling of independent tasks for reactive systems, 2002.

  • A. Duch and C. Martínez. On the average performance of orthogonal range search in multidimensional data structures, 2002.

  • Amalia Duch and Conrado Martínez. On the average performance of orthogonal range search in multidimensional data structures, 2002.

  • Amalia Duch and Conrado Martínez. On the average performance of orthogonal range search in multidimensional data structures., 2002.

  • J. Díaz, N. Do, M. Serna, and N. Wormald. Bisection of random cubic graphs, 2002.

  • J. Díaz, J. Nesetril, M. Serna, and D. Thilikos. H-colorings of large degree graph, 2002.

  • J. Díaz, J. Petit, and M. Serna. A survey on graph layout problems, 2002.

  • J. Díaz, M. Serna, and D. M. Thilikos. The complexity of restrictive H-coloring, 2002.

  • J. Díaz, M. J. Serna, and D. M. Thilikos. Counting H-colorings of partial k-trees, 2002. Selected papers in honour of Maurice Nivat.

  • X. Franch and X. Molinero. Informàtica Bàsica, 2002. URL: http://www.edicionsupc.es/.

  • X. Franch, J. Marco, X. Molinero, J. Petit, and F. Xhafa. Informàtica Bàsica, 2002. URL: http://www.edicionsupc.es/.

  • Joaquim Gabarró, Alan Stewart, and Maurice Clint. Grab and Go system: a CPO approach to concurrent web and grid-based computation, 2002.

  • Javier Larrosa and Gabriel Valiente. Constraint satisfaction algorithms for graph pattern matching, 2002.

  • Conrado Martínez, Daniel Panario, and Alfredo Viola. Analysis of quickfind with small subfiles, 2002.

  • Xavier Messeguer, Ruth Escudero, Domènec Farré, Oscar Núñez, Javier Martínez, and M. Mar Albà. PROMO: detection of known transcription regulatory elements using species-tailored searches., 2002.

  • M. A. Peña, J. Cortadella, E. Pastor, and A. Smirnov. A case study for the verification of complex timed circuits: IPCMOS, 2002.

  • J. Petit. Hamiltonian cycles in faulty random geometric networks, 2002.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, Takashi Nanya, and Alexander Yakovlev. Design of asynchronous controllers with delay insensitive interface, 2002.

  • N Santiago, C Herraiz, J. R. Goñi, X Messeguer, and J. M. Casacuberta. Genome-wide analysis of the emigrant family of MITEs of arabidopsis thaliana, 2002.

  • M. Serna and F. Xhafa. Approximating scheduling unrelated parallel machines in parallel, 2002.

  • M. Serna and F. Xhafa. The parallel approximability of the false and true Gates problems for NOR-circuits, 2002.

  • Gabriel Valiente. Algorithms on trees and graphs, 2002.

  • C. Àlvarez, M. Blesa, and M. Serna. Universal stability of undirected graphs in the adversarial queueing model, 2002.

  • E. Alba, F. Almeida, M. Blesa, C. Cotta, M. Diaz, I. Dorta, J. Gabarró, J. González, C. León, L. Moreno, J. Petit, J. Roda, A. Rojas, and F. Xhafa. MALLBA: Towards a combinatorial optimization library for geographically distributed systems, 2001.

  • C. Alvarez, J. Díaz, and M. Serna. The hardness of intervalizing four colored caterpillars, 2001.

  • A. Atserias. Improved bounds on the weak pigeonhole principle and infinitely many primes from weaker axioms, 2001.

  • A. Atserias, M. L. Bonet, and J. L. Esteban. Lower bounds for the weak pigeonhole principle beyond resolution, 2001.

  • A. Atserias, N. Galesi, and R. Gavaldà. Monotone proofs of the pigeon-hole principle, 2001.

  • A. Atserias, N. Galesi, and P. Pudlák. Monotone simulations of nonmonotone proofs, 2001.

  • S. Baumer, J. L. Esteban, and J. Torán. Minimally unsatisfiable CNF formulas, 2001. Technical Contributions.

  • M. J. Blesa and F. Xhafa. A Skeleton for the Tabu Search Metaheuristic with Applications to Problems in Software Engineering, 2001.

  • M. J. Blesa, Ll. Hernàndez, and F. Xhafa. Parallel Skeletons for Tabu Search Method, 2001.

  • M. J. Blesa, P. Moscato, and F. Xhafa. A Memetic Algorithm for the Minimum Weighted k-Cardinality Tree Subgraph Problem, 2001.

  • M. J. Blesa, J. Petit, and F. Xhafa. Computación en Internet: Librería MALLBA para problemas de optimización, 2001. ISBN: 84-8033-145-3.

  • Josep Carmona, Jordi Cortadella, and Enric Pastor. A structural encoding technique for the synthesis of asynchronous circuits, 2001.

  • G. Cornetta and J. Cortadella. Asynchronous multipliers with variable-delay counters, 2001.

  • Gianluca Cornetta and Jordi Cortadella. A multi-radix approach to asynchronous division, 2001.

  • J. Díaz, D. Koukopoulos, S. E. Nikoletseas, M. Serna, P. G. Spirakis, and D. M. Thilikos. Stability and non-stability of the FIFO protocol, 2001.

  • J. Díaz, M. D. Penrose, J. Petit, and M. Serna. Approximating layout problems on random geometric graphs, 2001.

  • J. Díaz, J. Petit, M. Serna, and L. Trevisan. Approximating layout problems on random graphs, 2001.

  • J. Díaz, J. Petit, and M. J. Serna. A guide to concentration bounds, 2001.

  • J. Díaz, M. Serna, and D. M. Thilikos. Counting H-colorings of partial k-trees, 2001.

  • J. Díaz, M. Serna, and D. M. Thilikos. (H,C,K)-coloring: Fast, easy and hard cases, 2001.

  • J. L. Esteban and J. Torán. Space bounds for resolution, 2001.

  • Mirtha-Lina Fernández and Gabriel Valiente. A graph distance measure combining maximum common subgraph and minimum common supergraph, 2001.

  • Fedor V. Fomin and D. M. Thilikos. On the monotonicity of games generated by symmetric submodular functions, 2001.

  • X. Franch and X. Molinero. Informàtica Bàsica, 2001. URL: http://www.edicionsupc.es/.

  • Ricard Gavaldà and Denis Thérien. Learning expressions over monoids, 2001.

  • C. Martínez and X. Molinero. Generic algorithms for the exhaustive generation of labelled objects, 2001.

  • C. Martínez and X. Molinero. A generic approach for the unranking of labeled combinatorial classes, 2001.

  • Conrado Martínez and Salvador Roura. Optimal sampling strategies in quicksort and quickselect, 2001.

  • C. Martínez, A. Panholzer, and H. Prodinger. Partial match queries in relaxed multidimensional search trees, 2001. Average-case analysis of algorithms (Princeton, NJ, 1998).

  • X. Molinero. Iterating through labelled combinatorial structures, 2001.

  • Enric Pastor, Jordi Cortadella, and Oriol Roig. Symbolic analysis of bounded Petri nets, 2001.

  • J. Petit. Layout problems, 2001.

  • S. Roura. A new method for balancing binary search trees, 2001.

  • Salvador Roura. Digital access to comparison-based tree data structures and algorithms, 2001.

  • Salvador Roura. Improved master theorems for divide-and-conquer recurrences, 2001.

  • M. Serna and Fatos Xhafa. The parallel approximability of a subclass of quadratic programming, 2001.

  • M. Serna, C. Alvarez, R. Cases, and T. Lozano. Els límits de la computació: Indecidibilitat i NP-completessa, 2001.

  • A. Stewart, M. Clint, J. Gabarró, and M. Serna. Towards formally refining BSP barriers into explicit two-sided communications, 2001.

  • D. M. Thilikos, M. J. Serna, and Hans L. Bodlaender. A polynomial time algorithm for the cutwidth of bounded degree graphs with small treewidth, 2001.

  • Gabriel Valiente. An efficient bottom-up distance between trees, 2001.

  • Gabriel Valiente. A general method for graph isomorphism, 2001.

  • C. Alvarez and R. Greenlaw. A compendium of problems complete for symmetric logarithmic space, 2000.

  • C. Alvarez, R. Cases, J. Díaz, J. Petit, and M. Serna. Routing trees for random graphs, 2000.

  • C. Alvarez, J. Díaz, and M. J. Serna. Modelos de grafos para la web, 2000.

  • V. Arvind, R. Beigel, and A. Lozano. The complexity of modular graph automorphism, 2000.

  • A. Atserias. The descriptive complexity of the fixed-points of bounded formulas, 2000.

  • A. Atserias, N. Galesi, and R. Gavaldà. Monotone proofs of the pigeon hole principle, 2000.

  • Ricardo Baeza-Yates and Gabriel Valiente. An image similarity measure based on graph matching, 2000.

  • M. J. Blesa and F. Xhafa. A C++ Implementation of Tabu Search for k-Cardinality Tree Problem based on Generic Programming and Component Reuse, 2000.

  • Jordi Cortadella and Gabriel Valiente. A relational view of subgraph isomorphism, 2000.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Hardware and Petri nets: Application to asynchronous circuit design, 2000.

  • Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Marc Massot, Sandra Moral, Claudio Passerone, Yosinori Watanabe, and Alberto Sangiovanni-Vincentelli. Task generation and compile-time scheduling for mixed data-control embedded software, 2000.

  • N. D. Dendris, L. M. Kirousis, Y. C. Stamatiou, and D. M. Thilikos. On parallel partial solutions and approximation schemes for local consistency in networks of constraints, 2000.

  • J. Diaz, J. Petit, and M. Serna. Faulty random geometric networks, 2000.

  • S. Diaz, J. L. Esteban, and M. Ogihara. A DNA-based random walk method for solving k-SAT, 2000.

  • J. Díaz, M. D. Penrose, J. Petit, and M. Serna. Convergence theorems for some layout measures on random lattice and random geometric graphs, 2000.

  • Hans-Jörg Kreowski and Gabriel Valiente. Redundancy and subsumption in high-level replacement systems, 2000.

  • C. Martínez and X. Molinero. Unranking of labelled combinatorial structures, 2000.

  • Conrado Martínez and Xavier Molinero. Ordered generation of combinatorial structures., 2000.

  • C. Martínez and S. Roura. On the competitiveness of the move-to-front rule, 2000.

  • N. Nishimura, P. Ragde, and D. M. Thilikos. On graph powers for leaf-labeled trees, 2000.

  • Marco A. Peña, Jordi Cortadella, Alex Kondratyev, and Enric Pastor. Formal verification of safety properties in timed circuits, 2000.

  • D. M. Thilikos. Algorithms and obstructions for linear-width and related search parameters, 2000.

  • D. M. Thilikos, M. J. Serna, and Hans L. Bodlaender. Constructive linear time algorithms for small cutwidth and carving-width, 2000.

  • A. Atserias and Ph. G. Kolaitis. First-order logic vs. fixed-point logic in finite set theory, 1999.

  • H. L. Bodlaender and D. M. Thilikos. Graphs with branchwidth at most three, 1999.

  • Peter Burmeister, Miquel Monserrat, Francesc Rosselló, and Gabriel Valiente. Algebraic transformation of unary partial algebras II: Single-pushout approach, 1999.

  • Gianluca Cornetta and Jordi Cortadella. A radix-16 SRT division unit with speculation of quotient digits, 1999.

  • Jordi Cortadella, Michael Kishinevsky, Steven M. Burns, and Ken Stevens. Synthesis of asynchronous control circuits with automatically generated timing assumptions, 1999.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Enric Pastor, and Alexandre Yakovlev. Decomposition and technology mapping of speed-independent circuits using Boolean relations, 1999.

  • J. Díaz, M. D. Penrose, J. Petit, and M. Serna. Layout problems on lattice graphs, 1999.

  • J. Díaz, M. D. Penrose, J. Petit, and M. J. Serna. Linear orderings of random geometric graphs., 1999.

  • J. Díaz, M. Serna, and P. Spirakis. Linear and non-linear systems: a survey, 1999.

  • J. L. Esteban and J. Torán. Space bounds for resolution, 1999.

  • Alex Kondratyev, Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexander Yakovlev. Automatic synthesis and optimization of partially specified asynchronous systems, 1999.

  • Alex Kondratyev, Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexander Yakovlev. Logic decomposition of speed-independent circuits, 1999.

  • N. Nishimura, P. Ragde, and D. M. Thilikos. Finding smallest supertrees under minor containment, 1999.

  • Enric Pastor, Jordi Cortadella, and Marco A. Peña. Structural Methods to Improve the Symbolic Analysis of Petri Nets, 1999.

  • S. Roura. Improving mergesort for linked lists, 1999.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, and Alexander Yakovlev. Bridging modularity and optimality: delay-insensitive interfacing in asynchronous circuits synthesis, 1999.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, and Alexander Yakovlev. What is the cost of delay insensitivity?, 1999.

  • Hiroshi Saito, Alex Kondratyev, Jordi Cortadella, Luciano Lavagno, and Alexander Yakovlev. What is the cost of delay insensitivity?, 1999.

  • Fermín Sánchez and Jordi Cortadella. Optimal exploration of the unrolling degree for software pipelining, 1999.

  • M. Serna and Fatos Xhafa. On the average case complexity of some P-complete problems, 1999.

  • Ken Stevens, Shai Rotem, Steven M. Burns, Jordi Cortadella, Ran Ginosar, Michael Kishinevsky, and Marly Roncken. CAD directions for high performance asynchronous circuits, 1999.

  • A. Taubin, A. Kondratyev, J. Cortadella, and L. Lavagno. Behavioral transformations to increase the noise immunity of asynchronous specifications, 1999.

  • A. Taubin, A. Kondratyev, J. Cortadella, and L. Lavagno. Crosstalk noise avoidance in asynchronous circuits, 1999.

  • K. Yamazaki, H. L. Bodlaender, B. de Fluiter, and D. M. Thilikos. Isomorphism for graphs of bounded distance width, 1999.

  • Randomization and approximation techniques in computer science (RANDOM 98), 1998.

  • R. Baeza-Yates, J. Gabarró, and X. Messeguer. Fringe analysis of synchronized parallel algorithms on 2-3 trees, 1998.

  • Jordi Cortadella. Combining structural and symbolic methods for the verification of concurrent systems, 1998.

  • J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, A. Taubin, and A. Yakovlev. Lazy transition systems: application to timing optimization of asynchronous circuits, 1998.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Automatic handshake expansion and reshuffling using concurrency reduction, 1998.

  • Jordi Cortadella, Michael Kishinevsky, Luciano Lavagno, and Alexandre Yakovlev. Deriving Petri nets from finite transition systems, 1998.

  • Amalia Duch, Valdimir Estivill-Castro, and Conrado Martínez. Randomized K-dimensional binary search trees, 1998.

  • J. Díaz and M. J. Serna. Algorítmica per a paral.lelisme massiu, 1998.

  • J. Díaz, J. Petit, P. Psycharis, and M. Serna. A parallel algorithm for sampling matchings from an almost uniform distribution, 1998.

  • J. Díaz, J. Petit, and M. Serna. Random geometric problems on [0,1]2, 1998.

  • J. Díaz, M. J. Serna, and P. Spirakis. On the random generation and counting of matchings in dense graphs, 1998.

  • Joaquim Gabarró and Xavier Messeguer. Parallel dictionaries with local rules on AVL and brother trees, 1998.

  • M. Kishinevsky, J. Cortadella, and A. Kondratyev. Asynchronous interface specification, analysis and synthesis, 1998.

  • A. Kondratyev, J. Cortadella, M. Kishinevsky, L. Lavagno, A. Taubin, and A. Yakovlev. Identifying state coding conflicts in asynchronous system specifications using Petri net unfoldings, 1998.

  • A. Kondratyev, M. Kishinevsky, A. Taubin, J. Cortadella, and L. Lavagno. The use of Petri nets for the design and verification of asynchronous circuits and systems, 1998.

  • Tomás Lang, Enric Musoll, and Jordi Cortadella. Extension of the working-zone-encoding method to reduce also the energy on the microprocessor data bus, 1998.

  • A. Lozano and V. Raghavan. On the complexity of counting the number of vertices moved by graph automorphisms, 1998.

  • C. Martínez and S. Roura. Optimal sampling strategies in quicksort, 1998.

  • C. Martínez and S. Roura. Randomized binary search trees, 1998.

  • Conrado Martínez, Alois Panholzer, and Helmut Prodinger. On the number of descendants and ascendants in random search trees, 1998.

  • X. Molinero. Lexicographic and boustrophedonic product in unrank, 1998.

  • Enric Musoll and Jordi Cortadella. Register-transfer level transformations for low-power data-paths, 1998.

  • Enric Musoll, Tomás Lang, and Jordi Cortadella. Reducing the energy of address and data buses with the working-zone encoding technique and its effect on multimedia applications, 1998.

  • Enric Musoll, Tomás Lang, and Jordi Cortadella. Working-zone encoding for reducing the energy in microprocessor address buses, 1998.

  • Enric Pastor and Jordi Cortadella. Efficient encoding schemes for symbolic analysis of Petri nets, 1998.

  • Enric Pastor and Jordi Cortadella. Structural methods applied to the symbolic analysis of Petri nets, 1998.

  • Enric Pastor, Jordi Cortadella, Alex Kondratyev, and Oriol Roig. Structural methods for the synthesis of speed-independent circuits, 1998.

  • J. Petit. Approximation heuristics and benchmarkings for the MinLA problem, 1998.

  • Fermín Sánchez and Jordi Cortadella. Reducing register pressure in software pipelining, 1998.

  • M. Serna, L. Trevisan, and F. Xhafa. The (parallel) approximability of non-Boolean satisfiability problems and restricted integer programming, 1998.

  • Luca Trevisan and Fatos Xhafa. The parallel complexity of positive linear programming, 1998.

  • José L. Balcázar, Josep Díaz, Ricard Gavaldà, and Osamu Watanabe. Algorithms for learning finite automata from queries: a unified view, 1997.

  • Luc Bougé, Joaquim Gabarró, Xavier Messeguer, and Nicolas Schabanel. Concurrent rebalancing of ACL trees: A fine-grained approach, 1997.

  • Peter Burmeister, Francesc Rosselló, Joan Torrens, and Gabriel Valiente. Algebraic transformation of unary partial algebras I: Double-pushout approach, 1997.

  • J. Castro, D. Guijarro, and Lavin V. Learning nearly monotone k-term DNF, 1997.

  • J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers, 1997.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, Enric Pastor, and Alexandre Yakovlev. Decomposition and technology mapping of speed-independent circuits using Boolean relations, 1997.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alex Yakovlev. Technology mapping of speed-independent circuits based on combinational decomposition and resynthesis, 1997.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. A region-based theory for state assignment in speed-independent circuits, 1997.

  • Jordi Cortadella, Luciano Lavagno, and Ellen Sentovich. Logic synthesis techniques for embedded control code optimization, 1997.

  • J. Delgado and R. V. Sole. Collective-induced computation, 1997.

  • J. Delgado and R. V. Sole. Noise induced transitions in fluid neural networks, 1997.

  • J. Díaz, A. Gibbons, G. Pantziou, M. Serna, P. Spirakis, and J. Torán. Parallel algorithms for the minimum cut and the minimum length tree layout problems, 1997.

  • J. Díaz, A. Gibbons, G. E. Pantziou, M. J. Serna, P. G. Spirakis, and J. Toran. Parallel algorithms for the minimum cut and the minimum length tree layout problems, 1997.

  • J. Díaz, M. Serna, P. Spirakis, and J. Torán. Paradigms for fast parallel approximability, 1997.

  • Philippe Flajolet, Xavier Gourdon, and Conrado Martínez. Patterns in random binary search trees, 1997.

  • Joaquim Gabarró and Xavier Messeguer. A unified approach to concurrent and parallel algorithms on balanced data structures (invited paper)., 1997.

  • Joaquim Gabarró, Xavier Messeguer, and Daniel Riu. Concurrent rebalancing on hyperred-black trees., 1997.

  • J. Gabarró and J. Petit. ParaDict, a data parallel library for dictionaries (extended abstract), 1997.

  • D. Guijarro, Lavin V., and V. Raghavan. Learning monotone term decision lists, 1997.

  • P. Kirschenhofer, H. Prodinger, and C. Martínez. Analysis of Hoare's FIND algorithm with median-of-three partition, 1997. Average-case analysis of algorithms (Dagstuhl, 1995).

  • Michael Kishinevsky, Jordi Cortadella, Alex Kondratyev, Luciano Lavagno, Alexander Taubin, and Alex Yakovlev. Coupling asynchrony and interrupts: Place chart nets and their synthesis, 1997.

  • Alex Kondratyev, Michael Kishinevsky, Jordi Cortadella, Luciano Lavagno, and Alex Yakovlev. Technology mapping for speed-independent circuits: decomposition and resynthesis, 1997.

  • Tomás Lang, Enric Musoll, and Jordi Cortadella. Individual flip-flops with gated clocks for low-power datapaths, 1997.

  • Luciano Lavagno, Jordi Cortadella, and Alberto Sangiovanni-Vincentelli. Embedded code optimization via common control structure detection, 1997.

  • Xavier Messeguer. Skip trees, an alternative data structure to skip lists in a concurrent approach, 1997.

  • X. Molinero. Unranking of combinatorial structures, 1997.

  • X. Molinero. Unranking of combinatorial structures, 1997.

  • Enric Musoll, Tomás Lang, and Jordi Cortadella. Exploiting the locality of memory references to reduce the address bus energy, 1997.

  • Oriol Roig, Jordi Cortadella, Marco A. Peña, and Enric Pastor. Automatic generation of synchronous test patterns for asynchronous circuits, 1997.

  • S. Roura. Divide-and-conquer algorithms and data structures, 1997.

  • S. Roura. An improved master theorem for divide-and-conquer recurrences, 1997.

  • Alex Semenov, Alexandre Yakovlev, Enric Pastor, Marco A. Peña, and Jordi Cortadella. Synthesis of speed-independent circuits from STG-unfolding segment, 1997.

  • Alex Semenov, Alexandre Yakovlev, Enric Pastor, Marco A. Peña, Jordi Cortadella, and Luciano Lavagno. Partial order based approach to synthesis of speed-independent circuits, 1997.

  • M. Serna and F. Xhafa. Approximating scheduling problems in parallel, 1997.

  • M. Serna and F. Xhafa. The parallel approximability of a subclass of quadratic programming, 1997.

  • Gabriel Valiente and Conrado Martínez. An algorithm for graph pattern-matching, 1997.

  • Algorithms---ESA '96, 1996.

  • Ricardo Alberich, Peter Burmeister, Francesc Rosselló, Gabriel Valiente, and Boleslaw Wojdylo. A partial algebras approach to graph transformation, 1996.

  • José L. Balcázar, Josep Díaz, Ricard Gavaldà, and Osamu Watanabe. An optimal parallel algorithm for learning DFA, 1996.

  • B. Borchert and A. Lozano. Succinct circuit representations and leaf language classes are basically the same concept, 1996.

  • J. Cortadella, M. Kishinevsky, A. Kondratyev, L. Lavagno, and A. Yakovlev. Complete state encoding based on the theory of regions, 1996.

  • Jordi Cortadella, Rosa M. Badia, and Fermín Sánchez. A mathematical formulation of the loop pipelining problem, 1996.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alex Yakovlev. Methodology and tools for state encoding in asynchronous circuit synthesis, 1996.

  • Jordi Cortadella, Michael Kishinevsky, Alex Kondratyev, Luciano Lavagno, and Alexandre Yakovlev. Petrify: a tool for manipulating concurrent specifications and synthesis of asynchronous controllers, 1996.

  • J. Díaz, M. J. Serna, and J. Torán. Parallel approximation schemes for problems on planar graphs, 1996.

  • J. Gabarró, C. Martínez, and X. Messeguer. A design of a parallel dictionary using skip lists, 1996.

  • Tomás Lang, Enric Musoll, and Jordi Cortadella. Redundant adder for reduced output transitions, 1996.

  • A. Lozano. Bounded queries to arbitrary sets, 1996.

  • Enric Musoll and Jordi Cortadella. Optimizing CMOS circuits for low power using transistor reordering, 1996.

  • E. Pastor, J. Cortadella, O. Roig, and A. Kondratyev. Structural methods for the synthesis of speed-independent circuits, 1996.

  • M. A. Peña and J. Cortadella. Combining process algebras and Petri nets for the specification and synthesis of asynchronous circuits, 1996.

  • J. Petit. Llibreria de diccionaris paral·lels --- disseny, implementació, avaluació, 1996.

  • S. Roura and C. Martínez. Randomization of search trees by subtree size, 1996.

  • Fermín Sánchez and Jordi Cortadella. Maximum-throughput software pipelining, 1996.

  • Fermín Sánchez and Jordi Cortadella. RESIS: A new methodology for register optimization in software pipelining, 1996.

  • L. Sintes, J. Escudero, M. A. Peña, O. Roig, J. Cortadella, and J. Carrabina. Flujo de diseño asíncrono con la biblioteca DCVSL_LIB para ES2 ECPD10, 1996.

  • R. V. Sole and J. Delgado. Universal computation in fluid neural networks, 1996.

  • R. V. Sole, J. Bascompte, J. Delgado, B. Luque, and S. C. Manrubia. Complejidad en la frontera del caos, 1996.

  • R. V. Sole, S. C. Manrubia, B. Luque, J. Delgado, and J. Bascompte. Phase transitions and complex systems, 1996.

  • T. Tsukiji and F. Xhafa. On the expected depth of randomly generated circuits, 1996.

  • Albert Atserias. Complexitat de kolmogorov i qüestions de fonament, 1995.

  • José Luis Balcázar, Josep Díaz, and Joaquim Gabarró. Structural complexity. I, 1995.

  • J. Cortadella, M. Kishinevsky, L. Lavagno, and A. Yakovlev. Synthesizing petri nets from state-based models, 1995.

  • J. Gabarró and M. J. Serna. Rational processes and linear systems in CSP, 1995.

  • P. Kirschenhofer, C. Martínez, and H. Prodinger. Analysis of an optimized search algorithm for skip lists, 1995.

  • Peter Kirschenhofer, Conrado Martínez, and Helmut Prodinger. Analysis of an optimized search algorithm for skip lists, 1995. Special volume on mathematical analysis of algorithms.

  • A. Kondratyev, J. Cortadella, M. Kishinevsky, E. Pastor, O. Roig, and A. Yakovlev. Checking Signal Transition Graph implementability by symbolic BDD traversal, 1995.

  • Miquel Monserrat, Francesc Rosselló, Joan Torrens, and Gabriel Valiente. Hypergraph rewriting using conformisms, 1995.

  • Enric Musoll and Jordi Cortadella. High-level synthesis techniques for reducing the activity of functional units, 1995.

  • Enric Musoll and Jordi Cortadella. Low-power array multipliers with transition-retaining barriers, 1995.

  • Enric Musoll and Jordi Cortadella. Scheduling and resource binding for low power, 1995.

  • Enric Pastor and Jordi Cortadella. Cover approximations for the synthesis of speed-independent circuits, 1995.

  • Enric Pastor, Jordi Cortadella, and Oriol Roig. A new look at the conditions for the synthesis of speed-independent circuits, 1995.

  • Marco A. Peña and Jordi Cortadella. Programación VLSI y síntesis de circuitos asíncronos mediante composición de redes de Petri, 1995.

  • Oriol Roig, Jordi Cortadella, and Enric Pastor. Hierarchical gate-level verification of speed-independent circuits, 1995.

  • Oriol Roig, Jordi Cortadella, and Enric Pastor. Verification of asynchronous circuits by BDD-based model checking of Petri nets, 1995.

  • F. Sanchez and J. Cortadella. Time constrained loop pipelining, 1995.

  • Fermín Sánchez and Jordi Cortadella. Resource-constrained software pipelining for high-level synthesis of DSP systems, 1995.

  • M. Serna and F. Xhafa. On parallel versus sequential approximation, 1995.

  • Paola Alimonti, Stefano Leonardi, Alberto Marchetti-Spaccamela, and Xavier Messeguer. Average case analysis of fully dynamic connectivity for directed graphs, 1994.

  • J. L. Balcàzar, J. Díaz, R. Gavaldà, and O. Watanabe. The query complexity of learning DFA, 1994.

  • J. L. Balcázar, Díaz, R. Gavaldà, and O. Watanabe. An optimal parallel algorithm for learning DFA, 1994.

  • J. L. Balcázar, Díaz, R. Gavaldà, and O. Watanabe. The query complexity of learning DFA, 1994.

  • Jordi Cortadella and Tomás Lang. High-radix division and square root with speculation, 1994.

  • J. Cortadella, J. A. B. Fortes, and E. A. Lee. Design and prototyping of digital signal processing systems (minitrack introduction), 1994.

  • Jordi Cortadella, Alexandre Yakovlev, Luciano Lavagno, and Peter Vanbekbergen. Designing asynchronous circuits from behavioral specifications with internal conflicts, 1994.

  • J. Gabarró and R. Gavaldà. An approach to correctness of data parallel algorithms, 1994.

  • Enric Pastor, Oriol Roig, Jordi Cortadella, and Rosa M. Badia. Petri net analysis using boolean manipulation, 1994. (PostScript)

  • Oriol Roig, Enric Pastor, and Jordi Cortadella. Verificación de circuitos independientes de la velocidad con modelos simbólicos de redes de Petri, 1994.

  • Rosa M. Badia and Jordi Cortadella. GLASS: a graph-theoretic approach for global binding, 1993.

  • Rosa M. Badia and Jordi Cortadella. High-level synthesis of asynchronous systems: Scheduling and process synchronization, 1993.

  • R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model, 1993.

  • Jordi Cortadella and Tomás Lang. Division with speculation of quotient digits, 1993.

  • J. Díaz, M. J. Serna, and J. Torán. Parallel approximation schemes for planar graphs problems, 1993.

  • L. M. Kirousis, M. Serna, and P. Spirakis. Parallel complexity of the connected subgraph problem, 1993.

  • M. Ogiwara and A. Lozano. On sparse hard sets for counting classes, 1993.

  • Enric Pastor and Jordi Cortadella. An efficient unique state coding algorithm for signal transition graphs, 1993.

  • Enric Pastor and Jordi Cortadella. Polynomial algorithms for the synthesis of hazard-free circuits from signal transition graphs, 1993.

  • Oriol Roig, Enric Pastor, Rosa M. Badia, and Jordi Cortadella. Síntesis de Máquinas de control para circuitos asíncronos, 1993.

  • Fermín Sánchez and Jordi Cortadella. Resource-constrained pipelining based on loop transformations, 1993.

  • Gabriel Valiente. Input-driven control of rule-based expert systems, 1993.

  • Gabriel Valiente. On knowledge base redundancy under uncertain reasoning, 1993.

  • Gabriel Valiente. Verification of knowledge base redundancy and subsumption using graph transformations, 1993.

  • V. Arvind, Y. Han, L. Hemachandra, J. Koebler, A. Lozano, M. Mundhenk, M. Ogiwara, U. Schoening, R. Silvestri, and T. Thierauf. Reductions to sets of low information content, 1992.

  • R. Baeza, R. Casas, J. Díaz, and C. Martínez. On the average size of the intersection of binary trees, 1992.

  • R. Baeza-Yates, R. Casas, J. Díaz, and C. Martínez. On the average size of the intersection of binary trees, 1992.

  • J. Cortadella and R. M. Badia. An asynchronous architecture model for behavioral synthesis, 1992.

  • Jordi Cortadella and Teodor Jové. Comments on ''Using Cache Mechanisms to Exploit non-Refreshing DRAM's for On-Chip Memories'', 1992.

  • Jordi Cortadella and José M. Llabería. Evaluation of A+B=K conditions without carry propagation, 1992.

  • Jordi Cortadella, Rosa M. Badia, Enric Pastor, and Abelardo Pardo. Achilles: A high-level synthesis system for asynchronous circuits, 1992.

  • Jordi Cortadella, Rosa M. Badia, Enric Pastor, and Abelardo Pardo. Achilles: Sistema de Síntesis de alto nivel para circuitos asíncronos, 1992.

  • J. Díaz. Graph layout problems (invited paper), 1992.

  • A. Lozano and J. Torán. On the nonuniform complexity of the graph isomorphism problem, 1992.

  • Gabriel Valiente. Using layered support graphs for verifying external adequacy in rule-based expert systems, 1992.

  • Rosa M. Badia and Jordi Cortadella. Optimización del tiempo de ciclo en la planificación de operaciones, 1991.

  • Rosa M. Badia, Jordi Cortadella, and Eduard Ayguadé. Computer-aided synthesis of data-path by using a simulated-annealing-based approach, 1991.

  • R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model, 1991.

  • R. Casas, J. Díaz, and C. Martínez. Average-case analysis on simple families of trees using a balanced probability model, 1991.

  • R. Casas, J. Díaz, and C. Martínez. Statistics on random trees, 1991.

  • R. Casas, J. Díaz, and C. Martínez. Statistics on random trees (invited lecture), 1991.

  • Jordi Cortadella, Rosa M. Badia, and Eduard Ayguadé. Scheduling in a continuous area-time design space, 1991.

  • Jordi Cortadella, Rosa M. Badia, and Eduard Ayguadé. Scheduling in a continuous area-time design space: A simulated-annealing-based approach, 1991.

  • J. Díaz, A. M. Gibbons, M. S. Paterson, and J. Torán. The minsumcut problem, 1991.

  • A. Lozano and J. Torán. Self-reducible sets of small density, 1991.

  • M. Ogiwara and A. Lozano. On one query self-reducible sets, 1991.

  • G. S. Whitcomb, J. Cortadella, and A. R. Newton. Functional level synthesis of the TRISC processor, 1991.

  • J. L. Balcázar, J. Díaz, and J. Gabarró. Structural complexity II, 1990.

  • J. Díaz and J. Torán. Classes of bounded nondeterminism, 1990.

  • C. Alvarez, J. Díaz, and J. Torán. Complexity classes with complete problems between P and NP-complete, 1989.

  • R. Casas, J. Díaz, and J. M. Steyaert. Average-case analysis of Robinson's unification algorithm with two different variables, 1989.

  • Jordi Cortadella and José M. Llabería. Making branches transparent to the execution unit, 1989.

  • Teodor Jové and Jordi Cortadella. Reduced instruction buffer for RISC architectures, 1989.

  • M. J. Serna and P. G. Spirakis. The approximability of problems complete for P., 1989.

  • J. L. Balcázar, J. Díaz, and J. Gabarró. Structural complexity I, 1988.

  • Jordi Cortadella. Executing branch instructions with zero time delay in a RISC, 1988.

  • Jordi Cortadella and Teodor Jové. Designing a branch target buffer for executing branches with zero time cost in a RISC processor, 1988.

  • Jordi Cortadella and Teodor Jové. Dynamic RAM for on-chip instruction caches, 1988.

  • Jordi Cortadella and Teodor Jové. Executing zero-delay branches with a branch target buffer in a RISC processor, 1988.

  • Jordi Cortadella and José M. Llabería. Evaluating A+B=K conditions in constant time, 1988.

  • Jordi Cortadella, Antonio González, and José M. Llabería. RISC: un nuevo enfoque en el diseño de procesadores, 1988.

  • Jordi Domingo, José M. Llabería, Mateo Valero, and Jordi Cortadella. Arbitration techniques for packet switching multistage networks, 1988.

  • Antonio González, José M. Llabería, and Jordi Cortadella. A mechanism for reducing the cost of branches in RISC architectures, 1988.

  • Antonio González, José M. Llabería, and Jordi Cortadella. Zero-delay cost branches in RISC architectures, 1988.

  • A. Lozano. Np-hardness on succinct representations of graphs, 1988.

  • J. L. Balcázar, Díaz, and J. Gabarró. On characterizations of the class PSPACE/POLY, 1987.

  • Jordi Cortadella. Mechanisms for the efficient execution of branches in RISC architecture, 1987. (In Spanish).

  • Jordi Cortadella and José M. Llabería. Arquitecturas RISC, 1987.

  • Jordi Cortadella and José M. Llabería. An intelligent IFU for pipelined processors that makes control instructions transparent to the execution unit, 1987.

  • Jordi Cortadella and José M. Llabería. A low cost evaluation methodology for new architectures, 1987.

  • Jordi Cortadella and José M. Llabería. Procesadores RISC, 1987.

  • Jordi Cortadella, José M. Llabería, and Mateo Valero. Arquitecturas orientadas a lenguajes basados en la lógica, 1987.

  • Jordi Domingo, José M. Llabería, Jordi Cortadella, and Mateo Valero. Arbitration methods to increase the throughput of packed switching buffered shuffle-exchange interconnection networks, 1987.

  • J. L. Balcázar, Díaz, and J. Gabarró. Uniform characterizations of non-uniform complexity measures, 1985.

  • R. Casas, J. Díaz, and M. Verges. On counting BECs, 1985.

  • Luis González, Jordi Cortadella, and José M. Llabería. Performance evaluation of a loosely coupled multiprocessor architecture with two buses, 1985.

  • R. Casas, J. Díaz, J. M. Steyaert, and M. Verges. Some considerations on the ratio of compactification of binary trees, 1983.

  • J. L. Balcázar and Díaz. A note on a theorem by Ladner, 1982.

  • X. Berenguer, J. Díaz, and L. H. harper. A solution to the Sperner-erdös problem, 1982.

  • R. Casas and J. Díaz. De la possibilitat a l'eficiència: Un intent d'explicar en forma entenedora alguns aspectes teòrics de la calculació, 1982.

  • J. Díaz. A subexponential average complexity for some difficult maximization problems, 1982.

  • X. Berenguer and J. Díaz. Algunes consideracions teòriques al problema de la construcció d'horaris, 1980.

  • X. Berenguer and J. Díaz. The weighted Sperner's set problem, 1980.

  • J. Díaz. The delta -operator, 1979.

  • J. Díaz. Complejidad de problemas combinatorios, 1978.

  • J. Díaz. El problema de l'ordenació lineal òptima és NP-complet, 1978.