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.~Process.~Lett. AND Volume=41
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Generating hinges from arbitrary subhypergraphs
L.L. Miller
Information Processing Letters
41
, 1992, pp. 307-312
A solution to the covering problem for 1-bounded conflict-free Petri nets using linear programming
Javier Esparza
Information Processing Letters
41
, 1992, pp. 313-319
A lower bound for the multiplication of polynomials modulo a polynomial
Nader H. Bshouty
Information Processing Letters
41
, 1992, pp. 321-326
Counting propositional models
Eliezer L. Lozinskii
Information Processing Letters
41
, 1992, pp. 327-332
An approximation algorithm for the general routing problem
Klaus Jansen
Information Processing Letters
41
, 1992, pp. 333-339
A discrete-state model of the two-headed disk
S.D. Carson
,
V. Nirkhe
,
P. Vongsathorn
Information Processing Letters
41
, 1992, pp. 341-345
Seiten
<
1
2
3