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
[1]
Hilfe
Suche: Journal=Theor.~Comput.~Sci. AND YEAR=1996
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
P,NP
,Co-
NP
and weak systems of arithmetic
Claude Sureson
Theoretical Computer Science
154
(2), 1996, pp. 145-163
Two linear time Union-Find strategies for image processing
Christophe Fiorio
,
Jens Gustedt
Theoretical Computer Science
154
(2), 1996, pp. 165-181
Pattern systems
Victor Mitrana
,
Gheorge Păn
,
Grzegorz Rozenberg
,
Arto Salomaa
Theoretical Computer Science
154
(2), 1996, pp. 183-201
Multiple matching of parameterized patterns
Ramana M. Idury
,
Alejandro A. Schäffer
Theoretical Computer Science
154
(2), 1996, pp. 203-224
Sorting strings and constructing digital search trees in parallel
Joseph F. Jájá
,
Kwan Woo Ryu
,
Uzi Vishkin
Theoretical Computer Science
154
(2), 1996, pp. 225-245
Characterization and complexity of uniformly nonprimitive labeled 2-structures
J. Engelfriet
,
T. Harju
,
A. Proskurowski
,
G. Rozenberg
Theoretical Computer Science
154
(2), 1996, pp. 247-282
On the information rate of secret sharing schemes
Carlo Blundo
,
Alfredo De Santis
,
Luisa Gargano
,
Ugo Vaccaro
Theoretical Computer Science
154
(2), 1996, pp. 283-306
Effective category and measure in abstract complexity theory
Cristian Calude
,
Marius Zimand
Theoretical Computer Science
154
(2), 1996, pp. 307-327
Confluence for graph transformations
N. Lafaye de Micheaux
,
C. Rambaud
Theoretical Computer Science
154
(2), 1996, pp. 329-348
\sigma
-game,
\sigma^+
-game and two-dimensional additive cellular automata
Rana Barua
,
S. Ramakrishnan
Theoretical Computer Science
154
(2), 1996, pp. 349-366
Optimal advice
Lane A. Hemaspaandra
,
Leen Torenvliet
Theoretical Computer Science
154
(2), 1996, pp. 367-377
A direct characterization of completion
S. Ramesh
,
Bommadevara N. Srinivas
Theoretical Computer Science
154
(2), 1996, pp. 379-385
On a combinatorial property of Sturmian words
J. Justin
,
G. Pirillo
Theoretical Computer Science
154
(2), 1996, pp. 387-394
Nets, time and space
C.A. Petri
Theoretical Computer Science
153
(1-2), 1996, pp. 3-48
Proving nonreachability by modulo-invariants
J. Desel
,
K.-P. Neuendorf
,
M.-D. Radola
Theoretical Computer Science
153
(1-2), 1996, pp. 49-64
A multiset semantics for the
pi
-calculus with replication
Joost Engelfriet
Theoretical Computer Science
153
(1-2), 1996, pp. 65-94
Trapping mutual exclusion in the box calculus
Javier Esparza
,
Glenn Bruns
Theoretical Computer Science
153
(1-2), 1996, pp. 95-128
An event structure semantics for general Petri nets
P.W. Hoogers
,
H.C.M. Kleijn
,
P.S. Thiagarajan
Theoretical Computer Science
153
(1-2), 1996, pp. 129-170
Process versus unfolding semantics for place/transition Petri nets
José Meseguer
,
Ugo Montanari
,
Vladimiro Sassone
Theoretical Computer Science
153
(1-2), 1996, pp. 171-210
Petri nets and bisimulation
Mogens Nielson
,
Glynn Winskel
Theoretical Computer Science
153
(1-2), 1996, pp. 211-244
On the border of causality: contact and confusion
Einar Smith
Theoretical Computer Science
153
(1-2), 1996, pp. 245-270
Structure theory of equal conflict systems
Enrique Teruel
,
Manuel Silva
Theoretical Computer Science
153
(1-2), 1996, pp. 271-300
Seiten
<
1
2
3
4
5
6
7
8
9
10
11