Sciweavers

8825 search results - page 88 / 1765
» All for one or one for all
Sort
View
LFCS
1997
Springer
15 years 5 months ago
Back-Forth Equivalences for Design of Concurrent Systems
The paper is devoted to the investigation of behavioural equivalences of concurrent systems modelled by Petri nets. Back-forth bisimulation equivalences known from the literature a...
Igor V. Tarasyuk
ASIACRYPT
2007
Springer
15 years 5 months ago
A Non-interactive Shuffle with Pairing Based Verifiability
A shuffle is a permutation and re-encryption of a set of ciphertexts. Shuffles are for instance used in mix-nets for anonymous broadcast and voting. One way to make a shuffle verif...
Jens Groth, Steve Lu
APN
2008
Springer
15 years 3 months ago
Modelling Concurrency with Quotient Monoids
Four quotient monoids over step sequences and one with compound generators are introduced and discussed. They all can be regarded as extensions (of various degrees) of Mazurkiewicz...
Ryszard Janicki, Dai Tri Man Le
APPROX
2008
Springer
125views Algorithms» more  APPROX 2008»
15 years 3 months ago
On the Degree Sequences of Random Outerplanar and Series-Parallel Graphs
In order to perform an average-case analysis for specific input distributions one needs to derive and understand properties of a 'typical' input instance. In the case of...
Nicla Bernasconi, Konstantinos Panagiotou, Angelik...
89
Voted
CCCG
2010
15 years 2 months ago
Sweeping minimum perimeter enclosing parallelograms: Optimal crumb cleanup
We examine the problem of pushing all the points of a planar region into one point using parallel sweeps of an infinite line, minimizing the sum of the lengths of the sweep vector...
Yonit Bousany, Mary Leah Karker, Joseph O'Rourke, ...