Sciweavers

TCS
2002
13 years 3 months ago
The chords' problem
The chords' problem is a variant of an old problem of computational geometry: given a set of points of n , one can easily build the multiset of the distances between the poi...
Alain Daurat, Yan Gérard, Maurice Nivat
SCP
1998
112views more  SCP 1998»
13 years 3 months ago
Structured Gamma
The Gamma language is based on the chemical reaction metaphor which has a number of benefits with respect to parallelism and program derivation. But the original definition of G...
Pascal Fradet, Daniel Le Métayer
FUIN
2007
116views more  FUIN 2007»
13 years 3 months ago
Decidability Problems of a Basic Class of Object Nets
It is shown that the boundedness problem for a certain class of basic object nets and a corresponding class of multiset rewriting systems is decidable. To achieve this result Dicks...
Roxana Dietze, Manfred Kudlek, Olaf Kummer
IJFCS
2006
130views more  IJFCS 2006»
13 years 3 months ago
Mealy multiset automata
We introduce the networks of Mealy multiset automata, and study their computational power. The networks of Mealy multiset automata are computationally complete. 1 Learning from Mo...
Gabriel Ciobanu, Viorel Mihai Gontineac
AAECC
2006
Springer
102views Algorithms» more  AAECC 2006»
13 years 3 months ago
An effective proof of the well-foundedness of the multiset path ordering
The contribution of this paper is an effective proof of the well-foundedness of MPO, as a term of the Calculus of Inductive Constructions. This proof is direct, short and simple. ...
Solange Coupet-Grimal, William Delobel
DM
2010
124views more  DM 2010»
13 years 3 months ago
Asymptotic enumeration of 2-covers and line graphs
A 2-cover is a multiset of subsets of [n] := {1, 2, . . . , n} such that each element of [n] lies in exactly two of the subsets. A 2-cover is called proper if all of the subsets o...
Peter J. Cameron, Thomas Prellberg, Dudley Stark
FSTTCS
2008
Springer
13 years 4 months ago
Analyzing Asynchronous Programs with Preemption
ABSTRACT. Multiset pushdown systems have been introduced by Sen and Viswanathan as an adequate model for asynchronous programs where some procedure calls can be stored as tasks to ...
Mohamed Faouzi Atig, Ahmed Bouajjani, Tayssir Toui...
APPROX
2006
Springer
126views Algorithms» more  APPROX 2006»
13 years 7 months ago
Better Approximations for the Minimum Common Integer Partition Problem
Abstract. In the k-Minimum Common Integer Partition Problem, abbreviated k-MCIP, we are given k multisets X1, . . . , Xk of positive integers, and the goal is to find an integer mu...
David P. Woodruff
CRYPTO
2003
Springer
127views Cryptology» more  CRYPTO 2003»
13 years 8 months ago
Cryptanalysis of SAFER++
This paper presents several multiset and boomerang attacks on Safer++ up to 5.5 out of its 7 rounds. These are the best known attacks for this cipher and significantly improve the...
Alex Biryukov, Christophe De Cannière, Gust...