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
[2]
Hilfe
Suche: Journal=Inf.~Process.~Lett. AND Volume=34
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Isomorphism testing of
k
-trees is in
NC
, for fixed
k
N. Chandrasekharan
Information Processing Letters
34
, 1990, pp. 283-287
Generalized closed world assumption is
\Pi^0_2
-complete
Jan Chomicki
,
V.S. Subrahmanian
Information Processing Letters
34
, 1990, pp. 289-291
Covering a set with arithmetic progressions is NP-complete
Lenwood S. Heath
Information Processing Letters
34
, 1990, pp. 293-298
Toward a definition of fault analysis for Petri nets models
M.R. Zargham
,
K.J. Danhof
Information Processing Letters
34
, 1990, pp. 299-305
A parallel algorithm for eliminating cycles in undirected graphs
Philip Klein
,
Clifford Stein
Information Processing Letters
34
, 1990, pp. 307-312
Distributing a
B^+
-tree in a loosely coupled environment
Gabriel Matsliach
,
Oded Shmueli
Information Processing Letters
34
, 1990, pp. 313-321
Deadlock-free routing in
k
-ary hypercube network in presence of processor failures
A. Sengupta
,
S. Bandyopadhyay
Information Processing Letters
34
, 1990, pp. 323-328
Seiten
<
1
2
3