index - Theoretical Computer Science
   


Full Text Documents

Chargement de la page

Search

Chargement de la page

Table of Contents
Theoretical Computer Science
Cristian Calude, Vladimiro Sassone
Front Matter
Convexity, Duality and Effects
Bart Jacobs
1-19
A Calculus for Power-Aware Multicast Communications in Ad Hoc Networks
Lucia Gallina, Sabina Rossi
20-31
The Coarsest Precongruences Respecting Safety and Liveness Properties
Robert Jan Glabbeek
32-52
Entropy and Attack Models in Information Flow
Mário Alvim, Miguel Andrés, Catuscia Palamidessi
53-54
Safe Equivalences for Security Properties
Mário Alvim, Miguel Andrés, Catuscia Palamidessi, Peter Van Rossum
55-70
On Probabilistic Alternating Simulations
Chenyi Zhang, Jun Pang
71-85
Probabilistic Mobility Models for Mobile and Wireless Networks
Lei Song, Jens Chr. Godskesen
86-100
On Packing Splittable Items with Cardinality Constraints
Fouad B. Chedid
101-110
Deterministic Computations in Time-Varying Graphs: Broadcasting under Unstructured Mobility
Arnaud Casteigts, Paola Flocchini, Bernard Mans, Nicola Santoro
111-124
Slicing Behavior Tree Models for Verification
Nisansala Yatapanage, Kirsten Winter, Saad Zafar
125-139
Optimization of the Anisotropic Gaussian Kernel for Text Segmentation and Parameter Extraction
Darko Brodić
140-152
Online Dictionary Matching for Streams of XML Documents
Panu Silvasti, Seppo Sippu, Eljas Soisalon-Soininen
153-164
The Duality of Computation under Focus
Pierre-Louis Curien, Guillaume Munch-Maccagnoni
165-181
Polarized Resolution Modulo
Gilles Dowek
182-196
A Logic on Subobjects and Recognizability
H. J. Sander Bruggink, Barbara König
197-212
Terminating Tableaux for $\mathcal{SOQ}$ with Number Restrictions on Transitive Roles
Mark Kaminski, Gert Smolka
213-228
Proof System for Applied Pi Calculus
Jia Liu, Huimin Lin
229-243
Concurrent Pattern Calculus
Thomas Given-Wilson, Daniele Gorla, Barry Jay
244-258
Initial Segment Complexities of Randomness Notions
Rupert Hölzl, Thorsten Kräling, Frank Stephan, Guohua Wu
259-270
Topologies Refining the Cantor Topology on Xω
Sibylle Schwarz, Ludwig Staiger
271-285
On Symbolic Representations of Maximum Matchings and (Un)directed Graphs
Beate Bollig
286-300
Traceable Sets
Rupert Hölzl, Wolfgang Merkle
301-315
Approximating the Non-contiguous Multiple Organization Packing Problem
Marin Bougeret, Pierre François Dutot, Klaus Jansen, Christina Otte, Denis Trystram
316-327
Improving the Competitive Ratios of the Seat Reservation Problem
Shuichi Miyazaki, Kazuya Okamoto
328-339
A Semiring-Based Trace Semantics for Processes with Applications to Information Leakage Analysis
Michele Boreale, David Clark, Daniele Gorla
340-354
A Game-Theoretic Approach to Routing under Adversarial Conditions
James Gross, Frank G. Radmacher, Wolfgang Thomas
355-370
An Operational Model for Multiprocessors with Caches
Salil Joshi, Sanjiva Prasad
371-385