Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Journal=Inf.~Comput. AND YEAR=210
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Abstract deduction and inferential models for type theory
Paolo Gentilini
,
Maurizio Martelli
Information and Computation
208
(7), 210, pp. 737-771
On the complexity of checking semantic equivalences between pushdown processes and finite-state processes
Antonín Kuc̑era
,
Richard Mayr
Information and Computation
208
(7), 210, pp. 772-796
Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces
Paul Gastin
,
Dietrich Kuske
Information and Computation
208
(7), 210, pp. 797-816
A thread calculus with molecular dynamics
J.A. Bergstra
,
C.A. Middelburg
Information and Computation
208
(7), 210, pp. 817-844
Ready simulation for concurrency: It's logical!
Gerald Lüttgen
,
Walter Vogler
Information and Computation
208
(7), 210, pp. 845-867
Abstract interpretation based verification of temporal properties for BioAmbients
Roberta Gori
,
Francesca Levi
Information and Computation
208
(8), 210, pp. 869-921
Context-sensitive dependency pairs
Beatriz Alarcón
,
Raúl Gutiérrez
,
Salvador Lucas
Information and Computation
208
(8), 210, pp. 922-968
Efficient recognition of trace languages defined by repeat-until loops
Luca Breveglieri
,
Stefano Crespi Reghizzi
,
Massimiliano Goldwurm
Information and Computation
208
(8), 210, pp. 969-981
On probabilistic pushdown automata
Juraj Hromkovic̑
,
Georg Schnitger
Information and Computation
208
(8), 210, pp. 982-995
On hierarchically developing reactive systems
Naijun Zhan
,
Mila Majster-Cederbaum
Information and Computation
208
(9), 210, pp. 997-1019
String matching with up to
k
swaps and mismatches
Ohad Lipsky
,
Benny Porat
,
Ely Porat
,
B. Riva Shalom
,
Asaf Tzur
Information and Computation
208
(9), 210, pp. 1020-1030
Towards a unified approach to encodability and separation results for process calculi
Daniele Gorla
Information and Computation
208
(9), 210, pp. 1031-1053
Fast computation of a longest increasing subsequence and application
Maxime Crochemore
,
Ely Porat
Information and Computation
208
(9), 210, pp. 1054-1059
Computational power of two stacks with restricted communication
Juhani Karhumäki
,
Michal Kunc
,
Alexander Okhotin
Information and Computation
208
(9), 210, pp. 1060-1089
A model of dynamic separation for transactional memory
Martín Abadi
,
Tim Harris
,
Katherine F. Moore
Information and Computation
208
(10), 210, pp. 1093-1117
Spatial and behavioral types in the pi-calculus
Lucia Acciai
,
Michele Boreale
Information and Computation
208
(10), 210, pp. 1118-1153
Quasi-static scheduling of communicating tasks
Philippe Darondeau
,
Blaise Genest
,
P.S. Thiagarajan
,
Shaofa Yang
Information and Computation
208
(10), 210, pp. 1154-1168
Unfolding-based diagnosis of systems with an evolving topology
Paolo Baldan
,
Thomas Chatain
,
Stefan Haar
,
Barbara König
Information and Computation
208
(10), 210, pp. 1169-1192
Complexity of deciding bisimilarity between normed BPA and normed BPP
Petr Janc̑ar
,
Martin Kot
,
Zdenȇk Sawa
Information and Computation
208
(10), 210, pp. 1193-1205
Strategy construction for parity games with imperfect information
Dietmar Berwanger
,
Krishnendu Chatterjee
,
Martin De Wulf
,
Laurent Doyen
,
Thomas A. Henzinger
Information and Computation
208
(10), 210, pp. 1206-1220
Deriving structural labelled transitions for mobile ambients
Julian Rathke
,
Paweƚ Sobociński
Information and Computation
208
(10), 210, pp. 1221-1242
Some (in)sufficient conditions for secure hybrid encryption
Javier Herranz
,
Dennis Hofheinz
,
Eike Kiltz
Information and Computation
208
(11), 210, pp. 1243-1257
The expressive power of the shuffle product
Jean Berstel
,
Luc Boasson
,
Olivier Carton
,
Jean-Éric Pin
,
Antonio Restivo
Information and Computation
208
(11), 210, pp. 1258-1272
On the universe, disjointness, and containment problems for simple machines
Oscar H. Ibarra
Information and Computation
208
(11), 210, pp. 1273-1282
Ehrenfeucht-Fraïssé goes automatic for real addition
Felix Klaedtke
Information and Computation
208
(11), 210, pp. 1283-1295
Seiten 1
2
>