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=130
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Gap-definability as a closure property
Stephen Fenner
,
Lance Fortnow
,
Lide Li
Information and Computation
130
(1), 1996, pp. 1-17
Computational limits on team identification of languages
Sanjay Jain
,
Arun Sharma
Information and Computation
130
(1), 1996, pp. 19-60
Computing the Rabin index of a regular language of infinite words
Thomas Wilke
,
Haiseung Yoo
Information and Computation
130
(1), 1996, pp. 61-70
Undecidable verification problems for programs with unreliable channels
Parosh Aziz Abdulla
,
Bengt Jonsson
Information and Computation
130
(1), 1996, pp. 71-90
Inductive counting for width-restricted branching programs
Carsten Damm
,
Markus Holzer
Information and Computation
130
(1), 1996, pp. 91-99
Time-space tradeoffs for undirected graph traversal by graph automata
Paul Beame
,
Allan Borodin
,
Prabhakar Raghavan
,
Walter L. Ruzzo
,
Martin Tompa
Information and Computation
130
(2), 1996, pp. 101-129
Parametric timing analysis for real-time systems
Farn Wang
Information and Computation
130
(2), 1996, pp. 131-150
On the construction of classes of suffix trees for square matrices: Algorithms and applications
Raffaele Giancarlo
,
Roberto Grossi
Information and Computation
130
(2), 1996, pp. 151-182
Any lifting of a trace coding is a word coding
Véronique Bruyère
,
Clelia de Felice
Information and Computation
130
(2), 1996, pp. 183-193