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=2008
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Termination of just/fair computations in term rewriting
Salvador Lucas
,
José Meseguer
Information and Computation
206
(5), 2008, pp. 652-675
Graph connectivity, partial words, and a theorem of Fine and Wilf
F. Blanchet-Sadri
,
Deepak Bal
,
Gautam Sisodia
Information and Computation
206
(5), 2008, pp. 676-693
When unlearning helps
Ganesh Baliga
,
John Case
,
Wolfgang Merkle
,
Frank Stephan
,
Rolf Wiehagen
Information and Computation
206
(5), 2008, pp. 694-709
A theory of system behaviour in the presence of node and link failure
Adrian Francalanza
,
Matthew Hennessy
Information and Computation
206
(6), 2008, pp. 711-759
Complexity of DNF minimization and isomorphism testing for monotone formulas
Judy Goldsmith
,
Matthias Hagen
,
Martin Mundhenk
Information and Computation
206
(6), 2008, pp. 760-775
Learning in Friedberg numberings
Sanjay Jain
,
Frank Stephan
Information and Computation
206
(6), 2008, pp. 776-790
Computational complexity of sentences over fields
Shih Ping Tung
Information and Computation
206
(7), 2008, pp. 791-805
Typechecking top-down XML transformations: Fixed input or output schemas
Wim Martens
,
Frank Neven
,
Marc Gyssens
Information and Computation
206
(7), 2008, pp. 806-827
Finding the conditional location of a median path on a tree
Biing-Feng Wang
,
Tzu-Chin Lin
,
Chien-Hsin Lin
,
Shan-Chyun Ku
Information and Computation
206
(7), 2008, pp. 828-839
Compositional verification of sequential programs with procedures
Dilian Gurov
,
Marieke Huisman
,
Christoph Sprenger
Information and Computation
206
(7), 2008, pp. 840-868
A framework for the verification of infinite-state graph transformation systems
Paolo Baldan
,
Andrea Corradini
,
Barbara König
Information and Computation
206
(7), 2008, pp. 869-907
Inapproximability of the Tutte polynomial
Leslie Ann Goldberg
,
Mark Jerrum
Information and Computation
206
(7), 2008, pp. 908-929
Comparing communication primitives via their relative expressive power
Daniele Gorla
Information and Computation
206
(8), 2008, pp. 931-952
Characterize branching distance in terms of
(\eta, \alpha)
-bisimilarity
Jinjin Zhang
,
Zhaohui Zhu
Information and Computation
206
(8), 2008, pp. 953-965
Bases for parametrized iterativity
Jiȓí Adámek
,
Stefan Milius
,
Jiȓí Velebil
Information and Computation
206
(8), 2008, pp. 966-1002
Bin packing with controllable item sizes
José R. Correa
,
Leah Epstein
Information and Computation
206
(8), 2008, pp. 1003-1016
Commutation-augmented pregroup grammars and push-down automata with cancellation
Nissim Francez
,
Michael Kaminski
Information and Computation
206
(9-10), 2008, pp. 1018-1032
Synchronization
Helmut Jürgensen
Information and Computation
206
(9-10), 2008, pp. 1033-1044
Automata can show PSPACE results for description logics
Franz Baader
,
Jan Hladik
,
Rafael Peñaloza
Information and Computation
206
(9-10), 2008, pp. 1045-1056
Periodicity properties on partial words
F. Blanchet-Sadri
,
Kevin Corcoran
,
Jenell Nyberg
Information and Computation
206
(9-10), 2008, pp. 1057-1064
A characterization of flip-accessibility for rhombus tilings of the whole plane
Olivier Bodini
,
Thomas Fernique
,
Éric Rémila
Information and Computation
206
(9-10), 2008, pp. 1065-1073
The number of convex permutominoes
Paolo Boldi
,
Violetta Lonati
,
Roberto Radicioni
,
Massimo Santini
Information and Computation
206
(9-10), 2008, pp. 1074-1083
Muller message-passing automata and logics
Benedikt Bollig
,
Dietrich Kuske
Information and Computation
206
(9-10), 2008, pp. 1084-1094
Comparison of some descriptional complexities of OL systems obtained by a unifying approach
Jürgen Dassow
,
Henning Fernau
Information and Computation
206
(9-10), 2008, pp. 1095-1103
Computational complexity of dynamical systems: The case of cellular automata
P. Di Lena
,
L. Margara
Information and Computation
206
(9-10), 2008, pp. 1104-1116
Seiten
<
1
2
3
4
>