default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTheoretical Computer Science, Volume 597
Volume 597, September 2015
- Katalin Bimbó:
The decidability of the intensional fragment of classical linear logic. 1-17 - Ferenc Bujtor, Walter Vogler:
Error-pruning in interface automata. 18-39 - Michele Boreale
, Michela Paolini:
Worst- and average-case privacy breaches in randomization mechanisms. 40-61 - Fabrizio Biondi, Axel Legay, Pasquale Malacaria, Andrzej Wasowski:
Quantifying information leakage of randomized protocols. 62-87
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-12-03 20:17 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
