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=180
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Complete inference systems for weak bisimulation equivalences in the
\pi
-calculus
Huimin Lin
Information and Computation
180
(1), 2003, pp. 1-29
Languages, DOL-systems, sets of curves, and surface automorphisms
Luis-Miguel Lopez
,
Philippe Narbel
Information and Computation
180
(1), 2003, pp. 30-52
Variations on extending partially defined Boolean functions with missing bits
Endre Boros
,
Toshihide Ibaraki
,
Kazuhisa Makino
Information and Computation
180
(1), 2003, pp. 53-70
The mutual exclusion scheduling problem for permutation and comparability graphs
Klaus Jansen
Information and Computation
180
(2), 2003, pp. 71-81
Learning from examples with unspecified attribute values
Sally A. Goldman
,
Stephen S. Kwek
,
Stephen D. Scott
Information and Computation
180
(2), 2003, pp. 82-100
Bounded size dictionary compression:
SC^k
-completeness and
NC
algorithms
Sergio de Agostino
,
Riccardo Silvestri
Information and Computation
180
(2), 2003, pp. 101-112
Multicoloring trees
Magnús M. Halldórsson
,
Guy Kortsarz
,
Andrzej Proskurowski
,
Ravit Salman
,
Hadas Shachnai
,
Jan Arne Telle
Information and Computation
180
(2), 2003, pp. 113-129