Sciweavers

163 search results - page 15 / 33
» Composition Theorems in Communication Complexity
Sort
View
JOC
2008
86views more  JOC 2008»
14 years 9 months ago
Lower Bounds and Impossibility Results for Concurrent Self Composition
In the setting of concurrent self composition, a single protocol is executed many times concurrently by a single set of parties. In this paper, we prove lower bounds and impossibi...
Yehuda Lindell
CISC
2007
Springer
156views Cryptology» more  CISC 2007»
15 years 3 months ago
Deniable Authentication on the Internet
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
Shaoquan Jiang
ACSD
1998
IEEE
105views Hardware» more  ACSD 1998»
15 years 1 months ago
Visual Formalisms Revisited
The development of an interactive application is a complex task that has to consider data, behavior, intercommunication, architecture and distribution aspects of the modeled syste...
Radu Grosu, Gheorghe Stefanescu, Manfred Broy
KBSE
1999
IEEE
15 years 1 months ago
Modular and Incremental Analysis of Concurrent Software Systems
Modularization and abstraction are the keys to practical verification and analysis of large and complex systems. We present in an incremental methodology for the automatic analysi...
Hassen Saïdi
WOTUG
2007
14 years 10 months ago
A Process-Oriented Architecture for Complex System Modelling
Abstract. A fine-grained massively-parallel process-oriented model of platelets (potentially artificial) within a blood vessel is presented. This is a CSP inspired design, expres...
Carl G. Ritson, Peter H. Welch