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 Volume=168
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Dependent types with subtyping and late-bound overloading
Giuseppe Castagna
,
Gang Chen
Information and Computation
168
(1), 2001, pp. 1-67
Static analysis for the
\pi
-calculus with applications to security
Chiara Bodei
,
Pierpaolo Degano
,
Flemming Nielson
,
Hanne Riis Nielson
Information and Computation
168
(1), 2001, pp. 68-92
The complexity of the
K_{n,n}
-problem for node replacement graph languages
Konstantin Skodinis
Information and Computation
168
(2), 2001, pp. 95-112
Circuit and decision tree complexity of some number theoretic problems
Anna Bernasconi
,
Carsten Damm
,
Igor Shparlinski
Information and Computation
168
(2), 2001, pp. 113-124
Iterated function systems and control languages
Henning Fernau
,
Ludwig Staiger
Information and Computation
168
(2), 2001, pp. 125-143
On some Schützenberger conjectures
Clelia de Felice
Information and Computation
168
(2), 2001, pp. 144-155
Adding for-loops to first-order logic
Frank Neven
,
Martin Otto
,
Jurek Tyszkiewicz
,
Jan van den Bussche
Information and Computation
168
(2), 2001, pp. 156-186
Lower bounds for merging networks
Shigeki Iwata
Information and Computation
168
(2), 2001, pp. 187-195