Skip to Main Content (Press Enter)
×
Home
Corsi
Insegnamenti
Professioni
Persone
Pubblicazioni
Strutture
Terza Missione
Attività
Competenze
IT
EN
☰
UNI-FIND
|
UNI-FIND
uninsubria.it
IT
EN
×
Home
Corsi
Insegnamenti
Professioni
Persone
Pubblicazioni
Strutture
Terza Missione
Attività
Competenze
☰
Pubblicazioni
THEORETICAL COMPUTER SCIENCE
Rivista
Codice:
E167142
ISSN:
0304-3975
Dati Generali
Dati Generali
Pubblicazioni (28)
Pulisci
Ordina Pubblicazioni:
ascendente
decrescente
A Comparison of Statecharts Step Semantics
Articolo
A process calculus approach to detection and mitigation of PLC malware
Articolo
A weak semantic approach to bisimulation metrics in models with nondeterminism and continuous state spaces
Articolo
An Axiomatic Semantics for Esterel
Articolo
An efficient algorithm for generating symmetric ice piles
Articolo
Complexity and succinctness issues for linear-time hybrid logics
Articolo
Compositional semantics and behavioral equivalences for P Systems
Articolo
Compositional semantics and behavioural equivalences for reaction systems with restriction
Articolo
Concurrency in timed automata
Articolo
Conditioning a state by a Lukasiewicz event: a probabilistic approach to Ulam games
Articolo
Foundational aspects of multiscale modeling of biological systems with process algebras
Articolo
Matrix algebra preconditioners for multilevel Toeplitz systems do not insure optimal convergence rate
Articolo
Non-expansive epsilon-bisimulations for probabilistic processes
Articolo
On a class of languages with holonomic generating functions
Articolo
On computing the coefficients of bivariate holonomic formal series
Articolo
On the Exhaustive Generation of Plane Partitions
Articolo
On the exhaustive generation of k-convex polyominoes
Articolo
On the geometry and algebra of networks with state
Articolo
Optimal comparison strategies in Ulam's searching game with two errors
Articolo
P-sufficient statistics for PAC learning k-term-DNF formulas through enumeration
Articolo
Predicting the labels of an unknown graph via adaptive exploration
Articolo
Probabilistic divide & congruence: Branching bisimilarity
Articolo
Robustness for biochemical networks: Step-by-step approach
Articolo
Sample size lower bounds in PAC learning by algorithmic complexity theory
Articolo
The complexity of computing the number of strings of given length in context-free languages
Articolo
The metric linear-time branching-time spectrum on nondeterministic probabilistic processes
Articolo
Theoretical Computer Science in Italy
Curatela
Weak bisimulation for Probabilistic Timed Automata
Articolo
No Results Found
«
‹
{pageNumber}
›
»
{startItem} - {endItem} di {itemsNumber}
5 per pagina
10 per pagina
30 per pagina
vedi tutti
