default search action

combined dblp search
author search
venue search
publication search

ask others

Theoretical Computer Science, Volume 597

> Home > Journals > Theoretical Computer Science

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

showing all ?? records

Volume 597, September 2015

Contributions

- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/Bimbo15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/Bimbo15
Katalin Bimbó:
The decidability of the intensional fragment of classical linear logic. 1-17
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BujtorV15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BujtorV15
Ferenc Bujtor, Walter Vogler:
Error-pruning in interface automata. 18-39
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BorealeP15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BorealeP15
Michele Boreale, Michela Paolini:
Worst- and average-case privacy breaches in randomization mechanisms. 40-61
- view
  - electronic edition via DOI (open access)
  - details & citations
  authority control:
- export record
  dblp key:
  - journals/tcs/BiondiLMW15
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/tcs/BiondiLMW15
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.