Search academic resources

We compute the influence of a vertex on the connectivity structure of a directed network by using Shapley value theory. In general, the computation of such ratings is highly inefficient. We show how the computation can b...

In this paper we study the Prefix Sum problem introduced by Fredman. We show that it is possible to perform both update and retrieval in O(1) time simultaneously under a memory model in which individual bits may be share...

In distributed hash tables, much communication traffic comes from multi-word searches. The aim of this work is to reduce the amount of traffic by using a bloom filter, which is a space-efficient probabilistic data struct...

Based on the imp&-calculus, ASP (Asynchronous Sequential Processes) de nes distributed applications behaving deterministically. This article extends ASP by building hierarchical and asynchronous distributed components. ...

We introduce a data structure, the Bundled Suffix Tree (BuST), that is a generalization of a Suffix Tree (ST). To build a BuST we use an alphabet Σ together with a non-transitive relation ≈ among its letters. Follow...

Let Σ be a ranked set. A categorical Σ-algebra, cΣa for C, for short, is a small category C equipped with a functor σC : C n each σ ∈ Σn , n ≥ 0. A continuous categorical Σ-algebra is a cΣa which C; has an in...

We investigate decidable properties for regular cellular automata. In particular, we show that regularity itself is an undecidable property and that nilpotency, equicontinuity and positively expansiveness became decidab...

The distributed coordination and control of a team of autonomous mobile robots is a problem widely studied in a variety of elds, such as engineering, arti cial intelligence, arti cial life, robotics. Generally, in thes...

Consider a team of (one or more) mobile agents operating in a graph G. Unaware of the graph topology and starting from the same node, the team must explore the graph. This problem, known as graph exploration, was initial...

A d-dimensional cellular automaton with sequential input mode is a d-dimensional grid of interconnected interacting finite automata. The distinguished automaton at the origin, the communication cell, is connected to th...

Quantum phenomena exhibit a variety of weird, counter intuitive, puzzling, mysterious and even entertaining effects. Quantum information processing tries to make an effective use of these phenomena to design new quantum ...

Approximation algorithms for a class of planar graph problems, including planar independent set, planar vertex cover and planar dominating set, were intensively studied. The current upper bound on the running time of the...

We extend the regular model checking framework so that it can handle systems with arbitrary width tree-like structures. Con gurations of a system are represented by trees of arbitrary arities, sets of con gurations are r...

Given an instance of an optimization problem together with an optimal solution, we consider the scenario in which this instance is modified locally. In graph problems, e. g., a singular edge might be removed or added, or...

It is a well established fact, that - in the case of classical random graphs like (variants of) Gn,p or random regular graphs - spectral methods yield efficient algorithms for clustering (e. g. colouring or bisection) pr...

We define a symbolic determinisation procedure for a class of infinite-state systems, which consists of automata extended with symbolic variables that may be infinite-state. The subclass of extended automata for which th...

The Gale-Shapley "propose/reject" algorithm is a wellknown procedure for solving the classical stable marriage problem. In this paper we study this algorithm in the context of the many-to-many stable marriage problem, al...

We investigate the problem of nding a total order of a nite set that satis es various local ordering constraints. Depending on the admitted constraints, we provide an e cient algorithm or prove NP-completeness. We disc...

Historically Functional Programming FP for short has been associated with a small scope of applications mainly academic The computer science community did not pay enough attention to its potential perhaps due t...

En los últimos años han adquirido gran protagonismo en la enseñanza los conceptos de “redes de aprendizaje”, “trabajo cooperativo”, “trabajo colaborativo”, y otros tantos que hacen referencia a la importan...

Many different areas in Computer Science - like Real Time Systems, Temporal Data Bases, Program Verification and Multimedia-demandan adequate way to represent and use the notions of time and change. We present a programm...