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=2002
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Bounded hairpin completion
Masami Ito
,
Peter Leupold
,
Florin Manea
,
Victor Mitrana
Information and Computation
209
(3), 2011, pp. 471-485
The subtyping problem for second-order types is undecidable
Jerzy Tiuryn
,
Paweƚ Urzyczyn
Information and Computation
179
(1), 2002, pp. 1-18
A linear logical framework
Iliano Cervesato
,
Frank Pfenning
Information and Computation
179
(1), 2002, pp. 19-75
A fully abstract model for the
\pi
-calculus
M.P. Fiore
,
E. Moggi
,
D. Sangiorgi
Information and Computation
179
(1), 2002, pp. 76-117
The essence of parallel Algol
Stephen Brookes
Information and Computation
179
(1), 2002, pp. 118-149
On the complexity of reasoning in Kleene algebra
Dexter Kozen
Information and Computation
179
(2), 2002, pp. 152-162
Bisimulation for labelled Markov processes
Josée Desharnais
,
Abbas Edalat
,
Prakash Panangaden
Information and Computation
179
(2), 2002, pp. 163-193
Boolean expression diagrams
Henrik Reif Andersen
,
Henrik Hulgaard
Information and Computation
179
(2), 2002, pp. 194-212
Set constraints with intersection
Witold Charatonik
,
Andreas Podelski
Information and Computation
179
(2), 2002, pp. 213-229
An expressively complete linear time temporal logic for Mazurkiewicz traces
P.S. Thiagarajan
,
I. Walukiewicz
Information and Computation
179
(2), 2002, pp. 230-249
Large finite structures with few
L^k
-types
Martin Grohe
Information and Computation
179
(2), 2002, pp. 250-278
First-order logic with two variables and unary temporal logic
Kousha Etessami
,
Moshe Y. Vardi
,
Thomas Wilke
Information and Computation
179
(2), 2002, pp. 279-295
A relational account of call-by-value sequentiality
Jon G. Riecke
,
Anders Sandholm
Information and Computation
179
(2), 2002, pp. 296-331
Completeness of continuation models for
\lambda_\mu
-calculus
Martin Hofmann
,
Thomas Streicher
Information and Computation
179
(2), 2002, pp. 332-355
The monadic quantifier alternation hierarchy over grids and graphs
Oliver Matz
,
Nicole Schweikardt
,
Wolfgang Thomas
Information and Computation
179
(2), 2002, pp. 356-383
Erratum to ''Mobile objects as mobile processes''
Massimo Merro
,
Josva Kleist
,
Uwe Nestmann
Information and Computation
179
(2), 2002, pp. 384-384
Intersection and singleton type assignment characterizing finite Böhm-trees
Toshihiko Kurata
Information and Computation
178
(1), 2002, pp. 1-11
Linear time and the power of one first-order universal quantifier
Arnaud Durand
Information and Computation
178
(1), 2002, pp. 12-22
Prelogical relations
Furio Honsell
,
Donald Sannella
Information and Computation
178
(1), 2002, pp. 23-43
The box algebra=Petri nets+process expressions
Eike Best
,
Raymond Devillers
,
Maciej Koutny
Information and Computation
178
(1), 2002, pp. 44-100
Relative undecidability in term rewriting: I. The termination hierarchy
Alfons Geser
,
Aart Middeldorp
,
Enno Ohlebusch
,
Hans Zantema
Information and Computation
178
(1), 2002, pp. 101-131
Relative undecidability in term rewriting: II. The confluence hierarchy
Alfons Geser
,
Aart Middeldorp
,
Enno Ohlebusch
,
Hans Zantema
Information and Computation
178
(1), 2002, pp. 132-148
Conservation and uniform normalization in lambda calculi with erasing reductions
Peter Mller Neergaard
,
Morten Heine Srensen
Information and Computation
178
(1), 2002, pp. 149-179
Ordered SOS process languages for branching and eager bisimulations
Irek Ulidowski
,
Iain Phillips
Information and Computation
178
(1), 2002, pp. 180-213
Learning closed Horn expressions
Marta Arias
,
Roni Khardon
Information and Computation
178
(1), 2002, pp. 214-240
Seiten 1
2
3
4
>