Joaquim Gabarró

According to our database1, Joaquim Gabarró authored at least 85 papers between 1982 and 2018.

Collaborative distances:



In proceedings 
PhD thesis 





Web Apps and Imprecise Probabilitites.
Proceedings of the Information Processing and Management of Uncertainty in Knowledge-Based Systems. Theory and Foundations, 2018

The pragmatic proof: Hypermedia API composition and execution.
TPLP, 2017

The computational complexity of QoS measures for orchestrations - The computational complexity of QoS measures.
J. Comb. Optim., 2017

Uncertainty in basic short-term macroeconomic models with angel-daemon games.
IJDATS, 2017

An Angel-Daemon Approach to Assess the Uncertainty in the Power of a Collectivity to Act.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2017

Clustering Media Items Stemming from Multiple Social Networks.
Comput. J., 2015

Uncertainty in the Cloud: An Angel-Daemon Approach to Modelling Performance.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2015

The Robustness of Periodic Orchestrations in Uncertain Evolving Environments.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2015

A Cost-benefit Analysis of Continuous Assessment.
Proceedings of the CSEDU 2015, 2015

Continuous Assessment in the Evolution of a CS1 Course: The Pass Rate/Workload Ratio.
Proceedings of the Computer Supported Education - 7th International Conference, 2015

Computational Aspects of Uncertainty Profiles and Angel-Daemon Games.
Theory Comput. Syst., 2014

Analysing Web-Orchestrations Under Stress Using Uncertainty Profiles.
Comput. J., 2014

The Life Cycle of a Cutting-edge Technology Course - A Coaching Experience on Android.
Proceedings of the CSEDU 2014, 2014

Capturing the functionality of Web services with functional descriptions.
Multimedia Tools Appl., 2013

On the hardness of game equivalence under local isomorphism.
RAIRO - Theor. Inf. and Applic., 2013

Reasoning about orchestrations of web services using partial correctness.
Formal Asp. Comput., 2013

Functional Composition of Sensor Web APIs.
Proceedings of the 5th International Workshop on Semantic Sensor Networks, 2012

Adding Realtime Coverage to the Google Knowledge Graph.
Proceedings of the ISWC 2012 Posters & Demonstrations Track, 2012

Functional descriptions as the bridge between hypermedia APIs and the Semantic Web.
Proceedings of the Third International Workshop on RESTful Design, 2012

Defining aesthetic principles for automatic media gallery layout for visual and audial event summarization based on social networks.
Proceedings of the Fourth International Workshop on Quality of Multimedia Experience, 2012

Linked Data and Linked APIs: Similarities, Differences, and Challenges.
Proceedings of the Semantic Web: ESWC 2012 Satellite Events, 2012

A Social Description Revolution - Describing Web APIs' Social Parameters with RESTdesc.
Proceedings of the Intelligent Web Services Meet Social Computing, 2012

The complexity of game isomorphism.
Theor. Comput. Sci., 2011

Equilibria problems on games: Complexity versus succinctness.
J. Comput. Syst. Sci., 2011

Coaching on New Technologies: Programming Workshop Android Applications for Google Phones.
Bulletin of the EATCS, 2011

Computational models for networks of tiny artifacts: A survey.
Computer Science Review, 2011

Orchestrating Unreliable Services: Strategic and Probabilistic Approaches to Reliability.
Proceedings of the Trustworthy Global Computing - 6th International Symposium, 2011

Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2011

Stressed Web Environments as Strategic Games: Risk Profiles and Weltanschauung.
Proceedings of the Trustworthly Global Computing - 5th International Symposium, 2010

Book review.
Computer Science Review, 2009

Sensor Field: A Computational Model.
Proceedings of the Algorithmic Aspects of Wireless Sensor Networks, 2009

Topic 9: Parallel and Distributed Programming.
Proceedings of the Euro-Par 2008, 2008

Analysing Orchestrations Using Risk Profiles And Angel-Daemon Games.
Proceedings of the Grid Computing, 2008

On the Complexity of Equilibria Problems in Angel-Daemon Games.
Proceedings of the Computing and Combinatorics, 14th Annual International Conference, 2008

Assessing the Reliability and Cost of Web and Grid Orchestrations.
Proceedings of the The Third International Conference on Availability, 2008

On using partial orders for web application design.
IJWIS, 2007

On the Complexity of Game Isomorphism.
Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

Bounded Site Failures: An Approach to Unreliable Grid Environments.
Proceedings of the Making Grids Work: Proceedings of the CoreGRID Workshop on Programming Models Grid and P2P System Architecture Grid Systems, 2007

Efficient parallel LAN/WAN algorithms for optimization. The mallba project.
Parallel Computing, 2006

Managing Grid Computations: An ORC-Based Approach.
Proceedings of the Parallel and Distributed Processing and Applications, 2006

Pure Nash equilibria in games with a large number of actions
Electronic Colloquium on Computational Complexity (ECCC), 2005

Pure Nash Equilibria in Games with a Large Number of Actions.
Proceedings of the Mathematical Foundations of Computer Science 2005, 2005

Polynomial Space Suffices for Deciding Nash Equilibria Properties for Extensive Games with Large Trees, .
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Barrier synchronisation: Axiomatisation and relaxation.
Formal Asp. Comput., 2004

Fringe analysis of synchronized parallel insertion algorithms in 2-3 Trees.
Theor. Comput. Sci., 2003

Computational Models for Web- and Grid-Based Computation.
Proceedings of the Euro-Par 2003. Parallel Processing, 2003

Grab and Go Systems: a CPO approach to concurrent web and grid-based computation.
Electr. Notes Theor. Comput. Sci., 2002

MALLBA: A Library of Skeletons for Combinatorial Optimisation (Research Note).
Proceedings of the Euro-Par 2002, 2002

Towards Formally Refining BSP Barrier s into Explicit Two-Sided Communications.
Proceedings of the Euro-Par 2001: Parallel Processing, 2001

Axiomatic Frameworks for Developing Bsp-style Programs*.
Parallel Algorithms Appl., 2000

Parallel Dictionaries with Local Rules on AVL and Brother Trees.
Inf. Process. Lett., 1998

Fringe Analysis of Synchronized Parallel Algorithms on 2-3 Trees.
Proceedings of the Randomization and Approximation Techniques in Computer Science, 1998

Relaxed Tree Structures, a Way to Deal with Concurrency and Parallelism on Dictionaries.
Proceedings of the International Colloquium Universal Machines and Computations, 1998

Concurrent Rebalancing on HyperRed-Black Trees.
Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997

A Unified Approach to Concurrent and Parallel Algorithms on Balanced Data Structures (Invited Paper).
Proceedings of 17th International Conference of the Chilean Computer Science Society (SCCC '97), 1997

ParaDict, a data parallel library for dictionaries.
Proceedings of the Fifth Euromicro Workshop on Parallel and Distributed Processing (PDP '97), 1997

Concurrent Rebalancing of ACL Trees: A Fine-Grained Approach (Extended Abstract).
Proceedings of the Euro-Par '97 Parallel Processing, 1997

A Design of a Parallel Dictionary Using Skip Lists.
Theor. Comput. Sci., 1996

Structural Complexity I, Second Edition
Texts in Theoretical Computer Science. An EATCS Series, Springer, ISBN: 354058384X, 1995

Rational Processes and Linear Systems in CSP.
Fundam. Inform., 1995

An Approach to Correctness of Data Parallel Algorithms.
J. Parallel Distrib. Comput., 1994

Deciding Bisimilarity is P-Complete.
Formal Asp. Comput., 1992

Correctness of flat data parallel algorithms: an axiomatic approach and examples.
Proceedings of the PARLE '92: Parallel Architectures and Languages Europe, 1992

The Design of a Parallel Algorithm to Solve the Word Problem for the Free Partially Commutative Groups.
Proceedings of the Parallel Processing: CONPAR 92, 1992

The Parallel Complexity of Two Problems on Concurrency.
Inf. Process. Lett., 1991

Parallel Complexity in the Design and Analysis on Conurrent Systems.
Proceedings of the PARLE '91: Parallel Architectures and Languages Europe, 1991

Structural Complexity II
EATCS Monographs on Theoretical Computer Science 22, Springer, ISBN: 0387520791, 1990

Structural Complexity I
EATCS Monographs on Theoretical Computer Science 11, Springer, ISBN: 978-3-642-97062-7, 1990

Non Recursive Functions Have Transcendental Generating Series.
ITA, 1989

Nonuniform Complexity Classes Specified by Lower and Upper Bounds.
ITA, 1989

Iterated GSMs and Co-CFL.
Acta Inf., 1989

Structural complexity, 1st Edition.
EATCS monographs on theoretical computer science 11, Springer, ISBN: 0387186220, 1988

On Characterizations of the Class PSPACE/POLY.
Theor. Comput. Sci., 1987

Prefixes of Infinite Words and Ambiguous Context-Free Languages.
Inf. Process. Lett., 1987

Some comments about notations of orders of manitude.
Bulletin of the EATCS, 1986

On Non- uniform Polynomial Space.
Proceedings of the Structure in Complexity Theory, 1986

Uniform Characterizations of Non-Uniform Complexity Measures
Information and Control, 1985

Some applications of the interchange lemma.
Bulletin of the EATCS, 1985

Examples of CFI-BI-immune and CF-levelable sets in logspace.
Bulletin of the EATCS, 1985

On some "non-uniform" complexity measures.
Proceedings of the Fundamentals of Computation Theory, 1985

Some results about Logspace complexity measures.
Bulletin of the EATCS, 1984

Context-free grammars in Greibach normal forms.
Bulletin of the EATCS, 1984

Pushdown Space Complexity and Related Full-AFLs.
Proceedings of the STACS 84, 1984

Initial Index: A New Complexity Function for Languages.
Proceedings of the Automata, 1983

Une Application des Notions de Centre et Index Rationell a Certains Langages Algébriques.
ITA, 1982