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=188
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
DP
lower bounds for equivalence-checking and model-checking of one-counter automata
Petr Janc̑ar
,
Antonín Kuc̑era
,
Faron Moller
,
Zdenék Sawa
Information and Computation
188
(1), 2004, pp. 1-19
Parallel two dimensional witness computation
Richard Cole
,
Zvi Galil
,
Ramesh Hariharan
,
S. Muthukrishnan
,
Kunsoo Park
Information and Computation
188
(1), 2004, pp. 20-67
De Bakker-Zucker processes revisited
Franck van Breugel
Information and Computation
188
(1), 2004, pp. 68-76
Generalization of ZYT-linearizability for bilinear Datalog programs
Ji-Hoon Kang
,
Ki-Hyung Hong
,
Kyu-Young Whang
,
Jung-Wan Cho
Information and Computation
188
(1), 2004, pp. 77-98
Efficient algorithms for learning functions with bounded variation
Philip M. Long
Information and Computation
188
(1), 2004, pp. 99-115
Bi-immunity separates strong
NP
-completeness notions
A. Pavan
,
Alan L. Selman
Information and Computation
188
(1), 2004, pp. 116-126
Counting extensional differences in
BC
-learning
Sanjay Jain
,
Frank Stephan
,
Sebastiaan A. Terwijn
Information and Computation
188
(1), 2004, pp. 127-142
Decidability of bounded second order unification
Manfred Schmidt-Schauß
Information and Computation
188
(2), 2004, pp. 143-178
On abstract interpretation of mobile ambients
Francesca Levi
,
Sergio Maffeis
Information and Computation
188
(2), 2004, pp. 179-240
On the call-by-value CPS transform and its semantics
Carsten Führmann
,
Hayo Thielecke
Information and Computation
188
(2), 2004, pp. 241-283