Sciweavers

1261 search results - page 88 / 253
» A Hierarchy of Temporal Properties
Sort
View
LFCS
1997
Springer
15 years 10 months ago
The Concurrency Complexity for the Horn Fragment of Linear Logic
The provability problem for the Horn fragment of linear logic is NP-complete [4, 1]. In this work we investigate various definitions of concurrency proposed in [2] and establish t...
Sergey Dudakov
LOGCOM
2007
92views more  LOGCOM 2007»
15 years 6 months ago
Third-Order Computation and Bounded Arithmetic
Abstract. We describe a natural generalization of ordinary computation to a third-order setting and give a function calculus with nice properties and recursion-theoretic characteri...
Alan Skelley
ICALP
2007
Springer
16 years 18 days ago
A Combinatorial Theorem for Trees
Following the idea developed by I. Simon in his theorem of Ramseyan factorisation forests, we develop a result of ‘deterministic factorisations’. This extra determinism propert...
Thomas Colcombet
CORR
2004
Springer
117views Education» more  CORR 2004»
15 years 6 months ago
Traffic-driven model of the World Wide Web graph
We propose a model for the World Wide Web graph that couples the topological growth with the traffic's dynamical evolution. The model is based on a simple traffic-driven dynam...
Alain Barrat, Marc Barthelemy, Alessandro Vespigna...
CL
2004
Springer
15 years 6 months ago
Safe metaclass composition using mixin-based inheritance
In the context of meta-programming and reflective languages, classes are treated as full fledged objects which are instances of other classes named metaclasses. Metaclasses have p...
Noury Bouraqadi