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=37
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
On the minimum requirements for independent recovery in distributed systems
Chung-Kuo Chang
,
M.G. Gouda
Information Processing Letters
37
, 1991, pp. 1-7
Overlap closures do not suffice for termination of general term rewriting systems
Xubo Zhang
Information Processing Letters
37
, 1991, pp. 9-11
Safety and liveness of
\omega
-context-free languages
Soma Chaudhuri
,
Richard E. Ladner
Information Processing Letters
37
, 1991, pp. 13-20
An optimal greedy heuristic to color interval graphs
Stephan Olariu
Information Processing Letters
37
, 1991, pp. 21-25
Maximum bounded 3-dimensional matching is MAX SNP-complete
Viggo Kann
Information Processing Letters
37
, 1991, pp. 27-35
Seek distances in disks with two independent heads per surface
Yannis Manolopoulos
,
Athina Vakali
Information Processing Letters
37
, 1991, pp. 37-42
Multiple stack branch and bound
U.K. Sarkar
,
P.P. Chakrabarti
,
S. Ghose
,
S.C. de Sarkar
Information Processing Letters
37
, 1991, pp. 43-48
Minimal visibility graphs
Douglas Campbell
,
John Higgins
Information Processing Letters
37
, 1991, pp. 49-53
The tree representation of the graph used in binary image processing
Bin Yu
,
Xinggang Lin
,
Youshou Wu
Information Processing Letters
37
, 1991, pp. 55-59
Prefix-free languages as
\omega
-generators
Igor Litovsky
Information Processing Letters
37
, 1991, pp. 61-65
Analysis of parallel uniform hashing
Fabrizio Luccio
,
Andrea Pietracaprina
,
Geppino Pucci
Information Processing Letters
37
, 1991, pp. 67-69
Lower bounds for rectilinear Steiner trees in bounded space
Timothy Law Snyder
Information Processing Letters
37
, 1991, pp. 71-74
A space efficient distributive sort
C.C. Handley
Information Processing Letters
37
, 1991, pp. 75-78
An incremental reconstruction method for dynamic planar point location
Roberto Tamassia
Information Processing Letters
37
, 1991, pp. 79-83
A dual algorithm for the satisfiability problem
Yoshihiro Tanaka
Information Processing Letters
37
, 1991, pp. 85-89
Probabilistic polynomial time is closed under parity reductions
Richard Beigel
,
Lane A. Hemachandra
,
Gerd Wechsung
Information Processing Letters
37
, 1991, pp. 91-94
Program inversion in the refinement calculus
J. von Wright
Information Processing Letters
37
, 1991, pp. 95-100
The balanced binary tree technique on mesh-connected computers
Alan Gibbons
,
Ridha Ziani
Information Processing Letters
37
, 1991, pp. 101-109
An efficient parallel algorithm for finding minimum weight matching for points on a convex polygon
Xin He
Information Processing Letters
37
, 1991, pp. 111-116
An optimal algorithm for deleting the root of a heap
Svante Carlsson
Information Processing Letters
37
, 1991, pp. 117-120
A simple algorithm for computing the smallest enclosing circle
Sven Skyum
Information Processing Letters
37
, 1991, pp. 121-125
Searching with a forbidden lie pattern in responses
Jurek Czyzowicz
,
K.B. Lakshmanan
,
Andrzej Pelc
Information Processing Letters
37
, 1991, pp. 127-132
An algorithm for string matching with a sequence of don't cares
Udi Manber
,
Ricardo Baeza-Yates
Information Processing Letters
37
, 1991, pp. 133-136
Semelectivity is not sufficient
Pavol Dúris̑
,
Imrich Vrt̑o
Information Processing Letters
37
, 1991, pp. 137-141
An oracle separating
\bigoplus P
from
PP^{PH}
Frederic Green
Information Processing Letters
37
, 1991, pp. 149-153
Seiten 1
2
3
>