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=178
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
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
On complexity of easy predictable sequences
Michael V. Vyugin
,
Vladimir V. V'yugin
Information and Computation
178
(1), 2002, pp. 241-252
The complexity of solving equations over finite groups
Mikael Goldmann
,
Alexander Russell
Information and Computation
178
(1), 2002, pp. 253-262
On the nonapproximability of Boolean functions by OBDDs and read-
k
-times branching programs
Beate Bollig
,
Martin Sauerhoff
,
Ingo Wegener
Information and Computation
178
(1), 2002, pp. 263-278
The small model property: How small can it be?
Amir Pnueli
,
Yoav Rodeh
,
Ofer Strichman
,
Michael Siegel
Information and Computation
178
(1), 2002, pp. 279-293
Context-sensitive rewriting strategies
Salvador Lucas
Information and Computation
178
(1), 2002, pp. 294-343
Deciding the word problem in the union of equational theories
Franz Baader
,
Cesare Tinelli
Information and Computation
178
(2), 2002, pp. 346-390
A monadic second-order definition of the structure of convex hypergraphs
Bruno Courcelle
Information and Computation
178
(2), 2002, pp. 391-411
The
\exists^\ast\forall^\ast
part of the theory of ground term algebra modulo an
AC
symbol is undecidable
Jerzy Marcinkowski
Information and Computation
178
(2), 2002, pp. 412-421
Practical algorithms for deciding path ordering constraint satisfaction
Robert Nieuwenhuis
,
José Miguel Rivero
Information and Computation
178
(2), 2002, pp. 422-440
On the strong normalisation of intuitionistic natural deduction with permutation-conversions
Philippe de Groote
Information and Computation
178
(2), 2002, pp. 441-464
Test sets for the universal and existential closure of regular tree languages
Dieter Hofbauer
,
Maria Huber
Information and Computation
178
(2), 2002, pp. 465-498
Decidability for left-linear growing term rewriting systems
Takashi Nagaya
,
Yoshihito Toyama
Information and Computation
178
(2), 2002, pp. 499-514
A fully syntactic AC-PRO
Albert Rubio
Information and Computation
178
(2), 2002, pp. 515-533
A characterisation of multiply recursive functions with Higman's lemma
Hélène Touzet
Information and Computation
178
(2), 2002, pp. 534-544