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=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Symbol-relation grammars: A formalism for graphical languages
F. Ferrucci
,
G. Pacini
,
G. Satta
,
M.I. Sessa
,
G. Tortora
,
M. Tucci
,
G. Vitiello
Information and Computation
131
(1), 1996, pp. 1-46
Contextual insertions/deletions and computability
Lila Kari
,
Gabriel Thierrin
Information and Computation
131
(1), 1996, pp. 47-61
Searching in an unknown environment: An optimal randomized algorithm for the cow-path problem
Ming-Yang Kao
,
John H. Reif
,
Stephen R. Tate
Information and Computation
131
(1), 1996, pp. 63-79
Multiple product modulo arbitrary numbers
Claudia Bertram-Kretzberg
,
Thomas Hofmeister
Information and Computation
131
(1), 1996, pp. 81-93
On the power of DNA-computing
Diana Rooß
,
Klaus W. Wagner
Information and Computation
131
(2), 1996, pp. 95-109
Randomness in distribution protocols
Carlo Blundo
,
Alfredo de Santis
,
Ugo Vaccaro
Information and Computation
131
(2), 1996, pp. 111-139
Bisimulation for higher-order process calculi
Davide Sangiorgi
Information and Computation
131
(2), 1996, pp. 141-178
A note on decision versus search for graph automorphism
M. Agrawal
,
V. Arvind
Information and Computation
131
(2), 1996, pp. 179-189
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
Logspace and logtime leaf languages
Birgit Jenner
,
Pierre McKenzie
,
Denis Thérien
Information and Computation
129
(1), 1996, pp. 21-33
Model checking mobile processes
Mads Dam
Information and Computation
129
(1), 1996, pp. 35-51
A new research into default logic
Mingyi Zhang
Information and Computation
129
(2), 1996, pp. 73-85
Visual cryptography for general access structures
Giuseppe Ateniese
,
Carlo Blundo
,
Alfredo de Santis
,
Douglas R. Stinson
Information and Computation
129
(2), 1996, pp. 86-106
CPO models for compact GSOS languages
Luca Aceto
,
Anna Ingólfsdóttir
Information and Computation
129
(2), 1996, pp. 107-141
Forward and backward simulations II. Timing-based systems
Nancy Lynch
,
Frits Vaandrager
Information and Computation
128
(1), 1996, pp. 1-25
From operational semantics to domain theory
Ian A. Mason
,
Scott F. Smith
,
Carolyn L. Talcott
Information and Computation
128
(1), 1996, pp. 26-47
The dynamic universality of sigmoidal neural networks
Joe Kilian
,
Hava T. Siegelmann
Information and Computation
128
(1), 1996, pp. 48-56
Seiten 1
2
3
4
>