The following pages link to Joaquim Gabarró (Q293413):
Displaying 49 items.
- Parallel dictionaries with local rules on AVL and brother trees (Q293415) (← links)
- (Q458501) (redirect page) (← links)
- Book review of: Robin Sharp, Principles of protocol design (Q458502) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- Reasoning about orchestrations of web services using partial correctness (Q469344) (← links)
- The complexity of game isomorphism (Q650900) (← links)
- Equilibria problems on games: complexity versus succinctness (Q657923) (← links)
- (Q811122) (redirect page) (← links)
- The parallel complexity of two problems on concurrency (Q811123) (← links)
- Modelling web-service uncertainty: the angel/daemon approach (Q826324) (← links)
- On characterizations of the class PSPACE/poly (Q1107320) (← links)
- Prefixes of infinite words and ambiguous context-free languages (Q1108044) (← links)
- Iterated GSMs and CO-CFL (Q1112624) (← links)
- Deciding bisimilarity is P-complete (Q1203120) (← links)
- A design of a parallel dictionary using skip lists (Q1351441) (← links)
- The computational complexity of QoS measures for orchestrations. The computational complexity of QoS measures (Q1679522) (← links)
- Analytic urns (Q1781182) (← links)
- Fringe analysis of synchronized parallel insertion algorithms in 2--3 trees. (Q1874394) (← links)
- Barrier synchronisation: Axiomatisation and relaxation (Q1882787) (← links)
- Web apps and imprecise probabilitites (Q2107319) (← links)
- Measuring investment opportunities under uncertainty (Q2297802) (← links)
- An angel-daemon approach to assess the uncertainty in the power of a collectivity to act (Q2401883) (← links)
- Computational aspects of uncertainty profiles and angel-daemon games (Q2441541) (← links)
- Web Services and Incerta Spiriti: A Game Theoretic Approach to Uncertainty (Q3011982) (← links)
- (Q3330536) (← links)
- The Robustness of Periodic Orchestrations in Uncertain Evolving Environments (Q3451171) (← links)
- Uncertainty in the Cloud: An Angel-Daemon Approach to Modelling Performance (Q3451172) (← links)
- On the Complexity of Equilibria Problems in Angel-Daemon Games (Q3511310) (← links)
- On the Complexity of Game Isomorphism (Q3525601) (← links)
- (Q3674080) (← links)
- (Q3692867) (← links)
- Uniform characterizations of non-uniform complexity measures (Q3716297) (← links)
- (Q3745282) (← links)
- (Q3753480) (← links)
- (Q3996675) (← links)
- (Q4039803) (← links)
- (Q4321931) (← links)
- AXIOMATIC FRAMEWORKS FOR DEVELOPING BSP-STYLE PROGRAMS∗ (Q4485121) (← links)
- (Q4536967) (← links)
- The pragmatic proof: Hypermedia API composition and execution (Q4593077) (← links)
- Nonuniform complexity classes specified by lower and upper bounds (Q4730777) (← links)
- Non recursive functions have transcendental generating series (Q4732456) (← links)
- (Q4742318) (← links)
- (Q4791950) (← links)
- (Q4817282) (← links)
- (Q4853315) (← links)
- On the hardness of game equivalence under local isomorphism (Q4928764) (← links)
- Mathematical Foundations of Computer Science 2005 (Q5492850) (← links)
- Algorithms and Computation (Q5897896) (← links)
